Related papers: Computing the EHZ capacity is NP-hard

We consider the capacity of entanglement as a probe of the Hawking radiation in a two-dimensional dilaton gravity coupled with conformal matter of large degrees of freedom. A formula calculating the capacity is derived using the…

We derive a set of constraints, which we will call hierarchy constraints (HCs), on scattering amplitudes of an arbitrary multistate Landau-Zener model (MLZM). The presence of additional symmetries can transform such constraints into…

We construct a family version of symplectic Floer cohomology for magnetic cotangent bundles, without any restrictions on the magnetic form, using the dissipative method for compactness introduced in \cite{Groman2015}. As an application, we…

The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…

In this note we show that one open four dimensional ellipsoid embeds symplectically into another if and only the ECH capacities of the first are no larger than those of the second. This proves a conjecture due to Hofer. The argument uses…

In the recent progress [BE1], [M], [Z1] and [Z2], the well-known Jacobian conjecture ([BCW], [E]) has been reduced to a problem on HN (Hessian nilpotent) polynomials (the polynomials whose Hessian matrix are nilpotent) and their (deformed)…

We show that {\sc Heegaard Genus $\leq g$}, the problem of deciding whether a triangulated 3-manifold admits a Heegaard splitting of genus less than or equal to $g$, is NP-hard. The result follows from a quadratic time reduction of the…

The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…

We find a recursive algorithm for computing the precise centralizers of the complex orthogonal and symplectic groups, and hence the isotropy groups, with respect to the similarity transformation on the spaces of skew-symmetric and…

We prove a complexity dichotomy theorem for a class of Holant problems on 3-regular bipartite graphs. Given an arbitrary nonnegative weighted symmetric constraint function $f = [x_0, x_1, x_2, x_3]$, we prove that the bipartite Holant…

In a recent work [10], we have introduced a pressure-robust Hybrid High-Order method for the numerical solution of the incompressible Navier-Stokes equations on matching simplicial meshes. Pressure-robust methods are characterized by error…

Ehrhart polynomials are extensively-studied structures that interpolate the discrete volume of the dilations of integral $n$-polytopes. The coefficients of Ehrhart polynomials, however, are still not fully understood, and it is not known…

We prove that computing a shortest monotone path to the optimum of a linear program over a simple polytope is NP-hard, thus resolving a 2022 open question of De Loera, Kafer, and Sanit\`a. As a consequence, finding a shortest sequence of…

We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…

We use positive S^1-equivariant symplectic homology to define a sequence of symplectic capacities c_k for star-shaped domains in R^{2n}. These capacities are conjecturally equal to the Ekeland-Hofer capacities, but they satisfy axioms which…

Configuration-space matrix elements of N-body potentials arise naturally and ubiquitously in the Ritz-Galerkin solution of many-body quantum problems. For the common specialization of local, finite-range potentials, we develop the eXact…

In this work we deal with left invariant complex and symplectic structures on simply connected four dimensional solvable real Lie groups. We search the general form of such structures, when they exist and we make use of this information to…

We introduce the M-representation of polytopes, which makes it possible to compute linear transformations, convex hulls, and Minkowski sums with linear complexity in the dimension of the polytopes. When the polytope is a convex hull of a…

We investigate the Hilbert complex of elasticity involving spaces of symmetric tensor fields. For the involved tensor fields and operators we show closed ranges, Friedrichs/Poincare type estimates, Helmholtz type decompositions, regular…

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…