Related papers: BCK-algebras arising from block codes
Algebras generated by strictly positive matrices are described up to similarity, including the commutative, simple, and semisimple cases. We provide sufficient conditions for some block diagonal matrix algebras to be generated by a set of…
In this chapter, starting from some results obtained in the papers [FV; 19], [FHSV; 19], we provide some examples of finite bounded commutative BCK- algebras, using the Wajsberg algebra associated to a bounded commutative BCK- algebra. This…
We provide a complete classification of all algebras of generalised dihedral type, which are natural generalizations of algebras which occurred in the study of blocks with dihedral defect groups. This gives a description by quivers and…
A study of the existing linear algebra libraries that you can use from C++
Leibniz algebras generated by one element, called cyclic, provide simple and illuminating examples of many basic concepts. It is the purpose of this paper to illustrate this fact.
In this paper we describe the blocks of the partition algebra over a field of positive characteristic.
We generalize the construction of the bangle, band and the bracelet bases for cluster algebras from orbifolds to the case where there is only one marked point on the boundary.
Hom-algebras over a PROP are defined and studied. Several twisting constructions for Hom-algebras over a large class of PROPs are proved, generalizing many such results in the literature. Partial classification of Hom-algebras over a PROP…
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…
We propose an algorithm to find a lower bound for the number of cyclic codes over any finite field with any given exponent. Besides, we give a formula to find the exponent of BCH codes.
We recall the derived subalgebra of a BCK-algebra, and use this to define the derived ideal. Using the derived ideal, we show that the category of commutative BCK-algebras is a reflective subcategory of the category of BCK-algebras. After…
We consider the problem of constructing semisimple subalgebras of real (semi-) simple Lie algebras. We develop computational methods that help to deal with this problem. Our methods boil down to solving a set of polynomial equations. In…
We give a construction of Rota-Baxter coalgebras from Hopf module coalgebras and also derive the structures of the pre-Lie coalgebras via Rota-Baxter coalgebras of different weight. Finally, the notion of Rota-Baxter bialgebra is introduced…
We present methods for obtaining new solutions to the bispectral problem. We achieve this by giving its abstract algebraic version suitable for generalizations. All methods are illustrated by new classes of bispectral operators.
An algebraic deformation theory of module-algebras over a bialgebra is constructed. The cases of module-coalgebras, comodule-algebras, and comodule-coalgebras are also considered.
Many matrices associated with fast transforms posess a certain low-rank property characterized by the existence of several block partitionings of the matrix, where each block is of low rank. Provided that these partitionings are known,…
Let $L$ be a Lie algebra of Block type over $\C$ with basis $\{L_{\alpha,i}\,|\,\alpha,i\in\Z\}$ and brackets $[L_{\alpha,i},L_{\beta,j}]=(\beta(i+1)-\alpha(j+1))L_{\alpha+\beta,i+j}$. In this paper, we shall construct a formal distribution…
The BRST structure of polynomial Poisson algebras is investigated. It is shown that Poisson algebras provide non trivial models where the full BRST recursive procedure is needed. Quadratic Poisson algebras may already be of arbitrarily high…
A cluster algebra is unistructural if the set of its cluster variables determines its clusters and seeds. It is conjectured that all cluster algebras are unistructural. In this paper, we show that any cluster algebra arising from a…
The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by discrete tomography. In this paper we approach the problem…