Zobrazeno 1 - 5
of 5
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