Words avoiding tangrams

DOI10.1007/S00026-024-00736-9MaRDI QIDQ6872902zbMATH OpenFDO

Authors Michał Dębski, Jarosław Grytczuk, Bartłomiej Pawlik, Jakub Przybyło, Małgorzata Śleszyńska-Nowak

Publication date 19 January 2026

Published in Annals of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00026-024-00736-9

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics on words (68R15)

Cites work

• A proof of Dejean’s conjecture
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Abelian combinatorics on words: a survey
• Abelian squares are avoidable on 4 letters
• Another approach to non-repetitive colorings of graphs of bounded degree
• Avoidable patterns in strings of symbols
• Avoiding squares over words with lists of size three amongst four symbols
• Bisection of Circle Colorings
• Dejean's conjecture and Sturmian words
• scientific article; zbMATH DE number 3162927 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3815593 (Why is no real title available?)
• scientific article; zbMATH DE number 3536116 (Why is no real title available?)
• scientific article; zbMATH DE number 3537726 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• Last cases of Dejean's conjecture
• Measurable patterns, necklaces and sets indiscernible by measure
• New approach to nonrepetitive sequences
• Nonrepetitive list colorings of the integers
• Obstacles for splitting multidimensional necklaces
• On a characterization of Gauss codes
• On Dejean's conjecture over large alphabets
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Splitting multidimensional necklaces
• Splitting multidimensional necklaces and measurable colorings of Euclidean spaces
• Splitting necklaces
• Splitting necklaces and measurable colorings of the real line
• Splitting necklaces, with constraints
• Sur un théorème de Thue
• The Borsuk-Ulam Theorem and Bisection of Necklaces
• The origins of combinatorics on words
• The probabilistic method
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• Über unendliche Zeichenreihen.

This page was built for publication: Words avoiding tangrams

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