String rearrangement inequalities and a total order between primitive words

DOI10.1007/978-3-031-20796-9_15zbMath1528.68428arXiv2204.11213OpenAlexW4313349468MaRDI QIDQ6111479

Ruixi Luo, Kai Jin, Taikun Zhu

Publication date: 3 August 2023

Published in: Frontiers of Algorithmic Wisdom (Search for Journal in Brave)

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

zbMATH Keywords

greedy algorithmcombinatorics on wordsprimitive wordsstring orderingstring rearrangement inequalities

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• On the language of primitive words
• Computing regularities in strings: a survey
• Cartesian and Lyndon trees
• On generalized Lyndon words
• Generalized de Bruijn words for primitive words and powers
• String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time
• Factorizing words over an ordered alphabet
• Fast Pattern Matching in Strings
• Context-Free Languages and Primitive Words
• The “Runs” Theorem
• Simple Linear Comparison of Strings in V-Order
• Free differential calculus. IV: The quotient groups of the lower central series