English
Related papers

Related papers: Stanley character polynomials

200 papers

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…

Representation Theory · Mathematics 2024-09-19 Michael Larsen , Jay Taylor , Pham Tiep

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…

Group Theory · Mathematics 2007-05-23 Thomas W. Mueller , Jan-Christoph Schlage-Puchta

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…

Algebraic Geometry · Mathematics 2018-05-04 E. Artal , J. Carmona , J. I. Cogolludo , M. A. Marco

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}\…

Commutative Algebra · Mathematics 2014-09-25 Bogdan Ichim , Lukas Katthän , Julio José Moyano-Fernández

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…

Combinatorics · Mathematics 2026-04-02 Noam Lifshitz , Avichai Marmor

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…

Combinatorics · Mathematics 2026-04-13 Feihu Liu

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…

Group Theory · Mathematics 2023-07-28 Peter Keevash , Noam Lifshitz

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…

Representation Theory · Mathematics 2016-04-22 Avraham Aizenbud , Dmitry Gourevitch , Andrey Minchenko

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:…

High Energy Physics - Theory · Physics 2024-08-09 Dmitry Galakhov , Alexei Morozov , Nikita Tselousov

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…

Combinatorics · Mathematics 2016-08-11 Olcay Coşkun , Müge Taşkın

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…

Algebraic Geometry · Mathematics 2017-05-22 Duiliu-Emanuel Diaconescu

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…

Combinatorics · Mathematics 2024-06-17 Zi-Wei Bai , Ricky X. F. Chen

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…

Combinatorics · Mathematics 2018-09-26 Per Alexandersson

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…

Commutative Algebra · Mathematics 2024-05-01 Mircea Cimpoeas

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…

Combinatorics · Mathematics 2026-01-26 Shinji Koshida

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}$,…

Combinatorics · Mathematics 2026-01-30 Seth R. Nelson , Eric Swartz

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…

Algebraic Geometry · Mathematics 2016-10-24 Christoph Hanselka

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…

Combinatorics · Mathematics 2016-12-02 Loïc Foissy , Claudia Malvenuto , Frédéric Patras

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…

Combinatorics · Mathematics 2019-02-25 Stefan Felsner , Torsten Ueckerdt
‹ Prev 1 8 9 10 Next ›