Related papers: A note on polynomials for character degrees

Representation theory of the symmetric group $\mathfrak{S}_n$ has a very distinctive combinatorial flavor. The conjugacy classes as well as the irreducible characters are indexed by integer partitions $\lambda \vdash n$. We introduce class…

We provide several properties of the geometric polynomials discussed in earlier works of the authors. Further, the geometric polynomials are used to obtain a closed form evaluation of certain series involving Riemann's zeta function.

A family of polynomials parameterized by the conjugacy classes of a finite Coxeter group is investigated. These polynomials, together with the character table of the group, determine the associated generic degrees. The polynomials are…

We propose a new refinement of the McKay conjecture and we prove it for symmetric groups.

We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In…

Stanley introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of the polynomials are positive. Stanley later gives a conjectured combinatorial interpretation for the coefficients of the…

We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…

In this paper, we derive some interesting symmetric properties for the geenralized Euler numbers and polynomials.

In \cite{[CZ]}, Cohen and Zemel showed that for a partition $\lambda \vdash k$, the dimension of the irreducible representation of $S_{n}$ corresponding to the partition $(n-k,\lambda) \vdash n$ is a polynomial of degree $k$ in $n$, whose…

We study zonal characters which are defined as suitably normalized coefficients in the expansion of zonal polynomials in terms of power-sum symmetric functions. We show that the zonal characters, just like the characters of the symmetric…

We investigate the zonal polynomials, a family of symmetric polynomials that appear in many mathematical contexts, such as multivariate statistics, differential geometry, representation theory, and combinatorics. We present two computer…

In this paper, a construction of Shoda pairs using character triples is given for a large class of monomial groups including abelian-by-supersolvable and subnormally monomial groups. The computation of primitive central idempotents and the…

We present some results on character degree sums in connection with certain characteristics of finite groups such as p-solvability, solvability, supersolvability, and nilpotency. Some of them strengthen known results in the literature.

In this paper, the correspondence between the finite dimensional representations of a simple Lie algebra and their characteristic polynomials is established, and a monoid structure on these characteristic polynomials is constructed.…

We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…

We present some variations on some of the main open problems on character degrees. We collect some of the methods that have proven to be very useful to work on these problems. These methods are also useful to solve certain problems on zeros…

This paper addresses the topic of equidistribution and recurrence for polynomial sequences over function fields. The main focus is to note and correct two small errors in [V. Bergelson and A. Leibman, A Weyl-type equidistribution theorem in…

We study asymptotics of characters of the symmetric groups on a fixed conjugacy class. It was proved by Kerov that such a character can be expressed as a polynomial in free cumulants of the Young diagram (certain functionals describing the…

We obtain nontrivial estimates of quadratic character sums of division polynomials $\Psi_n(P)$, $n=1,2, ...$, evaluated at a given point $P$ on an elliptic curve over a finite field of $q$ elements. Our bounds are nontrivial if the order of…

In this article, we show that the algebraic degree in semidefinite programming can be expressed in terms of the coefficient of a certain monomial in a doubly symmetric polynomial. This characterization of the algebraic degree allows us to…