Related papers: Character Polynomials and the Restriction Problem

We suggest to associate with each knot the set of coefficients of its HOMFLY polynomial expansion into the Schur functions. For each braid representation of the knot these coefficients are defined unambiguously as certain combinations of…

We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.

In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…

We study finite-dimensional representations of hyper loop algebras, i.e., the hyperalgebras over an algebraically closed field of positive characteristic associated to the loop algebra over a complex finite-dimensional simple Lie algebra.…

The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…

We compute the number of points over finite fields of the character stack associated to a compact surface group and a reductive group with connected centre. We find that the answer is a Polynomial On Residue Classes (PORC). The key…

By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…

In this paper we study the Frobenius characters of the invariant subspaces of the tensor powers of a representation V. The main result is a formula for these characters for a polynomial functor of V involving the characters for V. The main…

Let G be a connected reductive group. To any irreducible G-variety one associates a certain linear group generated by reflections called the Weyl group. Weyl groups play an important role in the study of embeddings of homogeneous spaces. We…

We investigate combinatorial properties of a kind of insets we defined in an earlier paper, interpreting them now in terms of restricted ternary words. This allows us to give new combinatorial interpretations of a number of known integer…

We study a spectral problem related to the finite-dimensional characters of the groups $Sp(2N)$, $SO(2N+1)$, and $SO(2N)$, which form the classical series $C$, $B$, and $D$, respectively. The irreducible characters of these three series are…

We introduce the notion of a spectral character for finite-dimensional representations of affine algebras. These can be viewed as a suitable q=1 limit of the elliptic characters defined by Etingof and Moura for quantum affine algebras. We…

The classical Peter-Weyl theorem describes the structure of the space of functions on a semi-simple algebraic group. On the level of characters (in type A) this boils down to the Cauchy identity for the products of Schur polynomials. We…

The plethysms of the Weyl characters associated to a classical Lie group by the symmetric functions stabilize in large rank. In the case of a power sum plethysm, we prove that the coefficients of the decomposition of this stabilized form on…

For any two involutions y,w in a Weyl group (y\le w), let P_{y,w} be the polynomial defined in [KL]. In this paper we define a new polynomial P^\sigma_{y,w} whose i-th coefficient is a_i-b_i where the i-th coefficient of P_{y,w} is a_i+b_i…

Derivative polynomials in two variables are defined by repeated differentiation of the tangent and secant functions. We establish the connections between the coefficients of these derivative polynomials and the numbers of interior and left…

We show that tools from circuit complexity can be used to study decompositions of global constraints. In particular, we study decompositions of global constraints into conjunctive normal form with the property that unit propagation on the…

In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…

In this paper, we give some results on closed polynomials and factorially closed polynomial in $n$ variables. In particular, we give a characterization of factorially closed polynomials in $n$ variables over an algebraically closed field…

A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…