Bouquets of circles for lamination languages and complexities
نویسندگان
چکیده
منابع مشابه
Bouquets of circles for lamination languages and complexities
Laminations are classic sets of disjoint and non-self-crossing curves on surfaces. Lamination languages are languages of two-way infinite words which code laminations by using associated labeled embedded graphs, and which are subshifts. Here, we characterize the possible exact affine factor complexities of these languages through bouquets of circles, i.e. graphs made of one vertex, as represent...
متن کاملQuaternionic Product of Circles and Cycles and Octonionic Product for Pairs of Circles
This paper concerns with a product of circles induced by the quaternionic product considered in a projective manner. Several properties of this composition law are derived and on this way we arrive at some special numbers as roots or powers of unit. We extend this product to cycles as oriented circles and to pairs of circles by using the algebra of octonions. Three applications of the given pro...
متن کاملA formula for the coincidence Reidemeister trace of selfmaps on bouquets of circles
We give a formula for the coincidence Reidemeister trace of selfmaps on bouquets of circles in terms of the Fox calculus. Our formula reduces the problem of computing the coincidence Reidemeister trace to the problem of distinguishing doubly twisted conjugacy classes in free groups.
متن کاملFlexibility of Embeddings of Bouquets of Circles on the Projective Plane and Klein Bottle
In this paper, we study the flexibility of embeddings of bouquets of circles on the projective plane and the Klein bottle. The numbers (of equivalence classes) of embeddings of bouquets of circles on these two nonorientable surfaces are obtained in explicit expressions. As their applications, the numbers (of isomorphism classes) of rooted one-vertex maps on these two nonorientable surfaces are ...
متن کاملGeneralised Entropy and Asymptotic Complexities of Languages
In this paper the concept of asymptotic complexity of languages is introduced. This concept formalises the notion of learnability in a particular environment and generalises Lutz and Fortnow’s concepts of predictability and dimension. Then asymptotic complexities in different prediction environments are compared by describing the set of all pairs of asymptotic complexities w.r.t. different envi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2014
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2014016