SearcharxivSearch

arXiv subjects

Jesse Reimann

Publications and source records attributed to Jesse Reimann.

5 recordsLinked to original sources

On split exact sequences and KK-equivalences of amplified graph C*-algebras

We give a general methodology for constructing split exact sequences of amplified graph C*-algebras with sinks. This in turn allows us to construct explicit KK-equivalences with $\mathbb{C}^N$ for a large class of C*-algebras, including the quantum Grassmannian $\mathrm{Gr}_q(2,4)$. We discuss compatibility with known (quantum) CW-constructions and give an explicit KK-equivalence between the classical and quantum projective spaces $\mathbb{C}P^1$ and $\mathbb{C}P_q^1$.

math.OA

Power counting in the spectral action matrix model

We derive power counting formulas for ribbon graph amplitudes that were recently independently discovered in two contexts, namely as a generalization of the Kontsevich model, and as corresponding to a matrix model approach to the spectral action. The Feynman rules are based on divided difference functions of eigenvalues of an abstract Dirac operator. We obtain formulas for the order of divergence, depending on the spectral dimension $d$, the order of decay of the test function $f$ of the spectral action, and the graph properties. Several consequences are discussed, such as the fact that all graphs with maximal order of divergence (at a given loop order and number of external vertices) are planar. To derive our main results we establish two-sided bounds for divided differences, and in particular generalize Hunter's positivity theorem to a larger class of functions.

math-ph

On the best constants of Schur multipliers of higher order divided difference functions

Let $f \in C^n(\mathbb{R})$ be such that $\Vert f^{(n)} \Vert_\infty < \infty$. Let $f^{[n]} \in C(\mathbb{R}^{n+1})$ be the $n$th order divided difference. A special case of our main result states that for $1 < p < \infty$ we have \[\Vert T_{f^{[n]}}: S_{np} \times \ldots \times S_{np} \rightarrow S_{p} \Vert \lesssim p^\ast p^n \Vert f^{(n)} \Vert_\infty, \] where $p^\ast = p/(p-1)$ is the H\"older conjugate of $p$ and $T_{f^{[n]}}$ is the multilinear Schur multiplier with symbol $f^{[n]}$. In case of the generalized absolute value map $f(\lambda) = \lambda^{n-1} \vert \lambda \vert, \lambda \in \mathbb{R}$, we show that \[p^\ast p^{n} \lesssim \Vert T_{f^{[n]}}: S_{np} \times \ldots \times S_{np} \rightarrow S_{p} \Vert.\] This provides an alternative proof to one of the key theorems in the solution of Koplienko's problem on higher order spectral shift [Invent. Math. 193, No. 3, 501-538 (2013)], which is moreover sharp as $p \searrow 1$ and as $p \to\infty$ for any $n$.

math.FA

On the best constants of Schur multipliers of second order divided difference functions

We give a new proof of the boundedness of bilinear Schur multipliers of second order divided difference functions, as obtained earlier by Potapov, Skripka and Sukochev in their proof of Koplienko's conjecture on the existence of higher order spectral shift functions. Our proof is based on recent methods involving bilinear transference and the H\"ormander-Mikhlin-Schur multiplier theorem. Our approach provides a significant sharpening of the known asymptotic bounds of bilinear Schur multipliers of second order divided difference functions. Furthermore, we give a new lower bound of these bilinear Schur multipliers, giving again a fundamental improvement on the best known bounds obtained by Coine, Le Merdy, Potapov, Sukochev and Tomskova. More precisely, we prove that for $f \in C^2(\mathbb{R})$ and $1 < p, p_1, p_2 < \infty$ with $\frac{1}{p} = \frac{1}{p_1} + \frac{1}{p_2}$ we have \[ \Vert M_{f^{[2]}}: S_{p_1} \times S_{p_2} \rightarrow S_p \Vert \lesssim \Vert f'' \Vert_\infty D(p, p_1, p_2), \] where the constant $D(p, p_1, p_2)$ is specified in Theorem 7.1 and $D(p, 2p, 2p) \approx p^4 p^\ast$ with $p^\ast$ the H\"older conjugate of $p$. We further show that for $f(\lambda) = \lambda \vert \lambda \vert$, $\lambda \in \mathbb{R}$, for every $1 < p < \infty$ we have \[ p^2 p^\ast \lesssim \Vert M_{f^{[2]}}: S_{2p} \times S_{2p} \rightarrow S_p \Vert. \] Here $f^{[2]}$ is the second order divided difference function of $f$ with $M_{f^{[2]}}$ the associated Schur multiplier. In particular it follows that our estimate $D(p, 2p, 2p)$ is optimal for $p \searrow 1$.

math.CA

Temporal Logic Formalisation of ISO 34502 Critical Scenarios: Modular Construction with the RSS Safety Distance

As the development of autonomous vehicles progresses, efficient safety assurance methods become increasingly necessary. Safety assurance methods such as monitoring and scenario-based testing call for formalisation of driving scenarios. In this paper, we develop a temporal-logic formalisation of an important class of critical scenarios in the ISO standard 34502. We use signal temporal logic (STL) as a logical formalism. Our formalisation has two main features: 1) modular composition of logical formulas for systematic and comprehensive formalisation (following the compositional methodology of ISO 34502); 2) use of the RSS distance for defining danger. We find our formalisation comes with few parameters to tune thanks to the RSS distance. We experimentally evaluated our formalisation; using its results, we discuss the validity of our formalisation and its stability with respect to the choice of some parameter values.

cs.RO