Related papers: Classification of Six-Point Metrics
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…
The problem of classification of cubic homogeneous Finslerian 3D metrics with respect to their isometries is considered. It is shown, that there are 6 different general affine types of such metrics. Algebras of isometries are presented in…
For real irreducible algebraic curves of the seventh degree, there are 22 types of singular points of multiplicity six, 174 types of singular points of multiplicity five, and at least 182 types of singular points of multiplicity four. For…
To a generic configuration of eight points in convex position in the plane, we associate a list consisting of the following information: for all of the 56 conics determined by five of the points, we specify the position of each remaining…
There are 106 individual types of singular points for reducible complex sextic curves.
Let six points $1, ...6$ lie in general position in the real projective plane and consider the pencil of nodal cubics based at these points, with node at one of them, say 1. This pencil has five reducible cubics. We call combinatorial cubic…
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensional and non-degenerate cases. Finschi and…
We present a fast enumeration algorithm for combinatorial 2- and 3-manifolds. In particular, we enumerate all triangulated surfaces with 11 and 12 vertices and all triangulated 3-manifolds with 11 vertices. We further determine all…
Smooth algebraic plane quartics over algebraically closed fields have 28 bitangent lines. Their tropical counterparts often have infinitely many bitangents. They are grouped into seven equivalence classes, one for each linear system…
In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and $n$ additional vertices. In this note, we study how many ways a combinatorial triangulation…
It is well-known that the Euclidean plane has a standard 6-regular geodesic triangulation , and the unit sphere has a 5-regular geodesic triangulation, which is induced from the regular Dodecahedron, and the hyperbolic plane has an…
A connected combinatorial 2-manifold is called degree-regular if each of its vertices have the same degree. A connected combinatorial 2-manifold is called weakly regular if it has a vertex-transitive automorphism group. Clearly, a weakly…
In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…
We compute the generalized triangle inequalities explicitly for all rank 3 symmetric spaces. We find that for Sp(6) the corresponding polyhedral cone has 102 facets and 51 edges.
We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. A focus is given to dimension 3 where slicings are normal surfaces. In the case of 2-neighborly 3-manifolds and quadrangulated slicings, a…
According to a computer search conducted by the author and described in [7], in $Q^+(6, 4)$ there are two types of hyperovals, having 72 and 96 points, respectively. Here we give geometric descriptions for these examples.
We give a complete enumeration of all combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product $S^2\times S^1$ and 615…