Abstract

Given a sequence s=(s1,s2,…)s=(s_1,s_2,\ldots) of positive integers, the inversion sequences with respect to ss, or ss-inversion sequences, were introduced by Savage and Schuster in their study of lecture hall polytopes. A sequence (e1,e2,…,en)(e_1,e_2,\ldots,e_n) of nonnegative integers is called an ss-inversion sequence of length nn if 0≤ei<si0\leq e_i < s_i for 1≤i≤n1\leq i\leq n. Let I(n) be the set of ss-inversion sequences of length nn for s=(1,4,3,8,5,12,…)s=(1,4,3,8,5,12,\ldots), that is, s2i=4is_{2i}=4i and s2i−1=2i−1s_{2i-1}=2i-1 for i≥1i\geq1, and let PnP_n be the set of signed permutations on {12,22,…,n2}\{1^2,2^2,\ldots,n^2\}. Savage and Visontai conjectured that when n=2kn=2k, the ascent number over InI_n is equidistributed with the descent number over PkP_k. For a positive integer nn, we use type BB PP-partitions to give a characterization of signed permutations over which the descent number is equidistributed with the ascent number over InI_n. When nn is even, this confirms the conjecture of Savage and Visontai. Moreover, let In′I'_n be the set of ss-inversion sequences of length nn for s=(2,2,6,4,10,6,…)s=(2,2,6,4,10,6,\ldots), that is, s2i=2is_{2i}=2i and s2i−1=4i−2s_{2i-1}=4i-2 for i≥1i\geq1. We find a set of signed permutations over which the descent number is equidistributed with the ascent number over In′I'_n.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.