Related papers: Higher genus universally decodable matrices (UDMG)

A structure M is pregeometric if the algebraic closure is a pregeometry in all M' elementarily equivalent to M. We define a generalisation: structures with an existential matroid. The main examples are superstable groups of U-rank a power…

A generalized eigenvector of a hypermatrix, called the universal (U-) eigenvector, is proposed, which extended the notion of diagonal (D-) eigenvectors in the literature. Using the semi-tensor product, the homogeneous U-eigenequation can be…

We classify irreducible unitary representations of the group of all infinite matrices over a $p$-adic field ($p\ne 2$) with integer elements equipped with a natural topology. Any irreducible representation passes through a group $GL$ of…

We consider fine G-gradings on M_n(C) (i.e. gradings of the matrix algebra over the complex numbers where each component is 1 dimensional). Groups which provide such a grading are known to be solvable. We consider the T-ideal of G-graded…

Let $G=GL_n(K)$ be the general linear group defined over an infinite field $K$ of positive characteristic $p$ and let $\Delta(\lambda)$ be the Weyl module of $G$ which corresponds to a partition $\lambda$. In this paper we classify all…

Call a monomial ideal M "generic" if no variable appears with the same nonzero exponent in two distinct monomial generators. Using a convex polytope first studied by Scarf, we obtain a minimal free resolution of M. Any monomial ideal M can…

We establish a connection between generalised commuting schemes $C_g(U_n)$ of higher genus $g$, which are associated with a group scheme $U_n$ consisting of upper triangular unipotent matrices, and the representation homology…

We consider symmetric and Hermitian random matrices whose entries are independent and symmetric random variables with an arbitrary variance pattern. Under a novel Short-to-Long Mixing condition, which is sharp in the sense that it precludes…

The prime graph of a finite group $G$, which is denoted by ${\rm GK}(G)$, is a simple graph whose vertex set is comprised of the prime divisors of $|G|$ and two distinct prime divisors $p$ and $q$ are joined by an edge if and only if there…

Let $G$ be a reductive group over a finite field with a maximal unipotent subgroup $U$, we consider certain sheaves on $G/U$ defined by Kazhdan and Laumon and show that their cohomology produces the cohomology of the Deligne-Lusztig…

For every integer $g \geq 1$ we define a universal Mumford curve of genus $g$ in the framework of Berkovich spaces over $\mathbb{Z}$. This is achieved in two steps: first, we build an analytic space $\mathcal{S}_g$ that parametrizes marked…

General matrix multiplication (GEMM) is a fundamental operation in deep learning (DL). With DL moving increasingly toward low precision, recent works have proposed novel unary GEMM designs as an alternative to conventional binary GEMM…

In a celebrated paper of 1893, Hadamard established the maximal determinant theorem, which establishes an upper bound on the determinant of a matrix with complex entries of norm at most $1$. His paper concludes with the suggestion that…

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

Let G=GL_n be the general linear group over an algebraically closed field k and let g=gl_n be its Lie algebra. Let U be the subgroup of G which consists of the upper unitriangular matrices. Let k[g] be the algebra of regular functions on…

We show that maximal families of mutually unbiased bases are characterized in all dimensions by partitioned unitary error bases, up to a choice of a family of Hadamards. Furthermore, we give a new construction of partitioned unitary error…

A global representation is a compatible collection of representations of the outer automorphism groups of the groups belonging to some collection of finite groups $\mathscr{U}$. Global representations assemble into an abelian category…

Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…

A d-dimensional framework is an embedding of the vertices and edges of a graph in Euclidean space. A d-dimensional framework is globally rigid if every other d-dimensional framework with the same edge lengths has the same pairwise distances…

We study random matrices with independent subgaussian columns. Assuming each column has a fixed Euclidean norm, we establish conditions under which such matrices act as near-isometries when restricted to a given subset of their domain. We…