Related papers: Algorithms for fusion systems with applications to…

Biclustering techniques have been widely used to identify homogeneous subgroups within large data matrices, such as subsets of genes similarly expressed across subsets of patients. Mining a max-sum sub-matrix is a related but distinct…

For a finite abelian $p$-group $A$ and a subgroup $\Gamma\le\text{Aut}(A)$, we say that the pair $(\Gamma,A)$ is fusion realizable if there is a saturated fusion system $\mathcal{F}$ over a finite $p$-group $S\ge A$ such that $C_S(A)=A$,…

Performance analysis based on modelling consists of two major steps: model construction and model analysis. Formal modelling techniques significantly aid model construction but can exacerbate model analysis. In particular, here we consider…

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…

Every saturated fusion system corresponds to a group-like structure called a regular locality. In this paper we study (suitably defined) normalizers and centralizers of partial subnormal subgroups of regular localities. This leads to a…

We extend Dwyer's sharp subgroup homology decomposition of the classifying space of a finite group to arbitrary saturated fusion systems and arbitrary Mackey functors.

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

We present a systematic procedure for analyzing cumulants to arbitrary order in the context of heavy-ion collisions. It generalizes and improves existing procedures in many respects. In particular, particles which are correlated are allowed…

Let $q$ be a power of a fixed prime $p$. We classify up to isomorphism all simple saturated fusion systems on a certain class of $p$-groups constructed from the polynomial representations of $\mathrm{SL}_2(q)$, which includes the Sylow…

Saturated fusion systems are categories generalizing important aspects of conjugacy of $p$-subgroups in finite groups. It was shown by Chermak that there are group-like structures called regular localities associated to saturated fusion…

Federated learning (FL) is a distributed learning paradigm that allows several clients to learn a global model without sharing their private data. In this paper, we generalize a primal dual fixed point (PDFP) \cite{PDFP} method to federated…

We present an approach to design stabilizing controllers for a set of linear systems without restrictions regarding their modeling order. To this end, the systems are treated as abstract objects in the space of the $\nu$-gap metric. Via a…

This is a collection of examples showing how the GAP system can be used to compute information about the probabilistic generation of finite almost simple groups. It includes all examples that were needed for the computational results in the…

It is shown that any finite group $A$ is realizable as the automizer in a finite perfect group $G$ of an abelian subgroup whose conjugates generate $G$. The construction uses techniques from fusion systems on arbitrary finite groups, most…

We present a computer algebra package based on Magma for performing computations in rational Cherednik algebras at arbitrary parameters and in Verma modules for restricted rational Cherednik algebras. Part of this package is a new general…

We have used the SmallGroups library of groups, together with the computer algebra systems GAP and Mathematica, to search for groups with a three-dimensional irreducible representation in which one of the group generators has a…

Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…

Linking systems are crucial for studying the homotopy theory of fusion systems, but are also of interest from an algebraic point of view. We propose a definition of a linking system associated to a saturated fusion system which is more…

Steiner triple systems form one of the most studied classes of combinatorial designs. Configurations, including subsystems, play a central role in the investigation of Steiner triple systems. With sporadic instances of small systems, ad-hoc…

Let G be a finite group. A complete system of pairwise orthogonal idempotents is constructed for the wreath product of G by the symmetric group by means of a fusion procedure, that is by consecutive evaluations of a rational function with…