Iterated Monodromy Group
   HOME
*





Iterated Monodromy Group
In geometric group theory and dynamical systems the iterated monodromy group of a covering map is a group describing the monodromy action of the fundamental group on all iterations of the covering. A single covering map between spaces is therefore used to create a tower of coverings, by placing the covering over itself repeatedly. In terms of the Galois theory of covering spaces, this construction on spaces is expected to correspond to a construction on groups. The iterated monodromy group provides this construction, and it is applied to encode the combinatorics and symbolic dynamics of the covering, and provide examples of self-similar groups. Definition The iterated monodromy group of ''f'' is the following quotient group: :\mathrmf := \frac where : *f:X_1\rightarrow X is a covering of a path-connected and locally path-connected topological space ''X'' by its subset X_1, * \pi_1 (X, t) is the fundamental group of ''X'' and * \digamma :\pi_1 (X, t)\rightarrow \mathrm\,f^(t) i ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Geometric Group Theory
Geometric group theory is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such group (mathematics), groups and topology, topological and geometry, geometric properties of spaces on which these groups Group action (mathematics), act (that is, when the groups in question are realized as geometric symmetries or continuous transformations of some spaces). Another important idea in geometric group theory is to consider finitely generated groups themselves as geometric objects. This is usually done by studying the Cayley graphs of groups, which, in addition to the graph (discrete mathematics), graph structure, are endowed with the structure of a metric space, given by the so-called word metric. Geometric group theory, as a distinct area, is relatively new, and became a clearly identifiable branch of mathematics in the late 1980s and early 1990s. Geometric group theory closely interacts with low-dimens ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Rational Function
In mathematics, a rational function is any function that can be defined by a rational fraction, which is an algebraic fraction such that both the numerator and the denominator are polynomials. The coefficients of the polynomials need not be rational numbers; they may be taken in any field ''K''. In this case, one speaks of a rational function and a rational fraction ''over K''. The values of the variables may be taken in any field ''L'' containing ''K''. Then the domain of the function is the set of the values of the variables for which the denominator is not zero, and the codomain is ''L''. The set of rational functions over a field ''K'' is a field, the field of fractions of the ring of the polynomial functions over ''K''. Definitions A function f(x) is called a rational function if and only if it can be written in the form : f(x) = \frac where P\, and Q\, are polynomial functions of x\, and Q\, is not the zero function. The domain of f\, is the set of all values of x\ ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Geometric Group Theory
Geometric group theory is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such group (mathematics), groups and topology, topological and geometry, geometric properties of spaces on which these groups Group action (mathematics), act (that is, when the groups in question are realized as geometric symmetries or continuous transformations of some spaces). Another important idea in geometric group theory is to consider finitely generated groups themselves as geometric objects. This is usually done by studying the Cayley graphs of groups, which, in addition to the graph (discrete mathematics), graph structure, are endowed with the structure of a metric space, given by the so-called word metric. Geometric group theory, as a distinct area, is relatively new, and became a clearly identifiable branch of mathematics in the late 1980s and early 1990s. Geometric group theory closely interacts with low-dimens ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Julia Set
In the context of complex dynamics, a branch of mathematics, the Julia set and the Fatou set are two complementary sets (Julia "laces" and Fatou "dusts") defined from a function. Informally, the Fatou set of the function consists of values with the property that all nearby values behave similarly under repeated iteration of the function, and the Julia set consists of values such that an arbitrarily small perturbation can cause drastic changes in the sequence of iterated function values. Thus the behavior of the function on the Fatou set is "regular", while on the Julia set its behavior is "chaotic". The Julia set of a function    is commonly denoted \operatorname(f), and the Fatou set is denoted \operatorname(f). These sets are named after the French mathematicians Gaston Julia and Pierre Fatou whose work began the study of complex dynamics during the early 20th century. Formal definition Let f(z) be a non-constant holomorphic function from the Riemann sphere on ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Complex Dynamics
Complex dynamics is the study of dynamical systems defined by Iterated function, iteration of functions on complex number spaces. Complex analytic dynamics is the study of the dynamics of specifically analytic functions. Techniques *General **Montel's theorem **Poincaré metric **Schwarz lemma **Riemann mapping theorem **Carathéodory's theorem (conformal mapping) **Böttcher's equation *Combinatorics, Combinatorial ** Hubbard trees ** Spider algorithm ** Tuning **Lamination (topology), Laminations **Cantor function, Devil's Staircase algorithm (Cantor function) **Orbit portraits **Jean-Christophe Yoccoz, Yoccoz puzzles Parts * Holomorphic dynamics (dynamics of holomorphic functions) ** in one complex variable ** in several complex variables * Conformal dynamics unites holomorphic dynamics in one complex variable with differentiable dynamics in one real variable. See also *Arithmetic dynamics *Chaos theory *Complex analysis *Complex quadratic polynomial *Fatou set *Infinite co ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Amenable Group
In mathematics, an amenable group is a locally compact topological group ''G'' carrying a kind of averaging operation on bounded functions that is invariant under translation by group elements. The original definition, in terms of a finitely additive measure (or mean) on subsets of ''G'', was introduced by John von Neumann in 1929 under the German name "messbar" ("measurable" in English) in response to the Banach–Tarski paradox. In 1949 Mahlon M. Day introduced the English translation "amenable", apparently as a pun on "''mean''". The amenability property has a large number of equivalent formulations. In the field of analysis, the definition is in terms of linear functionals. An intuitive way to understand this version is that the support of the regular representation is the whole space of irreducible representations. In discrete group theory, where ''G'' has the discrete topology, a simpler definition is used. In this setting, a group is amenable if one can say what proport ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Growth Rate (group Theory)
In the mathematical subject of geometric group theory, the growth rate of a group with respect to a symmetric generating set describes how fast a group grows. Every element in the group can be written as a product of generators, and the growth rate counts the number of elements that can be written as a product of length ''n''. Definition Suppose ''G'' is a finitely generated group; and ''T'' is a finite ''symmetric'' set of generators (symmetric means that if x \in T then x^ \in T ). Any element x \in G can be expressed as a word in the ''T''-alphabet : x = a_1 \cdot a_2 \cdots a_k \text a_i\in T. Consider the subset of all elements of ''G'' that can be expressed by such a word of length ≤ ''n'' :B_n(G,T) = \. This set is just the closed ball of radius ''n'' in the word metric ''d'' on ''G'' with respect to the generating set ''T'': :B_n(G,T) = \. More geometrically, B_n(G,T) is the set of vertices in the Cayley graph with respect to ''T'' that are within distan ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Basilica Group
In Ancient Roman architecture, a basilica is a large public building with multiple functions, typically built alongside the town's forum. The basilica was in the Latin West equivalent to a stoa in the Greek East. The building gave its name to the architectural form of the basilica. Originally, a basilica was an ancient Roman public building, where courts were held, as well as serving other official and public functions. Basilicas are typically rectangular buildings with a central nave flanked by two or more longitudinal aisles, with the roof at two levels, being higher in the centre over the nave to admit a clerestory and lower over the side-aisles. An apse at one end, or less frequently at both ends or on the side, usually contained the raised tribunal occupied by the Roman magistrates. The basilica was centrally located in every Roman town, usually adjacent to the forum and often opposite a temple in imperial-era forums. Basilicas were also built in private residences and ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  



MORE