中文
相关论文

相关论文: NP-hardness of computing PL geometric category in …

200 篇论文

Finding a cycle of lowest weight that represents a homology class in a simplicial complex is known as homology localization (HL). Here we address this NP-complete problem using parameterized complexity theory. We show that it is W[1]-hard…

计算几何 · 计算机科学 2020-12-01 Nello Blaser , Erlend Raa Vågset

We present a classification of the so-called "additive symmetric 2-cocycles" of arbitrary degree and dimension over Z/p, along with a partial result and some conjectures for m-cocycles over Z/p, m > 2. This expands greatly on a result…

交换代数 · 数学 2008-11-26 Adam Hughes , JohnMark Lau , Eric Peterson

This article focuses on Lp-estimates for the square root of elliptic systems of second order in divergence form on a bounded domain. We treat complex bounded measurable coefficients and allow for mixed Dirichlet/Neumann boundary conditions…

经典分析与常微分方程 · 数学 2021-03-29 Moritz Egert

We consider the vector space of globally differentiable piecewise polynomial functions defined on a three-dimensional polyhedral domain partitioned into tetrahedra. We prove new lower and upper bounds on the dimension of this space by…

代数几何 · 数学 2014-03-05 Bernard Mourrain , Nelly Villamizar

We consider the unconstrained $L_2$-$L_p$ minimization: find a minimizer of $\|Ax-b\|^2_2+\lambda \|x\|^p_p$ for given $A \in R^{m\times n}$, $b\in R^m$ and parameters $\lambda>0$, $p\in [0,1)$. This problem has been studied extensively in…

计算复杂性 · 计算机科学 2011-05-04 Xiaojun Chen , Dongdong Ge , Zizhuo Wang , Yinyu Ye

We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…

人工智能 · 计算机科学 2015-03-19 Wolfgang Dvořák

In a recent paper, Brusco, K\"ohn and Steinley [Ann. Oper. Res. 206:611-626 (2013)] conjecture that the 2 bins special case of the one-dimensional minimax bin-packing problem with bin size constraints might be solvable in polynomial time.…

数据结构与算法 · 计算机科学 2014-02-10 Mariona Vilà , Jordi Pereira

We classify orbifold geometries which can be interpreted as moduli spaces of four-dimensional $\mathcal{N}\geq 3$ superconformal field theories up to rank 2 (complex dimension 6). The large majority of the geometries we find correspond to…

高能物理 - 理论 · 物理学 2020-12-09 Philip C. Argyres , Antoine Bourget , Mario Martone

The corner polyhedron is described by minimal valid inequalities from maximal lattice-free convex sets. For the Relaxed Corner Polyhedron (RCP) with two free integer variables and any number of non-negative continuous variables, it is known…

最优化与控制 · 数学 2012-04-10 Yogesh P. Awate

We define counting classes #P_R and #P_C in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over R, or of…

计算复杂性 · 计算机科学 2011-06-17 Peter Buergisser , Felipe Cucker

We introduce a generalization of Selman's P-selectivity that yields a more flexible notion of selectivity, called (polynomial-time) multi-selectivity, in which the selector is allowed to operate on multiple input strings. Since our…

计算复杂性 · 计算机科学 2007-05-23 Lane A. Hemaspaandra , Zhigen Jiang , Joerg Rothe , Osamu Watanabe

In this article we introduce the notion of Polyhedral Kahler manifolds, even dimensional polyhedral manifolds with unitary holonomy. We concentrate on the 4-dimensional case, prove that such manifolds are smooth complex surfaces, and…

微分几何 · 数学 2016-08-04 Dmitri Panov

We show that a realization of a closed connected PL-manifold of dimension n-1 in Euclidean n-space (n>2) is the boundary of a convex polyhedron if and only if the interior of each (n-3)-face has a point, which has a neighborhood lying on…

度量几何 · 数学 2007-05-23 Konstantin Rybnikov

Spectrahedra are linear sections of the cone of positive semidefinite matrices that, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We reprove…

最优化与控制 · 数学 2015-07-22 Avinash Bhardwaj , Philipp Rostalski , Raman Sanyal

Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…

原子与分子团簇 · 物理学 2022-09-20 KLaus E. Hermann

Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…

组合数学 · 数学 2022-03-24 Matthew Kwan , Lisa Sauermann , Yufei Zhao

We study the maximal rigid subcategories in $2-$CY triangulated categories and their endomorphism algebras. Cluster tilting subcategories are obviously maximal rigid; we prove that the converse is true if the $2-$CY triangulated categories…

表示论 · 数学 2015-03-17 Yu Zhou , Bin Zhu

We consider the notions of (i) critical points, (ii) second-order points, (iii) local minima, and (iv) strict local minima for multivariate polynomials. For each type of point, and as a function of the degree of the polynomial, we study the…

最优化与控制 · 数学 2021-06-17 Amir Ali Ahmadi , Jeffrey Zhang

We give a geometric criterion which shows p-parabolicity of a class of submanifolds in a Riemannian manifold, with controlled second fundamental form, for p bigger or equal than 2.

微分几何 · 数学 2009-09-03 Ana Hurtado , Vicente Palmer

We determine set-theoretic defining equations for the variety of hypersurfaces of degree d in an N-dimensional complex vector space that have dual variety of dimension at most k. We apply these equations to the Mulmuley-Sohoni variety, the…

代数几何 · 数学 2010-04-28 J. M. Landsberg , Laurent Manivel , Nicolas Ressayre