Related papers: Computations of generating lengths with GAP
Motivated by Freyd's famous unsolved problem in stable homotopy theory, the generating hypothesis for the stable module category of a finite group is the statement that if a map in the thick subcategory generated by the trivial…
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…
This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…
A ghost over a finite p-group G is a map between modular representations of G which is invisible in Tate cohomology. Motivated by the failure of the generating hypothesis---the statement that ghosts between finite-dimensional…
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
We study several closely related invariants of the group algebra $kG$ of a finite group. The basic invariant is the ghost number, which measures the failure of the generating hypothesis and involves finding non-trivial composites of maps…
In this paper, we described the GAP implementation of crossed modules of commutative algebras and cat$^{1}$-algebras and their equivalence.
We construct extensions of the field of rational numbers with the Galois group G_2(F_p) by reducing p-adic representations attached to automorphic representations.
The mathematical software \texttt{GAP} (Groups, Algorithms, Programming) offers a powerful set of tools to investigate computationally group theory. Using this software package we investigate a variation of a well-known problem in…
We develop practical techniques to compute with arithmetic groups $H\leq \mathrm{SL}(n,\mathbb{Q})$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$,…
The main results in this thesis deal with the representation growth of certain classes of groups. In chapter $1$ we present the required preliminary theory. In chapter $2$ we introduce the Congruence Subgroup Problem for an algebraic group…
We illustrate the Lie theoretic capabilities of the computational algebra system GAP4 by reporting on results on nilpotent orbits of simple Lie algebras that have been obtained using computations in that system. Concerning reachable…
Using the \texttt{WeylModules} \textsf{GAP} Package, we compute structural information about certain Weyl modules for type $G_2$ in characteristic $2$. This gives counterexamples to two conjectures stated by S.~Donkin in 1990. It also…
In this paper, we describe an algorithm for computing algebraic modular forms on compact inner forms of $\mathrm{GSp}_4$ over totally real number fields. By analogues of the Jacquet-Langlands correspondence for $\mathrm{GL}_2$, this…
Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this…
In this paper, we define the notion of crossed modules of groups with action and investigate related structures. Functions for computing of these structures have been written using the GAP computational discrete algebra programming…
We define matrix models that converge to the generating functions of a wide variety of loop models with fugacity taken in sets with an accumulation point. The latter can also be seen as moments of a non-commutative law on a subfactor planar…
A random number generator for the Kappa velocity distribution in particle simulations is proposed. Approximating the cumulative distribution function with the q-exponential function, an inverse transform procedure is constructed. The…
We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…
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…