Generalized ballot sequences are ascent sequences

MaRDI QIDQ2800765zbMATH OpenFDO

Authors Mark Dukes

Publication date 18 April 2016

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://ajc.maths.uq.edu.au//pdf/64/ajc_v64_p061.pdf

zbMATH Keywords

encodeinvolutionchord diagrampattern avoiding permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial number theory (11B75)

Recommendations

• Pattern avoidance in ascent sequences
• scientific article; zbMATH DE number 4168687
• Weak ascent sequences and related combinatorial structures
• Ascent sequences avoiding pairs of patterns
• Some enumerative results related to ascent sequences

Cited in

(3)

• Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
• scientific article; zbMATH DE number 4168687 (Why is no real title available?)
• Difference ascent sequences

This page was built for publication: Generalized ballot sequences are ascent sequences

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