English
Related papers

Related papers: Variety Evasive Subspace Families

200 papers

We study the question of explicitly constructing variety-evasive subspace families, a pseudorandom primitive introduced by Guo (Computational Complexity 2024) that generalizes both hitting sets and lossless rank condensers. Roughly…

Computational Complexity · Computer Science 2026-05-08 Robert Andrews , Abhibhav Garg

In the affine space $\mathbb{F}_q^n$ over the finite field of order $q$, a point set $S$ is said to be $(d,k,r)$-evasive if the intersection between $S$ and any variety, of dimension $k$ and degree at most $d$, has cardinality less than…

Combinatorics · Mathematics 2025-07-11 Jeck Lim , Jiaxi Nie , Ji Zeng

In this work we describe an explicit, simple, construction of large subsets of F^n, where F is a finite field, that have small intersection with every k-dimensional affine subspace. Interest in the explicit construction of such sets, termed…

Computational Complexity · Computer Science 2011-10-27 Zeev Dvir , Shachar Lovett

In this work, we introduce a natural notion concerning finite vector spaces. A family of $k$-dimensional subspaces of $\mathbb{F}_q^n$, which forms a partial spread, is called almost affinely disjoint if any $(k+1)$-dimensional subspace…

Combinatorics · Mathematics 2021-06-29 Hedongliang Liu , Nikita Polyanskii , Ilya Vorobyev , Antonia Wachter-Zeh

We study the problem of classifying the irreducible projective varieties $X$ of dimension $n\ge 2$ in $\Bbb P^N$ which contain an algebraic family $\Cal F$ of dimension $h+1$ ($h<n$) of subvarieties $Y$ of dimension $n-h$, each one…

alg-geom · Mathematics 2008-02-03 Emilia Mezzetti

We give an explicit construction of a large subset of F^n, where F is a finite field, that has small intersection with any affine variety of fixed dimension and bounded degree. Our construction generalizes a recent result of Dvir and Lovett…

Computational Complexity · Computer Science 2012-03-21 Zeev Dvir , János Kollár , Shachar Lovett

In (Kabanets, Impagliazzo, 2004) it is shown how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial family for arithmetical…

Computational Complexity · Computer Science 2009-10-09 Maurice Jansen

In this paper, we construct explicit families of polynomials $P \in \mathbb{F}_q[x_1,\dots,x_n]$ with large root sets which have restricted intersections with affine lines. We use these sets to make substantial progress on a number of…

Combinatorics · Mathematics 2026-02-12 Jakob Führer , Vladislav Taranchuk

Given positive integers $k\leq d$ and a finite field $\mathbb{F}$, a set $S\subset\mathbb{F}^{d}$ is $(k,c)$-subspace evasive if every $k$-dimensional affine subspace contains at most $c$ elements of $S$. By a simple averaging argument, the…

Combinatorics · Mathematics 2022-07-29 Benny Sudakov , István Tomon

In this paper, we show exponential lower bounds for the class of homogeneous depth-$5$ circuits over all small finite fields. More formally, we show that there is an explicit family $\{P_d : d \in \mathbb{N}\}$ of polynomials in…

Computational Complexity · Computer Science 2015-07-02 Mrinal Kumar , Ramprasad Saptharishi

Let $f : X \to S$ be a family of smooth projective algebraic varieties over a smooth connected quasi-projective base $S$, and let $\mathbb{V} = R^{2k} f_{*} \mathbb{Z}(k)$ be the integral variation of Hodge structure coming from degree $2k$…

Algebraic Geometry · Mathematics 2023-08-21 David Urbanik

Cover-free families are set systems used as solutions for a large variety of problems, and in particular, problems where we deal with $n$ elements and want to identify $d$ invalid ones among them by performing only $t$ tests ($t \leq n$).…

Combinatorics · Mathematics 2018-11-02 Thais Bardini Idalino , Lucia Moura

There is a large literature on cover-free families of finite sets, because of their many applications in combinatorial group testing, cryptographic and communications. This work studies the generalization of cover-free families from sets to…

Combinatorics · Mathematics 2024-07-31 Yunjing Shan , Junling Zhou

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

Computational Complexity · Computer Science 2018-03-19 Chi-Ning Chou , Mrinal Kumar , Noam Solomon

We present a single, common tool to strictly subsume all known cases of polynomial time blackbox polynomial identity testing (PIT) that have been hitherto solved using diverse tools and techniques. In particular, we show that polynomial…

Computational Complexity · Computer Science 2011-11-03 Manindra Agrawal , Chandan Saha , Ramprasad Saptharishi , Nitin Saxena

Polynomial Identity Testing (PIT) is a fundamental computational problem. The famous depth-$4$ reduction result by Agrawal and Vinay (FOCS 2008) has made PIT for depth-$4$ circuits an enticing pursuit. A restricted depth-4 circuit computing…

Computational Complexity · Computer Science 2023-04-26 Pranjal Dutta , Prateek Dwivedi , Nitin Saxena

Let $G$ be a semi-simple algebraic group over a perfect field $k$. A lot of progress has been made recently in computing the Chow motives of projective $G$-homogenous varieties. When $k$ has positive characteristic, a broader class of…

Algebraic Geometry · Mathematics 2017-10-20 Srimathy Srinivasan

The Schmidt Subspace Theorem affirms that the solutions of some particular system of diophantine approximations in projective spaces accumulates on a finite number of proper linear subspaces. Given a subvariety $X$ of a projective space…

Algebraic Geometry · Mathematics 2007-05-23 Roberto G. Ferretti

We study families of linear spaces in projective space whose union is a proper subvariety X of the expected dimension. We establish relations between configurations of focal points and existence or non-existence of a fixed tangent space to…

Algebraic Geometry · Mathematics 2007-05-23 Emilia Mezzetti , Orsola Tommasi

The main aim of this paper is to construct a complex analytic family of symmetric projective K3 surfaces through a compactifiable deformation family of complete quasi-projective varieties from $\operatorname{CP}^2…

Complex Variables · Mathematics 2025-07-29 Fan Xu
‹ Prev 1 2 3 10 Next ›