اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSemi-regular tilings of the hyperbolic plane
70
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A semi-regular tiling of the hyperbolic plane is a tessellation by regular geodesic polygons with the property that each vertex has the same vertex-type, which is a cyclic tuple of integers that determine the number of sides of the polygons surrounding the vertex. We determine combinatorial criteria for the existence, and uniqueness, of a semi-regular tiling with a given vertex-type, and pose some open questions.
قيم البحث
اقرأ أيضاً
We study colorings of the hyperbolic plane, analogously to the Hadwiger-Nelson problem for the Euclidean plane. The idea is to color points using the minimum number of colors such that no two points at distance exactly $d$ are of the same color. The
problem depends on $d$ and, following a strategy of Kloeckner, we show linear upper bounds on the necessary number of colors. In parallel, we study the same problem on $q$-regular trees and show analogous results. For both settings, we also consider a variant which consists in replacing $d$ with an interval of distances.
We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.
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 triangulatio
n with respect to a constant curvature metric on $S$, and we list the possibilities. A key ingredient of the proof is to show that any two $d$-regular triangulations of the plane for $d> 6 $ are combinatorially equivalent. The proof of this uniqueness result, which is of independent interest, is based on an inductive argument involving some combinatorial topology.
If the face-cycles at all the vertices in a map on a surface are of same type then the map is called semi-equivelar. There are eleven types of Archimedean tilings on the plane. All the Archimedean tilings are semi-equivelar maps. If a map $X$ on the
torus is a quotient of an Archimedean tiling on the plane then the map $X$ is semi-equivelar. We show that each semi-equivelar map on the torus is a quotient of an Archimedean tiling on the plane. Vertex-transitive maps are semi-equivelar maps. We know that four types of semi-equivelar maps on the torus are always vertex-transitive and there are examples of other seven types of semi-equivelar maps which are not vertex-transitive. We show that the number of ${rm Aut}(Y)$-orbits of vertices for any semi-equivelar map $Y$ on the torus is at most six. In fact, the number of orbits is at most three except one type of semi-equivelar maps. Our bounds on the number of orbits are sharp.
A map $X$ on a surface is called vertex-transitive if the automorphism group of $X$ acts transitively on the set of vertices of $X$. If the face-cycles at all the vertices in a map are of same type then the map is called semi-equivelar. In general, s
emi-equivelar maps on a surface form a bigger class than vertex-transitive maps. There are semi-equivelar toroidal maps which are not vertex-transitive. In this article, we show that semi-equivelar toroidal maps are quotients of vertex-transitive toroidal maps. More explicitly, we prove that each semi-equivelar toroidal map has a finite vertex-transitive cover. In 2019, Drach {em et al.} have shown that each vertex-transitive toroidal map has a minimal almost regular cover. Therefore, semi-equivelar toroidal maps are quotients of almost regular toroidal maps.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
