Weak ascent sequences and related combinatorial structures

DOI10.1016/J.EJC.2022.103633MaRDI QIDQ2107499zbMATH OpenOpenAlexFDO

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)

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

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)

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.

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

Cites work

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

Cited in

(4)

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

Describes a project that uses

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)