Related papers: Computations of generating lengths with GAP
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…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
The theory of nilpotent orbits of simple Lie algebras has seen tremendous developments over the past decades. In this context an important role is played by the component group of the stabilizer of a nilpotent element. In this work, the aim…
We present a MATLAB/Octave toolbox to decompose finite dimensionial representations of compact groups. Surprisingly, little information about the group and the representation is needed to perform that task. We discuss applications to…
We present a swift walk-through of our recent work that uses machine learning to fit interatomic potentials based on quantum mechanical data. We describe our Gaussian Approximation Potentials (GAP) framework, discussing a variety of…
We present CubicJordanMatrixAlg, a GAP package for symbolic computation in cubic Jordan matrix algebras and in related Lie-theoretic structures. As an application, we use it to compute certain (commutator) relations in $F_4$-graded groups…
The growth of a finitely generated group is an important geometric invariant which has been studied for decades. It can be either polynomial, for a well-understood class of groups, or exponential, for most groups studied by geometers, or…
We introduce the notion of commuting probability, $p(G)$, for an algebraic group $G$. This notion is inspired by the corresponding notions in finite groups and compact groups. The computation of $p(G)$ for reductive groups is readily done…
This paper investigates the finite generation of cluster automorphism groups. By applying the pseudo $\mathbb{N}$-grading introduced in our previous work, we establish a sufficient condition for a cluster automorphism group to be finitely…
This paper focuses on the generalized grouping problem in the context of cellular manufacturing systems (CMS), where parts may have more than one process route. A process route lists the machines corresponding to each part of the operation.…
Combinatorial Hopf algebras give a linear algebraic structure to infinite families of combinatorial objects, a technique further enriched by the categorification of these structure via the representation theory of families of algebras. This…
In this paper, we count the number of matrices whose rows generate different $\mathbb{Z}_2\mathbb{Z}_8$ additive codes. This is a natural generalization of the well known Gaussian numbers that count the number of matrices whose rows…
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…
Letting $G=F/R$ be a finitely-presented group, Hopf's formula expresses the second integral homology of $G$ in terms of $F$ and $R$. Expanding on previous work, we explain how to find generators of $H_2(G;\mathbb{F}_p)$. The context of the…
Quaternionic automorphic representations are one attempt to generalize to other groups the special place holomorphic modular forms have among automorphic representations of $\mathrm{GL}_2$. Here, we use "hyperendoscopy" techniques to…
Successive pairs of pseudo-random numbers generated by standard linear congruential transformations display ordered patterns of parallel lines. We study the ``ordered'' and ``chaotic'' distribution of such pairs by solving the eigenvalue…
There is a long tradition of categorifying combinatorial Hopf algebras by the modules of a tower of algebras (or even better via the representation theory of a tower of groups). From the point of view of combinatorics, such a…
The aim of this paper is to present an algorithm the complexity of which is polynomial to compute the semi-simplified modulo $p$ of a semi-stable $\Q_p$-representation of the absolute Galois group of a $p$-adic field (\emph{i.e.} a finite…
Let $G$ be a connected reductive group over a totally real field $F$ which is compact modulo center at archimedean places. We find congruences modulo an arbitrary power of p between the space of arbitrary automorphic forms on $G(\mathbb…
We discuss algebraic/numeric methods to compute one-loop corrections for multiparticle/jet production cross sections. By using efficient reduction algorithms a compact expression for the ggg\gamma\gamma -> 0 amplitude is obtained. Further a…