Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations

DOI10.1137/20M1338411zbMath1460.05005arXiv2003.10743OpenAlexW3137958754MaRDI QIDQ5857006

Matthew McDevitt, Nikola Ruškuc

Publication date: 30 March 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

digraphantichainpathjoint embedding property

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Deciding atomicity of subword-closed languages

Cites Work

• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Wilf equivalence relations for consecutive patterns
• Homogeneous 3-dimensional permutation structures
• Forbidden substructures and combinatorial dichotomies: WQO and universality
• WQO is decidable for factorial languages
• On uniquely \(k\)-determined permutations
• Permutation classes
• A survey of consecutive patterns in permutations
• Well quasi-order in combinatorics: embeddings and homomorphisms
• Ramsey-type and amalgamation-type properties of permutations
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations