REVIEW 1 cited by
The interval posets of permutations seen from the decomposition tree perspective
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the decomposition trees of permutations, describing a procedure to obtain the former from the latter. We then give alternative proofs of some of the results in [B. Tenner, arXiv:2007.06142], and we solve the open problems that it posed (and some other enumerative problems) using techniques from symbolic and analytic combinatorics. Finally, we compute the M\"obius function on such posets.
Forward citations
Cited by 1 Pith paper
-
Sperner's colorings of hypergraphs arising from edgewise triangulations
For most permutation types of simplex-lattice hypergraphs, a new distance coloring produces more monochromatic cells than the greedy coloring, and it is optimal for a specific family.
Discussion (0). Continue with ORCID to comment.