Related papers: Rectangular loops and rectangular quasigroups
We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…
The famous pancake theorem states that for every finite set $X$ in the plane, there exist two orthogonal lines that divide $X$ into four equal parts. We propose an algorithm whose running time is linear in the number of points in $X$ and…
Rational counterterms are a key ingredient for the automation of loop calculations through numerical methods. Building on the recently established properties of rational terms of UV origin at two loops, in this paper we present a systematic…
Finite groups are of the greatest importance in science. Loops are a simple generalization of finite groups: they share all the group axioms except for the requirement that the binary operation be associative. The least loops that are not…
The main result of this paper states that for any group $G$ with an automatic structure $L$ with unique representatives one can construct a uniform partial algorithm which detects $L$-rational subgroups and gives their preimages in $L$.…
Slattery (2007) described computational methods to enumerate, construct, and identify finite groups of squarefree order. We generalise Slattery's result to the class of finite groups that have cyclic Sylow subgroups and provide an…
Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…
We write the loop equations for the $\beta$ two-matrix model, and we propose a topological recursion algorithm to solve them, order by order in a small parameter. We find that to leading order, the spectral curve is a "quantum" spectral…
The "loop equations" of random matrix theory are a hierarchy of equations born of attempts to obtain explicit formulae for generating functions of map enumeration problems. These equations, originating in the physics of 2-dimensional…
We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…
We introduce here a new axiomatisation of the rational fragment of the ZX-calculus, a diagrammatic language for quantum mechanics. Compared to the previous axiomatisation introduced in [8], our axiomatisation does not use any metarule , but…
The current form of quantum mechanics is very successful and is almost certainly correct. It is remarkable, however, that the entire structure-from the mass, spin and charge labels on particlelike states to antisymmetry to broken internal…
We study a completely-packed loop model with crossings in a three-dimensional lattice and confirm it is described by $\mathrm{RP}^{n-1}$ sigma field theories. We use Monte Carlo simulations, with systems sizes up to…
We develop a behavioural theory of reflective sequential algorithms (RSAs), i.e. sequential algorithms that can modify their own behaviour. The theory comprises a set of language-independent postulates defining the class of RSAs, an…
Approximate but reliable solutions of a quantum system with $N$ identical particles can be easily computed with the envelope theory, also known as the auxiliary field method. This technique has been developed for Hamiltonians with arbitrary…
In \cite{Kramer11} Kramer proves for a large class of semisimple Lie groups that they admit just one locally compact $\sigma$-compact Hausdorff topology compatible with the group operations. We present two different methods of generalising…
Noting that lemmas are a key feature of mathematics, we engage in an investigation of the role of lemmas in automated theorem proving. The paper describes experiments with a combined system involving learning technology that generates…
A pseudomodular group is a discrete subgroup $\Gamma \leq PGL(2,\mathbb{Q})$ which is not commensurable with $PSL(2,\mathbb{Z})$ and has cusp set precisely $\mathbb{Q}\cup\{\infty\}$. The existence of such groups was proved by Long and…
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…
The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt G\"odel's famous incompleteness theorems, we nowadays know numerous…