English
Related papers

Related papers: Fighting fish and two-stack sortable permutations

200 papers

A bijection between $(31245,32145,31254,32154)$-avoiding permutations and $(31425,32415,31524,32514)$-avoiding permutations is constructed, which preserves five classical set-valued statistics. Combining with two codings of permutations due…

Combinatorics · Mathematics 2022-12-23 Joanna N. Chen , Zhicong Lin

What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…

Representation Theory · Mathematics 2025-07-21 Nate Harman , Alexander N. Wilson

We study combinatorial aspects of the Schubert calculus of the affine Grassmannian Gr associated with SL(n,C). Our main results are: 1) Pieri rules for the Schubert bases of H^*(Gr) and H_*(Gr), which expresses the product of a special…

Combinatorics · Mathematics 2008-11-23 Thomas Lam , Luc Lapointe , Jennifer Morse , Mark Shimozono

A new solvable many-body problem of goldfish type is identified and used to revisit the connection among two different approaches to solvable dynamical systems. An isochronous variant of this model is identified and investigated.…

Mathematical Physics · Physics 2011-03-17 F. Calogero , E. Langmann

We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…

Combinatorics · Mathematics 2007-05-23 Vladimir Ivanov , Sergei Kerov

We enumerate several classes of pattern-avoiding rectangulations. We establish new bijective links with pattern-avoiding permutations, prove that their generating functions are algebraic, and confirm several conjectures by Merino and…

Discrete Mathematics · Computer Science 2024-04-02 Andrei Asinowski , Cyril Banderier

We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of…

Combinatorics · Mathematics 2007-05-23 Christian Krattenthaler

In 1997, Schaeffer described a bijection between Eulerian planar maps and some trees. In this work we generalize his work to a bijection between bicolorable maps on a surface of any fixed genus and some unicellular maps with the same genus.…

Combinatorics · Mathematics 2018-06-08 Mathias Lepoutre

Recently Albert and Bousquet-M\'elou obtained the solution to the long-standing problem of the enumeration of permutations sortable by two stacks in parallel (2sip). Their solution was expressed in terms of functional equations. E.P. and…

Combinatorics · Mathematics 2019-12-03 Andrew Elvey Price

We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…

Combinatorics · Mathematics 2022-12-12 Agnieszka Czyżewska-Jankowska , Piotr Śniady

This paper deals with properties of filtrations on vector spaces indexed by partially ordered finitely generated abelian groups, which we call multifiltrations. We discuss the usual properties of filtrations, like exhaustivity and…

Algebraic Geometry · Mathematics 2018-08-31 José Ignacio Burgos Gil , Vivek Mohan Mallick

The class of ranked tree-child networks, tree-child networks arising from an evolution process with a fixed embedding into the plane, has recently been introduced by Bienvenu, Lambert, and Steel. These authors derived counting results for…

Combinatorics · Mathematics 2022-01-17 Alessandra Caraceni , Michael Fuchs , Guan-Ru Yu

We introduce a new sorting device for permutations which makes use of a pop stack augmented with a bypass operation. This results in a sorting machine, which is more powerful than the usual Popstacksort algorithm and seems to have never…

Discrete Mathematics · Computer Science 2025-03-12 Lapo Cioni , Luca Ferrari , Rebecca Smith

Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman established a link between Springer numbers,…

Combinatorics · Mathematics 2017-09-13 Matthieu Josuat-Vergès

We study permutations that are sorted by operators of the form $\mathbf{S} \circ \alpha \circ \mathbf{S}$, where $\mathbf{S}$ is the usual stack sorting operator introduced by D. Knuth and $\alpha$ is any $D_8$-symmetry obtained combining…

Combinatorics · Mathematics 2012-10-24 Mathilde Bouvel , Olivier Guibert

In recent work, Bacher and de la Harpe define and study conjugacy growth series for finitary permutation groups. In two subsequent papers, Cotron, Dicks, and Fleming study the congruence properties of some of these series. We define a new…

Number Theory · Mathematics 2016-12-13 Ian Wagner

This paper proposes bimorphic recursion, which is restricted polymorphic recursion such that every recursive call in the body of a function definition has the same type. Bimorphic recursion allows us to assign two different types to a…

Logic in Computer Science · Computer Science 2011-06-08 Makoto Tatsuta , Ferruccio Damiani

Known results on the moments of the distribution generated by the two-locus Wright-Fisher diffusion model and a duality between the diffusion process and the ancestral process with recombination are briefly summarized. A numerical methods…

Populations and Evolution · Quantitative Biology 2013-04-08 Shuhei Mano

We provide bijective proofs of two classic identities that are very simple to prove using generating functions, but surprisingly difficult to prove combinatorially. The problem of finding a bijective proof for the first identity was first…

Combinatorics · Mathematics 2015-09-10 Miklos Bona

We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. We find a connection between multidimensional permutations…

Combinatorics · Mathematics 2008-03-25 Andrei Asinowski , Toufik Mansour
‹ Prev 1 3 4 5 6 7 10 Next ›