English
Related papers

Related papers: Structure computation and discrete logarithms in f…

200 papers

We use recurrence relations to derive explicit formulas for counting the number of subgroups of given order (or index) in rank 3 finite abelian p-groups and use these to derive similar formulas in few cases for rank 4. As a consequence, we…

Group Theory · Mathematics 2018-06-18 Fikreab Admasu , Amit Sehgal

The semidirect discrete logarithm problem (SDLP) in finite groups was proposed as a foundation for post-quantum cryptographic protocols, based on the belief that its non-abelian structure would resist quantum attacks. However, recent…

Cryptography and Security · Computer Science 2025-11-04 Mohammad Ferry Husnil Arif , Muhammad Imran

We describe an algorithm for computing the $p$-canonical basis of the Hecke algebra, or one of its antispherical modules. The algorithm does not operate in the Hecke category directly, but rather uses a faithful embedding of the Hecke…

Representation Theory · Mathematics 2022-08-02 Joel Gibson , Lars Thorge Jensen , Geordie Williamson

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2016-09-07 Wesley Calvert

Here we present a working framework to establish finite abelian groups in python. The primary aim is to allow new A-level students to work with examples of finite abelian groups using open source software. We include the code used in the…

Group Theory · Mathematics 2017-11-17 Paul Bradley , John Smethurst

In this paper we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic…

Algebraic Topology · Mathematics 2013-03-06 Ana Romero , Julio Rubio

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

Cryptography and Security · Computer Science 2007-12-27 Andreas Enge

We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…

Group Theory · Mathematics 2024-04-30 Max Horn , Alice Niemeyer , Cheryl Praeger , Daniel Rademacher

We give an algorithm to determine finitely many generators for a subgroup of finite index in the unit group of an integral group ring $\mathbb{Z} G$ of a finite nilpotent group $G$, this provided the rational group algebra $\mathbb{Q} G$…

We combine results about Whitehead groups of finite groups with results about genetic bases of finite $p$-groups to compute the Whitehead groups of some metacyclic $p$-groups. Let $C_{p^n}$ denote a cyclic group of order $p^n$ for $p$ an…

Group Theory · Mathematics 2015-11-13 Nadia Romero

Many open conjectures in the representation theory of finite groups can be studied by reducing them to related questions about quasi-simple groups. In such studies, $p$-radical subgroups typically play a critical role. To classify the…

Group Theory · Mathematics 2026-01-06 Meizheng Fu

In this article we put a very elaborate PSH-like structure on the $R_{+}(-)$ groups of products of finite general linear groups. This is not the case we want. Firstly one would really want the actual big PSH algebra of products of general…

Number Theory · Mathematics 2022-01-05 Victor P Snaith

In the first half of this paper, we outline the construction of a new class of abelian pro-$p$ groups, which covers all countably-based pro-$p$ groups. In the second half, we study them, and classify them up to topological isomorphism and…

Group Theory · Mathematics 2012-11-21 Jonathan Kiehlmann

Let G be a discrete group. We give methods to compute for a generalized (co-)homology theory its values on the Borel construction (EG x X)/G of a proper G-CW-complex X satisfying certain finiteness conditions. In particular we give formulas…

K-Theory and Homology · Mathematics 2012-01-24 Michael Joachim , Wolfgang Lueck

We construct a simplified resolution for the trivial G-module Z, where G is a finite abelian group, and compare it with the standard resolution. We use it to calculate cohomologies of irreducible G-lattices and their duals.

Group Theory · Mathematics 2017-12-13 Yuriy A. Drozd , Andriana I. Plakosh

We introduce a general constructive method to find a p-basis (and the Ulm invariants) of a finite Abelian p-group M. This algorithm is based on Groebner bases theory. We apply this method to determine the additive structure of…

Commutative Algebra · Mathematics 2007-05-23 Maria A. Avino-Diaz , Luis D. Garcia-Puente

We finish the classification, begun in two earlier papers, of all simple fusion systems over finite nonabelian $p$-groups with an abelian subgroup of index $p$. In particular, this gives many new examples illustrating the enormous variety…

Group Theory · Mathematics 2021-02-02 Bob Oliver , Albert Ruiz

Inspired by a beautiful formula of Bertolini, Darmon, and Prasanna -- the oft-termed BDP formula -- we address questions about the non-vanishing of non-torsion points under $p$-adic logarithms of abelian varieties. We largely consider…

Number Theory · Mathematics 2026-05-12 Ashay Burungale , Christopher Skinner , Xin Wan

Given a connected reductive algebraic group $G$, we consider the class of spherical subgroups $H \subset G$ such that $H$ is regularly embedded in a parabolic subgroup $P \subset G$ and $H,P$ have a common Levi subgroup $L$. In a previous…

Algebraic Geometry · Mathematics 2026-04-09 Roman Avdeev

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

Cryptography and Security · Computer Science 2015-04-07 Igor Semaev