Meeting covered elements in -Tamari lattices

DOI10.1016/J.AAM.2021.102303OpenAlexW4200561158MaRDI QIDQ2070083FDOQ2070083

Colin Defant

Publication date: 21 January 2022

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattice ideals, congruence relations (06B10) Semilattices (06A12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorics of Coxeter Groups
• Shellable nonpure complexes and posets. II
• Cambrian lattices.
• Sortable elements and Cambrian lattices.
• Generating functions for generating trees
• The algebra of binary search trees
• Associahedra, Tamari lattices and related structures. Tamari memorial Festschrift
• Generating trees and the Catalan and Schröder numbers
• 2N noncollinear points determine at least 2N directions
• A survey of stack-sorting disciplines
• The Congruences of a Finite Lattice
• The number of Baxter permutations
• Generating trees and forbidden subsequences
• Higher trivariate diagonal harmonics via generalized Tamari posets
• The number of intervals in the \(m\)-Tamari lattices
• A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
• Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
• The On-Line Encyclopedia of Integer Sequences
• Counting smaller elements in the Tamari and \(m\)-Tamari lattices
• Lattice Theory of the Poset of Regions
• Noncrossing partitions and the shard intersection order
• Stack-sorting with consecutive-pattern-avoiding stacks
• The lattice structure of chip firing games and related models
• Two-stack-sorting with pop stacks
• Parallel chip firing games on graphs
• Two first-order logics of permutations
• Counting 3-stack-sortable permutations
• The \(\nu \)-Tamari lattice via \(\nu \)-trees, \( \nu \)-bracket vectors, and subword complexes
• The enumeration of generalized Tamari intervals
• Young tableaux and Solitaire bulgare
• The cycling of partitions and composition under repeated shifts
• Solution of the Bulgarian Solitaire Conjecture
• Hochschild lattices and shuffle lattices
• Geometry of $\nu $-Tamari lattices in types $A$ and $B$
• The representation of the symmetric group on \(m\)-Tamari intervals
• The enumeration of generalized Tamari intervals
• The core label order of a congruence-uniform lattice
• Schröder combinatorics and \(\nu\)-associahedra
• Asymptotics of 3-stack-sortable permutations
• Promotion sorting
• Counting Pop-Stacked Permutations in Polynomial Time
• \(k\)-pop stack sortable permutations and \(2\)-avoidance
• Pop-stack-sorting for Coxeter groups
• Stack-sorting for Coxeter groups
• Enumerating permutations sortable by \(k\) passes through a pop-stack

Cited In (13)

• The image of the pop operator on various lattices
• Meeting Covered Elements in $\nu$-Tamari Lattices
• Pop-stack-sorting for Coxeter groups
• Crystal pop-stack sorting and type \(A\) crystal lattices
• Rowmotion on \(m\)-Tamari and biCambrian lattices
• The pop-stack-sorting operator on Tamari lattices
• A description of the segment \([1,T]\), where \(T\) is the meeting number of a set-lattice
• Maximal degree subposets of \(\nu\)-Tamari lattices
• A new lower bound for deterministic pop-stack-sorting
• Semidistrim Lattices
• Semidistrim lattices
• Dynamics of pop-tsack torsing
• The Ungar games

Uses Software

• OEIS

This page was built for publication: Meeting covered elements in \(\nu\)-Tamari lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070083)