|
Hyperbolic Group
In group theory, more precisely in geometric group theory, a hyperbolic group, also known as a ''word hyperbolic group'' or ''Gromov hyperbolic group'', is a finitely generated group equipped with a word metric satisfying certain properties abstracted from classical hyperbolic geometry. The notion of a hyperbolic group was introduced and developed by . The inspiration came from various existing mathematical theories: hyperbolic geometry but also low-dimensional topology (in particular the results of Max Dehn concerning the fundamental group of a hyperbolic Riemann surface, and more complex phenomena in three-dimensional topology), and combinatorial group theory. In a very influential (over 1000 citations ) chapter from 1987, Gromov proposed a wide-ranging research program. Ideas and foundational material in the theory of hyperbolic groups also stem from the work of George Mostow, William Thurston, James W. Cannon, Eliyahu Rips, and many others. Definition Let G be a finitely g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Theory
In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field (mathematics), fields, and vector spaces, can all be seen as groups endowed with additional operation (mathematics), operations and axioms. Groups recur throughout mathematics, and the methods of group theory have influenced many parts of algebra. Linear algebraic groups and Lie groups are two branches of group theory that have experienced advances and have become subject areas in their own right. Various physical systems, such as crystals and the hydrogen atom, and Standard Model, three of the four known fundamental forces in the universe, may be modelled by symmetry groups. Thus group theory and the closely related representation theory have many important applications in physics, chemistry, and materials science. Group theory is also ce ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
δ-hyperbolic Space
In mathematics, a hyperbolic metric space is a metric space satisfying certain metric relations (depending quantitatively on a nonnegative real number δ) between points. The definition, introduced by Mikhael Gromov, generalizes the metric properties of classical hyperbolic geometry and of trees. Hyperbolicity is a large-scale property, and is very useful to the study of certain infinite groups called Gromov-hyperbolic groups. Definitions In this paragraph we give various definitions of a \delta-hyperbolic space. A metric space is said to be (Gromov-) hyperbolic if it is \delta-hyperbolic for some \delta > 0. Definition using the Gromov product Let (X,d) be a metric space. The Gromov product of two points y, z \in X with respect to a third one x \in X is defined by the formula: :(y,z)_x = \frac 1 2 \left( d(x, y) + d(x, z) - d(y, z) \right). Gromov's definition of a hyperbolic metric space is then as follows: X is \delta-hyperbolic if and only if all x,y,z,w \in X satisfy ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fuchsian Group
In mathematics, a Fuchsian group is a discrete subgroup of PSL(2,R). The group PSL(2,R) can be regarded equivalently as a group of isometries of the hyperbolic plane, or conformal transformations of the unit disc, or conformal transformations of the upper half plane, so a Fuchsian group can be regarded as a group acting on any of these spaces. There are some variations of the definition: sometimes the Fuchsian group is assumed to be finitely generated, sometimes it is allowed to be a subgroup of PGL(2,R) (so that it contains orientation-reversing elements), and sometimes it is allowed to be a Kleinian group (a discrete subgroup of PSL(2,C)) which is conjugate to a subgroup of PSL(2,R). Fuchsian groups are used to create Fuchsian models of Riemann surfaces. In this case, the group may be called the Fuchsian group of the surface. In some sense, Fuchsian groups do for non-Euclidean geometry what crystallographic groups do for Euclidean geometry. Some Escher graphics are based on t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hyperbolic Plane
In mathematics, hyperbolic geometry (also called Lobachevskian geometry or Bolyai– Lobachevskian geometry) is a non-Euclidean geometry. The parallel postulate of Euclidean geometry is replaced with: :For any given line ''R'' and point ''P'' not on ''R'', in the plane containing both line ''R'' and point ''P'' there are at least two distinct lines through ''P'' that do not intersect ''R''. (Compare the above with Playfair's axiom, the modern version of Euclid's parallel postulate.) Hyperbolic plane geometry is also the geometry of pseudospherical surfaces, surfaces with a constant negative Gaussian curvature. Saddle surfaces have negative Gaussian curvature in at least some regions, where they locally resemble the hyperbolic plane. A modern use of hyperbolic geometry is in the theory of special relativity, particularly the Minkowski model. When geometers first realised they were working with something other than the standard Euclidean geometry, they described their geomet ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modular Group
In mathematics, the modular group is the projective special linear group of matrices with integer coefficients and determinant 1. The matrices and are identified. The modular group acts on the upper-half of the complex plane by fractional linear transformations, and the name "modular group" comes from the relation to moduli spaces and not from modular arithmetic. Definition The modular group is the group of linear fractional transformations of the upper half of the complex plane, which have the form :z\mapsto\frac, where , , , are integers, and . The group operation is function composition. This group of transformations is isomorphic to the projective special linear group , which is the quotient of the 2-dimensional special linear group over the integers by its center . In other words, consists of all matrices :\begin a & b \\ c & d \end where , , , are integers, , and pairs of matrices and are considered to be identical. The group operation is the usual mult ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modular Group
In mathematics, the modular group is the projective special linear group of matrices with integer coefficients and determinant 1. The matrices and are identified. The modular group acts on the upper-half of the complex plane by fractional linear transformations, and the name "modular group" comes from the relation to moduli spaces and not from modular arithmetic. Definition The modular group is the group of linear fractional transformations of the upper half of the complex plane, which have the form :z\mapsto\frac, where , , , are integers, and . The group operation is function composition. This group of transformations is isomorphic to the projective special linear group , which is the quotient of the 2-dimensional special linear group over the integers by its center . In other words, consists of all matrices :\begin a & b \\ c & d \end where , , , are integers, , and pairs of matrices and are considered to be identical. The group operation is the usual mult ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tree (graph Theory)
In graph theory In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are conne ..., a tree is an undirected graph in which any two Vertex (graph theory), vertices are connected by ''exactly one'' Path (graph theory), path, or equivalently a Connected graph, connected Cycle (graph theory), acyclic undirected graph. A forest is an undirected graph in which any two vertices are connected by ''at most one'' path, or equivalently an acyclic undirected graph, or equivalently a Disjoint union of graphs, disjoint union of trees. A polytreeSee . (or directed tree or oriented treeSee .See . or singly connected networkSee .) is a directed acyclic graph (DAG) whose underlying undirected graph is a tree. A polyforest (or directed forest or oriented forest) is a directed acyclic graph whose underlying undirecte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Free Group
In mathematics, the free group ''F''''S'' over a given set ''S'' consists of all words that can be built from members of ''S'', considering two words to be different unless their equality follows from the group axioms (e.g. ''st'' = ''suu''−1''t'', but ''s'' ≠''t''−1 for ''s'',''t'',''u'' ∈ ''S''). The members of ''S'' are called generators of ''F''''S'', and the number of generators is the rank of the free group. An arbitrary group ''G'' is called free if it is isomorphic to ''F''''S'' for some subset ''S'' of ''G'', that is, if there is a subset ''S'' of ''G'' such that every element of ''G'' can be written in exactly one way as a product of finitely many elements of ''S'' and their inverses (disregarding trivial variations such as ''st'' = ''suu''−1''t''). A related but different notion is a free abelian group; both notions are particular instances of a free object from universal algebra. As such, free groups are defined by their universal property. History Free ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Infinite Dihedral Group
In mathematics, the infinite dihedral group Dih∞ is an infinite group with properties analogous to those of the finite dihedral groups. In two-dimensional geometry, the infinite dihedral group represents the frieze group symmetry, ''p1m1'', seen as an infinite set of parallel reflections along an axis. Definition Every dihedral group is generated by a rotation ''r'' and a reflection; if the rotation is a rational multiple of a full rotation, then there is some integer ''n'' such that ''rn'' is the identity, and we have a finite dihedral group of order 2''n''. If the rotation is ''not'' a rational multiple of a full rotation, then there is no such ''n'' and the resulting group has infinitely many elements and is called Dih∞. It has presentations :\langle r, s \mid s^2 = 1, srs = r^ \rangle \,\! :\langle x, y \mid x^2 = y^2 = 1 \rangle \,\! and is isomorphic to a semidirect product of Z and Z/2, and to the free product Z/2 * Z/2. It is the automorphism group of the graph con ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Virtually Cyclic Group
In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of invertible elements with a single associative binary operation, and it contains an element ''g'' such that every other element of the group may be obtained by repeatedly applying the group operation to ''g'' or its inverse. Each element can be written as an integer power of ''g'' in multiplicative notation, or as an integer multiple of ''g'' in additive notation. This element ''g'' is called a ''generator'' of the group. Every infinite cyclic group is isomorphic to the additive group of Z, the integers. Every finite cyclic group of order ''n'' is isomorphic to the additive group of Z/''n''Z, the integers modulo ''n''. Every cyclic group is an abelian group (meaning that its group operation is commutative), and every finitely generated abelian group is a d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Groups
Finite is the opposite of infinite. It may refer to: * Finite number (other) * Finite set, a set whose cardinality (number of elements) is some natural number * Finite verb, a verb form that has a subject, usually being inflected or marked for person and/or tense or aspect * "Finite", a song by Sara Groves from the album '' Invisible Empires'' See also * * Nonfinite (other) Nonfinite is the opposite of finite * a nonfinite verb is a verb that is not capable of serving as the main verb in an independent clause * a non-finite clause In linguistics, a non-finite clause is a dependent or embedded clause that represen ... {{disambiguation fr:Fini it:Finito ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Commensurability (group Theory)
In mathematics, specifically in group theory, two groups are commensurable if they differ only by a finite amount, in a precise sense. The commensurator of a subgroup is another subgroup, related to the normalizer. Commensurability in group theory Two groups ''G''1 and ''G''2 are said to be (abstractly) commensurable if there are subgroups ''H''1 ⊂ ''G''1 and ''H''2 ⊂ ''G''2 of finite index such that ''H''1 is isomorphic to ''H''2. For example: *A group is finite if and only if it is commensurable with the trivial group. *Any two finitely generated free groups on at least 2 generators are commensurable with each other. The group ''SL''(2,Z) is also commensurable with these free groups. *Any two surface groups of genus at least 2 are commensurable with each other. A different but related notion is used for subgroups of a given group. Namely, two subgroups Γ1 and Γ2 of a group ''G'' are said to be commensurable if the intersection Γ1 ∩ Γ2 is of finite index in both Π... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
