Related papers: A bijection for two sequences in OEIS
Alternative splicing creates complex bubbles in splicing graphs where more than two transcript paths compete, challenging methods designed for simple binary events. We present a unified framework that compares paths using distinct exonic…
The combined work of Bousquet-M\'elou, Claesson, Dukes, Jel\'inek, Kitaev, Kubitzke and Parviainen has resulted in non-trivial bijections among ascent sequences, (2+2)-free posets, upper-triangular integer matrices, and pattern-avoiding…
The scaling limit of large simple outerplanar maps was established by Caraceni using a bijection due to Bonichon, Gavoille and Hanusse. The present paper introduces a new bijection between outerplanar maps and trees decorated with ordered…
We give a very brief introduction to the machinery of spectral sequences, including the spectral sequence of a bicomplex. We then briefly introduce a generalisation of the spectral sequences of a bicomplex to the spectral sequences of…
$a_n=[x^n](1-x)^{-n}(1-x^2)^{-n}$ is the sequence A348410 in the Encyclopedia of Integer Sequences. Using a method from Hautus and Klarner from 1971 and the software \textsf{Gfun} we find an algebraic equation for the generating function…
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 examine clusters in the cluster tube of rank $n+1$ using exceptional sequences in the abelian tube of rank $n+1$. Although the abelian tube has more exceptional sequences than the module categories of type $B_{n}/C_{n}$, we obtain a…
We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…
Bonin, Shapiro and Simion (1993) gave two formulas on the distribution of major index for Schr\"oder paths, and proved their result for the case $E<D<N$. In this short note, we correct an error in their proof, and give a complete proof for…
Inspired by the definition of modified ascent sequences, we introduce a new class of integer sequences called revised ascent sequences. These sequences are defined as Cayley permutations where each entry is a leftmost occurrence if and only…
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.…
Two classifications of second order ODE's cubic with respect to the first order derivative are compared in the case of general position, which is common for both classifications. The correspondence of vectorial, pseudovectorial, scalar, and…
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian…
In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…
For a labeled tree on the vertex set $\set{1,2,\ldots,n}$, the local direction of each edge $(i\,j)$ is from $i$ to $j$ if $i<j$. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges…
We study $\nu$-Schr\"oder paths, which are Schr\"oder paths which stay weakly above a given lattice path $\nu$. Some classical bijective and enumerative results are extended to the $\nu$-setting, including the relationship between small and…
In this paper, we introduce a subcategory $\widetilde{Sh}_*$ of Sh$_*$ and obtain some results in this subcategory. First we show that there is a natural bijection $Sh (\Sigma (X, x), (Y,y))\cong Sh((X,x),Sh((I, \dot{I}),(Y,y)))$, for every…
In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…
We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.
We elucidate a bijection between ribbon graphs on the real projective plane and non-crossing annular pairings that relate to the $1/N$ correction term of the GOE and LOE spectral moments. We also derive analogous objects for the $1/N^2$…