English
Related papers

Related papers: Hall-Littlewood polynomials and fixed point enumer…

200 papers

The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…

Combinatorics · Mathematics 2017-06-07 Sören Berg , Katharina Jochemko , Laura Silverstein

We introduce and study equivariant Hilbert series of ideals in polynomial rings in countably many variables that are invariant under a suitable action of a symmetric group or the monoid $Inc(\mathbb{N})$ of strictly increasing functions.…

Commutative Algebra · Mathematics 2021-05-18 Uwe Nagel , Tim Roemer

Following Talagrand's concentration results for permutations picked uniformly at random from a symmetric group [Tal95], Luczak and McDiarmid have generalized it to more general groups G of permutations which act suitably 'locally'. Here we…

Probability · Mathematics 2017-06-28 Paul-Marie Samson

Motivated by the Gray code interpretation of Hamiltonian cycles in Cayley graphs, we investigate the existence of Hamiltonian cycles in tope graphs of hyperplane arrangements, with a focus on simplicial, reflection, and supersolvable…

Combinatorics · Mathematics 2026-04-10 Veronika Körber , Tobias Schnieders , Jan Stricker , Jasmin Walizadeh

We explain the equality between the two sets of formulas for $q$-Whittaker functions and modified Hall-Littlewood functions obtained by Haglund, Haiman and Loehr - the Inv formula and Ayyer, Mandelshtam and Martin - the Quinv formula by use…

Combinatorics · Mathematics 2024-12-16 Aritra Bhattacharya

We give a counting formula in terms of modified Hall-Littlewood polynomials and the chromatic quasisymmetric function for the number of points on an arbitrary Hessenberg variety over a finite field. As a consequence, we express the…

Combinatorics · Mathematics 2025-10-27 Alex Abreu , Antonio Nigro , Samrith Ram

We show that a family of multivariate polynomials recently introduced by Bessenrodt and Stanley can be expressed as solution of the octahedron recurrence with suitable initial data. This leads to generalizations and explicit expressions as…

Combinatorics · Mathematics 2014-06-05 Philippe Di Francesco

We use the octahedron recurrence to give a simplified statement and proof of a formula for iterated birational rowmotion on a product of two chains, first described by Musiker and Roby. Using this, we show that weights of certain chains in…

Combinatorics · Mathematics 2022-04-12 Joseph Johnson , Ricky Ini Liu

Motivated by the work of Koornwinder, Macdonald, Cherednik, Noumi, and van Diejen we define a 6-parameter double affine Hecke algebra and establish its basic structural properties, including the existence of an involution. We relate the…

q-alg · Mathematics 2007-05-23 Siddhartha Sahi

An observation on Hall-Littlewood polynomials.

Combinatorics · Mathematics 2013-09-13 R. Virk

We establish a purely geometric form of the concentration theorem (also called localization theorem) for actions of a linearly reductive group $G$ on an affine scheme $X$ over an affine base scheme $S$. It asserts the existence of a…

Algebraic Geometry · Mathematics 2025-03-27 Olivier Haution

We apply the version of P\'{o}lya-Redfield theory obtained by White to count patterns with a given automorphism group to the enumeration of strong dichotomy patterns, that is, we count bicolor patterns of $\mathbb{Z}_{2k}$ with respect to…

Combinatorics · Mathematics 2018-09-25 Octavio A. Agustín-Aquino

In this note, the first-order Dickson polynomials are introduced through a particular case of the expression of the trace of the $n^{th}$ power of a matrix in terms of powers of the trace and determinant of the matrix itself. The technique…

Number Theory · Mathematics 2024-06-14 Jean-Christophe Pain

J. DeLoera-T. McAllister and K. D. Mulmuley-H. Narayanan-M. Sohoni independently proved that determining the vanishing of Littlewood-Richardson coefficients has strongly polynomial time computational complexity. Viewing these as Schubert…

Combinatorics · Mathematics 2019-05-23 Anshul Adve , Colleen Robichaux , Alexander Yong

Applying E. Kowalski's recent generalization of the large sieve we prove that certain properties expected to be typical (irreducibility of the characteristic polynomial, absence of squares among the matrix coefficients...) are indeed…

Number Theory · Mathematics 2008-11-13 Florent Jouve

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…

Algebraic Geometry · Mathematics 2009-06-03 A. I. Molev

Orbit harmonics is a tool in combinatorial representation theory which promotes the (ungraded) action of a linear group $G$ on a finite set $X$ to a graded action of $G$ on a polynomial ring quotient by viewing $X$ as a $G$-stable point…

Combinatorics · Mathematics 2020-10-19 Jaeseong Oh , Brendon Rhoades

We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…

Combinatorics · Mathematics 2021-08-31 Samuel Herman , Eirini Poimenidou

The Rota--Heron--Welsh conjecture (now a theorem of Adiprasito, Huh, and the author) asserts the log-concavity of the characteristic polynomial of matroids. We give an exposition of the Lorentzian polynomial proof following the work of…

Combinatorics · Mathematics 2025-08-13 Eric Katz

An increasing tableau is a semistandard tableau with strictly increasing rows and columns. It is well known that the Catalan numbers enumerate both rectangular standard Young tableaux of two rows and also Dyck paths. We generalize this to a…

Combinatorics · Mathematics 2018-06-13 Oliver Pechenik
‹ Prev 1 3 4 5 6 7 10 Next ›