On the growth of the Möbius function of permutations
DOI10.1016/J.JCTA.2019.105121zbMATH Open1428.05010arXiv1809.05774OpenAlexW2891151120MaRDI QIDQ2010617FDOQ2010617
Authors: Vít Jelínek, Ida Kantor, Jan Kynčl, Martin Tancer
Publication date: 27 November 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.05774
Recommendations
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Poset topology: tools and applications
- Pattern matching for permutations
- The patterns of permutations
- The Möbius function of partitions with restricted block sizes
- On the poset of partitions of an integer
- Title not available (Why is that?)
- Posets with maximal Möbius function
- The Möbius function of a composition poset
- On the Möbius function of permutations with one descent
- The Möbius function of generalized subword order
- The Möbius function of separable and decomposable permutations
- The Möbius function of factor order
- The Möbius function of the permutation pattern poset
- On the topology of the permutation pattern poset
- Intervals of permutations with a fixed number of descents are shellable
- The Möbius function of a restricted composition poset.
- Chains in the lattice of noncrossing partitions
- A formula for the Möbius function of the permutation poset based on a topological decomposition
- The Möbius function of permutations with an indecomposable lower bound
- 2413-balloon permutations and the growth of the Möbius function
Cited In (4)
Uses Software
This page was built for publication: On the growth of the Möbius function of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010617)