Related papers: Computing the EHZ capacity is NP-hard
We introduce the concept of Hofer-Zehnder $G$-semicapacity (or $G$-sensitive Hofer-Zehnder capacity) and prove that given a geometrically bounded symplectic manifold $(M,\omega)$ and an open subset $N \subset M$ endowed with a Hamiltonian…
The capacitance of an arbitrarily shaped object is calculated with the same second-kind integral equation method used for computing static and dynamic polarizabilities. The capacitance is simply the dielectric permittivity multiplied by the…
We give coefficient estimates for a class of close-to-convex harmonic mappings, and discuss the Fekete-Szeg\H{o} problem of it. We also introduce two classes of polyharmonic mappings $\mathcal{HS}_{p}$ and $\mathcal{HC}_{p}$, consider the…
We study the complexity of graph problems on graphs defined on groups, especially power graphs. We observe that an isomorphism invariant problem, such as Hamiltonian Path, Partition into Cliques, Feedback Vertex Set, Subgraph Isomorphism,…
It is a long-standing conjecture that all symplectic capacities which are equal to the Gromov width for ellipsoids coincide on a class of convex domains in $\mathbb{R}^{2n}$. It is known that they coincide for monotone toric domains in all…
We use Floer homology to study the Hofer-Zehnder capacity of neighborhoods near a closed symplectic submanifold M of a geometrically bounded and symplectically aspherical ambient manifold. We prove that, when the unit normal bundle of M is…
The Circuit diameter of polytopes was introduced by Borgwardt, Finhold and Hemmecke as a fundamental tool for the study of circuit augmentation schemes for linear programming and for estimating combinatorial diameters. Determining the…
For many classes of symplectic manifolds, the Hamiltonian flow of a function with sufficiently large variation must have a fast periodic orbit. This principle is the base of the notion of Hofer-Zehnder capacity and some other symplectic…
ECH capacities were developed by Hutchings to study embedding problems for symplectic $4$-manifolds with boundary. They have found especial success in the case of certain toric symplectic manifolds where many of the computations resemble…
We show that when integral polytopes are deformed while keeping the same facet normal vectors, the coefficients of weighted Ehrhart and $h^*$-polynomials are piecewise polynomial functions in the ``right hand sides'' of the linear…
We give a $K$-theoretic and geometric interpretation for a generalized weighted Ehrhart theory of a full-dimensional lattice polytope $P$, depending on a given homogeneous polynomial function $\varphi$ on $P$, and with Laurent polynomial…
We determine the Hofer-Zehnder capacity for twisted tangent bundles over closed surfaces for (i) arbitrary constant magnetic fields on the two-sphere and (ii) strong constant magnetic fields for higher genus surfaces. On $S^2$ we further…
We give a complexity dichotomy for the Quantified Constraint Satisfaction Problem QCSP(H) when H is a reflexive tournament. It is well-known that reflexive tournaments can be split into a sequence of strongly connected components…
Based on work of R. Lazarsfeld and M. Popa, we use the derivative complex associated to the bundle of the holomorphic p-forms to provide inequalities for all the Hodge numbers of a special class of irregular compact Kaehler manifolds. For…
Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…
We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…
While symplectic manifolds have no local invariants, they do admit many global numerical invariants. Prominent among them are the so-called symplectic capacities. Different capacities are defined in different ways, and so relations between…
We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only known result for this problem was an $O(n^3)$ algorithm for the…
A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global…
Ehrhart theory measures a polytope P discretely by counting the lattice points inside its dilates P, 2P, 3P, .... We compute the Ehrhart quasipolynomials of the standard Coxeter permutahedra for the classical Coxeter groups, expressing them…