中文
相关论文

相关论文: Variety Evasive Subspace Families

200 篇论文

An avoshift is a subshift where for each set $C$ from a suitable family of subsets of the shift group, the set of all possible valid extensions of a globally valid pattern on $C$ to the identity element is determined by a bounded…

动力系统 · 数学 2024-08-20 Ville Salo

We give a new general approach for designing exact exponential-time algorithms for subset problems. In a subset problem the input implicitly describes a family of sets over a universe of size n and the task is to determine whether the…

数据结构与算法 · 计算机科学 2015-12-08 Fedor V. Fomin , Serge Gaspers , Daniel Lokshtanov , Saket Saurabh

Subspace designs are a (large) collection of high-dimensional subspaces $\{H_i\}$ of $\F_q^m$ such that for any low-dimensional subspace $W$, only a small number of subspaces from the collection have non-trivial intersection with $W$; more…

计算复杂性 · 计算机科学 2017-04-21 Venkatesan Guruswami , Chaoping Xing , Chen Yuan

A family F of permutations of the vertices of a hypergraph H is called "pairwise suitable" for H if, for every pair of disjoint edges in H, there exists a permutation in F in which all the vertices in one edge precede those in the other.…

组合数学 · 数学 2013-01-01 Manu Basavaraju , L. Sunil Chandran , Rogers Mathew , Deepak Rajendraprasad

This paper deals with the quantitative Schmidt's subspace theorem and the general from of the second main theorem, which are two correspondence objects in Diophantine approximation theory and Nevanlinna theory. In this paper, we give a new…

数论 · 数学 2022-11-15 Si Duc Quang

One fundamental question in the context of the geometric complexity theory approach to the VP vs. VNP conjecture is whether VP = $\overline{\textrm{VP}}$, where VP is the class of families of polynomials that are of polynomial degree and…

计算复杂性 · 计算机科学 2016-05-11 Joshua A. Grochow , Ketan D. Mulmuley , Youming Qiao

We construct $\varepsilon$-approximate unitary $k$-designs on $n$ qubits in circuit depth $O(\log k \log \log n k / \varepsilon)$. The depth is exponentially improved over all known results in all three parameters $n$, $k$, $\varepsilon$.…

量子物理 · 物理学 2025-07-22 Laura Cui , Thomas Schuster , Fernando Brandao , Hsin-Yuan Huang

There are various approaches to exploiting "hidden structure" in instances of hard combinatorial problems to allow faster algorithms than for general unstructured or random instances. For SAT and its counting version #SAT, hidden structure…

数据结构与算法 · 计算机科学 2012-04-30 Serge Gaspers , Stefan Szeider

It was shown in \cite{FPV} that the classification of $n$-component systems of conservation laws possessing a third-order Hamiltonian structure reduces to the following algebraic problem: classify $n$-planes $H$ in $\wedge^2(V_{n+2})$ such…

代数几何 · 数学 2018-10-30 E Ferapontov , L Manivel

We consider the task of proving integer infeasibility of a bounded convex $K$ in $\mathbb{R}^n$ using a general branching proof system. In a general branching proof, one constructs a branching tree by adding an integer disjunction…

计算复杂性 · 计算机科学 2020-06-09 Daniel Dadush , Samarth Tiwari

In this work we give an efficient construction of unitary $k$-designs using $\tilde{O}(k\cdot poly(n))$ quantum gates, as well as an efficient construction of a parallel-secure pseudorandom unitary (PRU). Both results are obtained by giving…

We construct an explicit family of linear rank-metric codes over any field ${\mathbb F}_h$ that enables efficient list decoding up to a fraction $\rho$ of errors in the rank metric with a rate of $1-\rho-\epsilon$, for any desired $\rho \in…

信息论 · 计算机科学 2013-12-03 Venkatesan Guruswami , Carol Wang

Families of vector-like deformed relativistic quantum phase spaces and corresponding realizations are analyzed. Method for general construction of star product is presented. Corresponding twist, expressed in terms of phase space…

高能物理 - 理论 · 物理学 2017-12-12 Daniel Meljanac , Stjepan Meljanac , Danijel Pikutić

In this article, we investigate collections of `well-spread-out' projective (and linear) subspaces. Projective $k$-subspaces in $\mathsf{PG}(d,\mathbb{F})$ are in `higgledy-piggledy arrangement' if they meet each projective subspace of…

组合数学 · 数学 2014-09-23 Szabolcs L. Fancsali , Péter Sziklai

For a (possibly infinite) fixed family of graphs F, we say that a graph G overlays F on a hypergraph H if V(H) is equal to V(G) and the subgraph of G induced by every hyperedge of H contains some member of F as a spanning subgraph.While it…

数据结构与算法 · 计算机科学 2017-03-16 Nathann Cohen , Frédéric Havet , Dorian Mazauric , Ignasi Sau , Rémi Watrigant

Let $A$ be a commutative $k$-algebra over a field of $k$ and $\Xi$ a linear operator defined on $A$. We define a family of $A$-valued invariants $\Psi$ for finite rooted forests by a recurrent algorithm using the operator $\Xi$ and show…

组合数学 · 数学 2009-02-02 Wenhua Zhao

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…

离散数学 · 计算机科学 2016-05-20 Jarkko Kari , Michal Szabados

We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…

计算几何 · 计算机科学 2016-06-01 Sariel Har-Peled , Kent Quanrud

We describe the 6-dimensional compact K-moduli space of Fano threefolds in deformation family No 2.18. These Fano threefolds are double covers of $\mathbb P^1\times\mathbb P^2$ branched along smooth $(2,2)$-surfaces, and…

代数几何 · 数学 2024-03-15 Kristin DeVleming , Lena Ji , Patrick Kennedy-Hunt , Ming Hao Quek

This paper is concerned with restricted families of projections in $\mathbb{R}^{3}$. Let $K \subset \mathbb{R}^{3}$ be a Borel set with Hausdorff dimension $\dim K = s > 1$. If $\mathcal{G}$ is a smooth and sufficiently well-curved…

经典分析与常微分方程 · 数学 2016-02-03 Tuomas Orponen