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

DOI10.11575/CDM.V16I1.62653zbMATH Open1458.05024arXiv1606.06624OpenAlexW3160399941MaRDI QIDQ4986282FDOQ4986282

Authors:

Publication date: 27 April 2021

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.

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

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

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

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

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)