s-Inversion Sequences and P-Partitions of Type B
William Y.C. Chen, Alan J.X. Guo, Peter L. Guo, Harry H.Y. Huang, and, Thomas Y.H. Liu

TL;DR
This paper characterizes s-inversion sequences and their relation to type B P-partitions, confirming a conjecture about the equidistribution of ascent and descent numbers for certain signed permutations when n is even.
Contribution
It provides a characterization of signed permutations related to s-inversion sequences using type B P-partitions, confirming a conjecture for even n and extending the understanding of ascent-descent equidistribution.
Findings
Confirmed Savage and Visontai's conjecture for even n.
Established a set of signed permutations with equidistributed ascent and descent numbers.
Extended the analysis to a new class of s-inversion sequences.
Abstract
Given a sequence of positive integers, the inversion sequences with respect to , or -inversion sequences, were introduced by Savage and Schuster in their study of lecture hall polytopes. A sequence of nonnegative integers is called an -inversion sequence of length if for . Let I(n) be the set of -inversion sequences of length for , that is, and for , and let be the set of signed permutations on . Savage and Visontai conjectured that when , the ascent number over is equidistributed with the descent number over . For a positive integer , we use type -partitions to give a characterization of signed permutations over which the descent number is equidistributed with the ascent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Bayesian Methods and Mixture Models · graph theory and CDMA systems
