Related papers: Trisecting the 9-vertex complex projective plane
Results on $8$-dimensional topological planes are scattered in the literature. It is the aim of the present paper to give a survey of these geometries, in particular of information obtained after the appearance of the treatise Compact…
In this paper we prove, that none of the three combinatorial 8- manifolds on 15 vertices constructed by Brehm and Kuhnel, each of which is a cohomology quaternionic projective plane, can be combinatorially embedded in the Euclidean…
We consider the problem of constructing triangulations of projective planes over Hurwitz algebras with minimal numbers of vertices. We observe that the numbers of faces of each dimension must be equal to the dimensions of certain…
We give a new proof of Steinitz's classical theorem in the case of plane triangulations, which allows us to obtain a new general bound on the grid size of the simplicial polytope realizing a given triangulation, subexponential in a number…
A method to construct trihamiltonian extensions of a separable system is presented. The procedure is tested for systems, with a natural Hamiltonian, separable in classical sense in one of the four orthogonal separable coordinate systems of…
It is known that any two triangulations of a compact 3-manifold are related by finite sequences of certain local transformations. We prove here an upper bound for the length of a shortest transformation sequence relating any two…
Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…
The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…
It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…
A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…
The convex feasibility problem asks to find a point in the intersection of a collection of nonempty closed convex sets. This problem is of basic importance in mathematics and the physical sciences, and projection (or splitting) methods…
We study Poncelet's Theorem in the four non-isomorphic finite projective planes of order 9. Among these planes, only the Desarguesian plane turns out to be a Poncelet plane, while the other three planes which are constructed over the…
Over the complex numbers, there are 92 plane conics meeting 8 general lines in projective 3-space. Using the Euler class and local degree from motivic homotopy theory, we give an enriched version of this result over any perfect field. This…
Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…
This paper explores and proves the one-seventh area triangle using a purely algebraic approach as opposed to a geometric one. A triangle set purely in the complex plane is used so that we can utilise features of the complex number system to…
Fake projective planes are smooth complex surfaces of general type with Betti numbers equal to that of the usual projective plane. Recent explicit constructions of fake projective planes embed them via their bicanonical embedding in…
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.
We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $n>0$, we show that there exists a space of geodesic…
In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…
A fake projective plane is a compact complex manifold of dimension 2 which has the same Betti numbers as the complex projective plane, but not isomorphic to the complex projective plane. As was shown by D. Mumford, there exists at least one…