Related papers: Computations of generating lengths with GAP

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We develop a suitable version of the stable module category of a finite group G over an arbitrary commutative ring k. The purpose of the construction is to produce a compactly generated triangulated category whose compact objects are the…

This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…

An algorithmic computation of the set of unpointed stable homotopy classes of equivariant fibrewise maps was described in a recent paper of the author and his collaborators. In the present paper, we describe a simplification of this…

We prove that if $G$ is finite 2-generated $p$-group of nilpotence class at most 2 then the group algebra of $G$ with coefficients in the field with $p$ elements determines $G$ up to isomorphisms.

This paper classifies the derivations of group algebras in terms of the generators and defining relations of the group. If $RG$ is a group ring, where $R$ is commutative and $S$ is a set of generators of $G$ then necessary and sufficient…

In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…

For any prime number p and any positive real number {\alpha}, we construct a finitely generated group {\Gamma} with p-gradient equal to {\alpha}. This construction is used to show that there exist uncountably many pairwise non-commensurable…

We present a Serre-type conjecture on the modularity of four-dimensional symplectic mod p Galois representations. We assume that the Galois representation is irreducible and odd (in the symplectic sense). The modularity condition is…

We construct a functor from the category of admissible finitely presented o-representations of GL(2,F) to the category of finite length o-representations of Gal_{Q_p}, for any finite extension F of Q_p and the ring of integers o of a finite…

In support variety theory, representations of a finite dimensional (Hopf) algebra $A$ can be studied geometrically by associating any representation of $A$ to an algebraic variety using the cohomology ring of $A$. An essential assumption in…

We study finite-dimensional representations of hyper loop algebras, i.e., the hyperalgebras over an algebraically closed field of positive characteristic associated to the loop algebra over a complex finite-dimensional simple Lie algebra.…

Recent work has used deep learning to derive symmetry transformations, which preserve conserved quantities, and to obtain the corresponding algebras of generators. In this letter, we extend this technique to derive sparse representations of…

We outline how the group $K_{-1}( \mathbb{Z}[G] )$ for a finite group $G$ can be computed using the computer language $GAP$ and compile a table of all groups $G$ of order less than $100$ that have torsion in $K_{-1}( \mathbb{Z}[G] )$.

Using the computational algebra system GAP (http://www.gap-system.org) and the GAP package LAGUNA (http://www.cs.st-andrews.ac.uk/~alexk/laguna.htm), we checked that all 2-groups of order not greater than 32 are determined by normalized…

Most recently, there has been significant interest in learning contextual representations for various NLP tasks, by leveraging large scale text corpora to train large neural language models with self-supervised learning objectives, such as…

A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.

We use the Hopf algebra structure of the time-ordered algebra of field operators to generate all connected weighted Feynman graphs in a recursive and efficient manner. The algebraic representation of the graphs is such that they can be…

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…

Generative models for source code are an interesting structured prediction problem, requiring to reason about both hard syntactic and semantic constraints as well as about natural, likely programs. We present a novel model for this problem…