Group Isomorphism Problem
   HOME
*





Group Isomorphism Problem
In abstract algebra, the group isomorphism problem is the decision problem of determining whether two given Presentation of a group, finite group presentations refer to Isomorphism, isomorphic Group (mathematics), groups. The isomorphism problem was formulated by Max Dehn, and together with the Word problem for groups, word problem and conjugacy problem, is one of three fundamental decision problems in group theory he identified in 1911. All three problems are Decidability (logic), undecidable: there does not exist a computer algorithm that correctly solves every instance of the isomorphism problem, or of the other two problems, regardless of how much time is allowed for the algorithm to run. In fact the problem of deciding whether a group is trivial is undecidable, (See Corollary 3.4) a consequence of the Adian–Rabin theorem due to Sergei Adian and Michael O. Rabin. References

* Group theory Undecidable problems {{Abstract-algebra-stub ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Abstract Algebra
In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures. Algebraic structures include groups, rings, fields, modules, vector spaces, lattices, and algebras over a field. The term ''abstract algebra'' was coined in the early 20th century to distinguish this area of study from older parts of algebra, and more specifically from elementary algebra, the use of variables to represent numbers in computation and reasoning. Algebraic structures, with their associated homomorphisms, form mathematical categories. Category theory is a formalism that allows a unified way for expressing properties and constructions that are similar for various structures. Universal algebra is a related subject that studies types of algebraic structures as single objects. For example, the structure of groups is a single object in universal algebra, which is called the ''variety of groups''. History Before the nineteenth century, algebra meant ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Decision Problem
In computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question of the input values. An example of a decision problem is deciding by means of an algorithm whether a given natural number is prime. Another is the problem "given two numbers ''x'' and ''y'', does ''x'' evenly divide ''y''?". The answer is either 'yes' or 'no' depending upon the values of ''x'' and ''y''. A method for solving a decision problem, given in the form of an algorithm, is called a decision procedure for that problem. A decision procedure for the decision problem "given two numbers ''x'' and ''y'', does ''x'' evenly divide ''y''?" would give the steps for determining whether ''x'' evenly divides ''y''. One such algorithm is long division. If the remainder is zero the answer is 'yes', otherwise it is 'no'. A decision problem which can be solved by an algorithm is called ''decidable''. Decision problems typically appear in mat ...
[...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]  


Isomorphism
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 univer ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Group (mathematics)
In mathematics, a group is a Set (mathematics), set and an Binary operation, operation that combines any two Element (mathematics), elements of the set to produce a third element of the set, in such a way that the operation is Associative property, associative, an identity element exists and every element has an Inverse element, inverse. These three axioms hold for Number#Main classification, 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 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Max Dehn
Max Wilhelm Dehn (November 13, 1878 – June 27, 1952) was a German mathematician most famous for his work in geometry, topology and geometric group theory. Born to a Jewish family in Germany, Dehn's early life and career took place in Germany. However, he was forced to retire in 1935 and eventually fled Germany in 1939 and emigrated to the United States. Dehn was a student of David Hilbert, and in his habilitation in 1900 Dehn resolved Hilbert's third problem, making him the first to resolve one of Hilbert's well-known 23 problems. Dehn's students include Ott-Heinrich Keller, Ruth Moufang, Wilhelm Magnus, and the artists Dorothea Rockburne and Ruth Asawa. Biography Dehn was born to a family of Jewish origin in Hamburg, Imperial Germany. He studied the foundations of geometry with Hilbert at Göttingen in 1899, and obtained a proof of the Jordan curve theorem for polygons. In 1900 he wrote his dissertation on the role of the Legendre angle sum theorem in axiomatic geome ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Mathematische Annalen
''Mathematische Annalen'' (abbreviated as ''Math. Ann.'' or, formerly, ''Math. Annal.'') is a German mathematical research journal founded in 1868 by Alfred Clebsch and Carl Neumann. Subsequent managing editors were Felix Klein, David Hilbert, Otto Blumenthal, Erich Hecke, Heinrich Behnke, Hans Grauert, Heinz Bauer, Herbert Amann, Jean-Pierre Bourguignon, Wolfgang Lück, and Nigel Hitchin. Currently, the managing editor of Mathematische Annalen is Thomas Schick. Volumes 1–80 (1869–1919) were published by Teubner. Since 1920 (vol. 81), the journal has been published by Springer. In the late 1920s, under the editorship of Hilbert, the journal became embroiled in controversy over the participation of L. E. J. Brouwer on its editorial board, a spillover from the foundational Brouwer–Hilbert controversy. Between 1945 and 1947 the journal briefly ceased publication. References External links''Mathematische Annalen''homepage at Springer''Mathematische Annalen''archive (1869 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Word Problem For Groups
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group ''G'' is the algorithmic problem of deciding whether two words in the generators represent the same element. More precisely, if ''A'' is a finite set of generators for ''G'' then the word problem is the membership problem for the formal language of all words in ''A'' and a formal set of inverses that map to the identity under the natural map from the free monoid with involution on ''A'' to the group ''G''. If ''B'' is another finite generating set for ''G'', then the word problem over the generating set ''B'' is equivalent to the word problem over the generating set ''A''. Thus one can speak unambiguously of the decidability of the word problem for the finitely generated group ''G''. The related but different uniform word problem for a class ''K'' of recursively presented groups is the algorithmic problem of deciding, given as input a pres ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Conjugacy Problem
In abstract algebra, the conjugacy problem for a group ''G'' with a given presentation is the decision problem of determining, given two words ''x'' and ''y'' in ''G'', whether or not they represent conjugate elements of ''G''. That is, the problem is to determine whether there exists an element ''z'' of ''G'' such that :y = zxz^.\,\! The conjugacy problem is also known as the transformation problem. The conjugacy problem was identified by Max Dehn in 1911 as one of the fundamental decision problems in group theory; the other two being the word problem and the isomorphism problem. The conjugacy problem contains the word problem as a special case: if ''x'' and ''y'' are words, deciding if they are the same word is equivalent to deciding if xy^ is the identity, which is the same as deciding if it's conjugate to the identity. In 1912 Dehn gave an algorithm that solves both the word and conjugacy problem for the fundamental groups of closed orientable two-dimensional manifolds of g ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Dover Publications
Dover Publications, also known as Dover Books, is an American book publisher founded in 1941 by Hayward and Blanche Cirker. It primarily reissues books that are out of print from their original publishers. These are often, but not always, books in the public domain. The original published editions may be scarce or historically significant. Dover republishes these books, making them available at a significantly reduced cost. Classic reprints Dover reprints classic works of literature, classical sheet music, and public-domain images from the 18th and 19th centuries. Dover also publishes an extensive collection of mathematical, scientific, and engineering texts. It often targets its reprints at a niche market, such as woodworking. Starting in 2015, the company branched out into graphic novel reprints, overseen by Dover acquisitions editor and former comics writer and editor Drew Ford. Most Dover reprints are photo facsimiles of the originals, retaining the original pagination and ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Decidability (logic)
In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer. Zeroth-order logic (propositional logic) is decidable, whereas first-order and higher-order logic are not. Logical systems are decidable if membership in their set of logically valid formulas (or theorems) can be effectively determined. A theory (set of sentences closed under logical consequence) in a fixed logical system is decidable if there is an effective method for determining whether arbitrary formulas are included in the theory. Many important problems are undecidable, that is, it has been proven that no effective method for determining membership (returning a correct answer after finite, though possibly very long, time in all cases) can exist for them. Decidability of a logical system Each logical system comes with both a syntactic component, which among other things determines the notion of provability, and a semantic component, which determines ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Adian–Rabin Theorem
In the mathematical subject of group theory, the Adian–Rabin theorem is a result that states that most "reasonable" properties of finitely presentable groups are algorithmically undecidable. The theorem is due to Sergei Adian (1955) and, independently, Michael O. Rabin (1958).Michael O. Rabin''Recursive unsolvability of group theoretic problems'' Annals of Mathematics (2), vol. 67, 1958, pp. 172–194 Markov property A ''Markov property'' ''P'' of finitely presentable groups is one for which: #''P'' is an abstract property, that is, ''P'' is preserved under group isomorphism. #There exists a finitely presentable group A_+ with property ''P''. #There exists a finitely presentable group A_- that cannot be embedded as a subgroup in any finitely presentable group with property ''P''. For example, being a finite group is a Markov property: We can take A_+ to be the trivial group and we can take A_- to be the infinite cyclic group \mathbb. Precise statement of the Adian–Rabin ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]