Splitting necklaces and measurable colorings of the real line

DOI10.1090/S0002-9939-08-09699-8MaRDI QIDQ3625532zbMATH OpenFDO

Authors Noga Alon, Jarosław Grytczuk, Michał Lasoń, Mateusz Michalek

Publication date 5 May 2009

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

measurable coloringsplitting necklaces

Mathematics Subject Classification ID

Extremal set theory (05D05) Erd?s problems and related topics of discrete geometry (52C10)

Abstract: A (continuous) necklace is simply an interval of the real line colored measurably with some number of colors. A well-known application of the Borsuk-Ulam theorem asserts that every $k$-colored necklace can be fairly split by at most $k$ cuts (from the resulting pieces one can form two collections, each capturing the same measure of every color). Here we prove that for every $kgeq1$ there is a measurable $(k+3)$-coloring of the real line such that no interval can be fairly split using at most $k$ cuts. In particular, there is a measurable $4$-coloring of the real line in which no two adjacent intervals have the same measure of every color. An analogous problem for the integers was posed by ErdH{o}s in 1961 and solved in the affirmative in 1991 by Ker"anen. Curiously, in the discrete case the desired coloring also uses four colors.

Recommendations

• Obstacles for splitting multidimensional necklaces
• Splitting necklaces
• Splitting multidimensional necklaces and measurable colorings of Euclidean spaces
• scientific article; zbMATH DE number 496046
• Splitting multidimensional necklaces

Cites work

• Automatic Sequences
• Avoidable patterns in strings of symbols
• Bisection of Circle Colorings
• Breaking the rhythm on graphs
• 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 3678157 (Why is no real title available?)
• scientific article; zbMATH DE number 1522559 (Why is no real title available?)
• scientific article; zbMATH DE number 2188438 (Why is no real title available?)
• scientific article; zbMATH DE number 3296252 (Why is no real title available?)
• scientific article; zbMATH DE number 3375509 (Why is no real title available?)
• Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
• Non-repetitive colorings of infinite sets
• Nonrepetitive colorings of graphs
• Nonrepetitive colorings of graphs -- a survey
• Open Problems in Pattern Avoidance
• Splitting necklaces
• Strongly non-repetitive sequences and progression-free sets
• The Borsuk-Ulam Theorem and Bisection of Necklaces
• Thue type problems for graphs, points, and numbers
• 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

Cited in

(12)

• Splitting necklaces
• Obstacles for splitting multidimensional necklaces
• Anagram-free colourings of graphs
• Bisection of Circle Colorings
• Splitting multidimensional necklaces and measurable colorings of Euclidean spaces
• scientific article; zbMATH DE number 4112642 (Why is no real title available?)
• scientific article; zbMATH DE number 496046 (Why is no real title available?)
• The Borsuk-Ulam Theorem and Bisection of Necklaces
• A survey of mass partitions
• Measurable patterns, necklaces and sets indiscernible by measure
• Random necklaces require fewer cuts
• Words avoiding tangrams

This page was built for publication: Splitting necklaces and measurable colorings of the real line

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