Dane L. Flannery
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Dane L. Flannery has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Alla S. Detinko
School of Mathematics, Statistics and Applied Mathematics, National University of Ireland, Galway, Ireland
18 shared publications - José Andrés Armario
Departamento de Matemática Aplicada I, Universidad de Sevilla, Sevilla, Spain
9 shared publications - Alexander Hulpke
Department of Mathematics, Colorado State University, Fort Collins, USA
7 shared publications - E. A. O'Brien
University of Auckland
5 shared publications - Ronan Egan
School of Mathematical Sciences, Dublin City University, Dublin, Ireland
4 shared publications A. Hulpke
1 shared publication
Latest Publications
- Open Access
Nilpotent primitive linear groups over finite fields
We provide a detailed structural description of the nilpotent primitive subgroups of $\mathrm{GL}(n, \mathbb{F})$, where $\mathbb{F}$ is a finite field.Open AccessNilpotent primitive linear groups over finite fields
We provide a detailed structural description of the nilpotent primitive subgroups of $\mathrm{GL}(n, \mathbb{F})$, where $\mathbb{F}$ is a finite field. - Open Access
- 23 August 2023
- Published by Springer Nature in Cryptography and Communications
- Vol. 16 (2) , 323-337
Generalized partially bent functions, generalized perfect arrays, and cocyclic Butson matrices
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering Butson matrices that are cocyclic rather than strictly group invariant. This result has several applications; for example, to the construction of Boolean functions whose expansions are generalized partially bent functions, including cases where no bent function can exist.
- 23 August 2023
- Published by Springer Nature in Cryptography and Communications
- Vol. 16 (2) , 323-337
Open AccessGeneralized partially bent functions, generalized perfect arrays, and cocyclic Butson matrices
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering Butson matrices that are cocyclic rather than strictly group invariant. This result has several applications; for example, to the construction of Boolean functions whose expansions are generalized partially bent functions, including cases where no bent function can exist.
- Open Access
Zariski density and computing with $S$-integral groups
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 key task, backgrounded by the Strong Approximation theorem, is computing a minimal congruence overgroup of $H$. Once we have this overgroup, we may describe all congruence quotients of $H$. The case $n=2$ receives particular attention.Open AccessZariski density and computing with $S$-integral groups
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 key task, backgrounded by the Strong Approximation theorem, is computing a minimal congruence overgroup of $H$. Once we have this overgroup, we may describe all congruence quotients of $H$. The case $n=2$ receives particular attention. - Open Access
- 6 March 2023
- Published by Elsevier in Journal of Algebra
- Vol. 624, 93-105
Zariski density and computing with S-integral groups
- 6 March 2023
- Published by Elsevier in Journal of Algebra
- Vol. 624, 93-105
Open AccessZariski density and computing with S-integral groups
- 29 September 2022
- Published by Santander. Estudios de Patrimonio. Editorial de la Universidad de Cantabria
XVII Reunión española sobre criptología y seguridad de la información. RECSI 2022
La Reunión Española sobre Criptología y Seguridad de la Información (RECSI) es el congreso científico referente español en el tema de la Seguridad en las Tecnologías de la Información y Comunicación, donde se dan cita de forma bienal los principales investigadores españoles en el tema, así como invitados extranjeros de reconocido prestigio. En estos encuentros se muestran los avances de los grupos de investigación que presentan comunicaciones y fomentan la participación de los jóvenes investigadores. Este libro recoge los resúmenes de las conferencias plenarias junto con los trabajos presentados en la XVII RECSI celebrada en Santander del 19 al 21 de Octubre de 2022 organizada por el grupo de investigación AMAC (Algorithmic Mathematics And Cryptography) de la Universidad de Cantabria.
- 29 September 2022
- Published by Santander. Estudios de Patrimonio. Editorial de la Universidad de Cantabria
XVII Reunión española sobre criptología y seguridad de la información. RECSI 2022
La Reunión Española sobre Criptología y Seguridad de la Información (RECSI) es el congreso científico referente español en el tema de la Seguridad en las Tecnologías de la Información y Comunicación, donde se dan cita de forma bienal los principales investigadores españoles en el tema, así como invitados extranjeros de reconocido prestigio. En estos encuentros se muestran los avances de los grupos de investigación que presentan comunicaciones y fomentan la participación de los jóvenes investigadores. Este libro recoge los resúmenes de las conferencias plenarias junto con los trabajos presentados en la XVII RECSI celebrada en Santander del 19 al 21 de Octubre de 2022 organizada por el grupo de investigación AMAC (Algorithmic Mathematics And Cryptography) de la Universidad de Cantabria.
- Open Access
Generalized partially bent functions, generalized perfect arrays and cocyclic Butson matrices
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering Butson matrices that are cocyclic rather than strictly group invariant. This result has several applications; for example, to the construction of Boolean functions whose expansions are generalized partially bent functions, including cases where no bent function can exist.
Open AccessGeneralized partially bent functions, generalized perfect arrays and cocyclic Butson matrices
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering Butson matrices that are cocyclic rather than strictly group invariant. This result has several applications; for example, to the construction of Boolean functions whose expansions are generalized partially bent functions, including cases where no bent function can exist.
- Open Access
Classifying finite monomial linear groups of prime degree in characteristic zero
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,\mathbb{C})$-conjugacy class representatives as generating sets of monomial matrices. Copious structural information about non-solvable finite irreducible monomial subgroups of $\mathrm{GL}(p,\mathbb{C})$ is also proved, enabling a classification of all such groups bar one family. We explain the obstacles in that exceptional case. For $p\leq 3$, we classify all finite irreducible subgroups of $\mathrm{GL}(p,\mathbb{C})$. Our classifications are available publicly in Magma.Open AccessClassifying finite monomial linear groups of prime degree in characteristic zero
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,\mathbb{C})$-conjugacy class representatives as generating sets of monomial matrices. Copious structural information about non-solvable finite irreducible monomial subgroups of $\mathrm{GL}(p,\mathbb{C})$ is also proved, enabling a classification of all such groups bar one family. We explain the obstacles in that exceptional case. For $p\leq 3$, we classify all finite irreducible subgroups of $\mathrm{GL}(p,\mathbb{C})$. Our classifications are available publicly in Magma. - 19 August 2020
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 55 (1) , 15-25
Quasi-orthogonal cocycles, optimal sequences and a conjecture of Littlewood
- 19 August 2020
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 55 (1) , 15-25
Quasi-orthogonal cocycles, optimal sequences and a conjecture of Littlewood
- Open Access
Experimenting with symplectic hypergeometric monodromy groups
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 our previous algorithms for Zariski dense groups, based on the strong approximation and congruence subgroup properties.
Open AccessExperimenting with symplectic hypergeometric monodromy groups
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 our previous algorithms for Zariski dense groups, based on the strong approximation and congruence subgroup properties.
- Open Access
Almost supplementary difference sets and quaternary sequences
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 $2m-1$ is a prime power, or $m \equiv 1 \mod 4$ is prime, then ASDS of this kind exist. We also explore connections to optimal binary sequences and group cohomology.Open AccessAlmost supplementary difference sets and quaternary sequences
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 $2m-1$ is a prime power, or $m \equiv 1 \mod 4$ is prime, then ASDS of this kind exist. We also explore connections to optimal binary sequences and group cohomology.