Variety Evasive Subspace Families

05/06/2021
by   Zeyu Guo, et al.
0

We introduce the problem of constructing explicit variety evasive subspace families. Given a family ℱ of subvarieties of a projective or affine space, a collection ℋ of projective or affine k-subspaces is (ℱ,ϵ)-evasive if for every 𝒱∈ℱ, all but at most ϵ-fraction of W∈ℋ intersect every irreducible component of 𝒱 with (at most) the expected dimension. The problem of constructing such an explicit subspace family generalizes both deterministic black-box polynomial identity testing (PIT) and the problem of constructing explicit (weak) lossless rank condensers. Using Chow forms, we construct explicit k-subspace families of polynomial size that are evasive for all varieties of bounded degree in a projective or affine n-space. As one application, we obtain a complete derandomization of Noether's normalization lemma for varieties of low degree in a projective or affine n-space. In another application, we obtain a simple polynomial-time black-box PIT algorithm for depth-4 arithmetic circuits with bounded top fan-in and bottom fan-in that are not in the Sylvester-Gallai configuration, improving and simplifying a result of Gupta (ECCC TR 14-130). As a complement of our explicit construction, we prove a tight lower bound for the size of k-subspace families that are evasive for degree-d varieties in a projective n-space. When n-k=n^Ω(1), the lower bound is superpolynomial unless d is bounded. The proof uses a dimension-counting argument on Chow varieties that parametrize projective subvarieties.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2021

Affine OneMax

A new class of test functions for black box optimization is introduced. ...
research
09/05/2020

A Lower Bound on Determinantal Complexity

The determinantal complexity of a polynomial P ∈𝔽[x_1, …, x_n] over a fi...
research
07/27/2022

Searching for Regularity in Bounded Functions

Given a function f:𝔽_2^n → [-1,1], this work seeks to find a large affin...
research
04/28/2019

Efficient Black-Box Identity Testing over Free Group Algebra

Hrubeš and Wigderson [HW14] initiated the study of noncommutative arithm...
research
11/26/2022

Extractors for Images of Varieties

We construct explicit deterministic extractors for polynomial images of ...
research
04/06/2023

Some families of Jensen-like inequalities with application to information theory

It is well known that the traditional Jensen inequality is proved by low...
research
08/25/2020

The Index of Invariance and its Implications for a Parameterized Least Squares Problem

We study the problem x_b,ω := arg min_x ∈𝒮(A + ω I)^-1/2 (b - Ax)_2, wit...

Please sign up or login with your details

Forgot password? Click here to reset