Related papers: On the Cartan Decomposition for Classical Random M…

The supersymmetric method is a powerful method for the evaluation of quenched averages in disordered systems. Among others, this method has been applied to the theory of S-matrix fluctuations, the theory of universal conductance…

We consider powers of the absolute value of the characteristic polynomial of Haar distributed random orthogonal or symplectic matrices, as well as powers of the exponential of its argument, as a random measure on the unit circle minus small…

For linear operators which factor with suitable assumptions concerning commutativity of the factors, we introduce several notions of a decomposition. When any of these hold then questions of null space and range are subordinated to the same…

Let $(\mathfrak{g},\mathfrak{k})$ be a supersymmetric pair arising from a finite-dimensional, symmetrizable Kac-Moody superalgebra $\mathfrak{g}$. An important branching problem is to determine the finite-dimensional highest-weight…

One considers certain degenerations of the generic symmetric matrix over a field $k$ of characteristic zero and the main structures related to the determinant $f$ of the matrix, such as the ideal generated by its partial derivatives, the…

Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…

We consider large random matrices with a general slowly decaying correlation among its entries. We prove universality of the local eigenvalue statistics and optimal local laws for the resolvent away from the spectral edges, generalizing the…

The polynomial method from circuit complexity has been applied to several fundamental problems and obtains the state-of-the-art running times. As observed in [Alman and Williams, STOC 2017], almost all applications of the polynomial method…

A classical theorem of Riemannian geometry, due in its original form to Cartan, states that the Taylor expansion of the metric in geodesic normal coordinates is a universal formal power series involving only the symmetrizations of the…

For many classically chaotic systems it is believed that the quantum wave functions become uniformly distributed, that is the matrix elements of smooth observables tend to the phase space average of the observable. In this paper we study…

We study the interplay between double cross sum decompositions of a given Lie algebra and classical r-matrices for its semidual. For a class of Lie algebras which can be obtained by a process of generalised complexification we derive an…

To study discrete dynamical systems of different types --- deterministic, statistical and quantum --- we develop various approaches. We introduce the concept of a system of discrete relations on an abstract simplicial complex and develop…

We present two approaches for transmitting classical information over quantum broadcast channels. The first technique is a quantum generalization of the superposition coding scheme for the classical broadcast channel. We use a quantum…

Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…

We consider the problem of estimating a rank-one nonsymmetric matrix under additive white Gaussian noise. The matrix to estimate can be written as the outer product of two vectors and we look at the special case in which both vectors are…

Since it was first applied to the study of nuclear interactions by Wigner and Dyson, almost 60 years ago, Random Matrix Theory (RMT) has developed into a field of its own within applied mathematics, and is now essential to many parts of…

The classical concept of affine locally symmetric spaces allows a generalization for various geometric structures on a smooth manifold. We remind the notion of symmetry for parabolic geometries and we summarize the known facts for…

We define what we call morphisms of Cartan connections. We generalize the main theorems on Cartan connections to theorems on morphisms. Many of the known constructions involving Cartan connections turn out to be examples of morphisms. We…

Dirac algorithm allows to construct Hamiltonian systems for singular systems, and so contributing to its successful quantization. A drawback of this method is that the resulting quantized theory does not have manifest Lorentz invariance.…

Krawtchouk's polynomials occur classically as orthogonal polynomials with respect to the binomial distribution. They may be also expressed in the form of matrices, that emerge as arrays of the values that the polynomials take. The algebraic…