Related papers: HeLP -- A GAP-package for torsion units in integra…
H. J. Zassenhaus conjectured that any unit of finite order and augmentation one in the integral group ring of a finite group $G$ is conjugate in the rational group algebra to an element of $G$. One way to verify this is showing that such…
In this article, we review the proofs of the first Zassenhaus Conjecture on conjugacy of torsion units in integral group rings for the alternating groups of degree 5 and 6, by Luthar-Passi and Hertweck. We describe how the study of these…
We report our experiences with the generalized integration-by-parts algorithm [hep-ph/9609429] in the context of calculations of a realistic one-loop subset of diagrams.
simpcomp is an extension (a so called package) to GAP, the well known system for computational discrete algebra. The package enables the user to compute numerous properties of (abstract) simplicial complexes, provides functions to construct…
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…
This article explains how to apply the computer algebra package GAP (www.gap-system.org) in the computation of the problems in quantum physics, in which the application of Lie algebra is necessary. The article contains several exemplary…
We investigate coherency properties of certain completed integral group rings, precisely for compact $p$-adic Lie groups.
We study a generalization of the Set Cover problem called the \emph{Partial Set Cover} in the context of geometric set systems. The input to this problem is a set system $(X, \mathcal{S})$, where $X$ is a set of elements and $\mathcal{S}$…
Sequential decision-making and motion planning for robotic manipulation induce combinatorial complexity. For long-horizon tasks, especially when the environment comprises many objects that can be interacted with, planning efficiency becomes…
HEALPix is a Hierarchical, Equal Area, and iso-Latitude Pixelisation of the sphere designed to support efficiently - local operations on the pixel set, - a hierarchical tree structure for multi-resolution applications, and - the global Fast…
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 generalize the Uhlenbeck-Segal theory for harmonic maps into compact semi-simple Lie groups to general Lie groups equipped with torsion free bi-invariant connection.
The subject of this paper is the technology (the "how") of constructing machine-learning interatomic potentials, rather than science (the "what" and "why") of atomistic simulations using machine-learning potentials. Namely, we illustrate…
ALHEP is the symbolic algebra program for high-energy physics. It deals with amplitudes calculation, matrix element squaring, Wick theorem, dimensional regularization, tensor reduction of loop integrals and simplification of final…
It is shown that for any torsion unit of augmentation one in the integral group ring $\mathbb{Z} G$ of a finite solvable group $G$, there is an element of $G$ of the same order.
A heap is a structure with a ternary operation which is intuitively a group with forgotten unit element. Quantum heaps are associative algebras with a ternary cooperation which are to the Hopf algebras what heaps are to groups, and, in…
Geometrical modelling generally provides the geometrical description of a special structure and a set of services to "navigate" through its structure. HEP geometrical modellers are designed to handle high complexity detector geometries and…
A fast algorithm to study one-dimensional self-gravitating systems, and, more generally, systems that are Lagrangian integrable between collisions, is presented. The algorithm is event-driven, and uses a heap-ordered set of predicted future…
TurboGAP is a software package designed for efficient molecular dynamics simulations using Gaussian Approximation Potential (GAP) machine-learning interatomic potentials (MLIP). In this work, we enhance the capabilities of TurboGAP for…
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…