Related papers: Hidden symmetries and Large N factorisation for pe…
Under the name prime decomposition (pd), a unique decomposition of an arbitrary $N$-dimensional density matrix $\rho$ into a sum of seperable density matrices with dimensions given by the coprime factors of $N$ is introduced. For a class of…
We show that the fixed elements for the natural GL_m-action on the universal division algebra UD(m,n) of m generic n x n matrices form a division subalgebra of degree n, assuming n >= 3 and 2 <= m <= n^2 - 2. This allows us to describe the…
The structure of the multiplicative group $M_n = ({\mathbb Z}/n{\mathbb Z})^\times$ encodes a great deal of arithmetic information about the integer $n$ (examples include $\phi(n)$, the Carmichael function $\lambda(n)$, and the number…
Consider the symmetric group $S_n$ acting as a reflection group on the polynomial ring $k[x_1, \ldots, x_n]$, where $k$ is a field such that Char$(k)$ does not divide $n!$. We use Higher Specht polynomials to construct matrix factorizations…
In this work we are concerned with the multiplicity of the eigenvalues of the Neumann Laplacian in regions of Rn which are invariant under the natural action of a compact subgroup G of O(n). We give a partial positive answer (in the Neumann…
We show that a certain representation of the matrix-product can be computed with $n^{o(1)}$ multiplications. We also show, that siumilar representations of matrices can be compressed enormously.
We introduce a unified method for study of 2-dimensional invariant subspaces of matrices and their corresponding super-eigenvalues. As a novel application to non-commutative algebra, we present a connection between the eigenvalues of…
We study the representation theory of the uniform block permutation algebra in the context of the representation theory of factorizable inverse monoids. The uniform block permutation algebra is a subalgebra of the partition algebra and is…
The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…
We introduce a rather natural family of non-uniform distributions on $PF_n$, $n\in\mathbb{N}$, the set of parking functions of length $n$. One of the motivations for this comes from a similar situation in the context of integer partitions.…
A feature of certain ensembles of random matrices is that the corresponding measure is invariant under conjugation by unitary matrices. Study of such ensembles realised by matrices with Gaussian entries leads to statistical quantities…
Symmetric functions, which take as input an unordered, fixed-size set, are known to be universally representable by neural networks that enforce permutation invariance. These architectures only give guarantees for fixed input sizes, yet in…
Let $K$ be a field and let $\mathbb N = \{1,2, \dots \}$. Let $R_n=K[x_{ij} \mid 1\le i\le n, j\in \mathbb N]$ be the ring of polynomials in $x_{ij}$ $(1 \le i \le n, j \in \mathbb N)$ over $K$. Let $S_n = Sym (\{1,2, \ldots, n \})$ and…
The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…
We study intertwining relations for matrix one-dimensional, in general, non-Hermitian Hamiltonians by matrix differential operators of arbitrary order. It is established that for any matrix intertwining operator Q_N^- of minimal order N…
A novel invariant decomposition of diagonalizable $n \times n$ matrices into $n$ commuting matrices is presented. This decomposition is subsequently used to split the fundamental representation of $\mathfrak{su}(3)$ Lie algebra elements…
We show that interval partition functions (transition amplitudes) of three-dimensional $N = 2$ theories admit factorizations into sums of products of hemisphere partition functions with additional normalization factors. We prove the…
Nonnegative matrix factorization (NMF) is a popular model in the field of pattern recognition. It aims to find a low rank approximation for nonnegative data M by a product of two nonnegative matrices W and H. In general, NMF is NP-hard to…
We consider problems of dimensionality reduction and learning data representations for continuous spaces with two or more independent degrees of freedom. Such problems occur, for example, when observing shapes with several components that…
Nonnegative matrix factorization (NMF) is a popular dimension reduction technique that produces interpretable decomposition of the data into parts. However, this decompostion is not generally identifiable (even up to permutation and…