Zobrazeno 1 - 10
of 5 899
pro vyhledávání: '"Flannery, D."'
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
Let $p$ be a prime and let $\mathbb{C}$ be the complex field. We explicitly classify the finite solvable irreducible monomial subgroups of $\mathrm{GL}(p,\mathbb{C})$ up to conjugacy. That is, we give a complete and irredundant list of $\mathrm{GL}(p
Externí odkaz:
http://arxiv.org/abs/2107.12252
Autor:
Detinko, A. S., Flannery, D. L.
Publikováno v:
Irish Math. Soc. Bull. 56 (2005), 37-51
We survey aspects of locally nilpotent linear groups. Then we obtain a new classification; namely, we classify the irreducible maximal locally nilpotent subgroups of $\mathrm{GL}(q, \mathbb F)$ for prime $q$ and any field $\mathbb F$.
Externí odkaz:
http://arxiv.org/abs/2103.07187
Autor:
Armario, J. A., Flannery, D. L.
We introduce almost supplementary difference sets (ASDS). For odd $m$, certain ASDS in ${\mathbb Z}_m$ that have amicable incidence matrices are equivalent to quaternary sequences of odd length $m$ with optimal autocorrelation. As one consequence, if
Externí odkaz:
http://arxiv.org/abs/1911.08828
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Detinko, A. S., Flannery, D. L.
Publikováno v:
J. Symbolic Comput. 43 (2008), no.1, 8-26
We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of matrix group
Externí odkaz:
http://arxiv.org/abs/1907.06045
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
Publikováno v:
Journal of Algebra 322 (2009), 4151-4160
We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness problem for f
Externí odkaz:
http://arxiv.org/abs/1905.07017
Publikováno v:
Journal of Algebra 344 (2011), 397-406
We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is nilpotent
Externí odkaz:
http://arxiv.org/abs/1905.05234