Related papers: Recognizing Cartesian products of matrices and pol…
We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem…
This paper is the second in a series of two, and describes the current state of the art in modelling and prediction of chaotic time series. Sampled data from deterministic non-linear systems may look stochastic when analysed with linear…
In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…
The M-polynomial provides a unifying framework for a wide class of degree-based topological indices. Despite its structural importance, general methods for computing the M-polynomial under graph constructions remain limited. In this paper,…
We consider the statistics of time delay in a chaotic cavity having $M$ open channels, in the absence of time-reversal invariance. In the random matrix theory approach, we compute the average value of polynomial functions of the time delay…
Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…
Prior to the recent development of symplectic integrators, the time-stepping operator $\e^{h(A+B)}$ was routinely decomposed into a sum of products of $\e^{h A}$ and $\e^{hB}$ in the study of hyperbolic partial differential equations. In…
Yannakakis' theorem relating the extension complexity of a polytope to the size of a nonnegative factorization of its slack matrix is a seminal result in the study of lifts of convex sets. Inspired by this result and the importance of lifts…
A generalization of matrix product states (MPS) is introduced which is suitable for describing interacting quantum systems in two and three dimensions. These scale-renormalized matrix-product states (SR-MPS) are based on a course-graining…
We consider a fast approximation algorithm for the linear matroid intersection problem. In this problem, we are given two $r \times n$ matrices $M_1$ and $M_2$, and the objective is to find a largest set of columns that are linearly…
Computing ground states of local Hamiltonians is a fundamental problem in condensed matter physics. We give the first randomized polynomial-time algorithm for finding ground states of gapped one-dimensional Hamiltonians: it outputs an…
Matrix multiplication is a fundamental task in almost all computational fields, including machine learning and optimization, computer graphics, signal processing, and graph algorithms (static and dynamic). Twin-width is a natural complexity…
We present a manifestly rotational invariant formulation of the matrix product method valid for spin chains and ladders. We apply it to 2 legged spin ladders with spins 1/2, 1 and 3/2 and different magnetic structures labelled by the…
We apply symmetric function theory to study random processes formed by singular values of products of truncations of Haar distributed symplectic and orthogonal matrices. These product matrix processes are degenerations of Macdonald…
Matryoshka dolls, the traditional Russian nesting figurines, are known world-wide for each doll's encapsulation of a sequence of smaller dolls. In this paper, we identify a large class of Markov process whose moments are easy to compute by…
It is known that a category of many-sorted algebras on pure sets of similarity type is "concretely equivalent" to a category of single-sorted algebras. In this paper, we characterize a single-sorted variety that corresponds to a many-sorted…
In this paper, we study the problems of detection and recovery of hidden submatrices with elevated means inside a large Gaussian random matrix. We consider two different structures for the planted submatrices. In the first model, the…
The matrix product state formalism is used to simulate Hamiltonian lattice gauge theories. To this end, we define matrix product state manifolds which are manifestly gauge invariant. As an application, we study 1+1 dimensional one flavour…
A method for evaluating matrix polynomials have recently been developed that require one fewer matrix product ($1M$) than the Paterson--Stockmeyer (PS) method. Since the computational cost for large-scale matrices is asymptotically…