English
Related papers

Related papers: A bijection for partitions simultaneously $s$-regu…

200 papers

We show that, in many cases, there are infinitely many sets of partitions corresponding to a single analytical Rogers-Ramanujan type identity. This means that a single analytical Rogers-Ramanujan type identity implies the existence of…

Combinatorics · Mathematics 2021-01-06 Pietro Mercuri

For integers m, n $\ge$ 1, we describe a bijection sending dissections of the (mn + 2)-regular polygon into (m + 2)-sided polygons to a new basis of the quotient of the polynomial algebra in mn variables by an ideal generated by some kind…

Combinatorics · Mathematics 2016-07-11 Jean-Christophe Aval , Frédéric Chapoton

For a subclass of matchings, set partitions, and permutations, we describe a direct bijection involving only arc annotated diagrams that not only interchanges maximum nesting and crossing numbers, but also all refinements of crossing and…

Combinatorics · Mathematics 2012-10-23 Lily Yen

In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends $\delta$-distant k-crossings to $(\delta+1)$-distant k-crossings (and similarly for nestings). This map provides a…

Combinatorics · Mathematics 2023-10-24 Juan B. Gil , Jordan O. Tirrell

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our…

Combinatorics · Mathematics 2015-07-27 Marie Albenque , Dominique Poulalhon

We show that there is a reflection type bijection between the indecomposable summands of two multiplicity free tilting modules $X$ and $Y$. This bijection fixes the common indecomposable summands of $X$ and $Y$ and sends indecomposable…

Representation Theory · Mathematics 2021-06-24 Gabriella D'Este , H. Melis Tekin Akcin

A provably correct bijection between higher-order abstract syntax (HOAS) and the natural numbers enables one to define a "not equals" relationship between terms and also to have an adequate encoding of sets of terms, and maps from one term…

Logic in Computer Science · Computer Science 2010-09-16 John Tang Boyland

In this paper, we investigate the problem of finding {\it bisections} (i.e., balanced bipartitions) in graphs. We prove the following two results for {\it all} graphs $G$: (1). $G$ has a bisection where each vertex $v$ has at least $(1/4 -…

Combinatorics · Mathematics 2025-04-22 Jie Ma , Hehui Wu

We extend so-called slit-slide-sew bijections to constellations and quasiconstellations. We present an involution on the set of hypermaps given with an orientation, one distinguished corner, and one distinguished edge leading away from the…

Combinatorics · Mathematics 2025-12-08 Jérémie Bettinelli , Dimitri Korkotashvili

We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.

Combinatorics · Mathematics 2007-05-23 Igor Pak , Ernesto Vallejo

In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we show that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result. Second, we obtain a number of new…

Combinatorics · Mathematics 2007-10-09 Matjaz Konvalinka , Igor Pak

Let $A_k(n)$ denote the set of $k$-distinct partitions of $n$, and let $B_k(n)$ be the set of $k$-regular partitions of $n$. Glaisher showed that $\# A_k(n) = \# B_k(n)$. For $k=2$, this equality yields the celebrated Euler's partition…

Combinatorics · Mathematics 2025-11-19 Hongshu Lin , Wenston J. T. Zang

We resolve the explicit bijection problem between symmetric plane partitions (SPPs) and quasi transpose complementary plane partitions (QTCPPs), introduced by Schreier-Aigner, who proved their equinumerosity. First, we relate this problem…

Combinatorics · Mathematics 2026-01-06 Takuya Inoue

We obtain the generating functions for partial matchings avoiding neighbor alignments and for partial matchings avoiding neighbor alignments and left nestings. We show that there is a bijection between partial matchings avoiding three…

Combinatorics · Mathematics 2010-09-24 William Y. C. Chen , Neil J. Y. Fan , Alina F. Y. Zhao

We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…

Combinatorics · Mathematics 2024-03-11 Manosij Ghosh Dastidar , Michael Wallner

In this paper we build a bijection between the meet-irreducible elements of the lattice of the compositions of $n$ with parts in $[1,p]$ equipped with the dominance order, and the edges of the $(n,p)$-Tur\'an graph. Using this bijection, we…

Combinatorics · Mathematics 2026-01-29 Nathanaël Hassler

In this paper, we give a purely bijective proof that two different partition classes that are both combinatorial interpretations of the partition function $p_\nu(n)$, a partition function related to the third order mock theta function…

Combinatorics · Mathematics 2020-07-21 A. S. Andersen

In \cite{Lusztig}, Lusztig gives an explicit formula for the bijection between the set of bipartitions and the set $\mathcal{N}$ of unipotent classes in a spin group which carry irreducible local systems equivariant for the spin group but…

Representation Theory · Mathematics 2018-10-24 Jianqiao Xia

A unicellular map is a map which has only one face. We give a bijection between a dominant subset of rooted unicellular maps of fixed genus and a set of rooted plane trees with distinguished vertices. The bijection applies as well to the…

Combinatorics · Mathematics 2012-03-15 Guillaume Chapuy

We define a bijection between triangulations of a convex polygon and $312$-avoiding permutations through the process of "ear-clipping". This bijection is then used to obtain a bijection between polygon dissections and a certain class of…

Combinatorics · Mathematics 2013-11-11 Alon Regev