Related papers: Form factor for large quantum graphs: evaluating o…
Every classical orthogonal polynomial system $p_n(x)$ satisfies a three-term recurrence relation of the type \[ p_{n+1}(x)=(A_nx+B_n)p_n(x)-C_np_{n-1}(x)~ (n=0,1,2,\ldots, p_{-1}\equiv 0), \] with $C_nA_nA_{n-1}>0$. Moreover, Favard's…
The not necessarily unitary evolution operator of a finite dimensional quantum system is studied with the help of a projection operators technique. Applying this approach to the Schr\"odinger equation allows the derivation of an alternative…
Time reversal symmetry is studied in a space with noncommutativity of coordinates and noncommutativity of momenta of canonical type. The circular motion is examined as an apparent example of time reversal symmetry breaking in the space. On…
We use the order complex corresponding to a symmetric matrix (defined by Giusti et al in 2015). In this note, we use it to define a class of models of random graphs, and show some surprising experimental results, showing sharp phase…
We propose a new unsupervised learning method for clustering a large number of time series based on a latent factor structure. Each cluster is characterized by its own cluster-specific factors in addition to some common factors which impact…
The micromaser is examined with the aim of understanding certain of its properties based on a time-reversed quantum trajectory analysis. The background theory of master equations derived from a repeated interaction model perspective is…
Theory of the quantum quartic oscillator is developed with close attention to the energy cutoff one needs to impose on the system in order to approximate the smallest eigenvalues and corresponding eigenstates of its Hamiltonian by…
In this talk, we are concerned with the formulation and understanding of the combinatorics of time-ordered n-point functions in terms of the Hopf algebra of field operators. Mathematically, this problem can be formulated as one in…
We show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes it possible to analyze the walks in terms of scattering…
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…
We analyze the response of a complex quantum-mechanical system (e. g., a quantum dot) to a time-dependent perturbation. Assuming the dot energy spectrum and the perturbation to be described by the Gaussian Orthogonal Ensemble of random…
We describe an analytical method for computing the orbital parameters of a planet from the periodogram of a radial velocity signal. The method is very efficient and provides a good approximation of the orbital parameters. The accuracy is…
The well-known Caputo fractional derivative and the corresponding Caputo fractional integral occur naturally in many equations that model physical phenomena under inhomogeneous media. The relationship between the two fractional terms can be…
$k$-diagonal circulant matrices and cyclic banded matrices are widely used in numerical simulations and signal processing of circular linear systems. Algorithms that directly involve or specify linear or quadratic complexity for the…
In this paper, we consider the nonstationary matrix-valued time series with common stochastic trends. Unlike the traditional factor analysis which flattens matrix observations into vectors, we adopt a matrix factor model in order to fully…
Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to…
The method of four-dimensional Causal Dynamical Triangulations provides a background-independent definition of the sum over geometries in quantum gravity, in the presence of a positive cosmological constant. We present the evidence…
The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge…
One of von Neumann's motivations for developing the theory of operator algebras and his and Murray's 1936 classification of factors was the question of possible decompositions of quantum systems into independent parts. For quantum systems…
The eigenvalue density of a quantum-mechanical system exhibits oscillations, determined by the closed orbits of the corresponding classical system; this relationship is simple and strong for waves in billiards or on manifolds, but becomes…