Weak ascent sequences and related combinatorial structures

DOI10.1016/J.EJC.2022.103633zbMATH Open1504.05003arXiv2111.03159OpenAlexW3213013446MaRDI QIDQ2107499FDOQ2107499

Authors: Beáta Bényi, Anders Claesson, Mark Dukes 

Publication date: 1 December 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: In this paper we introduce {em weak ascent sequences}, a class of number sequences that properly contains ascent sequences. We show how these sequences uniquely encode each of the following objects: permutations avoiding a particular length-4 bivincular pattern; upper-triangular binary matrices that satisfy a column-adjacency rule; factorial posets that are weakly (3+1)-free. We also show how weak ascent sequences are related to a class of pattern avoiding inversion sequences that has been a topic of recent research by Auli and Elizalde. Finally, we consider the problem of enumerating these new sequences and give a closed form expression for the number of weak ascent sequences having a prescribed length and number of weak ascents.

Full work available at URL: https://arxiv.org/abs/2111.03159

Recommendations

• Pattern avoidance in ascent sequences
• Vincular patterns in inversion sequences
• Some enumerative results related to ascent sequences
• Ascent sequences avoiding pairs of patterns
• (2+2)-free posets, ascent sequences and pattern avoiding permutations

zbMATH Keywords

pattern avoidanceWilf equivalenceconsecutive patterninversion sequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Special sequences and polynomials (11B83)

Cites Work

• Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
• Patterns in inversion sequences. I.
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Partition and composition matrices
• Composition matrices, \((2+2)\)-free posets and their specializations
• Ascent sequences and upper triangular matrices containing non-negative integers
• Pattern avoidance in ascent sequences
• The On-Line Encyclopedia of Integer Sequences
• $n!$ matchings, $n!$ posets
• Wilf equivalences between vincular patterns in inversion sequences
• Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
• On pattern-avoiding Fishburn permutations
• Pattern avoidance in inversion sequences
• Consecutive Patterns in Inversion Sequences
• Pattern-avoiding ascent sequences of length 3
• Vincular patterns in inversion sequences
• Consecutive patterns in inversion sequences II: avoiding patterns of relations

Cited In (3)

• Some sequences associated with combinatorial structures
• Difference ascent sequences
• Pattern avoidance in weak ascent sequences

Uses Software

• OEIS

This page was built for publication: Weak ascent sequences and related combinatorial structures

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