Statistics on bargraphs of inversion sequences of permutations

MaRDI QIDQ5121950zbMATH OpenFDO

Authors Toufik Mansour, Mark Shattuck

Publication date 22 September 2020

Full work available at URL https://arxiv.org/abs/2203.07532, https://www.dmlett.com/archive/v4/DML20_v4_p42_49.pdf

zbMATH Keywords

bargraphcombinatorial statisticinversion sequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Bernoulli and Euler numbers and polynomials (11B68) Bell and Stirling numbers (11B73)

Abstract: We consider the joint distribution of the area and perimeter statistics on the set I_n of inversion sequences of length n represented as bargraphs. Functional equations for both the ordinary and exponential generating functions are derived from recurrences satisfied by this distribution. Explicit formulas are found in some special cases as are expressions for the totals of the respective statistics on I_n. A similar treatment is provided for the joint distribution on I_n for the statistics recording the number of levels, descents and ascents. Some connections are made between specific cases of this latter distribution and the Stirling numbers of the first kind and Eulerian numbers.

Recommendations

• Parameters in inversion sequences
• Combinatorial parameters on bargraphs of permutations
• Counting permutations by the number of vertical edges in their bargraphs
• Counting inversion sequences by parity successions and runs
• Refined inversion statistics on permutations

Cites work

• Combinatorial parameters in bargraphs
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 1975686 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• Kernel method and linear recurrence system
• Levels in bargraphs
• Pattern avoidance in inversion sequences
• Patterns in inversion sequences. I.
• Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
• Restricted inversion sequences and enhanced 3-noncrossing partitions
• Vincular patterns in inversion sequences

Cited in

(9)

• The maximal-inversion statistic and pattern-avoiding permutations
• Counting inversion sequences by parity successions and runs
• Refined inversion statistics on permutations
• Counting permutations by the number of vertical edges in their bargraphs
• Combinatorial parameters on bargraphs of permutations
• Parameters in inversion sequences
• Inversion sequences avoiding a triple of patterns of 3 letters
• Lattice points on polyominoes of inversion sequences
• Counting rectangles of size r s in nondecreasing and Smirnov words

This page was built for publication: Statistics on bargraphs of inversion sequences of permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121950)