Related papers: Stanley character polynomials
For every integer $k$ there exists a bound $B=B(k)$ such that if the characteristic polynomial of $g\in \operatorname{SL}_n(q)$ is the product of $\le k$ pairwise distinct monic irreducible polynomials over $\mathbb{F}_q$, then every…
We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…
We derive an asymptotic expansion for the subgroup of arbitrary Fuchsian groups and some other classes of large groups. Moreover, the main conjecture for Random Walks on symmetric groups is established in full generality. Both problems…
Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the…
Let $K$ be a field, $R=K[X_1, ..., X_n]$ be the polynomial ring and $J \subsetneq I$ two monomial ideals in $R$. In this paper we show that $\mathrm{sdepth}\ {I/J} - \mathrm{depth}\ {I/J} = \mathrm{sdepth}\ {I^p/J^p}-\mathrm{depth}\…
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…
Graph polytopes arising from vertex-weighted graphs were first introduced by B\'ona, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is…
A recently fertile strand of research in Group Theory is developing non-abelian analogues of classical combinatorial results for arithmetic Cayley graphs, describing properties such as growth, expansion, mixing, diameter, etc. We consider…
In this paper, we prove that any relative character (a.k.a. spherical character) of any admissible representation of a real reductive group with respect to any pair of spherical subgroups is a holonomic distribution on the group. This…
We introduce generalization of famous Macdonald polynomials for the case of super-Young diagrams that contain half-boxes on the equal footing with full boxes. These super-Macdonald polynomials are polynomials of extended set of variables:…
We prove that the well-known condition of being a balanced labeling can be characterized in terms of the sliding algorithm on tower diagrams. The characterization involves a generalization of authors' Rothification algorithm. Using the…
Conjectural results for cohomological invariants of wild character varieties are obtained by counting curves in degenerate Calabi-Yau threefolds. A conjectural formula for E-polynomials is derived from the Gromov-Witten theory of local…
Enumeration of hypermaps is widely studied in many fields. In particular, enumerating hypermaps with a fixed edge-type according to the number of faces and genus is one topic of great interest. However, it is challenging and explicit…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…
Given arbitrary monomial ideals $I$ and $J$ in polynomial rings $A$ and $B$ over a field $K$, we investigate the Stanley depth of powers of the sum $I+J$, and their quotient rings, in $A\otimes_K B$ in terms of those of $I$ and $J$. Our…
This paper studies planar algebras of Jones' style associated with the Young graph. We first see that, given a positive real valued function on the Young graph, we may obtain a planar algebra whose structure is defined in terms of a state…
A $(v,k,\lambda, \mu)$-partial difference set (PDS) is a subset $D$ of size $k$ of a group $G$ of order $v$ such that every nonidentity element $g$ of $G$ can be expressed in either $\lambda$ or $\mu$ different ways as a product $xy^{-1}$,…
Viewing a bivariate polynomial f in R[x,t] as a family of univariate polynomials in t parametrized by real numbers x, we call f real rooted if this family consists of monic polynomials with only real roots. If f is the characteristic…
The theory of pictures between posets is known to encode much of the combinatorics of symmetric group representations and related topics such as Young diagrams and tableaux. Many reasons, com-binatorial (e.g. since semi-standard tableaux…
We prove that in every cover of a Young diagram with $\binom{2k}{k}$ steps with generalized rectangles there is a row or a column in the diagram that is used by at least $k+1$ rectangles. We show that this is best-possible by partitioning…