A Formula for the Möbius Function of the Permutation Poset Based on a Topological Decomposition
The poset P of all permutations ordered by pattern containment is a fundamental object of study in the field of permutation patterns. This poset has a very rich and complex topology and an understanding of its Möbius function has proved particularly elusive, although results have been slowly emergin...
Main Author: | Jason P Smith |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2020-04-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/6376/pdf |
Similar Items
-
An equivalence of multistatistics on permutations
by: Arthur Nunge
Published: (2020-04-01) -
On intervals of the consecutive pattern poset
by: Sergi Elizalde, et al.
Published: (2020-04-01) -
Hook formulas for skew shapes
by: Alejandro H. Morales, et al.
Published: (2020-04-01) -
Symmetric Chain Decompositions and the Strong Sperner Property for Noncrossing Partition Lattices
by: Henri Mühle
Published: (2020-04-01) -
Rhombic alternative tableaux, assemblees of permutations, and the ASEP
by: Olya Mandelshtam, et al.
Published: (2020-04-01)