Related papers: Recognizing Cartesian products of matrices and pol…
In this paper we present a new algorithm for computing a low rank approximation of the product $A^TB$ by taking only a single pass of the two matrices $A$ and $B$. The straightforward way to do this is to (a) first sketch $A$ and $B$…
We introduce a systematic construction of higher-order matrix product operator (MPO) approximations of the time evolution operator for generic (short and long range) one-dimensional Hamiltonians. We demonstrate the utility of our…
Matrix product states play an important role in quantum information theory to represent states of many-body systems. They can be seen as low-dimensional subvarieties of a high-dimensional tensor space. In these notes, we consider two…
We study the $(\varepsilon, \delta)$-PAC policy identification problem in finite-horizon episodic Markov Decision Processes. Existing approaches provide finite-time guarantees for approximate settings ($\varepsilon>0$) but suffer from high…
It is an open question whether the linear extension complexity of the Cartesian product of two polytopes P, Q is the sum of the extension complexities of P and Q. We give an affirmative answer to this question for the case that one of the…
We present an algorithm to reduce the computational effort for the multiplication of a given matrix with an unknown column vector. The algorithm decomposes the given matrix into a product of matrices whose entries are either zero or integer…
In this paper, an exact algorithm in polynomial time is developed to solve unrestricted binary quadratic programs. The computational complexity is $O\left( n^{\frac{15}{2}}\right) $, although very conservative, it is sufficient to prove…
We argue first that translational invariant Matrix Product can be interpreted as a stationary sea of particles. Next, rather than starting from some local Hamiltonian with random potentials, we consider fluctuations of the local tensors of…
Over the last years the vertex enumeration problem of polyhedra has seen a revival in the study of metabolic networks, which increased the demand for efficient vertex enumeration algorithms for high-dimensional polyhedra given by…
Very recently we have shown that the spherical transform is a convenient tool for studying the relation between the joint density of the singular values and that of the eigenvalues for bi-unitarily invariant random matrices. In the present…
Determining the crossing numbers of Cartesian products of small graphs with arbitrarily large paths has been an ongoing topic of research since the 1970s. Doing so requires the establishment of coincident upper and lower bounds; the former…
Let $C$ be an arithmetic circuit of $poly(n)$ size given as input that computes a polynomial $f\in\mathbb{F}[X]$, where $X=\{x_1,x_2,\ldots,x_n\}$ and $\mathbb{F}$ is any field where the field arithmetic can be performed efficiently. We…
We consider certain decision problems for the free model of the theory of Cartesian monoids. We introduce a model of computation based on the notion of a single stack one-way PDA due to Ginsburg, Greibach and Harrison. This model allows us…
For minimal unique ergodic diffeomorphisms $\alpha_n$ of $S^{2n+1} (n>0)$ and $\alpha_m$ of $S^{2m+1}(m>0)$, the $C^*$-crossed product algebra $C(S^{2n+1})\rtimes_{\alpha_n} \mathbb{Z}$ is isomorphic to $C(S^{2m+1})\rtimes_{\alpha_m}…
This work demonstrates a methodology for using deep learning to discover simple, practical criteria for classifying matrices based on abstract algebraic properties. By combining a high-performance neural network with explainable AI (XAI)…
In this paper, we study matrix scaling and balancing, which are fundamental problems in scientific computing, with a long line of work on them that dates back to the 1960s. We provide algorithms for both these problems that, ignoring…
We show that singular numbers (also known as invariant factors or Smith normal forms) of products and corners of random matrices over $\mathbb{Q}_p$ are governed by the Hall-Littlewood polynomials, in a structurally identical manner to the…
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…
One of the major successes in computational biology has been the unification, using the graphical model formalism, of a multitude of algorithms for annotating and comparing biological sequences. Graphical models that have been applied…
Given a pattern $p = s_1x_1s_2x_2\cdots s_{r-1}x_{r-1}s_r$ such that $x_1,x_2,\ldots,x_{r-1}\in\{x,\overset{{}_{\leftarrow}}{x}\}$, where $x$ is a variable and $\overset{{}_{\leftarrow}}{x}$ its reversal, and $s_1,s_2,\ldots,s_r$ are…