On uniquely \(k\)-determined permutations

DOI10.1016/j.disc.2007.03.079zbMath1134.05002arXivmath/0610333OpenAlexW2092545680MaRDI QIDQ2477375

Sergey Kitaev, Sergei V. Avgustinovich

Publication date: 13 March 2008

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

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

zbMATH Keywords

permutationreconstructionde Bruijn graphconsecutive patternset of prohibitions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Enumerating cycles in the graph of overlapping permutations ⋮ Counting crucial permutations with respect to monotone patterns ⋮ Number of cycles in the graph of 312-avoiding permutations ⋮ The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2 ⋮ Cycles in the graph of overlapping permutations avoiding barred patterns ⋮ The solution to the partition reconstruction problem ⋮ Enumerating anchored permutations with bounded gaps ⋮ Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A spectral approach to consecutive pattern-avoiding permutations
• Crucial words and the complexity of some extremal problems for sets of prohibited words
• Colouring prime distance graphs
• Universal cycles for combinatorial structures
• Consecutive patterns in permutations
• Multi-avoidance of generalised patterns
• Partially ordered generalized patterns
• On Unavoidable Sets of Word Patterns
• Systematic generation of ordered sequences using recurrence relations

This page was built for publication: On uniquely \(k\)-determined permutations