Avoidable algebraic subsets of Euclidean space

DOI10.1090/S0002-9947-99-02331-4zbMath0948.03045OpenAlexW1587175384MaRDI QIDQ4955693

James H. Schmerl

Publication date: 22 May 2000

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

Full work available at URL: https://doi.org/10.1090/s0002-9947-99-02331-4

zbMATH Keywords

infinite combinatoricsalgebraic setsavoidable polynomialsmaster partitionpartition of Euclidean \(n\)-space

Mathematics Subject Classification ID

Partitions of sets (05A18) Polyhedra and polytopes; regular figures, division of spaces (51M20) Other combinatorial set theory (03E05) Euclidean geometries (general) and generalizations (51M05)

Related Items (9)

Krull dimension in set theory ⋮ Coloring the distance graphs ⋮ Coloring triangles and rectangles ⋮ An infinite color analogue of Rado's theorem ⋮ A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids ⋮ DECIDING THE CHROMATIC NUMBERS OF ALGEBRAIC HYPERGRAPHS ⋮ Chromatic numbers of algebraic hypergraphs ⋮ The first omega alephs: from simplices to trees of trees to higher walks ⋮ Some algebraic equivalent forms of $\mathbb {R}\subseteq L$

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)
• Combinatorial set theory: Partition relations for cardinals
• Partitions of vector spaces
• Alfred Tarski's elimination theory for real closed fields
• Tetrahedron Free Decomposition of R³
• A Decomposition Theorem for R n
• Triangle-Free Partitions of Euclidean Space
• Countable partitions of Euclidean space
• On non-denumerable graphs
• Partitioning Euclidean space
• Partitioning Euclidean space

This page was built for publication: Avoidable algebraic subsets of Euclidean space