相关论文: Variety Evasive Subspace Families

Given a graph property $\Phi$, we consider the problem $\mathtt{EdgeSub}(\Phi)$, where the input is a pair of a graph $G$ and a positive integer $k$, and the task is to decide whether $G$ contains a $k$-edge subgraph that satisfies $\Phi$.…

We explicitly construct the first nontrivial extractors for degree $d \ge 2$ polynomial sources over $\mathbb{F}_2^n$. Our extractor requires min-entropy $k\geq n - \tilde{\Omega}(\sqrt{\log n})$. Previously, no constructions were known,…

In the $\mathcal{F}$-Minor-Free Deletion problem one is given an undirected graph $G$, an integer $k$, and the task is to determine whether there exists a vertex set $S$ of size at most $k$, so that $G-S$ contains no graph from the finite…

We give explicit polynomial-sized (in $n$ and $k$) semidefinite representations of the hyperbolicity cones associated with the elementary symmetric polynomials of degree $k$ in $n$ variables. These convex cones form a family of…

We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…

This thesis concerns the study of the Bredon cohomological and geometric dimensions of a discrete group $G$ with respect to a family $\mathfrak{F}$ of subgroups of $G$. With that purpose, we focus on building finite-dimensional models for…

In this article we develop a new way of systematically constructing infinitely many families of smooth subvarieties $X$ of any given dimension $m$, $m \geq 3$, and any given codimension in $\mathbb P^N$, embedded by complete subcanonical…

Let $k$ be a field, $m$ a positive integer, $\mathbb{V}$ an affine subvariety of $\mathbb{A}^{m+3}$ defined by a linear relation of the form $x_{1}^{r_{1}}\cdots x_{m}^{r_{m}}y=F(x_{1}, \ldots , x_{m},z,t)$, $A$ the coordinate ring of…

We study the computational complexity of the problem $\#\text{IndSub}(\Phi)$ of counting $k$-vertex induced subgraphs of a graph $G$ that satisfy a graph property $\Phi$. Our main result establishes an exhaustive and explicit classification…

We introduce a construction that associates, to each finite dimensional k-vector space V, a family of projective k-varieties that comes equipped with the structure of a operad in the category of k-schemes. When dim V = 1, this operad…

Let W be a projective variety of dimension n+1, L a free line bundle on W, X in $H^0(L^d)$ a hypersurface of degree d which is generic among those given by sums of monomials from $L$, and let $f : Y \to X$ be a generically finite map from a…

We investigate the problem $\#\mathsf{IndSub}(\Phi)$ of counting all induced subgraphs of size $k$ in a graph $G$ that satisfy a given property $\Phi$. This continues the work of Jerrum and Meeks who proved the problem to be…

Ever since the famous Erd\H{o}s-Ko-Rado theorem initiated the study of intersecting families of subsets, extremal problems regarding intersecting properties of families of various combinatorial objects have been extensively investigated.…

We consider the problem of deciding if a group is the fundamental group of a smooth connected complex quasi-projective (or projective) variety using Alexander-based invariants. In particular, we solve the problem for large families of…

This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…

Statistical modeling of spatiotemporal phenomena often requires selecting a covariance matrix from a covariance class. Yet standard parametric covariance families can be insufficiently flexible for practical applications, while…

The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Let $X$ be a projective toric variety of dimension $n$ and let $L$ be a ample line bundle on $X$. For $k \geq 0$, it is in general difficult to determine whether $L^{\otimes k}$ is very ample and whether it additionally gives a projectively…

Constructing ensembles of circuits which efficiently approximate the Haar measure over various groups is a long-standing and fundamental problem in quantum information theory. Recently it was shown that one can obtain approximate designs…