Related papers: Hidden symmetries and Large N factorisation for pe…
We investigate the problem of factorizing a matrix into several sparse matrices and propose an algorithm for this under randomness and sparsity assumptions. This problem can be viewed as a simplification of the deep learning problem where…
The algebra of observables for identical particles on a line is formulated starting from postulated basic commutation relations. A realization of this algebra in the Calogero model was previously known. New realizations are presented here…
A fundamental problem in quantum physics is to encode functions that are completely anti-symmetric under permutations of identical particles. The Barron space consists of high-dimensional functions that can be parameterized by infinite…
We show that nilpotent matrices that yield the Schrodinger equation from its first order form encode the fingerprints of grand unified theories. We perform a rigorous search for all such nilpotent matrices and find that the resulting…
The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…
In this paper we continue studying of matrix $n\times n$ linear differential intertwining operators. The problems of minimization and of reducibility of matrix intertwining operators are considered and criterions of weak minimizability and…
Weingarten functions provide a tool for computing Haar measure matrix integrals of polynomials in the matrix entries. An important property of Weingarten functions, is their particularly simple large $N$ limits. In 2017 Benoit Collins and…
Symmetric nonnegative matrix factorization (symNMF) is a variant of nonnegative matrix factorization (NMF) that allows to handle symmetric input matrices and has been shown to be particularly well suited for clustering tasks. In this paper,…
In this paper, we revisit implicit regularization from the ground up using notions from dynamical systems and invariant subspaces of Morse functions. The key contributions are a new criterion for implicit regularization---a leading…
A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…
Let $n \ge 3$ be an integer. Let $P_n = \{1, 2, 3, ..., n-1, n \}$ and let $S_n$ be the symmetric group of permutations on $P_n$. Motivated by the theory of discrete dynamical systems on the interval, we associate each permutation $\si_n$…
We evidence a family $\mathcal{X}$ of square matrices over a field $\mathbb{K}$, whose elements will be called X-matrices. We show that this family is shape invariant under multiplication as well as transposition. We show that $\mathcal{X}$…
The symmetric group $\mathfrak{S}_n$ acts on the polynomial ring $\mathbb{Q}[\mathbf{x}_n] = \mathbb{Q}[x_1, \dots, x_n]$ by variable permutation. The invariant ideal $I_n$ is the ideal generated by all $\mathfrak{S}_n$-invariant…
We extend the results of Cachazo, Seiberg and Witten to N=1 supersymmetric gauge theories with gauge groups SO(2N), SO(2N+1) and Sp(2N). By taking the superpotential which is an arbitrary polynomial of adjoint matter \Phi as a small…
Consider the real space D_U of directions moving into which from a unitary N x N matrix U we do not disturb its unitarity and the moduli of its entries in the first order. dim( D_U ) is called the defect of U and denoted D(U). We give an…
We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…
An invariant theoretic characterization of subdiscriminants of matrices is given. The structure as a module over the special orthogonal group of the minimal degree non-zero homogeneous component of the vanishing ideal of the variety of real…
It is a well known result that the number of irreducible representations of SU(N) on a tensor product containing k factors of a vector space V is given by the number of involutions in the symmetric group on k letters. In this paper, we…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
Irreducible sigma models, i.e. those for which the partition function does not factorise, are defined on Riemannian spaces with irreducible holonomy groups. These special geometries are characterised by the existence of covariantly constant…