Zobrazeno 1 - 10
of 747
pro vyhledávání: '"Hulpke, A."'
Autor:
Hulpke, Alexander
We describe a generalization of the concept of a pc presentation that applies to groups with a nontrivial solvable radical. Such a representation can be much more efficient in terms of memory use and even of arithmetic, than permuattion and matrix re
Externí odkaz:
http://arxiv.org/abs/2412.06218
We generalize our methodology for computing with Zariski dense subgroups of $\mathrm{SL}(n, \mathbb{Z})$ and $\mathrm{Sp}(n, \mathbb{Z})$, to accommodate input dense subgroups $H$ of $\mathrm{SL}(n, \mathbb{Q})$ and $\mathrm{Sp}(n, \mathbb{Q})$. A ke
Externí odkaz:
http://arxiv.org/abs/2303.06236
We initiate a new, computational approach to a classical problem: certifying non-freeness of ($2$-generator, parabolic) M\"{o}bius subgroups of $\mathrm{SL}(2,\mathbb{Q})$. The main tools used are algorithms for Zariski dense groups and algorithms to
Externí odkaz:
http://arxiv.org/abs/2203.17201
Autor:
Hulpke, Alexander
We show how tools from computational group theory can be used to prove that a subgroup of matrices has infinite index.
Externí odkaz:
http://arxiv.org/abs/2110.04359
Autor:
Hulpke, John F.1 (AUTHOR) john.hulpke@ucd.ie, Lau, Cubie LaiLai1 (AUTHOR) cubie.lau@ucd.ie
Publikováno v:
Academy of Management Learning & Education. Dec2023, Vol. 22 Issue 4, p740-742. 3p.
Autor:
Hulpke, Alexander
We enumerate the 15768 perfect groups of order up to $2\cdot 10^6$, up to isomorphism, thus also completing the missing cases in the prior classification. The work supplements the by now well-understood computer classifications of solvable groups, il
Externí odkaz:
http://arxiv.org/abs/2104.10828
Autor:
Hulpke, Alexander
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
Externí odkaz:
http://arxiv.org/abs/2012.01595
Publikováno v:
Blood Pressure, Vol 32, Iss 1 (2023)
Purpose Ambulatory, cuff-less blood pressure (BP) measurement devices are a promising trend to alleviate the strains of conventional, cuff-based BP determination. Cuff-less devices circumvent discomfort and nocturnal arousal reactions which can be tr
Externí odkaz:
https://doaj.org/article/2a01274716fd40768f23b1336eea5c30
Autor:
Dietrich, Heiko, Hulpke, Alexander
Motivated by quotient algorithms, such as the well-known $p$-quotient or solvable quotient algorithms, we describe how to compute extensions $\tilde H$ of a finite group $H$ by a direct sum of isomorphic simple $\mathbb{Z}_p H$-modules such that $H$
Externí odkaz:
http://arxiv.org/abs/1910.11453
Publikováno v:
Journal of Algebra 421 (2015), 234-259
We develop practical techniques to compute with arithmetic groups $H\leq \mathrm{SL}(n,\mathbb{Q})$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$, analyzing th
Externí odkaz:
http://arxiv.org/abs/1906.10423