When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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.

  3. History of group theory - Wikipedia

    en.wikipedia.org/wiki/History_of_group_theory

    One foundational root of group theory was the quest of solutions of polynomial equations of degree higher than 4.. An early source occurs in the problem of forming an equation of degree m having as its roots m of the roots of a given equation of degree >.

  4. List of unsolved problems in mathematics - Wikipedia

    en.wikipedia.org/wiki/List_of_unsolved_problems...

    Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.

  5. 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]

  6. Word problem for groups - Wikipedia

    en.wikipedia.org/wiki/Word_problem_for_groups

    On the other hand, the fact that a particular algorithm does not solve the word problem for a particular group does not show that the group has an unsolvable word problem. For instance Dehn's algorithm does not solve the word problem for the fundamental group of the torus. However this group is the direct product of two infinite cyclic groups ...

  7. Burnside problem - Wikipedia

    en.wikipedia.org/wiki/Burnside_problem

    Burnside problem II. For which positive integers m, n is the free Burnside group B(m, n) finite? The full solution to Burnside problem in this form is not known. Burnside considered some easy cases in his original paper: B(1, n) is the cyclic group of order n. B(m, 2) is the direct product of m copies of the cyclic group of order 2 and hence ...

  8. Hilbert's fifth problem - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_fifth_problem

    Hilbert's fifth problem is the fifth mathematical problem from the problem list publicized in 1900 by mathematician David Hilbert, and concerns the characterization of Lie groups. The theory of Lie groups describes continuous symmetry in mathematics; its importance there and in theoretical physics (for example quark theory ) grew steadily in ...

  9. Geometric group theory - Wikipedia

    en.wikipedia.org/wiki/Geometric_group_theory

    Geometric group theory grew out of combinatorial group theory that largely studied properties of discrete groups via analyzing group presentations, which describe groups as quotients of free groups; this field was first systematically studied by Walther von Dyck, student of Felix Klein, in the early 1880s, [2] while an early form is found in the 1856 icosian calculus of William Rowan Hamilton ...