Avoiding Multiple Repetitions in Euclidean Spaces

DOI10.1137/18M1180347MaRDI QIDQ5208643zbMATH OpenWikidataFDO

Authors Michaĺ Deębski, Jarosław Grytczuk, Barbara Nayar, Urszula Pastwa, Joanna Sokół, Michał Tuczyński, Przemysław Wenus, Krzysztof Węsek

Publication date 9 January 2020

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

zbMATH Keywords

pattern avoidanceEuclidean Ramsey theorynonrepetitive sequenceLovász local lemma

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• scientific article; zbMATH DE number 1290179
• On avoding \(r\)-repetitions in \(\mathbb R^2\)
• Avoidable algebraic subsets of Euclidean space
• Optimal discovery of repetitions in 2D
• Repetition avoidance in circular factors
• Towards the parallel repetition conjecture
• The density of sets avoiding distance 1 in Euclidean space
• Two-dimensional maximal repetitions
• Two-dimensional maximal repetitions
• scientific article; zbMATH DE number 2188438

Cites work

• scientific article; zbMATH DE number 4089457 (Why is no real title available?)
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 3489127 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 2145230 (Why is no real title available?)
• scientific article; zbMATH DE number 863486 (Why is no real title available?)
• Automatic Sequences
• Avoidable patterns in strings of symbols
• Breaking the rhythm on graphs
• Computing small unit-distance graphs with chromatic number 5
• Euclidean Ramsey theorems. I
• Graph colouring and the probabilistic method
• Grasshopper avoidance of patterns
• Multidimensional unrepetitive configurations
• Non-repetitive colorings of infinite sets
• Non-repetitive tilings
• Nonrepetitive and pattern-free colorings of the plane
• Nonrepetitive colorings of graphs
• Nonrepetitive colorings of line arrangements
• Nonrepetitive sequences on arithmetic progressions
• On Sets of Distances of n Points
• Regularity and Positional Games
• Research Problems in Discrete Geometry
• THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE
• The chromatic number of the plane is at least 5
• The chromatic number of the plane is at least 5: a new proof
• The origins of combinatorics on words
• The probabilistic method
• Thue type problems for graphs, points, and numbers
• Words avoiding repetitions in arithmetic progressions

Cited in

(4)

• Fractional meanings of nonrepetitiveness
• scientific article; zbMATH DE number 2188438 (Why is no real title available?)
• On avoding \(r\)-repetitions in \(\mathbb R^2\)
• Non-repetitive colorings of infinite sets

This page was built for publication: Avoiding Multiple Repetitions in Euclidean Spaces

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