Related papers: Computing with small quasigroups and loops
We present a new algorithm for the reduction of one-loop tensor Feynman integrals within the framework of the XLOOPS project, covering both mathematical and programming aspects. The new algorithm supplies a clean way to reduce the one-loop…
Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of covering type. In spite of their widespread use, these…
In the recent years there has been an enormous development in the evaluation of higher order quantum corrections. An essential ingredient in the practical calculations is provided by vacuum diagrams, i.e. integrals without external momenta.…
The method of using Hopf algebras for calculating Feynman integrals developed by Abreu et al. is applied to the two-loop non-planar on-shell diagram with massless propagators and three external mass scales. We show that the existence of the…
This is an outline of Erlangen Program at Large. Study of objects and properties, which are invariant under a group action, is very fruitful far beyond the traditional geometry. In this paper we demonstrate this on the example of the group…
We enumerate three classes of non-medial quasigroups of order $243=3^5$ up to isomorphism. There are $17004$ non-medial trimedial quasigroups of order $243$ (extending the work of Kepka, B\'en\'eteau and Lacaze), $92$ non-medial…
We present the Mathematica group theory package GTPack providing about 200 additional modules to the standard Mathematica language. The content ranges from basic group theory and representation theory to more applied methods like crystal…
In this short note we count the finite semirings up to isomorphism, and up to isomorphism and anti-isomorphism for some small values of $n$; for which we utilise the existing library of small semigroups in the GAP package Smallsemi.
This is an overview of Erlangen Programme at Large. Study of objects and properties, which are invariant under a group action, is very fruitful far beyond the traditional geometry. In this paper we demonstrate this on the example of the…
We present peapods (github.com/PeaBrane/peapods), an open-source Python package for Monte Carlo simulation of Ising spin systems with arbitrary coupling constants on periodic Bravais lattices with user-specified neighbor offsets. The…
We generalize the global construction of code loops introduced by Nagy, which is based on the connection between Moufang loops and groups with triality. This follows from the construction of a nilpotent group $G_n$ of class 3 with triality…
In this expository paper we present a brief introduction to the geometrical modeling of some quantum computing problems. After a brief introduction to establish the terminology, we focus on quantum information geometry and ZX-calculus,…
We describe in some detail the present features of an automatic loop calculation program as well as the integration techniques that go into it. The program, called XLOOPS 1.0, allows one to calculate massive one- and two-loop Feynman…
Code loops are Moufang loops constructed from doubly even binary codes. Then, given a code loop $L$, we ask which doubly even binary code $V$ produces $L$. In this sense, $V$ is called a representation of $L$. In this article we define and…
We introduce an algebro-geometrically motived integration-by-parts (IBP) reduction method for multi-loop and multi-scale Feynman integrals, using a framework for massively parallel computations in computer algebra. This framework combines…
Major advancements in building general-purpose and customized hardware have been one of the key enablers of versatility and pervasiveness of machine learning models such as deep neural networks. To sustain this ubiquitous deployment of…
The existence of finite simple non-Moufang Bol loops was considered as one of the main open problems in the theory of loops and quasigroups. In this paper, we present a class of proper simple Bol loops. This class also contains finite and…
An important objective of research in counting complexity is to understand which counting problems are approximable. In this quest, the complexity class TotP, a hard subclass of #P, is of key importance, as it contains self-reducible…
The FormCalc package automates the computation of FeynArts amplitudes up to one loop including the generation of a Fortran code for the numerical evaluation of the squared matrix element. Major new or enhanced features in Version 5 are:…
One obstacle to the use of Gaussian processes (GPs) in large-scale problems, and as a component in deep learning system, is the need for bespoke derivations and implementations for small variations in the model or inference. In order to…