Related papers: Computing the EHZ capacity is NP-hard
Let $M$ be a compact manifold with an effective semi-free circle action whose fixed point set has trivial normal bundle. We prove that its cotangent bundle endowed with the canonical symplectic form has bounded Hofer-Zehnder sensitive…
The capacity of a channel with an energy-harvesting (EH) encoder and a finite battery remains an open problem, even in the noiseless case. A key instance of this scenario is the binary EH channel (BEHC), where the encoder has a unit-sized…
We study the complexity of the classic Hylland-Zeckhauser scheme [HZ'79] for one-sided matching markets. We show that the problem of finding an $\epsilon$-approximate equilibrium in the HZ scheme is PPAD-hard, and this holds even when…
This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…
We prove that the problem of minimizing the number of integer points inparallel translations of a rational convex polytope in $\mathbb{R}^6$ is NP-hard. We apply this result to show that given a rational convex polytope $P \subset…
We study the complexity of computing the mixed-integer hull $\operatorname{conv}(P\cap\mathbb{Z}^n\times\mathbb{R}^d)$ of a polyhedron $P$. Given an inequality description, with one integer variable, the mixed-integer hull can have…
We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…
We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…
The ECH capacities are a sequence of numerical invariants of symplectic four-manifolds which give (sometimes sharp) obstructions to symplectic embeddings. These capacities are defined using embedded contact homology, and establishing their…
We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the…
The polytope containment problem is deciding whether a polytope is a contained within another polytope. This problem is rooted in computational convexity, and arises in applications such as verification and control of dynamical systems. The…
Recently it was shown that, for every fixed k>1, given a finite simply connected simplicial complex X, the kth homotopy group \pi_k(X) can be computed in time polynomial in the number n of simplices of X. We prove that this problem is…
The multi-homogeneous Bezout number is a bound for the number of solutions of a system of multi-homogeneous polynomial equations, in a suitable product of projective spaces. Given an arbitrary, not necessarily multi-homogeneous system, one…
For subsets in the standard symplectic space $(\mathbb{R}^{2n},\omega_0)$ whose closures are intersecting with coisotropic subspace $\mathbb{R}^{n,k}$ we construct relative versions of the Ekeland-Hofer capacities of the subsets with…
In this paper, our focus lies on a fundamental geometric invariant known as Riesz capacity, which holds an essential position in potential theory. We establish the Hadamard variational formula for Riesz capacity of convex bodies. As a…
Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…
A direct and exact method for calculating the density of states for systems with localized potentials is presented. The method is based on explicit inversion of the operator $E-H$. The operator is written in the discrete variable…
We compute the Hofer-Zehnder capacity of disk tangent bundles of certain lens spaces with respect to the round metric. Interestingly we find that the Hofer-Zehnder capacity does not see the covering, i.e. the capacity of the disk tangent…
In a previous paper, we showed how to use the Ehrhart function $L_P(s)$, defined by $L_P(s) = \#(sP \cap \mathbb Z^d)$, to reconstruct a polytope $P$. More specifically, we showed that, for rational polytopes $P$ and $Q$, if $L_{P + w}(s) =…
Reachability analysis for hybrid nonaffine systems remains computationally challenging, as existing set representations--including constrained, polynomial, and hybrid zonotopes--either lose tightness under high-order nonaffine maps or…