Search arXivSearch

arXiv · 1507.08181

Schwartz-Zippel bounds for two-dimensional products

Abstract

We prove bounds on intersections of algebraic varieties in $\mathbb{C}^4$ with Cartesian products of finite sets from $\mathbb{C}^2$, and we point out connections with several classic theorems from combinatorial geometry. Consider an algebraic variety $X$ in $\mathbb{C}^4$ of degree $d$, such that the polynomials defining $X$ are not all of the form $F(x,y,s,t) = G(x,y)H(x,y,s,t) + K(s,t)L(x,y,s,t)$. Let $P$ and $Q$ be finite subsets of $\mathbb{C}^2$ of size $n$. If $X$ has dimension one or two, then we prove $|X\cap (P\times Q)| = O_d(n)$, while if $X$ has dimension three, then $|X\cap (P\times Q)| =O_{d,\varepsilon}(n^{4/3+\varepsilon})$ for any $\varepsilon>0$. Both bounds are best possible in this generality (except for the $\varepsilon$). These bounds can be viewed as different generalizations of the Schwartz-Zippel lemma, where we replace a product of "one-dimensional" finite subsets of $\mathbb{C}$ by a product of "two-dimensional" finite subsets of $\mathbb{C}^2$. The bound for three-dimensional varieties generalizes the Szemerédi-Trotter theorem. A key ingredient in our proofs is a two-dimensional version of a special case of Alon's combinatorial Nullstellensatz. As corollaries of our two bounds, we obtain bounds on the number of repeated and distinct values of polynomials and polynomial maps of pairs of points in $\mathbb{C}^2$, with a characterization of those maps for which no good bounds hold. These results generalize known bounds on repeated and distinct Euclidean distances.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hossein Nassajian Mojarrad, Thang Pham, Claudiu Valculescu, Frank de Zeeuw. 2017-12-20. Schwartz-Zippel bounds for two-dimensional products. https://doi.org/10.19086/da.2750

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO