相关论文: Self-dual interval orders and row-Fishburn matrice…
It is well known that for a regular semistable curve $\mathfrak X$ over a DVR with algebraically closed residue field, the spanning trees of the dual graph of the special fiber of $\mathfrak X$ are in bijection with components of the…
Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…
We explain how homotopical information of two composeable relations can be organized in two simplicial categories that augment the relations row and column complexes. We show that both of these categories realize to weakly equivalent…
We continue developing the theory around the twin-width of totally ordered binary structures, initiated in the previous paper of the series. We first introduce the notion of parity and linear minors of a matrix, which consists of…
We construct weight-preserving bijections between column strict shifted plane partitions with one row and alternating sign trapezoids with exactly one column in the left half that sums to $1$. Amongst other things, they relate the number of…
It is known that, when $n$ is even, the number of permutations of $\{1,2,\dots,n\}$ all of whose cycles have odd length equals the number of those all of whose cycles have even length. Adin, Heged\H{u}s and Roichman recently found a…
We present an elegant bijection between standard Young tableaux with 2n cells and at most two rows, and pairs of standard Young tableaux of the same shape, with n+1 cells, where only the top row can have more than one cell.
We consider the semiconjugate factorization and reduction of order for non-autonomous, nonlinear, higher order difference equations containing linear arguments. These equations have appeared in several mathematical models in biology and…
In this paper semirings with an idempotent addition are considered. These algebraic structures are endowed with a partial order. This allows to consider residuated maps to solve systems of inequalities $A \otimes X \preceq B$. The purpose…
We construct a bijection between $321$- and $213$-avoiding permutations that preserves the property of $t$-stack-sortability. Our bijection transforms natural statistics between these two classes of permutations and proves a refinement of…
We present a bijection between permutation matrices and descending plane partitions without special parts, which respects the quadruple of statistics considered by Behrend, Di Francesco and Zinn--Justin. This bijection involves the…
We establish a list of characterizations of bounded twin-width for hereditary, totally ordered binary structures. This has several consequences. First, it allows us to show that a (hereditary) class of matrices over a finite alphabet either…
This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures" on triangulations of the 4-gon with no separating 3-cycle, which are…
Generalized Tamari intervals have been recently introduced by Pr\'eville-Ratelle and Viennot, and have been proved to be in bijection with (rooted planar) non-separable maps by Fang and Pr\'eville-Ratelle. We present two new bijections…
We establish two explicit bijections: from acyclic reorientations of an oriented matroid to no broken circuit (NBC) subsets of its underlying matroid, and from regions of a real hyperplane arrangement to its affine NBC subsets.
In the first three papers, we conducted a series of discussions on the statistics of strict partitions and Rogers-Ramanujan partitions, specifically the sequences of odd length (denoted as $\mathrm{sol}$) and its extensions. We established…
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…
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…
In a recent paper by Kitaev and Remmel, several formulas for the number of words of length n avoiding some generalized patterns were established. Each time the obtained function of n had been found in Sloane's Encyclopedia as the number of…
In 2017, Duchi, Guerrini, Rinaldi and Schaeffer proposed a new family of combinatorial objects called "fighting fish", which are counted by the same formula as more classical objects, such as two-stack sortable permutations and…