Related papers: Exact trace formulae for a class of one-dimensiona…
We recall from previous work a model-independent framework of computational complexity theory. Notably for the present paper, the framework allows formalization of the issues of precision that present themselves when one considers physical,…
In this paper, we establish a determinantal formula for 2 x 2 matrix commutators [X,Y] = XY - YX over a commutative ring, using (among other invariants) the quantum traces of X and Y. Special forms of this determinantal formula include a…
Many quantum systems may have the same classical limit. We argue that in the classical limit their traces do not necessarily converge one to another. The trace formula allows to express quantum traces by means of classical quantities as…
We introduce an algorithm for the uniform generation of infinite traces, i.e., infinite words up to commutation of some letters. The algorithm outputs on-the-fly approximations of a theoretical infinite trace, the latter being distributed…
We present a direct and simple method for the computation of the total scattering matrix of an arbitrary finite noncompact connected quantum graph given its metric structure and local scattering data at each vertex. The method is inspired…
A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…
An innovative method based on the traversal of rays, originating from detected particles, through a three-dimensional grid of voxels is presented. The methodology has as main advantage that the outcome of the method is independent of the…
We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…
We introduce quantum association schemes. This allows to define distance regular and strongly regular quantum graphs. We bring examples thereof. In addition, we formulate the duality for translation quantum association schemes corresponding…
Quantum correlations can be used as a resource for quantum computing, eg for quantum state manipulation, and for quantum sensing, eg for creating non-classical states which allow to achieve the quantum advantage regime. This review collects…
We present a more accurate numerical scheme for the calculation of diffusive shock acceleration of cosmic rays using Stochastic Differential Equations. The accuracy of this scheme is demonstrated using a simple analytical flow profile that…
Single-file diffusion refers to the motion of diffusive particles in narrow channels, so that they cannot bypass each other. This constraint leads to the subdiffusion of a tagged particle, called the tracer. This anomalous behaviour results…
Path integrals for particles in curved spaces can be used to compute trace anomalies in quantum field theories, and more generally to study properties of quantum fields coupled to gravity in first quantization. While their construction in…
The explicit solution to the spectral problem of quantum graphs found recently in \cite{Anima}, is used to produce the exact periodic orbit theory description for the probability distributions of spectral statistics, including the…
The completely bounded trace and spectral norms in finite dimensions are shown to be expressible by semidefinite programs. This provides an efficient method by which these norms may be both calculated and verified, and gives alternate…
We discuss an algorithm for the exact sampling of vectors v in [0,1]^N satisfying a set of pairwise difference inequalities. Applications include the exact sampling of skew Young Tableaux, of configurations in the Bead Model, and of…
The current article considers Mayer cluster integrals of n-dimensional hard particles in the n>1 dimensional flat Euclidean space. Extending results from Wertheim and Rosenfeld, we proof that the graphs are completely reducible into 1- and…
In order to design and implement tracers, one must decide what exactly to trace and how to produce this trace. On the one hand, trace designs are too often guided by implementation concerns and are not as useful as they should be. On the…
We give a formula for the coincidence Reidemeister trace of selfmaps on bouquets of circles in terms of the Fox calculus. Our formula reduces the problem of computing the coincidence Reidemeister trace to the problem of distinguishing…
We study a relative trace formula for a compact Riemann surface with respect to a closed geodesic $C$. This can be expressed as a relation between the period spectrum and the ortholength spectrum of $C$. This provides a new proof of…