相关论文: Variety Evasive Subspace Families

In this paper, a generic intersection theorem in projective differential algebraic geometry is presented. Precisely, the intersection of an irreducible projective differential variety of dimension d>0 and order h with a generic projective…

We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various…

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

In this note, we give two applications of \cite[Theorem 3.1]{Hwang}. We first study the free family $\mathcal{K}$ of hyperplane sections of the smooth hypersurface $X\subset\mathbb{P}^{n+1}$ of degree $d\ge 3$. We prove that $X$ is…

Let $E_1,\ldots,E_k$ be a collection of linear series on an algebraic variety $X$ over $\mathbb{C}$. That is, $E_i\subset H^0(X, \mathcal{L}_i)$ is a finite dimensional subspace of the space of regular sections of line bundles $…

Linear hypersurfaces over a field $k$ have been playing a central role in the study of some of the challenging problems on affine spaces. Breakthroughs on such problems have occurred by examining two difficult questions on linear…

In this paper we study those submonoids of $\mathbb{N}^d$ which a non-trivial pseudo-Frobenius set. In the affine case, we prove that they are the affine semigroups whose associated algebra over a field has maximal projective dimension…

Consider a system F of n polynomials in n variables, with a total of n+k distinct exponent vectors, over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all…

We prove super-polynomial lower bounds on the size of propositional proof systems operating with constant-depth algebraic circuits over fields of zero characteristic. Specifically, we show that the subset-sum variant…

Let $k$ be a field and $V$ an $k$-vector space. For a family $\bar P=\{ P_i\}_{1\leq i\leq c}, $ of polynomials on $V$, we denote by $\mathbb X _{\bar P}\subset V$ the subscheme defined by the ideal generated by $ \bar P$. We show the…

This paper investigates a refinement of Marstrand's projection theorem; more specifically, let $\Pi_t, t\in[0,1]$ be a family of $m$ dimensional subspaces of the Euclidean space $\mathbb{R}^n$ and let $P_t:\mathbb{R}^4\mapsto \Pi_t$ be the…

We introduce and explore a new concept of evasive subspace with respect to a collection of subspaces sharing a common dimension, most notably partial spreads. We show that this concept generalises known notions of subspace scatteredness and…

In this paper we study constrained subspace approximation problem. Given a set of $n$ points $\{a_1,\ldots,a_n\}$ in $\mathbb{R}^d$, the goal of the {\em subspace approximation} problem is to find a $k$ dimensional subspace that best…

We construct a $15$-dimensional affine variety $\Pi_{\mathbb{A}}^{15}$ with a ${\rm GL}_{2}$- and $(\mathbb{C}^{*})^{4}$-actions. We denote by $\Pi_{\mathbb{A}}^{14}$ the affine variety obtained from $\Pi_{\mathbb{A}}^{15}$ by setting one…

In the Densest $k$-Subgraph problem, given an undirected graph $G$ and an integer $k$, the goal is to find a subgraph of $G$ on $k$ vertices that contains maximum number of edges. Even though the state-of-the-art algorithm for the problem…

Let $K/k$ be an extension of number fields, and let $P(t)$ be a quadratic polynomial over $k$. Let $X$ be the affine variety defined by $P(t) = N_{K/k}(\mathbf{z})$. We study the Hasse principle and weak approximation for $X$ in three…

Dvir and Moran proved the following upper bound for the size of a family $\mbox{$\cal F$}$ of subsets of $[n]$ with $\mbox{Vdim}(\mbox{$\cal F$} \Delta \mbox{$\cal F$})\leq d$. Let $d\leq n$ be integers. Let $\mbox{$\cal F$}$ be a family of…

We show that there exists a family of Knapsack polytopes such that, for each polytope P from this family and each {\epsilon} > 0, any {\epsilon}-approximated formulation of P in the original space R^n requires a number of inequalities that…

Following the example of Shor's algorithm for period-finding in the integers, we explore the hidden subgroup problem (HSP) for discrete infinite groups. On the hardness side, we show that HSP is NP-hard for the additive group of rational…

We prove the following theorem. Given a planar graph $G$ and an integer $k$, it is possible in polynomial time to randomly sample a subset $A$ of vertices of $G$ with the following properties: (i) $A$ induces a subgraph of $G$ of treewidth…