相关论文: Variety Evasive Subspace Families

Let f: V --> U be a smooth non-isotrivial family of canonically polarized n-dimensional complex manifolds, where U is the complement of a normal crossing divisor S in a projective manifold Y. We show that some symmetric product of the sheaf…

This text is a development of a preprint of Ankit Gupta. We present an approach for devising a deterministic polynomial time blackbox identity testing (PIT) algorithm for depth-$4$ circuits with bounded top fanin. This approach is similar…

In this article, we introduce a new approach to show the existence and smoothing of simple normal crossing varieties in a given projective space. Our approach relates the above to the existence of nowhere reduced schemes called ribbons and…

In this note, we make a step towards the classification of toric surfaces admitting reducible Severi varieties. We generalize the results of [Lan19, Tyo13, Tyo14], and provide two families of toric surfaces admitting reducible Severi…

A natural oriented (2k+2)-chain in CP^{2k+1} with boundary twice RP^{2k+1}, its complex shade, is constructed. Via intersection numbers with the shade, a new invariant, the shade number of k-dimensional subvarieties with normal vector…

The independence number of a tree decomposition is the size of a largest independent set contained in a single bag. The tree-independence number of a graph $G$ is the minimum independence number of a tree decomposition of $G$. As shown…

In this paper, we introduce a novel explicit family of subcodes of Reed-Solomon (RS) codes that efficiently achieve list decoding capacity with a constant output list size. Our approach builds upon the idea of large linear subcodes of RS…

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the length and in the geometric degree of the input equation system…

We study Fano schemes $F_k(X)$ for complete intersections $X$ in a projective toric variety $Y\subset \mathbb{P}^n$. Our strategy is to decompose $F_k(X)$ into closed subschemes based on the irreducible decomposition of $F_k(Y)$ as studied…

We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…

We consider the family of $\Phi$-Subset problems, where the input consists of an instance $I$ of size $N$ over a universe $U_I$ of size $n$ and the task is to check whether the universe contains a subset with property $\Phi$ (e.g., $\Phi$…

In this note we introduce the concept of reflective projective varieties. These are stratified projective varieties with certain dimension constraints on their dual varieties. We prove that for such varieties, the Chern-Schwartz-MacPherson…

Random unitaries are useful in quantum information and related fields, but hard to generate with limited resources. An approximate unitary $k$-design is an ensemble of unitaries with an underlying measure over which the average is close to…

For real and complex homogeneous cubic polyomials in $n+1$ variables, we prove that the Chow variety of products of linear forms is generically complex identifiable for all ranks up to the generic rank minus two. By integrating fundamental…

Vertex Subset Problems (VSPs) are a class of combinatorial optimization problems on graphs where the goal is to find a subset of vertices satisfying a predefined condition. Two prominent approaches for solving VSPs are dynamic programming…

We introduce a method to determine if n-dimensional smooth subvarieties of an ambient space of dimension at most 2n − 2 inherit the Picard group from the ambient space (as it happens when the ambient space is a projective space,…

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

Let $k$ be a perfect field. Assume that the characteristic of $k$ satisfies certain tameness assumptions \eqref{tameness}. Let $\mathcal O_{_n} := k\llbracket z_{_1}, \ldots, z_{_n}\rrbracket$ and set $K_{_n} := \text{Fract}~\cO_{_n}$. Let…

We study Farber's topological complexity (TC) of Davis' projective product spaces (PPS's). We show that, in many non-trivial instances, the TC of PPS's coming from at least two sphere factors is (much) lower than the dimension of the…