Related papers: Computing with small quasigroups and loops
The program package XLOOPS calculates massive one- and two-loop Feynman diagrams. It consists of five parts: i) a graphical user interface ii) routines for generating diagrams from particle input iii) procedures for calculating one-loop…
These notes accompany a series of three lectures on automorphic loops to be delivered by the author at Workshops Loops '15 (Ohrid, Macedonia, 2015). Automorphic loops are loops in which all inner mappings are automorphisms. The first paper…
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
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
In this book, for the first time we introduce the notion of neutrosophic algebraic structures for groups, loops, semigroups and groupoids; and also their neutrosophic N-algebraic structures. One is fully aware of the fact that many…
We show how to obtain all nonassociative Moufang loops of order less than 64 and 4262 nonassociative Moufang loops of order 64 in a unified way. We conjecture that there are no other nonassociative Moufang loops of order 64. The main idea…
The package numericalsgps performs computations with and for numerical semigroups. Recently also affine semigroups are admitted as objects for calculations. This manuscript is a survey of what the package does, and at the same time of the…
In this paper, we discuss how to apply GAP to do computations in modular representation theory. Of particular interest is the generating number of a group algebra, which measures the failure of the generating hypothesis in the stable module…
For most (and possibly all) non-associative finite simple Moufang loops, three generators of order 3 can be chosen so that each two of them generate a group isomorphic to $(3, 3 | 3, p)$. The subgroup structure of $(3, 3 | 3, p)$ depends on…
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…
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…
We present GLoop, a Fortran90 computational framework that allows one to compute by Monte Carlo a certain class of higher-loop integrals in terms of lower-loop building blocks. This is based on a recently introduced method that enables the…
The Moufang loop named for Richard Parker is a central extension of the extended binary Golay code. It the prototypical example of a general class of nonassociative structures known today as code loops, which have been studied from a number…
The aim of XLOOPS is to calculate one-particle irreducible Feynman diagrams with one or two closed loops for arbitrary processes in the Standard model of particles and related theories. Up to now this aim is realized for all one-loop…
In these lectures we discuss some of the mathematical structures that appear when computing multi-loop Feynman integrals. We focus on a specific class of special functions, the so-called multiple polylogarithms, and discuss introduce their…
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…
Data visualization and interaction with large data sets is known to be essential and critical in many businesses today, and the same applies to research and teaching, in this case, when exploring large and complex mathematical objects. GAP…
These are expanded lecture notes of a series of expository talks surveying basic aspects of group cohomology and homology. They were written for someone who has had a first course in graduate algebra but no background in cohomology. You…
Complex networks are relational data sets commonly represented as graphs. The analysis of their intricate structure is relevant to many areas of science and commerce, and data sets may reach sizes that require distributed storage and…
This article is intended to an introductory lecture in material physics, in which the modern computational group theory and the electronic structure calculation are in collaboration. The effort of mathematicians in field of the group…