Generalized ballot sequences are ascent sequences

zbMATH Open1333.05011MaRDI QIDQ2800765FDOQ2800765

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

Recommendations

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

zbMATH Keywords

encodeinvolutionchord diagrampattern avoiding permutation

Mathematics Subject Classification ID

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

Cited In (3)

• Difference ascent sequences
• Title not available (Why is that?)
• Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations

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)