HOME
*





Tietze Transformation
In group theory, Tietze transformations are used to transform a given presentation of a group into another, often simpler presentation of the same group. These transformations are named after Heinrich Franz Friedrich Tietze who introduced them in a paper in 1908. A presentation is in terms of ''generators'' and ''relations''; formally speaking the presentation is a pair of a set of named generators, and a set of words in the free group on the generators that are taken to be the relations. Tietze transformations are built up of elementary steps, each of which individually rather evidently takes the presentation to a presentation of an isomorphic group. These elementary steps may operate on generators or relations, and are of four kinds. Adding a relation If a relation can be derived from the existing relations then it may be added to the presentation without changing the group. Let G=〈 x , x3=1 〉 be a finite presentation for the cyclic group of order 3. Multiplying x3=1 on bo ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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]  


Presentation Of A Group
In mathematics, a presentation is one method of specifying a group. A presentation of a group ''G'' comprises a set ''S'' of generators—so that every element of the group can be written as a product of powers of some of these generators—and a set ''R'' of relations among those generators. We then say ''G'' has presentation :\langle S \mid R\rangle. Informally, ''G'' has the above presentation if it is the "freest group" generated by ''S'' subject only to the relations ''R''. Formally, the group ''G'' is said to have the above presentation if it is isomorphic to the quotient of a free group on ''S'' by the normal subgroup generated by the relations ''R''. As a simple example, the cyclic group of order ''n'' has the presentation :\langle a \mid a^n = 1\rangle, where 1 is the group identity. This may be written equivalently as :\langle a \mid a^n\rangle, thanks to the convention that terms that do not include an equals sign are taken to be equal to the group identity. S ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Group (mathematics)
In mathematics, a group is a set and an operation that combines any two elements of the set to produce a third element of the set, in such a way that the operation is associative, an identity element exists and every element has an inverse. These three axioms hold for number systems and many other mathematical structures. For example, the integers together with the addition operation form a group. The concept of a group and the axioms that define it were elaborated for handling, in a unified way, essential structural properties of very different mathematical entities such as numbers, geometric shapes and polynomial roots. Because the concept of groups is ubiquitous in numerous areas both within and outside mathematics, some authors consider it as a central organizing principle of contemporary mathematics. In geometry groups arise naturally in the study of symmetries and geometric transformations: The symmetries of an object form a group, called the symmetry group of th ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Heinrich Franz Friedrich Tietze
Heinrich Franz Friedrich Tietze (August 31, 1880 – February 17, 1964) was an Austrian mathematician, famous for the Tietze extension theorem on functions from topological spaces to the real numbers. He also developed the Tietze transformations for group presentations, and was the first to pose the group isomorphism problem. Tietze's graph is also named after him; it describes the boundaries of a subdivision of the Möbius strip into six mutually-adjacent regions, found by Tietze as part of an extension of the four color theorem to non-orientable surfaces. Education and career Tietze was the son of Emil Tietze and the grandson of Franz Ritter von Hauer, both of whom were Austrian geologists. He was born in Schleinz, Austria-Hungary, and studied mathematics at the Technische Hochschule in Vienna beginning in 1898. After additional studies in Munich, he returned to Vienna, completing his doctorate in 1904 and his habilitation in 1908. From 1910 until 1918 Tietze taught m ...
[...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]  




Isomorphic
In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word isomorphism is derived from the Ancient Greek: ἴσος ''isos'' "equal", and μορφή ''morphe'' "form" or "shape". The interest in isomorphisms lies in the fact that two isomorphic objects have the same properties (excluding further information such as additional structure or names of objects). Thus isomorphic structures cannot be distinguished from the point of view of structure only, and may be identified. In mathematical jargon, one says that two objects are . An automorphism is an isomorphism from a structure to itself. An isomorphism between two structures is a canonical isomorphism (a canonical map that is an isomorphism) if there is only one isomorphism between the two structures (as it is the case for solutions of a uni ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Elementary Abelian Group
In mathematics, specifically in group theory, an elementary abelian group (or elementary abelian ''p''-group) is an abelian group in which every nontrivial element has order ''p''. The number ''p'' must be prime, and the elementary abelian groups are a particular kind of ''p''-group. The case where ''p'' = 2, i.e., an elementary abelian 2-group, is sometimes called a Boolean group. Every elementary abelian ''p''-group is a vector space over the prime field with ''p'' elements, and conversely every such vector space is an elementary abelian group. By the classification of finitely generated abelian groups, or by the fact that every vector space has a basis, every finite elementary abelian group must be of the form (Z/''p''Z)''n'' for ''n'' a non-negative integer (sometimes called the group's ''rank''). Here, Z/''p''Z denotes the cyclic group of order ''p'' (or equivalently the integers mod ''p''), and the superscript notation means the ''n''-fold direct product of groups. In ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Symmetric Group
In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group \mathrm_n defined over a finite set of n symbols consists of the permutations that can be performed on the n symbols. Since there are n! (n factorial) such permutation operations, the order (number of elements) of the symmetric group \mathrm_n is n!. Although symmetric groups can be defined on infinite sets, this article focuses on the finite symmetric groups: their applications, their elements, their conjugacy classes, a finite presentation, their subgroups, their automorphism groups, and their representation theory. For the remainder of this article, "symmetric group" will mean a symmetric group on a finite set. The symmetric group is important to diverse areas of mathematics such as Galois theory, invariant theory, the repres ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Nielsen Transformation
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, Nielsen transformations, named after Jakob Nielsen, are certain automorphisms of a free group which are a non-commutative analogue of row reduction and one of the main tools used in studying free groups, . They were introduced in to prove that every subgroup of a free group is free (the Nielsen–Schreier theorem), but are now used in a variety of mathematics, including computational group theory, k-theory, and knot theory. The textbook devotes all of chapter 3 to Nielsen transformations. Definitions One of the simplest definitions of a Nielsen transformation is an automorphism of a free group, but this was not their original definition. The following gives a more constructive definition. A Nielsen transformation on a finitely generated free group with ordered basis ''x''1, ..., ''x''''n'' can be factored into elementary Nielsen transformations of the following sorts: * Switch ' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Andrews–Curtis Conjecture
In mathematics, the Andrews–Curtis conjecture states that every balanced presentation of the trivial group can be transformed into a trivial presentation by a sequence of Nielsen transformations on the relators together with conjugations of relators, named after James J. Andrews and Morton L. Curtis who proposed it in 1965. It is difficult to verify whether the conjecture holds for a given balanced presentation or not. It is widely believed that the Andrews–Curtis conjecture is false. While there are no counterexamples known, there are numerous potential counterexamples. It is known that the Zeeman conjecture on collapsibility In topology, a branch of mathematics, a collapse reduces a simplicial complex (or more generally, a CW complex) to a homotopy-equivalent subcomplex. Collapses, like CW complexes themselves, were invented by J. H. C. Whitehead. Collapses find appli ... implies the Andrews–Curtis conjecture. References * * Combinatorial group theory Conjectures ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Roger Lyndon
Roger Conant Lyndon (December 18, 1917 – June 8, 1988) was an American mathematician, for many years a professor at the University of Michigan.. He is known for Lyndon words, the Curtis–Hedlund–Lyndon theorem, Craig–Lyndon interpolation and the Lyndon–Hochschild–Serre spectral sequence. Biography Lyndon was born on December 18, 1917, in Calais, Maine, the son of a Unitarian minister. His mother died when he was two years old, after which he and his father moved several times to towns in Massachusetts and New York. He did his undergraduate studies at Harvard University, originally intending to study literature but eventually settling on mathematics, and graduated in 1939. He took a job as a banker, but soon afterwards returned to graduate school at Harvard, earning a master's degree in 1941. After a brief teaching stint at the Georgia Institute of Technology, he returned to Harvard for the third time in 1942 and while there taught navigation as part of the V-12 Navy ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Paul E
Paul may refer to: *Paul (given name), a given name (includes a list of people with that name) * Paul (surname), a list of people People Christianity *Paul the Apostle (AD c.5–c.64/65), also known as Saul of Tarsus or Saint Paul, early Christian missionary and writer * Pope Paul (other), multiple Popes of the Roman Catholic Church * Saint Paul (other), multiple other people and locations named "Saint Paul" Roman and Byzantine empire * Lucius Aemilius Paullus Macedonicus (c. 229 BC – 160 BC), Roman general * Julius Paulus Prudentissimus (), Roman jurist * Paulus Catena (died 362), Roman notary *Paulus Alexandrinus (4th century), Hellenistic astrologer * Paul of Aegina or Paulus Aegineta (625–690), Greek surgeon Royals *Paul I of Russia (1754–1801), Tsar of Russia * Paul of Greece (1901–1964), King of Greece Other people *Paul the Deacon or Paulus Diaconus (c. 720 – c. 799), Italian Benedictine monk *Paul (father of Maurice), the father of Mauric ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]