Related papers: Character Polynomials and the Restriction Problem

The maximal subgroup of unipotent upper-triangular matrices of the finite general linear groups are a fundamental family of $p$-groups. Their representation theory is well-known to be wild, but there is a standard supercharacter theory,…

This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…

The observational characteristics of a linear structural equation model can be effectively described by polynomial constraints on the observed covariance matrix. However, these polynomials can be exponentially large, making them impractical…

The permutation matrices form a subgroup of $\text{GL}_n(\mathbb{C})$ that is isomorphic to the symmetric group $S_n$. Let $r_{\mu\lambda}$ denote the multiplicity of the irreducible representation $V_\mu$ of $S_n$, corresponding to a…

We evaluate averages involving characteristic polynomials, inverse characteristic polynomials and ratios of characteristic polynomials for a $N\times N$ random matrix taken from a $L$-deformed Chiral Gaussian Unitary Ensemble with an…

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

Given a word $w(x_{1},\ldots,x_{r})$, i.e., an element in the free group on $r$ elements, and an integer $d\geq1$, we study the characteristic polynomial of the random matrix $w(X_{1},\ldots,X_{r})$, where $X_{i}$ are Haar-random…

We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…

We establish the existence of the Bernstein polynomial in one indeterminate $t$, and provide a method for its explicit computation. The Bernstein polynomial is associated with finitely generated modules over the Weyl algebra, known as…

The Weyl group of the Cuntz algebra O_n, with n finite, is investigated. This is (isomorphic to) the group of polynomial automorphisms of O_n, namely those induced by unitaries that can be written as finite sums of words in the canonical…

Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow…

The Hankel determinant representations for the partition function and boundary correlation functions of the six-vertex model with domain wall boundary conditions are investigated by the methods of orthogonal polynomial theory. For specific…

Given a chain of groups $G_0 \le G_1 \le G_2 ... $, we may form the corresponding chain of their representation rings, together with induction and restriction operators. We may let $\textrm{Res}^l$ denote the operator which restricts down…

We study character varieties arising as moduli of representations of an orientable surface group into a reductive group $G$. We first show that if $G/Z$ acts freely on the representation variety, then both the representation variety and the…

We show the convergence of the characteristic polynomial for random permutation matrices sampled from the generalized Ewens distribution. Under this distribution, the measure of a given permutation depends only on its cycle structure,…

We consider properties of the box polynomials, a one variable polynomial defined over all integer partitions $\lambda$ whose Young diagrams fit in an $m$ by $n$ box. We show that these polynomials can be expressed by the finite difference…

Finding upper bounds for character ratios is a fundamental problem in asymptotic group theory. Previous bounds in the symmetric group have led to remarkable applications in unexpected domains. The existing approaches predominantly relied on…

We introduce the notion of numerical functors to generalise Eilenberg & MacLane's polynomial functors to modules over a binomial base ring. After shewing how these functors are encoded by modules over a certain ring, we record a precise…

Given a multiarrangement of hyperplanes we define a series by sums of the Hilbert series of the derivation modules of the multiarrangement. This series turns out to be a polynomial. Using this polynomial we define the characteristic…

One of the main features of eigenvalue matrix models is that the averages of characters are again characters, what can be considered as a far-going generalization of the Fourier transform property of Gaussian exponential. This is true for…