Polynomial partitioning for several sets of varieties (Q1687152)

The celebrated work of \textit{L. Guth} and \textit{N. H. Katz} [Ann. Math. (2) 181, No. 1, 155--190 (2015; Zbl 1310.52019)] on the Erdős distance problem uses the following Theorem 4.1: Let \(X\) be finite set of points in \(\mathbb R^n\), and let \(D\geq 1\) be an integer. Then, there exists a non-zero polynomial \(p\in \mathbb R [X_1,\dots ,X_n]\) of degree at most \(D\), such that each connected component of the complement \(\mathbb R^n\setminus Z(p)\) contains at most \(C_nD^{-n}| X|\) points of \(X\), where the constant \(C_n\) may depend on \(n\). \textit{L. Guth} [Math. Proc. Camb. Philos. Soc. 159, No. 3, 459--469 (2015; Zbl 1371.14065)] in Theorem 0.3 extended the previous result using equivariant topolgy: Let \(\Gamma\) be a finite set of \(k\)-dimensional varieties in \(\mathbb R^n\), each of them defined by at most \(m\) polynomial equations of degree at most \(d\). Then, for every \(D\geq 1\), there exists a non-zero polynomial \(p\in \mathbb R[X_1,\dots ,X_n]\) of degree at most \(D\), such that each connected component of the complement \(\mathbb R^n\setminus Z(p)\) intersects at most \(C(d,m,n)D^{k-n} | \Gamma|\) varieties in \(\Gamma\), where \(C(d,m,n)\) is a constant that may depend on \(d,m\) and \(n\). The paper under review uses the set-up of the previous theorem, and the Fadell-Husseini index theory for the proof of a necessary Borsuk-Ulam type theorem to obtain a ``colored'' generalization: Let \(j\geq 1\) be an integer. For \(1\leq i\leq j\), let \(\Gamma_i\) be a finite set of \(k_i\)-dimensional varieties in \(\mathbb R^n\), each of them defined by at most \(m_i\) polynomial equations of degree at most \(d_i\). Then, for every \(D\geq 1\), there exists a non-zero polynomial \(p\in \mathbb R [X_1,\dots,X_n]\) of degree at most \(D\), such that each connected component of the complement \(\mathbb R^n\setminus Z(p)\) for every \(1\leq i\leq j\) intersects at most \(C(d_i,m_i,n)jD^{k_i-n} |\Gamma_i|\) varieties in \(\Gamma_i\), where \(C(d_i,m_,n)\) is a constant that may depend on \(d_i\), \(m_i\) and \(n\).