Related papers: Variety Evasive Subspace Families

We introduce families of quasi-rectifiable vector fields and study their geometric and algebraic aspects. Then, we analyse their applications to systems of partial differential equations. Our results explain, in a simpler manner, previous…

We give upper bounds for the dimension of the set of hypersurfaces of $\mathbb{P}^N$ whose intersection with a fixed integral projective variety is not integral. Our upper bounds are optimal. As an application, we construct, when possible,…

We study the arithmetic complexity of hitting set generators, which are pseudorandom objects used for derandomization of the polynomial identity testing problem. We give new explicit constructions of hitting set generators whose outputs are…

We present a structural resolution to the exact evaluation of the partition function $p_k(n)$, systematically overcoming the limitations of traditional recursive and asymptotic methods. By framing the partition polytope $\mathcal{P}_{n,k}$…

Let $f : X \rightarrow B$ be a proper flat dominant morphism between two smooth quasi-projective complex varieties $X$ and $B$. Assume that there exists an integer $l$ such that all closed fibres $X_b$ of $f$ satisfy $CH_j(X_b) = \Q$ for…

We introduce a new class of algorithms for finding a short vector in lattices defined by codes of co-dimension $k$ over $\mathbb{Z}_P^d$, where $P$ is prime. The co-dimension $1$ case is solved by exploiting the packing properties of the…

We initiate a study of varieties of minimal degree in weighted projective spaces. We call a weighted projective space $\mathbf{P}(w_0,\dots,w_n)$ divisible if $w_i \mid w_{i+1}$ for all $i$. We provide sharp bounds for when a non-degenerate…

Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes in $\mathbb{R}^k$. Cubicity is a variant of boxicity, where the axis parallel boxes in the intersection…

We construct an explicit family of 3-XOR instances hard for $\Omega(n)$-levels of the Sum-of-Squares (SoS) semi-definite programming hierarchy. Not only is this the first explicit construction to beat brute force search (beyond low-order…

In this paper, we study the explicit geometry of threefolds, in particular, Fano varieties. We find an explicitly computable positive integer $N$, such that all but a bounded family of Fano threefolds have $N$-complements. This result has…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

We present a simple deterministic reduction which, assuming the Exponential Time Hypothesis ($\mathsf{ETH}$), yields tight lower bounds for approximating the parameterized Maximum Likelihood Decoding problem ($\mathsf{MLD}$) and the…

We investigate the consequences of the existence of ``efficiently describable'' hitting sets for polynomial sized algebraic circuit ($\mathsf{VP}$), in particular, \emph{$\mathsf{VP}$-succinct hitting sets}. Existence of such hitting sets…

A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…

Motivated by the idea of turbomachinery active subspace performance maps, this paper studies dimension reduction in turbomachinery 3D CFD simulations. First, we show that these subspaces exist across different blades---under the same…

We provide two different proofs of an irreducibility criterion for the preimages of a transverse subvariety of a product of elliptic curves under a diagonal endomorphism of sufficiently large degree.For curves, we present an arithmetic…

A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…

The $k$-ExactCover problem is a parameterized version of the ExactCover problem, in which we are given a universe $U$, a collection $S$ of subsets of $U$, and an integer $k$, and the task is to determine whether $U$ can be partitioned into…

We prove that the variation in a smooth projective family of varieties admitting a good minimal model forms a lower bound for the Kodaira dimension of the base, if the dimension of the base is at most five and its Kodaira dimension is…

Given a linear code $\mathcal{C}$, its square code $\mathcal{C}^{(2)}$ is the span of all component-wise products of two elements of $\mathcal{C}$. Motivated by applications in multi-party computation, our purpose with this work is to…