Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 Hannah Vogel Mathematics , 2015, Abstract: Asymptotic triangulations can be viewed as limits of triangulations under the action of the mapping class group. In the case of the annulus, such triangulations have been introduced by Baur and Dupont. We construct an alternative method of obtaining these asymptotic triangulations using Coxeter transformations. This provides us with an algebraic and combinatorial framework for studying these limits via the associated quivers.
 A. Felikson Mathematics , 2002, DOI: 10.1070/SM2002v193n12ABEH000702 Abstract: We classify Coxeter decompositions of hyperbolic tetrahedra, i.e. simplices in the hyperbolic space H^3. The paper completes the classification of Coxeter decompositions of hyperbolic simplices.
 A. Felikson Mathematics , 2002, Abstract: Let X be a space of constant curvature and P be a convex polyhedron in X. A Coxeter decomposition of the polyhedron P is a decomposition of P into finitely many Coxeter polyhedra, such that any two polyhedra having a common facet are symmetric with respect to this facet. In this paper we classify Coxeter decompositions of simplices in hyperbolic space of dimension greater than 3. The problem is close to the classification of the finite index subgroups in the discrete hyperbolic reflection groups.
 Mathematics , 2009, Abstract: We introduce a notion of essential hyperbolic Coxeter polytope as a polytope which fits some minimality conditions. The problem of classification of hyperbolic reflection groups can be easily reduced to classification of essential Coxeter polytopes. We determine a potentially large combinatorial class of polytopes containing, in particular, all the compact hyperbolic Coxeter polytopes of dimension at least 6 which are known to be essential, and prove that this class contains finitely many polytopes only. We also construct an effective algorithm of classifying polytopes from this class, realize it in four-dimensional case, and formulate a conjecture on finiteness of the number of essential polytopes.
 Mathematics , 2003, Abstract: We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and we improve lower bounds for covers and triangulations in dimensions 4 through at least 12 (and possibly more dimensions as well). Important ingredients are an analysis of the number of exterior faces that a simplex in the cube can have of a specified dimension and volume, and a characterization of corner simplices in terms of their exterior faces.
 Brent Everitt Mathematics , 2002, Abstract: The rich theory of Coxeter groups is used to provide an algebraic construction of finite volume hyperbolic n-manifolds. Combinatorial properties of finite images of these groups can be used to compute the volumes of the resulting manifolds. Three examples, in 4,5 and 6-dimensions, are given, each of very small volume, and in one case of smallest possible volume.
 John Mcleod Advances in Pure Mathematics (APM) , 2013, DOI: 10.4236/apm.2013.31010 Abstract: Hyperbolic Coxeter polytopes are defined precisely by combinatorial type. Polytopes in hyperbolic n-space with n + p faces that have the combinatorial type of a pyramid over a product of simplices were classified by Tumarkin for small p. In this article we generalise Tumarkin’s methods and find the remaining hyperbolic Coxeter pyramids.
 Mathematics , 2009, Abstract: For an arbitrary cocompact hyperbolic Coxeter group G with finite generator set S and complete growth function P(x)/Q(x), we provide a recursion formula for the coefficients of the denominator polynomial Q(x) which allows to determine recursively the Taylor coefficients and the pole behavior of the growth function of G in terms of its Coxeter subgroup structure. We illustrate this in the easy case of compact right-angled hyperbolic n-polytopes. Finally, we provide detailed insight into the case of Coxeter groups with at most 6 generators, acting cocompactly on hyperbolic 4-space, by considering the three combinatorially different families discovered and classified by Lanner, Kaplinskaya and Esselmann, respectively.
 Mathematics , 2005, Abstract: A polytope in the hyperbolic space $\H^n$ is called an {\it ideal polytope} if all its vertices belong to the boundary of $\H^n$. We prove that no simple ideal Coxeter polytope exist in $\H^n$ for $n>8$.
 Nicolas Curien Mathematics , 2014, Abstract: Pursuing the approach of Angel & Ray, we introduce and study a family of random infinite triangulations of the full-plane that satisfy a natural spatial Markov property. These new random lattices naturally generalize Angel & Schramm's Uniform Infinite Planar Triangulation (UIPT) and are hyperbolic in flavor. We prove that they exhibit a sharp exponential volume growth, are non-Liouville, and that the simple random walk on them has positive speed almost surely. We conjecture that these infinite triangulations are the local limits of uniform triangulations whose genus is proportional to the size.
 Page 1 /100 Display every page 5 10 20 Item