中文
相关论文

相关论文: Variety Evasive Subspace Families

200 篇论文

Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let $\mathbf{v} \in \mathbb{Q}^d$ be a rational vector, $(T_{1},…

计算复杂性 · 计算机科学 2023-10-05 Cornelius Brand , Viktoriia Korchemna , Michael Skotnica , Kirill Simonov

We show that for any compact convex set $K$ in $\mathbb{R}^d$ and any finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$, if the intersection of every sufficiently small subfamily of $\mathcal{F}$ contains an isometric copy of $K$…

度量几何 · 数学 2020-10-09 John A. Messina , Pablo Soberón

We are given n base elements and a finite collection of subsets of them. The size of any subset varies between p to k (p < k). In addition, we assume that the input contains all possible subsets of size p. Our objective is to find a…

数据结构与算法 · 计算机科学 2009-06-09 Asaf Levin , Uri Yovel

This paper concerns the construction of minimal varieties with small canonical volumes. The first part devotes to establishing an effective nefness criterion for the canonical divisor of a weighted blow-up over a weighted hypersurface, from…

代数几何 · 数学 2024-06-05 Meng Chen , Chen Jiang , Binru Li

Let X be a subvariety of $P^n$ defined by equations of degrees $ d =(d_1,...,d_s)$, over an algebraically closed field k of any characteristic. We study properties of the Fano scheme $F_r(X)$ that parametrizes linear subspaces of dimension…

alg-geom · 数学 2008-02-03 O. Debarre , L. Manivel

Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of matrix identities as hard instances for strong proof systems. A matrix identity of $d \times d$ matrices over a field $\mathbb{F}$, is a…

计算复杂性 · 计算机科学 2014-09-04 Fu Li , Iddo Tzameret

Proposed for rapid document similarity estimation in web search engines, the celebrated property of minwise independence imposes highly symmetric constraints on a family $\mathcal{F}$ of permutations of $\{1,\ldots, n\}$: The property is…

离散数学 · 计算机科学 2024-12-17 Enrico Iurlano , Günther R. Raidl

Given an irreducible hypersurface singularity of dimension $d$ (defined by a polynomial $f\in K[[ {\bf x} ]][z]$) and the projection to the affine space defined by $K[[ {\bf x} ]]$, we construct an invariant which detects whether the…

代数几何 · 数学 2018-05-30 Hussein Mourtada , Bernd Schober

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

符号计算 · 计算机科学 2014-05-05 Danko Adrovic , Jan Verschelde

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

计算几何 · 计算机科学 2020-03-17 M. Sharir , C. Ziv

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

数论 · 数学 2018-01-04 Anish Ghosh , Alexander Gorodnik , Amos Nevo

We show that if we can design poly($s$)-time hitting-sets for $\Sigma\wedge^a\Sigma\Pi^{O(\log s)}$ circuits of size $s$, where $a=\omega(1)$ is arbitrarily small and the number of variables, or arity $n$, is $O(\log s)$, then we can…

计算复杂性 · 计算机科学 2017-02-24 Manindra Agrawal , Michael Forbes , Sumanta Ghosh , Nitin Saxena

For any family of measurable sets in a probability space, we show that either (i) the family has infinite Vapnik-Chervonenkis (VC) dimension or (ii) for every epsilon > 0 there is a finite partition pi such the pi-boundary of each set has…

概率论 · 数学 2010-10-22 Terrence M. Adams , Andrew B. Nobel

We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…

计算复杂性 · 计算机科学 2022-02-14 Oliver Korten

In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…

计算复杂性 · 计算机科学 2007-05-23 Ketan D Mulmuley , Milind Sohoni

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

离散数学 · 计算机科学 2015-10-02 Jarkko Kari , Michal Szabados

Let G be a semisimple affine algebraic group of inner type over a field F. We write C for the class of all finite direct products of projective G-homogeneous F-varieties. We determine the structure of the Chow motives with coefficients in a…

代数几何 · 数学 2011-07-12 Nikita A. Karpenko

In the present article we define an integral analogue of Chow-K\"unneth decomposition for \'etale motives. By using families of conservative functors we are able to establish a decomposition of the \'etale motive of commutative group…

代数几何 · 数学 2024-03-04 Ivan Rosas-Soto

We show that for a number of parameterized problems for which only $2^{O(k)} n^{O(1)}$ time algorithms are known on general graphs, subexponential parameterized algorithms with running time $2^{O(k^{1-\frac{1}{1+\delta}} \log^2 k)}…

数据结构与算法 · 计算机科学 2016-10-26 Dániel Marx , Marcin Pilipczuk

In this paper we construct an equivariant embedding of the affine space $\mathbb{A}^n$ with the translation group action into a complete non-projective algebraic variety $X$ for all $n \geq 3$. The theory of toric varieties is used as the…

代数几何 · 数学 2022-03-11 Kirill Shakhmatov
‹ 上一页 1 8 9 10 下一页 ›