Related papers: Some connections between BCK algebras and n ary bl…
We consider relationships between cubic algebras and implication algebras. We first exhibit a functorial construction of a cubic algebra from an implication algebra. Then we consider an collapse of a cubic algebra to an implication algebra…
We develop a theory of toroidal vertex algebras and their modules, and we give a conceptual construction of toroidal vertex algebras and their modules. As an application, we associate toroidal vertex algebras and their modules to toroidal…
Alphabetic codes and binary search trees are combinatorial structures that abstract search procedures in ordered sets endowed with probability distributions. In this paper, we design new linear-time algorithms to construct alphabetic codes,…
In this paper, we employ group rings and automorphism groups of binary linear codes to construct new record-breaking binary linear codes. We consider the semidirect product of abelian groups and cyclic groups and use these groups to…
A general framework for obtaining certain types of contracted and centrally extended algebras is presented. The whole process relies on the existence of quadratic algebras, which appear in the context of boundary integrable models.
A certain analysis of all possible associative binary operations on N is presented. This is equivalent with an analysis of all possible monoid structures on N. Several results and a conjecture in this regard are given.
The (co)homology theory of n-ary (co)compositions is a functor associating to $n$-ary (co)composition a complex. We present unified approach to the cohomology theory of coassociative and Lie coalgebras and for $2n$-ary cocompositions. This…
This article develops a comprehensive theory of multiary graded polyadic algebras, extending the classical concept of group-graded algebras to higher-arity structures. We introduce the notion of grading by multiary groups and investigate…
We present a procedure to construct (n+1)-Hom-Nambu-Lie algebras from n-Hom-Nambu-Lie algebras equipped with a generalized trace function. It turns out that the implications of the compatibility conditions, that are necessary for this…
A new type of algebras that represent a generalization of both quantum groups and braided groups is defined. These algebras are given by a pair of solutions of the Yang--Baxter equation that satisfy some additional conditions. Several…
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…
We present a structure associated to the class of linear codes. The properties of that structure are similar to some structures in the linear algebra techniques into the framework of the Gr\"obner bases tools. It allows to get some insight…
We introduce and investigate binary $(k,k)$-designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible…
Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…
Let $G$ be a finite nonabelian group. We show how an endomorphism of $G$ with abelian image gives rise to a family of binary operations $\{\circ_n: n\in \mathbb Z^{\ge 0}\}$ on $G$ such that $(G,\circ_m,\circ_n)$ is a skew left brace for…
Language theory, symbolic dynamics, modelisation of viral insertion into the genetic code of a host cell motivate the introduction of new types of bialgebras whose coalgebra parts are not necessarily coassociative. One of the aim of this…
Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…
Minimal linear codes are algebraic objects which gained interest in the last twenty years, due to their link with Massey's secret sharing schemes. In this context, Ashikhmin and Barg provided a useful and a quite easy to handle sufficient…
Algebraic-geometric codes can be constructed by evaluating a certain set of functions on a set of distinct rational points of an algebraic curve. The set of functions that are evaluated is the linear space of a given divisor or,…