Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Alexander Hulpke"'
This volume is the proceedings of a conference on Finite Geometries, Groups, and Computation that took place on September 4-9, 2004, at Pingree Park, Colorado (a campus of Colorado State University). Not accidentally, the conference coincided with th
Autor:
Alexander Hulpke
Publikováno v:
Mathematics of Computation. 91:1007-1017
We enumerate the 15768 15768 perfect groups of order up to 2 ⋅ 10 6 2\cdot 10^6 , up to isomorphism, thus also completing the missing cases reported by Holt and Plesken [Perfect groups, The Clarendon Press, Oxford University Press, New York, 1989].
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fcb09fd4b4121d1fcf30002e62c0fc2e
https://doi.org/10.1090/mcom/3684
https://doi.org/10.1090/mcom/3684
Publikováno v:
Jahresbericht der Deutschen Mathematiker-Vereinigung.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::934b53fe48ad1a3dbdbcd7545fb77a48
https://doi.org/10.1365/s13291-022-00255-7
https://doi.org/10.1365/s13291-022-00255-7
Publikováno v:
Journal of Algebra. 486:396-416
The goal of this paper is to study primitive groups that are contained in the union of maximal (in the symmetric group) imprimitive groups. The study of types of permutations that appear inside primitive groups goes back to the origins of the theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7bad59e859904ace814707be5a04b7e3
https://doi.org/10.1016/j.jalgebra.2017.03.043
https://doi.org/10.1016/j.jalgebra.2017.03.043
We develop practical techniques to compute with arithmetic groups H ≤ SL ( n , Q ) for n > 2 . Our approach relies on constructing a principal congruence subgroup in H. Problems solved include testing membership in H, analyzing the subnormal struct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cf0b5ac4124dcbb0486efe1f5104be4
http://arxiv.org/abs/1906.10423
http://arxiv.org/abs/1906.10423
We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group H ≤ SL ( n , Z ) for n ≥ 2 . More gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8ee6d434bd92fe3244ba30bade6148a
http://arxiv.org/abs/1905.02683
http://arxiv.org/abs/1905.02683
We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by extending o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d2901d5b7766c24b7d3363fe4f52730
http://arxiv.org/abs/1905.02190
http://arxiv.org/abs/1905.02190
Autor:
Alexander Hulpke, Heiko Dietrich
Motivated by the success of quotient algorithms, such as the well-known p-quotient or solvable quotient algorithms, in computing information about finite groups, we describe how to compute finite extensions H ˜ of a finite group H by a direct sum of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d98863fae282347a0c061a52115ffd2e
Publikováno v:
Journal of Pure and Applied Algebra. 220:735-758
We establish a canonical correspondence between connected quandles and certain configurations in transitive groups, called quandle envelopes. This correspondence allows us to efficiently enumerate connected quandles of small orders, and present new p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7dfe0fe146210375fab4ea288af5c63
https://doi.org/10.1016/j.jpaa.2015.07.014
https://doi.org/10.1016/j.jpaa.2015.07.014
Autor:
Alexander Hulpke
Publikováno v:
ISSAC
We describe algorithms and heuristics that allow us to express arbitrary elements of SLn (Z) and Sp2n (Z) as products of generators in particular "standard" generating sets. For elements obtained experimentally as random products, it produces product
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f114f56ce47354656e6e5dd33b5cce2
https://doi.org/10.1145/3208976.3208983
https://doi.org/10.1145/3208976.3208983