Catalan intervals and uniquely sorted permutations

DOI10.1016/j.jcta.2020.105250zbMath1439.05006arXiv1904.02627OpenAlexW3011106694MaRDI QIDQ2174949

Colin Defant

Publication date: 27 April 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.02627

zbMATH Keywords

Dyck pathTamari latticestack-sortinguniquely sorted permutationStanley latticenoncrossing partition latticePallo comb posetposet interval

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (18)

Stack-sorting for Coxeter groups ⋮ 312-Avoiding reduced valid hook configurations and duck words ⋮ Highly sorted permutations and Bell numbers ⋮ Unimodality of a refinement of Lassalle's sequence ⋮ Fertilitopes ⋮ Polyurethane toggles ⋮ Dynamical aspects of \(\sigma\)-machines ⋮ Uniquely sorted permutations ⋮ Fertility monotonicity and average complexity of the stack-sorting map ⋮ Enumeration of Stack-Sorting Preimages via a Decomposition Lemma ⋮ Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ Further bijections to pattern-avoiding valid hook configurations ⋮ Stack-sorting with consecutive-pattern-avoiding stacks ⋮ Counting 3-stack-sortable permutations ⋮ Stack-sorting, set partitions, and Lassalle's sequence ⋮ Stack-sorting for Words ⋮ Troupes, cumulants, and stack-sorting

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattices of paths: representation theory and valutions
• On a subposet of the Tamari lattice
• Enumeration of chains and saturated chains in Dyck lattices.
• Poset structures on \((m+2)\)-angulations and polynomial bases of the quotient by \(G^{m}\)-quasisymmetric functions
• The number of intervals in the \(m\)-Tamari lattices
• Two integer sequences related to Catalan numbers
• Stack-sorting, set partitions, and Lassalle's sequence
• Intervals in Catalan lattices and realizers of triangulations
• Right-arm rotation distance between binary trees
• The number of Baxter permutations
• On Tamari lattices
• Generating functions for generating trees
• Free probability theory and non-crossing partitions
• A survey of stack-sorting disciplines
• Sorted and/or sortable permutations
• Realization of the Stasheff polytope
• Chain lengths in the Tamari lattice
• Generating trees and the Catalan and Schröder numbers
• Generating trees and forbidden subsequences
• Noncrossing partitions
• Polyurethane toggles
• Counting 3-stack-sortable permutations
• Preimages under the stack-sorting algorithm
• On maximal chains in the non-crossing partition lattice
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
• A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
• On the number of intervals in Tamari lattices
• Combinatorics of Permutations
• Postorder Preimages
• Noncrossing Partitions in Surprising Locations
• Enumerating, Ranking and Unranking Binary Trees
• Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
• Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
• Fertility, Strong Fertility, and Postorder Wilf Equivalence
• Enumeration of edges in some lattices of paths

This page was built for publication: Catalan intervals and uniquely sorted permutations