English
Related papers

Related papers: Computing the EHZ capacity is NP-hard

200 papers

Let G be a compact simple Lie group and the O the minimal nilpotent orbit in g^C. We determine all G-invariant K\"ahler potentials for hyperK\"ahler metrics compatible with the KKS complex symplectic form on O.

Differential Geometry · Mathematics 2007-05-23 Piotr Kobak , Andrew Swann

The energy of harmonic sections of flat bundles of nonpositively curved (NPC) length spaces over a Riemann surface $S$ is a function $E_\rho$ on Teichm\"uller space $\Teich$ which is a qualitative invariant of the holonomy representation…

Differential Geometry · Mathematics 2011-07-12 William M. Goldman , Richard A. Wentworth

ECH (embedded contact homology) capacities give obstructions to symplectically embedding one four-dimensional symplectic manifold with boundary into another. These obstructions are known to be sharp when the domain and target are ellipsoids…

Symplectic Geometry · Mathematics 2016-05-04 Michael Hutchings

We propose a novel Hybrid High-Order method for the Cahn-Hilliard problem with convection. The proposed method is valid in two and three space dimensions, and it supports arbitrary approximation orders on general meshes containing…

Numerical Analysis · Mathematics 2017-02-28 Florent Chave , Daniele Di Pietro , Fabien Marche

The Hofer-Zehnder theorem states that almost every hypersurface in a thickening of a hypersurface $S$ in a symplectic manifold $(M,\omega)$ carries a closed characteristic provided that $S$ bounds a compact submanifold and $(M,\omega)$ has…

Symplectic Geometry · Mathematics 2007-05-23 Leonardo Macarini , Felix Schlenk

We show that Hopf invariants, defined by evaluation in Harrison cohomology of the commutative cochains of a space, calculate the logarithm map from a fundamental group to its Malcev Lie algebra. They thus present the zeroth Harrison…

Algebraic Topology · Mathematics 2025-12-08 Nir Gadish , Aydin Ozbek , Dev Sinha , Ben Walter

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

Functional Analysis · Mathematics 2010-10-13 Maxim V. Balashov , Dušan Repovš

We provide a streamlined proof and improved estimates for the weak multivariate Gnedenko law of large numbers on concentration of random polytopes within the space of convex bodies (in a fixed or a high dimensional setting), as well as a…

Probability · Mathematics 2014-03-11 Daniel J. Fresen , Richard A. Vitale

Equivariant Ehrhart theory enumerates the lattice points in a polytope with respect to a group action. Answering a question of Stapledon, we describe the equivariant Ehrhart theory of the permutahedron, and we prove his Effectiveness…

Combinatorics · Mathematics 2020-07-20 Federico Ardila , Mariel Supina , Andrés R. Vindas-Meléndez

This work studies the problem of maximizing a higher degree real homogeneous multivariate polynomial over the unit sphere. This problem is equivalent to finding the leading eigenvalue of the associated symmetric tensor of higher order,…

Optimization and Control · Mathematics 2019-10-02 Yuning Yang , Guoyin Li

We use the minimal coupling procedure of Sternberg and Weinstein and our pseudo-symplectic capacity theory to prove that every closed symplectic submanifold in any symplectic manifold has an open neighborhood with finite ($\pi_1$-sensitive)…

Symplectic Geometry · Mathematics 2009-09-29 Guangcun Lu

The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem that is equivalent to optimizing a linear objective function over the QAP polytope. The QAP polytope with parameter $n$ - \qappolytope{n} - is defined as the convex hull…

Computational Complexity · Computer Science 2020-10-14 Pawan Aurora , Hans Raj Tiwary

This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…

Computational Geometry · Computer Science 2022-12-09 Rahul Arya , Sunil Arya , Guilherme D. da Fonseca , David M. Mount

In view of the complexity of the dynamics of learning in games, we seek to decompose a game into simpler components where the dynamics' long-run behavior is well understood. A natural starting point for this is Helmholtz's theorem, which…

Computer Science and Game Theory · Computer Science 2024-05-21 Davide Legacci , Panayotis Mertikopoulos , Bary Pradelski

We present lower bounds for the coefficients of Ehrhart polynomials of convex lattice polytopes in terms of their volume. Concerning the coefficients of the Ehrhart series of a lattice polytope we show that Hibi's lower bound is not true…

Metric Geometry · Mathematics 2008-02-26 Martin Henk , Makoto Tagami

We introduce the flag-approximability of a convex body to measure how easy it is to approximate by polytopes. We show that the flag-approximability is exactly half the volume entropy of the Hilbert geometry on the body, and that both…

Metric Geometry · Mathematics 2018-09-26 Constantin Vernicos , Cormac Walsh

A unit-vector field n:P \to S^2 on a convex polyhedron P \subset R^3 satisfies tangent boundary conditions if, on each face of P, n takes values tangent to that face. Tangent unit-vector fields are necessarily discontinuous at the vertices…

Mathematical Physics · Physics 2009-05-11 A Majumdar , JM Robbins , M Zyskin

The capacitance of arbitrarily shaped objects is reformulated in terms of the Neumann-Poincar\'{e} operator. Capacitance is simply the dielectric permittivity of the surrounding medium multiplied by the area of the object and divided by the…

Mesoscale and Nanoscale Physics · Physics 2013-04-25 Titus Sandu , George Boldeiu , Victor Moagar-Poladian

Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap.…

Computational Geometry · Computer Science 2012-09-25 Sarah R. Allen , John Iacono

In this paper we establish new restrictions on symplectic embeddings of certain convex domains into symplectic vector spaces. These restrictions are stronger than those implied by the Ekeland-Hofer capacities. By refining an embedding…

Symplectic Geometry · Mathematics 2013-06-10 Richard Hind , Ely Kerman