Pattern avoidance in k-ary heaps

MaRDI QIDQ2800771zbMATH OpenFDO

Authors Derek Levin, Manda Riehl, Andrew Sandberg, Lara Pudwell

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_p120.pdf

zbMATH Keywords

breadth-first search

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Recommendations

• Proofs of conjectures about pattern-avoiding linear extensions
• Pattern avoidance in ternary trees
• Pattern avoidance in binary trees
• Pattern avoidance in forests of binary shrubs
• Non-contiguous pattern avoidance in binary trees

Cited in

(6)

• Rooted forests that avoid sets of permutations
• Stack-sorting preimages of permutation classes
• Proofs of conjectures about pattern-avoiding linear extensions
• Wilf equivalences for patterns in rooted labeled forests
• Combinatorial generation via permutation languages. VI: Binary trees
• Pattern-avoiding binary trees -- generation, counting, and bijections

Describes a project that uses

Uses Software

• BinaryTrees

This page was built for publication: Pattern avoidance in \(k\)-ary heaps

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