Avoidable algebraic subsets of Euclidean space

DOI10.1090/S0002-9947-99-02331-4MaRDI QIDQ4955693zbMATH OpenOpenAlexFDO

Authors 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) Other combinatorial set theory (03E05) Euclidean geometries (general) and generalizations (51M05) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Recommendations

• Classifying unavoidable Tverberg partitions
• Counting the number of unavoidable sets of a given size in a finite set of integers
• Asymptotic results on Klazar set partition avoidance
• Publication:5753200
• Set partition patterns and the dimension index
• scientific article; zbMATH DE number 3951186
• Set partition patterns and statistics
• scientific article; zbMATH DE number 1790528
• Chromatic polynomials and \(k\)-trees
• Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory

Cites work

• scientific article; zbMATH DE number 45943 (Why is no real title available?)
• scientific article; zbMATH DE number 3501471 (Why is no real title available?)
• scientific article; zbMATH DE number 496012 (Why is no real title available?)
• scientific article; zbMATH DE number 3300442 (Why is no real title available?)
• A Decomposition Theorem for R n
• Alfred Tarski's elimination theory for real closed fields
• Combinatorial set theory: Partition relations for cardinals
• Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)
• Countable partitions of Euclidean space
• On non-denumerable graphs
• Partitioning Euclidean space
• Partitioning Euclidean space
• Partitions of vector spaces
• Tetrahedron Free Decomposition of R³
• Triangle-Free Partitions of Euclidean Space

Cited in

(11)

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

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

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