Related papers: A supercharacter table decomposition via power-sum…
The irreducible characters of the symmetric group are a symmetric polynomial in the eigenvalues of a permutation matrix. They can therefore be realized as a symmetric function that can be evaluated at a set of variables and form a basis of…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…
We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} =…
The Fock space of $m+p$ bosonic and $n+q$ fermionic quantum oscillators forms a unitarizable module of the general linear superalgebra $gl_{m+p|n+q}$. Its tensor powers decompose into direct sums of infinite dimensional irreducible highest…
Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a Hidden Subgroup problem, in which an unknown subgroup H of a group G must be determined from a uniform superposition on a…
The algebra of quasisymmetric functions QSym and the shuffle algebra of compositions Sh are isomorphic as graded Hopf algebras (in characteristic zero), and isomorphisms between them can be specified via shuffle bases of QSym. We use the…
It is well known that not every summability property for non linear operators leads to a factorization theorem. In this paper we undertake a detailed study of factorization schemes for summing linear and nonlinear operators. Our aim is to…
Let A be a Hopf algebra and H a coalgebra. We shall describe and classify up to an isomorphism all Hopf algebras E that factorize through A and H: that is E is a Hopf algebra such that A is a Hopf subalgebra of E, H is a subcoalgebra in E…
Much can be learned about a finite group from its character table, but sometimes that table can be difficult to compute. Supercharacter theories are generalizations of character theory defined by P. Diaconis and I.M. Isaacs, in which…
We describe a unification of several apparently unrelated factorizations arisen from quantum field theory, vertex operator algebras, combinatorics and numerical methods in differential equations. The unification is given by a Birkhoff type…
We establish, for the character table of the symmetric group, the positivity of the row sums indexed by irreducible characters, when restricted to various subsets of the conjugacy classes. A notable example is that of partitions with all…
Coupled decompositions are a widely used tool for data fusion. As the volume of data increases, so does the dimensionality of matrices and tensors, highlighting the need for more efficient coupled decomposition algorithms. This paper…
We show that if a finite dimensional Hopf algebra over ${\bf C}$ has a basis such that all the structure constants are non-negative, then the Hopf algebra must be given by a finite group $G$ and a factorization $G=G_+G_-$ into two…
We describe the quasitriangular structure (universal $R$-matrix) on the non-standard quantum group $U_q(H_1,H_2,X^\pm)$ associated to the Alexander-Conway matrix solution of the Yang-Baxter equation. We show that this Hopf algebra is…
In order to find a tractable theory to substitute for the wild character theory of the group of $n\times n$ unipotent upper-triangular matrices over a finite field $\mathbb{F}_q$, Andr\'e and Yan introduced the notion of supercharacter…
Various algebraic properties of Heilbronn's exponential sum can be deduced through the use of supercharacter theory, a novel extension of classical character theory due to Diaconis-Isaacs and Andre. This perspective yields a variety of…
Supercharacter theory is developed by P. Diaconis and I. M. Isaacs as a natural generalization of the classical ordinary character theory. Some classical sums of number theory appear as supercharacters which are obtained by the action of…
Assume $\mathbf{G}$ is a connected reductive algebraic group defined over an algebraic closure $\mathbb{K} = \overline{\mathbb{F}}_p$ of the finite field of prime order $p>0$. Furthermore, assume that $F : \mathbf{G} \to \mathbf{G}$ is a…
Let $G(q)$ be a Chevalley group over a finite field $F_q$. By Lusztig's and Shoji's work, the problem of computing the values of the unipotent characters of $G(q)$ is solved, in principle, by the theory of character sheaves; one issue in…
We identify and analyse obstructions to factorisation of integer matrices into products $N^T N$ or $N^2$ of matrices with rational or integer entries. The obstructions arise as quadratic forms with integer coefficients and raise the…