English
Related papers

Related papers: Counting Finite Magmas

200 papers

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

Group Theory · Mathematics 2019-05-14 A. S. Detinko , D. L. Flannery , E. A. O'Brien

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…

Group Theory · Mathematics 2019-05-20 A. S. Detinko , D. L. Flannery , E. A. O'Brien

This paper introduces a SAT-based technique that calculates a compact and complete symmetry-break for finite model finding, with the focus on structures with a single binary operation (magmas). Classes of algebraic structures are typically…

Logic in Computer Science · Computer Science 2025-02-17 Marek Dančo , Mikoláš Janota , Michael Codish , João Jorge Araújo

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

Group Theory · Mathematics 2019-05-13 W. A. de Graaf , A. S. Detinko , D. L. Flannery

In this short note we count the finite semirings up to isomorphism, and up to isomorphism and anti-isomorphism for some small values of $n$; for which we utilise the existing library of small semigroups in the GAP package Smallsemi.

Rings and Algebras · Mathematics 2025-12-02 J. Edwards , J. D. Mitchell , P. Ragavan

Finite quandles with n elements can be represented as n-by-n matrices. We show how to use these matrices to distinguish all isomorphism classes of finite quandles for a given cardinality n, as well as how to compute the automorphism group…

Geometric Topology · Mathematics 2007-05-23 Benita Ho , Sam Nelson

We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…

Group Theory · Mathematics 2018-11-14 Avraham Aizenbud , Nir Avni

We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.

Commutative Algebra · Mathematics 2009-01-08 Anurag K. Singh , Irena Swanson

We describe a new arithmetic system for the Magma computer algebra system for working with $p$-adic numbers exactly, in the sense that numbers are represented lazily to infinite $p$-adic precision. This is the first highly featured such…

Number Theory · Mathematics 2020-08-26 Christopher Doris

We describe the computation of class groups and unit groups of number fields as implemented in Magma (V2.29). After quickly reviewing the main algorithms based on factor bases, relation collection, and analytic class number evaluation, we…

Number Theory · Mathematics 2025-10-08 Andreas-Stephan Elsenhans , John Voight

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

Group Theory · Mathematics 2019-11-11 Alexander Bors

We determine the numbers of integral tetrahedra with diameter $d$ up to isomorphism for all $d\le 1000$ via computer enumeration. Therefore we give an algorithm that enumerates the integral tetrahedra with diameter at most $d$ in $O(d^5)$…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz

For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set…

Group Theory · Mathematics 2019-07-29 C. R. Leedham-Green , E. A. O'Brien

Let $n$ be a positive integer, $\sigma$ be an element of the symmetric group $\mathcal{S}_n$ and let $\sigma$ be a cycle of length $n$. The elements $\alpha ,\beta \in \mathcal{S}_n$ are $\sigma$-equivalent, if there are natural numbers $k$…

Combinatorics · Mathematics 2014-10-31 Krasimir Yordzhev

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…

Combinatorics · Mathematics 2007-05-23 Igor Rivin

A very classical subject in Commutative Algebra is the Invariant Theory of finite groups. In our work on 3-dimensional topology (S. King, Ideal Turaev-Viro invariants. To appear in Top. Appl.), we found certain examples of group actions on…

Commutative Algebra · Mathematics 2007-05-23 Simon A. King

We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.

Group Theory · Mathematics 2012-03-13 Junqin Li , Shouchuan Zhang , Hengtai Wang , Min Wu

We count subrings of small index of $\mathbb{Z}^n$, where the addition and multiplication are defined componentwise. Let $f_n(k)$ denote the number of subrings of index $k$. For any $n$, we give a formula for this quantity for all integers…

Combinatorics · Mathematics 2022-01-25 Stanislav Atanasov , Nathan Kaplan , Benjamin Krakoff , Julia Menzel

We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…

Combinatorics · Mathematics 2009-09-21 Daniel Appel

In this paper, we describe an elementary method for counting the number of non-isomorphic algebras of a fixed dimension over a given finite field. We show how this method works for the explicit example of $2$-dimensional algebras over the…

Rings and Algebras · Mathematics 2019-09-30 Nikolaas D. Verhulst
‹ Prev 1 2 3 10 Next ›