Generating even triangulations on the torus

A triangulation on a surface $\mathbf{F}$ is a fixed embedding of a loopless graph on $\mathbf{F}$ with each face bounded by a cycle of length three. A triangulation is even if each vertex has even degree. We define two reductions for even triangulations on surfaces, called the 4-contraction and the twin-contraction. In this paper, we first determine the complete list of minimal 3-connected even triangulations on the torus with respect to these two reductions. Secondly, allowing a vertex of degree 2 and replacing the twin-contraction with another reduction, called the 2-contraction, we establish the list for all minimal even triangulations on the torus. We also describe several applications of the lists for solving problems on even triangulations.     

Degree-regular triangulations of torus and Klein bottle

A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices have the same degree. Clearly, a weakly regular triangulation is degree-regular. In [8], Lutz has classified all the weakly regular triangulations on at most 15 vertices. In [5], Datta and Nilakantan have classified all the degree-regular triangulations of closed surfaces on at most 11 vertices. In this article, we have proved that any degree-regular triangulation of the torus is weakly regular. We have shown that there exists ann-vertex degree-regular triangulation of the Klein bottle if and only if n is a composite number ≥ 9. We have constructed two distinctn-vertex weakly regular triangulations of the torus for eachn ≥ 12 and a (4m + 2)-vertex weakly regular triangulation of the Klein bottle for eachm ≥ 2. For 12 ≤n ≤ 15, we have classified all then-vertex degree-regular triangulations of the torus and the Klein bottle. There are exactly 19 such triangulations, 12 of which are triangulations of the torus and remaining 7 are triangulations of the Klein bottle. Among the last 7, only one is weakly regular.     

Clean triangulations

A polyhedron on a surface is called a clean triangulation if each face is a triangle and each triangle is a face. LetS _p (resp.N _p ) be the closed orientable (resp. nonorlentable) surface of genusp. If (S) is the smallest possible number of triangles in a clean triangulation ofS, the results are: (N ₁)=20, (S ₁)=24, lim(S _p )p ^–1=4, lim(N _p )p ^–1=2 forp.     

典型根系中不可约子根系的数目

Let Ф be an irreducible root system of classical type. In this short note, we study the irreducible subsystems of Ф and compute the number of irreducible subsystems of any rank k in Ф.     

2-isohedral triangulations

A triangulations is 2-isohedral iff there are exactly two orbits of triangles under the triangulation's symmetry group. 2-isohedral triangulations are classified using incidence symbols. This also determines the homeomeric types of 2-isohedral triangulation. There are 38 types. The proof is by aggregation into isohedral tilings and by reflection axis splitting.     

Variable resolution triangulations

A comprehensive study of multiresolution decompositions of planar domains into triangles is given. A general model is introduced, called a Multi-Triangulation (MT), which is based on a collection of fragments of triangulations arranged into a directed acyclic graph. Different decompositions of a domain can be obtained by combining different fragments of the model. Theoretical results on the expressive power of the MT are given. An efficient algorithm is proposed that can extract a triangulation from the MT, whose level of detail is variable over the domain according to a given threshold function. The algorithm works in linear time, and the extracted representation has minimum size among all possible triangulations that can be built from triangles in the MT, and that satisfy the given level of detail. Major applications of these results are in real-time rendering of complex surfaces, such as topographic surfaces in flight simulation.     

Products of foldable triangulations

Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. The (weighted) size difference of this bipartition is a lower bound for the number of real roots of certain sparse polynomial systems by recent results of Soprunova and Sottile [E. Soprunova, F. Sottile, Lower bounds for real solutions to sparse polynomial systems, Adv. Math. 204 (1) (2006) 116–151]. Special attention is paid to the cube case.     

Acute triangulations of trapezoids

In this paper we discuss acute triangulations of trapezoids. It is known that every rectangle can be triangulated into eight acute triangles, and that this is best possible. In this paper we prove that all other trapezoids can be triangulated into at most seven acute triangles.     

Generating the triangulations of the projective plane

Using the operations of face splitting and its dual, vertex splitting, one can generate all of the triangulations of the projective plane from two minimal triangulations. One of the minimal triangulations is the familiar embedding of the complete graph on 6 vertices. The other is a triangulation with 7 vertices.     

On the average length of Delaunay triangulations

We shall show that on the average, the total length of a Delaunay triangulation is of the same order as that of a minimum triangulation, under the assumption that our points are drawn from a homogeneous planar Poisson point distribution.     

Equilibrium triangulations of the complex projective plane

Starting with the well-known 7-vertex triangulation of the ordinary torus, we construct a 10-vertex triangulation of P² which fits the equilibrium decomposition of P² in the simplest possible way. By suitable positioning of the vertices, the full automorphism group of order 42 is realized by a discrete group of isometries in the Fubini-Study metric. A slight subdivision leads to an elementary proof of the theorem of Kuiper-Massey which says that P² modulo conjugation is PL homeomorphic to the standard 4-sphere. The branch locus of this identification is a 7-vertex triangulation P ₂ ⁷ of the real projective plane. We also determine all tight simplicial embeddings of P ₂ ¹⁰ and P ₂ ⁷ .     

Generating even triangulations of the projective plane

We shall determine the 20 families of irreducible even triangulations of the projective plane. Every even triangulation of the projective plane can be obtained from one of them by a sequence of even‐splittings and attaching octahedra, both of which were first given by Batagelj 2 . © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 333–349, 2007     

Separating diffeomorphisms of the torus

There exists a diffeomorphism on the n-dimensional torus Tⁿ which is conjugate with a hyperbolic linear automorphism, but is not an Anosov diffeomorphism. A diffeomorphismf: Tⁿ→Tⁿ has such a property iff is separating and belongs to the C⁰ closure of the Anosov diffeomorphisms.     

Hamiltonian embeddings from triangulations

A Hamiltonian embedding of K_n is an embedding of K_n in a surface,which may be orientable or non-orientable, in such a way thatthe boundary of each face is a Hamiltonian cycle. Ellinghamand Stephens recently established the existence of such embeddingsin non-orientable surfaces for n = 4 and n 6. Here we presentan entirely new construction which produces Hamiltonian embeddingsof K_n from triangulations of K_n when n 0 or 1 (mod 3). We thenuse this construction to obtain exponential lower bounds forthe numbers of nonisomorphic Hamiltonian embeddings of K_n.     

一些(双)代数的不可约表示

本文完全刻画了下列代数k,k,k(x,Y,Z|ZX-qXZ=1-θY2,ZY=qYZ,YX= qXY>和M(p,q)=k的不可约表示．