English
Related papers

Related papers: Bijective counting of plane bipolar orientations a…

200 papers

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

Combinatorics · Mathematics 2012-01-13 Edinah K. Gnang , Chetan Tonde

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou , Anders Claesson , Mark Dukes , Sergey Kitaev

In this short note, we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers.

Combinatorics · Mathematics 2008-05-12 Yidong Sun

Amdeberhan conjectured that the number of $(s,s+2)$-core partitions with distinct parts for an odd integer $s$ is $2^{s-1}$. This conjecture was first proved by Yan, Qin, Jin and Zhou, then subsequently by Zaleski and Zeilberger. Since the…

Combinatorics · Mathematics 2017-05-10 Jineon Baek , Hayan Nam , Myungjun Yu

A $B$-tree is a type of search tree where every node (except possibly for the root) contains between $m$ and $2m$ keys for some positive integer $m$, and all leaves have the same distance to the root. We study sequences of $B$-trees that…

Combinatorics · Mathematics 2024-06-11 Fabian Burghart , Stephan Wagner

Arnol'd proved in 1992 that Springer numbers enumerate the Snakes, which are type $B$ analogs of alternating permutations. Chen, Fan and Jia in 2011 introduced the labeled ballot paths and established a ``hard'' bijection with snakes.…

Combinatorics · Mathematics 2025-01-03 Shaoshi Chen , Yang Li , Zhicong Lin , Sherry H. F. Yan

We study bipartite maps on the plane with one infinite face and one face of perimeter 2. At first we consider the problem of their enumeration an then study the connection between the combinatorial structure of a map and the degree of its…

Combinatorics · Mathematics 2017-06-30 Yury Kochetkov

A sub-problem of the open problem of finding an explicit bijection between alternating sign matrices and totally symmetric self-complementary plane partitions consists in finding an explicit bijection between so-called $(n,k)$ Gog…

Combinatorics · Mathematics 2016-04-12 Jérémie Bettinelli

We find an explicit $S_n$-equivariant bijection between the integral points in a certain zonotope in $\mathbb{R}^n$, combinatorially equivalent to the permutahedron, and the set of $m$-parking functions of length $n$. This bijection…

Combinatorics · Mathematics 2026-02-19 Valery Lunts , Špela Špenko , Michel Van den Bergh

This note introduces some bijections relating core partitions and tuples of integers. We apply these bijections to count the number of cores with various types of restriction, including fixed number of parts, limited size of parts, parts…

Combinatorics · Mathematics 2019-11-20 Hao Zhong

In this article we show that non-singular quadrics and non-singular Hermitian varieties are completely characterized by their intersection numbers with respect to hyperplanes and spaces of codimension 2. This strongly generalizes a result…

Combinatorics · Mathematics 2013-09-10 Stefaan De Winter , Jeroen Schillewaert

Let $T(n,m)$ be the set of all plane labelled bipartite trees with $n$ white vertices and $m$ black. If the number $n+m$ of vertices is even, then the set $T(n,m)$ is a union of two disjoint subsets --- subset od "even" trees and subset of…

Combinatorics · Mathematics 2016-11-04 Yury Kochetkov

In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a…

Combinatorics · Mathematics 2022-11-16 Robert Cori , Yiting Jiang , Patrice Ossona de Mendez , Pierre Rosenstiehl

Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…

Combinatorics · Mathematics 2007-05-23 Jason Burns

In this paper, we give part-preserving bijections between three fundamental families of objects that serve as natural framework for many problems in enumerative combinatorics. Specifically, we consider compositions, Dyck paths, and…

Combinatorics · Mathematics 2024-05-13 Juan B. Gil , Emma G. Hoover , Jessica A. Shearer

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

This note discusses the bijection between the exceptional subcategories of representations of quivers and generalized non-crossing partitions of Weyl groups. We give a new proof of the Ingalls-Thomas-Igusa-Schiffler bijection by using the…

Representation Theory · Mathematics 2016-01-29 Anningzhe Gao

We study random bipartite planar maps defined by assigning nonnegative weights to each face of a map. We prove that for certain choices of weights a unique large face, having degree proportional to the total number of edges in the maps,…

Probability · Mathematics 2015-06-05 Svante Janson , Sigurdur Örn Stefánsson

There is a bijection from Schroder paths to {4132, 4231}-avoiding permutations due to Bandlow, Egge, and Killpatrick that sends "area" to "inversion number". Here we give a concise description of this bijection.

Combinatorics · Mathematics 2016-02-19 David Callan

We enumerate bijectively the family of involutive Baxter permutations according to various parameters; in particular we obtain an elementary proof that the number of involutive Baxter permutations of size $2n$ with no fixed points is…

Combinatorics · Mathematics 2011-10-31 Eric Fusy