enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Group theory - Wikipedia

    en.wikipedia.org/wiki/Group_theory

    Geometric group theory attacks these problems from a geometric viewpoint, either by viewing groups as geometric objects, or by finding suitable geometric objects a group acts on. [7] The first idea is made precise by means of the Cayley graph , whose vertices correspond to group elements and edges correspond to right multiplication in the group.

  3. Group isomorphism problem - Wikipedia

    en.wikipedia.org/wiki/Group_isomorphism_problem

    In abstract algebra, the group isomorphism problem is the decision problem of determining whether two given finite group presentations refer to isomorphic groups.. The isomorphism problem was formulated by Max Dehn, [1] and together with the word problem and conjugacy problem, is one of three fundamental decision problems in group theory he identified in 1911. [2]

  4. List of group theory topics - Wikipedia

    en.wikipedia.org/wiki/List_of_group_theory_topics

    In mathematics and abstract algebra, group theory studies the algebraic structures known as groups.The concept of a group is central to abstract algebra: other well-known algebraic structures, such as rings, fields, and vector spaces, can all be seen as groups endowed with additional operations and axioms.

  5. Conjugacy problem - Wikipedia

    en.wikipedia.org/wiki/Conjugacy_problem

    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 .

  6. Burnside problem - Wikipedia

    en.wikipedia.org/wiki/Burnside_problem

    The Burnside problem asks whether a finitely generated group in which every element has finite order must necessarily be a finite group. It was posed by William Burnside in 1902, making it one of the oldest questions in group theory, and was influential in the development of combinatorial group theory.

  7. List of problems in loop theory and quasigroup theory

    en.wikipedia.org/wiki/List_of_problems_in_loop...

    Solution: There are 4262 nonassociative Moufang loops of order 64. They were found by the method of group modifications in (VojtÄ›chovský, 2006), and it was shown in (Nagy and VojtÄ›chovský, 2007) that the list is complete. The latter paper uses a linear-algebraic approach to Moufang loop extensions.

  8. Classification of finite simple groups - Wikipedia

    en.wikipedia.org/wiki/Classification_of_finite...

    In mathematics, the classification of finite simple groups (popularly called the enormous theorem [1] [2]) is a result of group theory stating that every finite simple group is either cyclic, or alternating, or belongs to a broad infinite class called the groups of Lie type, or else it is one of twenty-six exceptions, called sporadic (the Tits group is sometimes regarded as a sporadic group ...

  9. Category:Group theory - Wikipedia

    en.wikipedia.org/wiki/Category:Group_theory

    Complement (group theory) Complex reflection group; Component (group theory) Conjugacy class; Conjugacy class sum; Conjugacy problem; Conjugation of isometries in Euclidean space; Convergence group; Core (group theory) Coset; Cosocle; Coxeter complex; Coxeter notation; Cremona group; Crystallographic restriction theorem; Curie's principle ...