Polynomial partitioning for several sets of varieties

DOI10.1007/S11784-016-0322-ZMaRDI QIDQ1687152zbMATH OpenOpenAlexFDO

Authors Pavle V. M. Blagojević, Aleksandra S. Dimitrijević Blagojević, Günter M. Ziegler

Publication date 22 December 2017

Published in Journal of Fixed Point Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

equivariant cohomologyFadell-Husseini index theorypolynomial method

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Combinatorial complexity of geometric structures (52C45) Homology with local coefficients, equivariant cohomology (55N25)

Abstract: We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $Dgeq1$ and any collection of sets $Gamm{a}_1,ldots,Gamm{a}_j$ of low-degree $k$-dimensional varieties in $mathbb{R}^n$ there exists a non-zero polynomial $pinmathbbR[X_1,ldots,X_n]$ of degree at most $D$ so that each connected component of $mathbb{R}^{n}setminusZ(p)$ intersects $O(j{D}^{k-n}|Gamm{a}_i|)$ varieties of $Gamm{a}_i$, simultaneously for every $1leqileqj$. For $j=1$ we recover the original result by Guth. Our proof, via an index calculation in equivariant cohomology, shows how the degrees of the polynomials used for partitioning are dictated by the topology, namely by the Euler class being given in terms of a top Dickson polynomial.

Review text

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\).

Recommendations

• Polynomial partitioning for a set of varieties
• Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions
• Multilevel polynomial partitions and simplified range searching
• The polynomial method over varieties
• A Partition Result for Algebraic Varieties

Cites work

• An ideal-valued cohomological index theory with applications to Borsuk—Ulam and Bourgin—Yang theorems
• An incidence theorem in higher dimensions
• scientific article; zbMATH DE number 2016544 (Why is no real title available?)
• On the Erdős distinct distances problem in the plane
• Polynomial partitioning for a set of varieties
• The ideal-valued index for a dihedral group action, and mass partition by two hyperplanes
• 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

(14)

• Binary segmentation for multivariate polynomials
• Joints of varieties
• The polynomial method over varieties
• Multilevel polynomial partitions and simplified range searching
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• A Partition Result for Algebraic Varieties
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Polynomial partitioning for a set of varieties
• Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions
• Borsuk-Ulam theorems for elementary abelian 2-groups
• Partitioning procedure for polynomial optimization
• Partitioning theorems for sets of semi-Pfaffian sets, with applications
• Many partitions of mass assignments
• On splitting sets in block designs and finding roots of polynomials

This page was built for publication: Polynomial partitioning for several sets of varieties

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