English
Related papers

Related papers: A simple explicit bijection between (n,2) Gog and …

200 papers

For positive integers $k, l \geq 2$, the set of $k$-regular partitions in which parts appear at most $l$ times has attracted a lot of interest in that a composition of Glaisher's mapping can be used to prove the associated partition…

Combinatorics · Mathematics 2023-10-31 Darlison Nyirenda , Molatelo Rapudi

In 2017, Igusa and Todorov gave a bijection between signed exceptional sequences and ordered partial clusters. In this paper, we show that every term in an exceptional sequence is either relatively projective or relatively injective or both…

Representation Theory · Mathematics 2024-12-31 Shujian Chen , Kiyoshi Igusa

We give a bijective proof of a conjecture of Regev and Vershik on the equality of two multisets of hook numbers of certain skew-Young diagrams. The bijection proves a result that is stronger and more symmetric than the original conjecture,…

Combinatorics · Mathematics 2011-10-19 Ian Goulden , Alexander Yong

Let A be a symmetrizable hyperbolic generalized Cartan matrix with Kac-Moody algebra g = g(A) and (adjoint) Kac-Moody group G = G(A)=$\langle\exp(ad(t e_i)), \exp(ad(t f_i)) \,|\, t\in C\rangle$ where $e_i$ and $f_i$ are the simple root…

Group Theory · Mathematics 2020-06-01 Lisa Carbone , Alex J. Feingold , Walter Freyn

If $ p_k(a,m,n) $ denotes the number of partitions of $n$ into $k$th powers with a number of parts that is congruent to $ a $ modulo $m,$ then $p_2(0,2,n)\sim p_2(1,2,n)$ and the sign of the difference $p_2(0,2,n)- p_k(1,2,n)$ alternates…

Number Theory · Mathematics 2021-02-03 Alexandru Ciolan

We give a bijection between permutations of length 2n and certain pairs of Dyck paths with labels on the down steps. The bijection arises from a game in which two players alternate selecting from a set of 2n items: the permutation encodes…

Combinatorics · Mathematics 2013-07-01 Louis J. Billera , Lionel Levine , Karola Meszaros

A binary partition of a positive integer $n$ is a partition of $n$ in which each part has size a power of two. In this note we first construct a Gray sequence on the set of binary partitions of $n$. This is an ordering of the set of binary…

Combinatorics · Mathematics 2009-07-23 Thomas Colthurst , Michael Kleber

The classical McKay correspondence for finite subgroups $G$ of $\SL(2,\C)$ gives a bijection between isomorphism classes of nontrivial irreducible representations of $G$ and irreducible components of the exceptional divisor in the minimal…

Algebraic Geometry · Mathematics 2015-04-02 Mark Blume

This paper is the second in a series of planned papers which provide first bijective proofs of alternating sign matrix results. Based on the main result from the first paper, we construct a bijective proof of the enumeration formula for…

Combinatorics · Mathematics 2019-12-04 Ilse Fischer , Matjaž Konvalinka

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

We establish a general bijective framework for encoding faces of some classical hyperplane arrangements. Precisely, we consider hyperplane arrangements in $\mathbb{R}^n$ whose hyperplanes are all of the form $\{x_i-x_j=s\}$ for some…

Combinatorics · Mathematics 2025-03-04 Olivier Bernardi

We study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…

Combinatorics · Mathematics 2020-11-20 Damir Yeliussizov

There is the same number of $n \times n$ alternating sign matrices (ASMs) as there is of descending plane partitions (DPPs) with parts no greater than $n$, but finding an explicit bijection is an open problem for about $40$ years now. So…

Combinatorics · Mathematics 2022-12-05 Florian Aigner , Ilse Fischer

Let ${p > 2}$ be an odd prime and ${G = SL_2(\mathbb{F}_p)}$. Denote the subgroup of upper triangular matrices as $B$. Finally, let ${\mathbb{F}}$ be an algebraically closed field of characteristic ${p}$. The Green correspondence gives a…

Representation Theory · Mathematics 2025-05-16 Denver-James Logan Marchment

We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…

Algebraic Topology · Mathematics 2007-05-23 Pavle V. M. Blagojevic , Sinisa T. Vrecica , Rade T. Zivaljevic

This paper is motivated by two problems recently proposed by Coker on combinatorial identities related to the Narayana polynomials and the Catalan numbers. We find that a bijection of Chen, Deutsch and Elizalde can be used to provide…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Sherry H. F. Yan , Laura L. M. Yang

Let $P$ and $Q$ be simple polygons with $n$ vertices each. We wish to compute triangulations of $P$ and $Q$ that are combinatorially equivalent, if they exist. We consider two versions of the problem: if a triangulation of $P$ is given, we…

Computational Geometry · Computer Science 2026-03-03 Peyman Afshani , Boris Aronov , Kevin Buchin , Maike Buchin , Otfried Cheong , Katharina Klost , Carolin Rehs , Günter Rote

Let n be a positive integer greater than or equal to 2, and q a complex number, transcendental over Q. In this paper, we give an algorithmic construction of an ordered bijection between the set of H-primes of n \times n quantum matrices and…

Rings and Algebras · Mathematics 2007-05-23 Stéphane Launois

Let $G$ be a connected complex reductive algebraic group with Lie algebra $\mathfrak{g}$. The Lusztig--Vogan bijection relates two bases for the bounded derived category of $G$-equivariant coherent sheaves on the nilpotent cone…

Representation Theory · Mathematics 2017-11-02 David B Rush

We introduce a bijection between inequivalent minimal factorizations of the n-cycle (1 2 ... n) into a product of smaller cycles of given length, on one side, and trees of a certain structure on the other. We use this bijection to count the…

Combinatorics · Mathematics 2010-12-14 G. Berkolaiko , J. M. Harrison , M. Novaes