Transport of patterns by Burge transpose

DOI10.1016/J.EJC.2022.103630MaRDI QIDQ2107496zbMATH OpenOpenAlexFDO

Authors Giulio Cerbai, Anders Claesson

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/2005.07950

zbMATH Keywords

ascent sequencesCayley permutationsFishburn permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Abstract: We take the first steps in developing a theory of transport of patterns from Fishburn permutations to (modified) ascent sequences. Given a set of pattern avoiding Fishburn permutations, we provide an explicit construction for the basis of the corresponding set of modified ascent sequences. Our approach is in fact more general and can transport patterns between permutations and equivalence classes of so called Cayley permutations. This transport of patterns relies on a simple operation we call the Burge transpose. It operates on certain biwords called Burge words. Moreover, using mesh patterns on Cayley permutations, we present an alternative view of the transport of patterns as a Wilf-equivalence between subsets of Cayley permutations. We also highlight a connection with primitive ascent sequences.

Recommendations

• Pattern avoidance in ascent sequences
• On pattern-avoiding Fishburn permutations
• Ascent-descent Young diagrams and pattern avoidance in alternating permutations
• Patterns in permutations and words.
• (2+2)-free posets, ascent sequences and pattern avoiding permutations

Cites work

• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Ascent sequences and Fibonacci numbers
• Ascent sequences and upper triangular matrices containing non-negative integers
• Ascent sequences avoiding pairs of patterns
• Cayley permutations
• Cyclic sieving, skew Macdonald polynomials and Schur positivity
• Enumerating \((2 + 2)\)-free posets by indistinguishable elements
• Four correspondences between graphs and generalized Young tableaux
• Generalized pattern avoidance
• Generalized permutation patterns and a classification of the Mahonian statistics
• Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
• On pattern-avoiding Fishburn permutations
• On pattern-avoiding partitions
• Pattern avoidance in ``flattened partitions
• Pattern avoidance in ascent sequences
• Pattern avoidance in set partitions.
• Restricted ascent sequences and Catalan numbers
• Restricted growth function patterns and statistics
• Some enumerative results related to ascent sequences
• Sorting Cayley permutations with pattern-avoiding machines
• Stack sorting with restricted stacks
• Vassiliev invariants and a strange identity related to the Dedekind eta-function

Cited in

(7)

• Fishburn trees
• Modified ascent sequences and Bell numbers
• Difference ascent sequences
• Caylerian polynomials
• Dynamical aspects of \(\sigma\)-machines
• On enumeration of pattern-avoiding Fishburn permutations
• Pattern-avoiding ascent sequences of length 3

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Transport of patterns by Burge transpose

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