Search arXivSearch

arXiv · 2403.05414

Combinatorial approach to Andrews-Gordon and Bressoud type identities

Abstract

We provide combinatorial tools inspired by work of Warnaar to give combinatorial interpretations of the sum sides of the Andrews-Gordon and Bressoud identities. More precisely, we give an explicit weight- and length-preserving bijection between sets related to integer partitions, which provides these interpretations. In passing, we discover the $q$-series version of an identity of Kurşungöz, similar to the Bressoud identity but with opposite parity conditions, which we prove combinatorially using the classical Bressoud identity and our bijection. We also use this bijection to prove combinatorially many identities, some known and other new, of the Andrews-Gordon and Bressoud type.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jehanne Dousse, Frédéric Jouhet, Isaac Konan. 2024-03-08. Combinatorial approach to Andrews-Gordon and Bressoud type identities. https://arxiv.org/abs/2403.05414

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO