اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAsymptotic rays
53
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We prove that a graph G is asymptotically isomorphic to the ray if and only if G is uniformly spherically bounded and is of bounded local degrees. This problem arouse in combinatorics and was posed in [3] (Problem 10.1).
قيم البحث
اقرأ أيضاً
We prove that graph products constructed over infinite graphs with bounded clique number preserve finite asymptotic dimension. We also study the extent to which Dranishnikovs property C, and Dranishnikov and Zarichnyis straight finite decomposition c
omplexity are preserved by constructions such as unions, free products, and group extensions.
The loop graph of an infinite type surface is an infinite diameter hyperbolic graph first studied in detail by Juliette Bavard. An important open problem in the study of infinite type surfaces is to describe the boundary of the loop graph as a space
of geodesic laminations. We approach this problem by constructing the first examples of 2-filling rays on infinite type surfaces. Such rays accumulate onto geodesic laminations which are in some sense filling, but without strong enough properties to correspond to points in the boundary of the loop graph. We give multiple constructions using both a hands-on combinatorial approach and an approach using train tracks and automorphisms of flat surfaces. In addition, our approaches are sufficiently robust to describe all 2-filling rays with certain other basic properties as well as to produce uncountably many distinct mapping class group orbits.
We construct a CW decomposition $C_n$ of the $n$-dimensional half cube in a manner compatible with its structure as a polytope. For each $3 leq k leq n$, the complex $C_n$ has a subcomplex $C_{n, k}$, which coincides with the clique complex of the ha
lf cube graph if $k = 4$. The homology of $C_{n, k}$ is concentrated in degree $k-1$ and furthermore, the $(k-1)$-st Betti number of $C_{n, k}$ is equal to the $(k-2)$-nd Betti number of the complement of the $k$-equal real hyperplane arrangement. These Betti numbers, which also appear in theoretical computer science, numerical analysis and engineering, are the coefficients of a certain Pascal-like triangle (Sloanes sequence A119258). The Coxeter groups of type $D_n$ act naturally on the complexes $C_{n, k}$, and thus on the associated homology groups.
We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s vertices. Let f
be a simplicial map of the graph S to the plane. The map f is approximable by embeddings if and only if for each i=0,...,s the i-th derivative of the map f (defined by Minc) neither contains transversal self-intersections nor is the standard winding of degree greater than 1. We deduce from the Minc result the completeness of the van Kampen obstruction to approximability by embeddings of piecewise linear maps of a segment to the plane. We also generalize these criteria to simplicial maps of a graph without vertices of degree >3 to a circle.
For any cluster algebra whose underlying combinatorial data can be encoded by a bordered surface with marked points, we construct a geometric realization in terms of suitable decorated Teichmueller space of the surface. On the geometric side, this re
quires opening the surface at each interior marked point into an additional geodesic boundary component. On the algebraic side, it relies on the notion of a non-normalized cluster algebra and the machinery of tropical lambda lengths. Our model allows for an arbitrary choice of coefficients which translates into a choice of a family of integral laminations on the surface. It provides an intrinsic interpretation of cluster variables as renormalized lambda lengths of arcs on the surface. Exchange relations are written in terms of the shear coordinates of the laminations, and are interpreted as generalized Ptolemy relations for lambda lengths. This approach gives alternative proofs for the main structural results from our previous paper, removing unnecessary assumptions on the surface.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
