English
Related papers

Related papers: Hamiltonian submanifolds of regular polytopes

200 papers

A notion of dual curve for pseudoholomorphic curves in 4--manifolds turns out to be possible only if the notion of almost complex structure structure is slightly generalized. The resulting structure is as easy (perhaps easier) to work with,…

Differential Geometry · Mathematics 2007-05-23 Benjamin McKay

A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…

Algebraic Geometry · Mathematics 2022-12-21 Jaeho Shin

A centrally symmetric $2d$-vertex combinatorial triangulation of the product of spheres $\S^i\times\S^{d-2-i}$ is constructed for all pairs of non-negative integers $i$ and $d$ with $0\leq i \leq d-2$. For the case of $i=d-2-i$, the…

Combinatorics · Mathematics 2011-02-03 Steven Klee , Isabella Novik

It is shown that the horizontal holonomy group of a K-contact sub-Riemannian manifold either coincides with the holonomy group of a Riemannian manifold, or it is a codimension-one normal subgroup of the later group. The question of…

Differential Geometry · Mathematics 2025-09-08 Anton S. Galaev

In earlier papers, we showed a decomposition of the arcs of 2-diregular digraphs (2-dds) and used it to prove some conditions for these graphs to be non-Hamiltonian; we then extended this decomposition to a larger class of digraphs and used…

Combinatorics · Mathematics 2026-01-27 Munagala V. Ramanath

A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…

Combinatorics · Mathematics 2018-04-17 Ian M. Alevy

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

Metric Geometry · Mathematics 2007-05-23 Hartwig Bosse , Martin Groetschel , Martin Henk

We show that a generic Hamiltonian diffeomorphism on a closed symplectic manifold which is symplectically aspherical has at least the stable Morse number of fixed points - this is in line with a conjecture by Arnold.

Symplectic Geometry · Mathematics 2017-01-09 Georgios Dimitroglou Rizell , Roman Golovko

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e. 3-connected planar graph)…

Combinatorics · Mathematics 2021-04-12 Simon Špacapan

We construct a CW decomposition $C_n$ of the $n$-dimensional half cube in a manner compatible with its structure as a polytope. For each $3 \leq k \leq n$, the complex $C_n$ has a subcomplex $C_{n, k}$, which coincides with the clique…

Geometric Topology · Mathematics 2008-12-04 R. M. Green

The symplectomorphism group of a 2-dimensional surface is homotopy equivalent to the orbit of a filling system of curves. We give a generalization of this statement to dimension 4. The filling system of curves is replaced by a decomposition…

Symplectic Geometry · Mathematics 2014-11-11 Joseph Coffey

We show that every $(n,d,\lambda)$-graph contains a Hamilton cycle for sufficiently large $n$, assuming that $d\geq \log^{6}n$ and $\lambda\leq cd$, where $c=\frac{1}{70000}$. This significantly improves a recent result of Glock, Correia…

Combinatorics · Mathematics 2025-07-02 Asaf Ferber , Jie Han , Dingjia Mao , Roman Vershynin

Let $\mathcal{M}_{2N}(\delta_1, \delta_2,\dots, \delta_N)$ be the moduli space of centrally symmetric convex polyhedral surfaces with $2N$ labeled vertices and prescribed cone-deficits $\delta_1$, $\delta_2$, $\dots$, $\delta_N$. We show…

Geometric Topology · Mathematics 2026-03-31 Zili Wang , Cong Wu

In this paper we study convex subcomplexes of spherical buildings. We pay special attention to fixed point sets of type-preserving isometries of spherical buildings. This sets are also convex subcomplexes of the natural polyhedral structure…

Metric Geometry · Mathematics 2014-08-14 Carlos Ramos-Cuevas

The present work investigates regular, semiregular, and chiral polytopes of any rank $d\geq 3$, whose automorphism groups are 2-groups. There is a large variety of rather small finite regular or alternating semiregular polytopes with…

Group Theory · Mathematics 2025-12-18 Gabriel Cunningham , Yan-Quan Feng , Dong-Dong Hou , Egon Schulte

For every $k \geq 2$ and $n \geq 2$ we construct $n$ pairwise homotopically inequivalent simply-connected, closed $4k$-dimensional manifolds, all of which are stably diffeomorphic to one another. Each of these manifolds has hyperbolic…

Geometric Topology · Mathematics 2021-10-22 Anthony Conway , Diarmuid Crowley , Mark Powell , Joerg Sixt

In the first part we survey some of the known results and conjectures on compact Hyperkaehler (HK) manifolds. In the second part we presents a program which aims to show that HK four-folds whose second cohomology (with 4-tuple cup-product)…

Algebraic Geometry · Mathematics 2010-05-19 Kieran G. O'Grady

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

Combinatorics · Mathematics 2026-02-20 Torben Donzelmann , Thiago Holleben , Martina Juhnke

Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…

Atomic and Molecular Clusters · Physics 2022-09-20 KLaus E. Hermann

In 1988, Kalai extended a construction of Billera and Lee to produce many triangulated (d-1)-spheres. In fact, in view of upper bounds on the number of simplicial d-polytopes by Goodman and Pollack, he derived that for every dimension d>=5,…

Combinatorics · Mathematics 2007-05-23 Julian Pfeifle
‹ Prev 1 3 4 5 6 7 10 Next ›