Related papers: (Re)constructing Code Loops
Numerical reconstruction techniques are widely employed in the calculation of multi-loop scattering amplitudes. In recent years, it has been observed that the rational functions in multi-loop calculations greatly simplify under partial…
Motivated by polymer-based data-storage platforms that use chains of binary synthetic polymers as the recording media and read the content via tandem mass spectrometers, we propose a new family of codes that allows for both unique string…
The study of good nonregular fractional factorial designs has received significant attention over the last two decades. Recent research indicates that designs constructed from quaternary codes (QC) are very promising in this regard. The…
Boolean functions have important applications in cryptography and coding theory. Two famous classes of binary codes derived from Boolean functions are the Reed-Muller codes and Kerdock codes. In the past two decades, a lot of progress on…
A general outlook is presented on the study of multiloop topologies appearing for the first time at four loops. A unified description and representation of this family is provided, the so-called N$^4$MLT universal topology. Based on the…
In this paper we introduce the theory of multiplication alteration by two-cocycles for nonassociative structures like nonassociative bimonoids with left (right) division. Also we explore the connections between Yetter-Drinfeld modules for…
We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…
Building on recent progress in constructing derivations on Fourier algebras, we provide the first examples of locally compact groups whose Fourier algebras support non-zero, alternating 2-cocycles; this is the first step in a larger…
The problem of three-user multiple-access channel (MAC) with noiseless feedback is investigated. A new coding strategy is presented. The coding scheme builds upon the natural extension of the Cover-Leung (CL) scheme; and uses quasi-linear…
In this paper, we study the codes over the matrix ring over $\mathbb{Z}_4$, which is perhaps the first time the ring structure $M_2(\mathbb{Z}_4)$ is considered as a code alphabet. This ring is isomorphic to…
We put the known results on the antipode of a usual quasitriangular Hopf algebra into the framework of multiplier Hopf algebras. We illustrate with examples which can not be obtained using classical Hopf Algebras. The focus of the present…
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…
Iterated loop algebras are by definition obtained by repeatedly applying the loop construction, familiar from the theory of affine Kac-Moody Lie algebras, to a given base algebra. Our interest in this iterated construction is motivated by…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
In a recent paper, we defined twisted unitary $1$-groups and showed that they automatically induced error-detecting quantum codes. We also showed that twisted unitary $1$-groups correspond to irreducible products of characters thereby…
Viewing the Cayley-Dickson process as a graded construction provides a rigorous definition of associativity consisting of three classes and the non-associative parts dividing into four types. These simplify the Moufang loop identities and…
Let $A$ be a Hopf algebra over a field $K$ of characteristic 0 and suppose there is a coalgebra projection $\pi$ from $A$ to a sub-Hopf algebra $H$ that splits the inclusion. If the projection is $H$-bilinear, then $A$ is isomorphic to a…
A Code loop on a binary linear code that is doubly even with a factor set is shown to be a central loop, conjugacy closed loop, Burn loop and extra loop. General forms of the identities that define the factor set of a code are deduced.
We give a proof of a Conjecture of Walker which states that one can recover the lengths of the bars of a circular linkage from the cohomology ring of the configuration space. For a large class of length vectors, this has been shown by…
A Gray code is a listing structure for a set of combinatorial objects such that some consistent (usually minimal) change property is maintained throughout adjacent elements in the list. While Gray codes for m-ary strings have been…