Counting inversion sequences by parity successions and runs

DOI10.1016/j.dam.2022.12.026OpenAlexW4313577488WikidataQ130258094 ScholiaQ130258094MaRDI QIDQ2689642

Mark Shattuck, Toufik Mansour

Publication date: 13 March 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.12.026

zbMATH Keywords

generating functioncombinatorial statisticinversion sequenceparity succession

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (1)

Enumeration of r-smooth words over a finite alphabet

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parity alternating permutations and signed Eulerian numbers
• Alternating subsets modulo \(m\)
• Generating functions and generalized alternating subsets
• Enumeration of inversion sequences avoiding triples of relations
• Successions in words and compositions
• Parity considerations for drops in cycles on \(\{1,2,\dots,n\}\)
• A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples
• Parity-alternating permutations and successions
• Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
• Patterns of relation triples in inversion and ascent sequences
• Vincular patterns in inversion sequences
• Parity successions in set partitions
• Cycles on a multiset with only even-odd drops
• Patterns in Inversion Sequences I
• Pattern avoidance in inversion sequences
• Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
• Set partitions and parity successions
• Generalizations of Terquem's problem
• Refined restricted inversion sequences

This page was built for publication: Counting inversion sequences by parity successions and runs