Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Hans Ulrich Besche"'
Publikováno v:
International Journal of Algebra and Computation. 12:623-644
We survey the problem of constructing the groups of a given finite order. We provide an extensive bibliography and outline practical algorithmic solutions to the problem. Motivated by the millennium, we used these methods to construct the groups of o
Autor:
Hans Ulrich Besche, Bettina Eick
Publikováno v:
Communications in Algebra. 29:1759-1772
We describe a method to determine up to isomorphism the groups of order q n · p for a fixed prime-power q n and indeterminate prime p ≠ q. We report on the explicit construction of all groups of order 2 n · p for n ≤ 8 and 3 n · p for n ≤ 6.
Publikováno v:
Electronic Research Announcements of the American Mathematical Society. 7:1-4
We announce the construction up to isomorphism of the 49 910 529 484 49\,910\,529\,484 groups of order at most 2000.
Publikováno v:
Water Science and Technology. 30:193-203
The incorporation of enhanced biological phosphorus elimination in the single sludge process is a contemporary challenge in the design of biological wastewater treatment plants. The simultaneous biological removal of nitrogen and phosphorus is a proc
Autor:
Hans Ulrich Besche, Bettina Eick
Publikováno v:
Journal of Symbolic Computation. (4):387-404
We1999 Academic Pressintroduce three practical algorithms to construct certain finite groups up to isomorphism. The first one can be used to construct all soluble groups of a given order. This method can be restricted to compute the soluble groups wi
Autor:
Chen, Lei, Lanier, Justin
Publikováno v:
Geometriae Dedicata; Oct2024, Vol. 218 Issue 5, p1-17, 17p
Autor:
Calegari, Frank, Chidambaram, Shiva
Publikováno v:
Proceedings of the American Mathematical Society; May2022, Vol. 150 Issue 5, p1975-1984, 10p
Publikováno v:
Journal of Industrial & Management Optimization; Mar2022, Vol. 18 Issue 2, p1035-1062, 28p
Publikováno v:
Mathematics of Computation; Mar2022, Vol. 91 Issue 334, p943-971, 29p
Autor:
Akin, Ethan
Publikováno v:
Journal of Dynamics & Games; Jan2021, Vol. 8 Issue 1, p1-20, 20p