113 research outputs found
Diagonal flips in Hamiltonian triangulations on the projective plane
AbstractIn this paper, we shall prove that any two triangulations on the projective plane with n vertices can be transformed into each other by at most 8n-26 diagonal flips, up to isotopy. To prove it, we focus on triangulations on the projective plane with contractible Hamilton cycles
Irreducible triangulations of surfaces with boundary
A triangulation of a surface is irreducible if no edge can be contracted to
produce a triangulation of the same surface. In this paper, we investigate
irreducible triangulations of surfaces with boundary. We prove that the number
of vertices of an irreducible triangulation of a (possibly non-orientable)
surface of genus g>=0 with b>=0 boundaries is O(g+b). So far, the result was
known only for surfaces without boundary (b=0). While our technique yields a
worse constant in the O(.) notation, the present proof is elementary, and
simpler than the previous ones in the case of surfaces without boundary
Triangulating the Real Projective Plane
We consider the problem of computing a triangulation of the real projective
plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a
triangulation of P2 always exists if at least six points in S are in general
position, i.e., no three of them are collinear. We also design an algorithm for
triangulating P2 if this necessary condition holds. As far as we know, this is
the first computational result on the real projective plane
Contractible Hamiltonian Cycles in Polyhedral Maps
We present a necessary and sufficient condition for existence of a
contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces.
We also present an algorithm to construct such cycles. This is further
generalized and shown to hold for more general maps.Comment: 9 pages, 1 figur
Hamiltonian submanifolds of regular polytopes
We investigate polyhedral -manifolds as subcomplexes of the boundary
complex of a regular polytope. We call such a subcomplex {\it -Hamiltonian}
if it contains the full -skeleton of the polytope. Since the case of the
cube is well known and since the case of a simplex was also previously studied
(these are so-called {\it super-neighborly triangulations}) we focus on the
case of the cross polytope and the sporadic regular 4-polytopes. By our results
the existence of 1-Hamiltonian surfaces is now decided for all regular
polytopes.
Furthermore we investigate 2-Hamiltonian 4-manifolds in the -dimensional
cross polytope. These are the "regular cases" satisfying equality in Sparla's
inequality. In particular, we present a new example with 16 vertices which is
highly symmetric with an automorphism group of order 128. Topologically it is
homeomorphic to a connected sum of 7 copies of . By this
example all regular cases of vertices with or, equivalently, all
cases of regular -polytopes with are now decided.Comment: 26 pages, 4 figure
Stacked polytopes and tight triangulations of manifolds
Tightness of a triangulated manifold is a topological condition, roughly
meaning that any simplexwise linear embedding of the triangulation into
euclidean space is "as convex as possible". It can thus be understood as a
generalization of the concept of convexity. In even dimensions,
super-neighborliness is known to be a purely combinatorial condition which
implies the tightness of a triangulation.
Here we present other sufficient and purely combinatorial conditions which
can be applied to the odd-dimensional case as well. One of the conditions is
that all vertex links are stacked spheres, which implies that the triangulation
is in Walkup's class . We show that in any dimension
\emph{tight-neighborly} triangulations as defined by Lutz, Sulanke and Swartz
are tight.
Furthermore, triangulations with -stacked vertex links and the centrally
symmetric case are discussed.Comment: 28 pages, 2 figure
Triangulating the Real Projective Plane
We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general position, i.e., no three of them are collinear. We also design an algorithm for triangulating P2 if this necessary condition holds. As far as we know, this is the first computational result on the real projective plane
The quantum dilogarithm and representations quantum cluster varieties
We construct, using the quantum dilogarithm, a series of *-representations of
quantized cluster varieties. This includes a construction of infinite
dimensional unitary projective representations of their discrete symmetry
groups - the cluster modular groups. The examples of the latter include the
classical mapping class groups of punctured surfaces.
One of applications is quantization of higher Teichmuller spaces.
The constructed unitary representations can be viewed as analogs of the Weil
representation. In both cases representations are given by integral operators.
Their kernels in our case are the quantum dilogarithms.
We introduce the symplectic/quantum double of cluster varieties and related
them to the representations.Comment: Dedicated to David Kazhdan for his 60th birthday. The final version.
To appear in Inventiones Math. The last Section of the previous versions was
removed, and will become a separate pape
Discrete Geometry (hybrid meeting)
A number of important recent developments in various branches of
discrete geometry were presented at the workshop, which took place in
hybrid format due to a pandemic situation. The presentations
illustrated both the diversity of the area and its strong connections
to other fields of mathematics such as topology, combinatorics,
algebraic geometry or functional analysis. The open questions abound
and many of the results presented were obtained by young researchers,
confirming the great vitality of discrete geometry
- …