Related papers: Code loops: automorphisms and representations
This is a companion to our lectures GAP and loops, to be delivered at the Workshops Loops 2007, Prague, Czech Republic. In the lectures we introduce the GAP package LOOPS, describe its capabilities, and explain in detail how to use it. In…
Synthesizing inductive loop invariants is fundamental to automating program verification. In this work, we observe that Large Language Models (such as gpt-3.5 or gpt-4) are capable of synthesizing loop invariants for a class of programs in…
We derive presentations for Moufang loops of type $M(G,2)$, defined by Chein, with $G$ finite, two-generated. We then use $G=S_3$ to visualize the smallest non-associative Moufang loop.
The total homology of the loop space of the configuration space of ordered distinct n points in R^m has a structure of a Hopf algebra defined by the 4-term relations if m>2. We describe a relation of between the cohomology of this loop…
We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat…
In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…
We propose a project for automatic representation and evaluation of helicity amplitudes we started to develop and explain it's main functioning principles.
In this paper, we explore a connection between binary hierarchical models, their marginal polytopes and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is…
In this paper we investigate the Bol loops and connected with them groups. We prove an analog of the Doro's theorem for Moufang loops and find a criterion for simplicity of Bol loops. One of the main results obtained is the following: if…
It is proved that the maximum condition for subloops in a commutative Moufang loop $Q$ is equivalent with the conditions of finite generating of different subloops of the loop $Q$ and different subgroups of the multiplication group of the…
We describe, up to degree equal to the rank, the Lie algebra associated with the automorphism group of a free group. We compute in particular the ranks of its homogeneous components, and their structure as modules over the linear group.…
We investigate the problem of defining group or loop structures on spheres, where by ''sphere'' we mean the level set q(x) = c of a general K-valued quadratic form q, for an invertible scalar c. When K is a field and q non-degenerate, then…
A toric code is an error-correcting code determined by a toric variety or its associated integral convex polytope. We investigate $4$- and $5$-dimensional toric $3$-fold codes, which are codes arising from polytopes in $\mathbf{R}^3$ with…
We describe all constructions for loops of Bol-Moufang type analogous to the Chein construction $M(G,*,g_0)$ for Moufang loops.
Convolutional codes are constructed, designed and analysed using row and/or block structures of unit algebraic schemes. Infinite series of such codes and of codes with specific properties are derived. Properties are shown algebraically and…
We deduce from the work of Chen, that the restriction morphism from closed free iterated integrals to closed iterated integrals on loops is onto. We use this to show that the module of higher order invariants of smooth functions is…
Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…
Loop invariants are properties of a program loop that hold both before and after each iteration of the loop. They are often used to verify programs and ensure that algorithms consistently produce correct results during execution.…
There are many declarative frameworks that allow us to implement code formatters relatively easily for any specific language, but constructing them is cumbersome. The first problem is that "everybody" wants to format their code differently,…
The causal representation of multi-loop scattering amplitudes, obtained from the application of the loop-tree duality formalism, comprehensively elucidates, at integrand level, the behaviour of only physical singularities. This…