913 research outputs found
Shapes of polyhedra and triangulations of the sphere
The space of shapes of a polyhedron with given total angles less than 2\pi at
each of its n vertices has a Kaehler metric, locally isometric to complex
hyperbolic space CH^{n-3}. The metric is not complete: collisions between
vertices take place a finite distance from a nonsingular point. The metric
completion is a complex hyperbolic cone-manifold. In some interesting special
cases, the metric completion is an orbifold. The concrete description of these
spaces of shapes gives information about the combinatorial classification of
triangulations of the sphere with no more than 6 triangles at a vertex.Comment: 39 pages. Published copy, also available at
http://www.maths.warwick.ac.uk/gt/GTMon1/paper25.abs.htm
Intermediate Subfactors with No Extra Structure
If are type II_1 factors with
and finite we show that restrictions on the standard invariants of the
elementary inclusions , , and imply drastic restrictions on the indices and angles between the
subfactors. In particular we show that if these standard invariants are trivial
and the conditional expectations onto and do not commute, then
is 6 or . In the former case is the fixed point algebra for
an outer action of on and the angle is , and in the latter
case the angle is and an example may be found in the GHJ
subfactor family. The techniques of proof rely heavily on planar algebras.Comment: 51 pages, 65 figure
Transforming triangulations on non planar-surfaces
We consider whether any two triangulations of a polygon or a point set on a
non-planar surface with a given metric can be transformed into each other by a
sequence of edge flips. The answer is negative in general with some remarkable
exceptions, such as polygons on the cylinder, and on the flat torus, and
certain configurations of points on the cylinder.Comment: 19 pages, 17 figures. This version has been accepted in the SIAM
Journal on Discrete Mathematics. Keywords: Graph of triangulations,
triangulations on surfaces, triangulations of polygons, edge fli
Overlap properties of geometric expanders
The {\em overlap number} of a finite -uniform hypergraph is
defined as the largest constant such that no matter how we map
the vertices of into , there is a point covered by at least a
-fraction of the simplices induced by the images of its hyperedges.
In~\cite{Gro2}, motivated by the search for an analogue of the notion of graph
expansion for higher dimensional simplicial complexes, it was asked whether or
not there exists a sequence of arbitrarily large
-uniform hypergraphs with bounded degree, for which . Using both random methods and explicit constructions, we answer this
question positively by constructing infinite families of -uniform
hypergraphs with bounded degree such that their overlap numbers are bounded
from below by a positive constant . We also show that, for every ,
the best value of the constant that can be achieved by such a
construction is asymptotically equal to the limit of the overlap numbers of the
complete -uniform hypergraphs with vertices, as
. For the proof of the latter statement, we establish the
following geometric partitioning result of independent interest. For any
and any , there exists satisfying the
following condition. For any , for any point and
for any finite Borel measure on with respect to which
every hyperplane has measure , there is a partition into measurable parts of equal measure such that all but
at most an -fraction of the -tuples
have the property that either all simplices with
one vertex in each contain or none of these simplices contain
- …