Schröder partitions, Schröder tableaux and weak poset patterns

DOI10.11575/cdm.v16i1.62653zbMath1458.05024arXiv1606.06624OpenAlexW3160399941MaRDI QIDQ4986282

No author found.

Publication date: 27 April 2021

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

zbMATH Keywords

latticeenumerationinterval orderinteger partitionRobinson-Schensted correspondencestandard tableauweak poset pattern

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattices of paths: representation theory and valutions
• Enumeration of chains and saturated chains in Dyck lattices.
• Patterns in permutations and words.
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Limits of areas under lattice paths
• Intransitive indifference with unequal indifference intervals
• Permutations, matrices, and generalized Young tableaux
• Partition identities
• Lattices of lattice paths
• Schröder Partitions and Schröder Tableaux
• Combinatorics of Permutations
• Longest Increasing and Decreasing Subsequences
• On Families of Subsets With a Forbidden Subposet
• Differential Posets
• Overpartitions
• Combinatorics of Set Partitions
• Pattern classes and priority queues
• Combinatorics of Compositions and Words
• Enumeration of edges in some lattices of paths
• On the Representations of the Symmetric Group
• The Hook Graphs of the Symmetric Group
• Restricted permutations

This page was built for publication: Schröder partitions, Schröder tableaux and weak poset patterns