English
Related papers

Related papers: Variety Evasive Subspace Families

200 papers

We study geometric properties of certain obstructed equisingular families of projective hypersurfaces with emphasis on smoothness, reducibility, being reduced, and having expected dimension. In the case of minimal obstructness, we give a…

Algebraic Geometry · Mathematics 2009-04-19 Anna Gourevitch , Dmitry Gourevitch

In the noisy $k$-XOR problem, one is given $y \in \mathbb{F}_2^M$ and must distinguish between $y$ uniform and $y = A x + e$, where $A$ is the adjacency matrix of a $k$-left-regular bipartite graph with $N$ variables and $M$ constraints,…

Computational Complexity · Computer Science 2026-04-14 Jarosław Błasiok , Paul Lou , Alon Rosen , Madhu Sudan

In this paper, we derive a tight upper bound for the size of an intersecting $k$-Sperner family of subspaces of the $n$-dimensional vector space $\mathbb{F}_{q}^{n}$ over finite field $\mathbb{F}_{q}$ which gives a $q$-analogue of the…

Combinatorics · Mathematics 2024-05-01 Jiuqiang Liu , Guihai Yu , Lihua Feng , Yongtao Li

We continue a line of work on extracting random bits from weak sources that are generated by simple processes. We focus on the model of locally samplable sources, where each bit in the source depends on a small number of (hidden) uniformly…

Computational Complexity · Computer Science 2022-05-30 Omar Alrabiah , Eshan Chattopadhyay , Jesse Goodman , Xin Li , João Ribeiro

We show that if $B \subset \mathbb{R}^n$ and $E \subset A(n,k)$ is a nonempty collection of $k$-dimensional affine subspaces of $\mathbb{R}^n$ such that every $P \in E$ intersects $B$ in a set of Hausdorff dimension at least $\alpha$ with…

Metric Geometry · Mathematics 2019-03-12 Kornélia Héra

We construct one-parameter deformations of the Euclidean sphere $\mathbb{S}^n$ inside $\mathbb{R}^{n+1}$ that admit a Zoll family of codimension one embedded minimal spheres, in all dimensions $n\geq 3$. The method of construction is…

Differential Geometry · Mathematics 2026-04-28 Lucas Ambrozio , Diego Guajardo

Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…

Machine Learning · Statistics 2026-01-06 Alexandra Carpentier , Simone Maria Giancola , Christophe Giraud , Nicolas Verzelen

Let N a compact complex submanifold of a compact complex manifold M. We say N splits in M, if the holomorphic tangent bundle sequence splits holomorphically. By a result of Mok a splitting submanifold of a Kaehler Einstein manifold with a…

Algebraic Geometry · Mathematics 2015-05-18 Priska Jahnke , Ivo Radloff

Consider polynomials $F_1,\dots,F_s$ in $\K[X_1,\dots,X_n]$ over a field $\K$, their zero-set $V(F_1,\dots,F_n)$ in $\Kbar^n$ and its decomposition into equidimensional components $V_0,\dots,V_n$ (with $V_i$ either empty or of dimension $i$…

Commutative Algebra · Mathematics 2026-03-04 Jesse Elliott , Éric Schost

We construct algebraic families of smooth affine $\mathbb{A}^1$-contractible varieties of every dimension $n\geq 4$ over fields of characteristic zero which are non-isomorphic to affine spaces and potential counterexamples to the Zariski…

Algebraic Geometry · Mathematics 2025-01-17 Adrien Dubouloz , Parnashree Ghosh

Roughly speaking, an $(n,(r,s))$-Cover Free Family (CFF) is a small set of $n$-bit strings such that: "in any $d:=r+s$ indices we see all patterns of weight $r$". CFFs have been of interest for a long time both in discrete mathematics as…

Discrete Mathematics · Computer Science 2015-07-28 Nader H. Bshouty , Ariel Gabizon

We study projective dimension, a graph parameter (denoted by pd$(G)$ for a graph $G$), introduced by (Pudl\'ak, R\"odl 1992), who showed that proving lower bounds for pd$(G_f)$ for bipartite graphs $G_f$ associated with a Boolean function…

Computational Complexity · Computer Science 2020-01-10 Krishnamoorthy Dinesh , Sajin Koroth , Jayalal Sarma

We prove that if $K$ is a compact subset of an affine variety O = P^n - D (where D is a projective hypersuface), and if K is a compact subset of a closed analytic subvariety V \subset O, then the projective hull K^ of K has the property…

Complex Variables · Mathematics 2007-05-23 Blaine Lawson , John Wermer

Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…

Computational Geometry · Computer Science 2018-02-27 Boris Aronov , Anirudh Donakonda , Esther Ezra , Rom Pinchasi

We study real linear spaces in projective space that avoid the real points of a non-degenerate projective variety. For a variety $X \subset \mathbb{P}^{n-1}$ with a real smooth point, we define the avoidance locus $\mathcal{A}_k(X)$ as the…

Algebraic Geometry · Mathematics 2025-11-21 Elizabeth Pratt , Kexin Wang

We address the black-box polynomial identity testing (PIT) problem for non-commutative polynomials computed by $+$-regular circuits, a class of homogeneous circuits introduced by [AJMR](STOC 2017, Theory of Computing 2019). These circuits…

Computational Complexity · Computer Science 2025-02-11 G V Sumukha Bharadwaj , S Raja

A disjoint $(v,k,k-1)$ difference family in an additive group $G$ is a partition of $G\setminus\{0\}$ into sets of size $k$ whose lists of differences cover, altogether, every non-zero element of $G$ exactly $k-1$ times. The main purpose of…

Combinatorics · Mathematics 2017-05-16 Marco Buratti

We consider the convex geometry of the cone of nonnegative quadratics over Stanley-Reisner varieties. Stanley-Reisner varieties (which are unions of coordinate planes) are amongst the simplest real projective varieties, so this is…

Algebraic Geometry · Mathematics 2021-07-01 Kevin Shu

The celebrated result of Kabanets and Impagliazzo (Computational Complexity, 2004) showed that PIT algorithms imply circuit lower bounds, and vice versa. Since then it has been a major challenge to understand the precise connections between…

Computational Complexity · Computer Science 2025-08-19 Robert Andrews , Deepanshu Kush , Roei Tell

We study deterministic polynomial identity testing (PIT) and reconstruction algorithms for depth-$4$ arithmetic circuits of the form \[ \Sigma^{[r]}\!\wedge^{[d]}\!\Sigma^{[s]}\!\Pi^{[\delta]}. \] This model generalizes Waring…

Computational Complexity · Computer Science 2026-02-25 Amir Shpilka , Yann Tal