相关论文: Algorithms for fusion systems with applications to…

We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…

The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…

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…

In this paper we give a classification of the rank two p-local finite groups for odd p. This study requires the analisis of the possible saturated fusion systems in terms of the outer automorphism group ant the proper F-radical subgroups.…

A p-local finite group consists of a finite p-group S, together with a pair of categories which encode ``conjugacy'' relations among subgroups of S, and which are modelled on the fusion in a Sylow p-subgroup of a finite group. It contains…

The theory of saturated fusion systems resembles in many parts the theory of finite groups. However, some concepts from finite group theory are difficult to translate to fusion systems. For example, products of normal subsystems with other…

Let $G$ be a classical group defined over a finite field. We consider the following fundamental problems concerning conjugacy in $G$: 1. List a representative for each conjugacy class of $G$. 2. Given $x \in G$, describe the centralizer of…

The aim of this paper is to generalise the notion of p-stability to fusion systems. We study the question how Qd(p) is involved in finite simple groups. We show that with a single exception a simple group involving Qd(p) has a subgroup…

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…

A fast algorithm to study one-dimensional self-gravitating systems, and, more generally, systems that are Lagrangian integrable between collisions, is presented. The algorithm is event-driven, and uses a heap-ordered set of predicted future…

We describe a group theoretic analysis of Shor's algorithm and other related hidden subgroup problems in mathematics and relate these to symmetries of molecular and condensed phase assemblies. By recasting Shor's algorithm through the lens…

Many large-scale machine learning (ML) systems allow specifying custom ML algorithms by means of linear algebra programs, and then automatically generate efficient execution plans. In this context, optimization opportunities for fused…

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G cong H. For several decades, the n^(log_p n + O(1)) generator-enumeration bound (where p is the smallest prime…

We prove that if $\mathcal{E}\trianglelefteq\mathcal{F}$ are saturated fusion systems over $p$-groups $T\trianglelefteq S$, such that $C_S(\mathcal{E})\le T$, and either $Aut_{\mathcal{F}}(T)/Aut_{\mathcal{E}}(T)$ or $Out(\mathcal{E})$ is…

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…

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…

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…

In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…

We give several algorithms addressing computations of intersections of conjugate subgroups.

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…