Related papers: Computing Reeb dynamics on 4d convex polytopes
The monotone path polytope of a polytope $P$ encapsulates the combinatorial behavior of the shadow vertex rule (a pivot rule used in linear programming) on $P$. Computing monotone path polytopes is the entry door to the larger subject of…
Some combinatorial properties of fixed boundary rhombus random tilings with octagonal symmetry are studied. A geometrical analysis of their configuration space is given as well as a description in terms of discrete dynamical systems, thus…
We characterize which closed Reeb orbits of a dynamically convex contact form on the 3-sphere bound disk-like global surfaces of section for the Reeb flow, without any genericity assumptions. We show that these global surfaces of section…
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…
Motivated by Luo's combinatorial Yamabe flow on closed surfaces \cite{L1} and Guo's combinatorial Yamabe flow on surfaces with boundary \cite{Guo}, we introduce combinatorial Calabi flow on ideally triangulated surfaces with boundary,…
In this paper we introduce a combinatorial formula for the Ekeland-Hofer-Zehnder capacity of a convex polytope in $\mathbb{R}^{2n}$. One application of this formula is a certain subadditivity property of this capacity.
Motivated by the problem of bounding the number of iterations of the Simplex algorithm we investigate the possible lengths of monotone paths followed by the Simplex method inside the oriented graphs of polyhedra (oriented by the objective…
We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…
We study the existence of $3-2-1$ foliations adapted to Reeb flows on the tight $3$-sphere. These foliations admit precisely three binding orbits whose Conley-Zehnder indices are $3$, $2$, and $1$, respectively. All regular leaves are disks…
We study the combinatorial Calabi flow for ideal circle patterns in both hyperbolic and Euclidean background geometry. We prove that the flow exists for all time and converges exponentially fast to an ideal circle pattern metric on surfaces…
In this article, we study the dynamical properties of Reeb vector fields on b-contact manifolds. We show that in dimension 3, the number of so-called singular periodic orbits can be prescribed. These constructions illuminate some key…
Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…
The research is devoted to the stability of convective flow in a nonuniformly rotating layer of an electrically conducting fluid in a spiral magnetic field. The stationary and oscillatory modes of magnetic convection are considered…
In this work we study a class of random convex sets that "interpolate" between polytopes and zonotopes. These sets arise from considering a $q^{th}$-moment ($q\geq 1$) of an average of order statistics of $1$-dimensional marginals of a…
In this paper, we consider the geodesic flow on factors of the hyperbolic plane. We prove that a periodic orbit including a 2-antiparallel encounter has a partner orbit. We construct the partner orbit and give an estimate for the action…
We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…
We explore several problems related to ruled polygons. Given a ruling of a polygon $P$, we consider the Reeb graph of $P$ induced by the ruling. We define the Reeb complexity of $P$, which roughly equates to the minimum number of points…
We give a necessary and sufficient condition for strong stability of low dimensional Hamiltonian systems, in terms of the iterates of a closed orbit and the Conley-Zehnder index. Applications to Mathieu equation and stable harmonic…
Recently, Connelly and Gortler gave a novel proof of the circle packing theorem for tangency packings by introducing a hybrid combinatorial-geometric operation, flip-and-flow, that allows two tangency packings whose contact graphs differ by…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…