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

DOI10.11575/CDM.V16I1.62653MaRDI QIDQ4986282zbMATH OpenOpenAlexFDO

Authors

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)

Abstract: We introduce the notions of Schr"oder shape and of Schr"oder tableau, which provide some kind of analogs of the classical notions of Young shape and Young tableau. We investigate some properties of the partial order given by containment of Schr"oder shapes. Then we propose an algorithm which is the natural analog of the well known RS correspondence for Young tableaux, and we characterize those permutations whose insertion tableaux have some special shapes. The last part of the article relates the notion of Schr"oder tableau with those of interval order and of weak containment (and strong avoidance) of posets. We end our paper with several suggestions for possible further work.

Recommendations

• Schröder partitions and Schröder tableaux
• Planarity properties of the Schensted correspondence
• Enumerative results on the Schröder pattern poset
• scientific article; zbMATH DE number 3559589
• Patterns in Shi tableaux and Dyck paths

Cites work

• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 3845613 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Algebraic combinatorics and coinvariant spaces
• Combinatorics of Compositions and Words
• Combinatorics of permutations
• Combinatorics of set partitions
• Differential Posets
• Enumeration of chains and saturated chains in Dyck lattices.
• Enumeration of edges in some lattices of paths
• Intransitive indifference with unequal indifference intervals
• Lattices of lattice paths
• Lattices of paths: representation theory and valutions
• Limits of areas under lattice paths
• Longest Increasing and Decreasing Subsequences
• On families of subsets with a forbidden subposet
• On the Representations of the Symmetric Group
• Overpartitions
• Partition identities
• Pattern classes and priority queues
• Patterns in permutations and words.
• Permutations, matrices, and generalized Young tableaux
• Restricted permutations
• Schröder partitions and Schröder tableaux
• The Hook Graphs of the Symmetric Group

Cited in

(4)

• Schröder partitions and Schröder tableaux
• \(s\)-modular, \(s\)-congruent and \(s\)-duplicate partitions
• RSK tableaux and the weak order on fully commutative permutations
• Enumerative results on the Schröder pattern poset

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

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