Hall sets,Lazard sets and comma-free codes

We investigate the relationship between two constructions of maximal comma-free codes described, respectively, by Eastman and by Scholtz and the notions of Hall sets and Lazard sets introduced in connection with factorizations of free monoids and bases of free Lie algebras.     

Free and cofree Hopf algebras

We first prove that a graded, connected, free and cofree Hopf algebra is always self-dual. Then, we prove that two graded, connected, free and cofree Hopf algebras are isomorphic if and only if they have the same Poincaré–Hilbert formal series. If the characteristic of the base field is zero, we prove that the Lie algebra of the primitive elements of such an object is free, and we deduce a characterization of the formal series of free and cofree Hopf algebras by a condition of growth of the coefficients. We finally show that two graded, connected, free and cofree Hopf algebras are isomorphic as (nongraded) Hopf algebras if and only if the Lie algebras of their primitive elements have the same number of generators.     

Bases, filtrations and module decompositions of free Lie algebras

We use the technique known as elimination to devise some new bases of the free Lie algebra which (like classical Hall bases) consist of Lie products of left normed basic Lie monomials. Our bases yield direct decompositions of the homogeneous components of the free Lie algebra with direct summands that are particularly easy to describe: they are tensor products of metabelian Lie powers. They also give rise to new filtrations and decompositions of free Lie algebras as modules for groups of graded algebra automorphisms. In particular, we obtain some new decompositions for free Lie algebras and free restricted Lie algebras over fields of positive characteristic.     

Novikov algebras and Novikov structures on Lie algebras

We study ideals of Novikov algebras and Novikov structures on finite-dimensional Lie algebras. We present the first example of a three-step nilpotent Lie algebra which does not admit a Novikov structure. On the other hand we show that any free three-step nilpotent Lie algebra admits a Novikov structure. We study the existence question also for Lie algebras of triangular matrices. Finally we show that there are families of Lie algebras of arbitrary high solvability class which admit Novikov structures.     

On Z2Z4-additive complementary dual codes and related LCD codes

Linear complementary dual codes were defined by Massey in 1992, and were used to give an optimum linear coding solution for the two user binary adder channel. In this paper, we define the analog of LCD codes over fields in the ambient space with mixed binary and quaternary alphabets. These codes are additive, in the sense that they are additive subgroups, rather than linear as they are not vector spaces over some finite field. We study the structure of these codes and we use the canonical Gray map from this space to the Hamming space to construct binary LCD codes in certain cases. We give examples of such binary LCD codes which are distance-optimal, i.e., they have the largest minimum distance among all binary LCD codes with the same length and dimension.     

c-Graded filiform Lie algebras

In this paper we generalize naturally graded filiform Lie algebras as well as filiform Lie algebras admitting a connected gradation of maximal length, by introducing the concept of c-graded complex filiform Lie algebras. We deal with the particular case of 3-graded filiform Lie algebras and we obtain their classification in arbitrary dimension. We finally show a link among derived algebras, graded filiform and rigid solvable Lie algebras.     

Lie ideals of graded associative algebras

We study the Lie structure of graded associative algebras. Essentially, we analyze the relation between Lie and associative graded ideals, and between Lie and associative graded derivations. Gathering together results on both directions, we compute maximal graded algebras of quotients of graded Lie algebras that arise from associative algebras. We also show that the Lie algebra Der _gr (A) of graded derivations of a graded semiprime associative algebra is strongly non-degenerate (modulo a certain ideal containing the center of Der _gr (A)).     

Two-letter group codes that preserve aperiodicity of inverse finite automata

We construct group codes over two letters (i.e., bases of subgroups of a two-generated free group) with special properties. Such group codes can be used for reducing algorithmic problems over large alphabets to algorithmic problems over a two-letter alphabet. Our group codes preserve aperiodicity of inverse finite automata. As an application we show that the following problems are PSpace-complete for two-letter alphabets (this was previously known for large enough finite alphabets): The intersection-emptiness problem for inverse finite automata, the aperiodicity problem for inverse finite automata, and the closure-under-radical problem for finitely generated subgroups of a free group. The membership problem for 3-generated inverse monoids is PSpace-complete. Both authors were supported in part by NSF grant DMS-9970471. The first author was also supported in part by NSF grant CCR-0310793. The second author acknowledges the support of the Excellency Center, “Group Theoretic Methods for the Study of Algebraic Varieties” of the Israeli Science Foundation.     

On quantum stabilizer codes derived from local Frobenius rings

In this paper we consider stabilizer codes over local Frobenius rings. Firstly, we study the relative minimum distances of a stabilizer code and its reduction onto the residue field. We show that for various scenarios, a free stabilizer code over the ring does not underperform the according stabilizer code over the field. This leads us to conjecture that the same is true for all free stabilizer codes. Secondly, we focus on the isometries of stabilizer codes. We present some preliminary results and introduce some interesting open problems.     

3-Filiform Leibniz algebras of maximum length,whose naturally graded algebras are Lie algebras

In this article we present the classification of the 3-filiform Leibniz algebras of maximum length, whose associated naturally graded algebras are Lie algebras. Our main tools are a previous existence result by Cabezas and Pastor [J.M. Cabezas and E. Pastor, Naturally graded p-filiform Lie algebras in arbitrary finite dimension, J. Lie Theory 15 (2005), pp. 379–391] and the construction of appropriate homogeneous bases in the connected gradation considered. This is a continuation of the work done in Ref. [J.M. Cabezas, L.M. Camacho, and I.M. Rodríguez, On filiform and 2-filiform Leibniz algebras of maximum length, J. Lie Theory 18 (2008), pp. 335–350].     

Binary permutation sequences as subsets of Levenshtein codes,spectral null codes,run-length limited codes and constant weight codes

We investigate binary sequences which can be obtained by concatenating the columns of (0,1)-matrices derived from permutation sequences. We then prove that these binary sequences are subsets of a surprisingly diverse ensemble of codes, namely the Levenshtein codes, capable of correcting insertion/deletion errors; spectral null codes, with spectral nulls at certain frequencies; as well as being subsets of run-length limited codes, Nyquist null codes and constant weight codes. This paper was presented in part at the IEEE Information Theory Workshop, Chengdu, China, October, 2006.     

Negacyclic duadic codes

This paper extends the concepts from cyclic duadic codes to negacyclic codes over F_q (q an odd prime power) of oddly even length. Generalizations of defining sets, multipliers, splittings, even-like and odd-like codes are given. Necessary and sufficient conditions are given for the existence of self-dual negacyclic codes over F_q and the existence of splittings of 2N, where N is odd. Other negacyclic codes can be extended by two coordinates in a way to create self-dual codes with familiar parameters.     

The centroid of extended affine and root graded Lie algebras

We develop general results on centroids of Lie algebras and apply them to determine the centroid of extended affine Lie algebras, loop-like and Kac-Moody Lie algebras, and Lie algebras graded by finite root systems.     

On Hermitian LCD codes and their Gray image

We provide methods and algorithms to construct Hermitian linear complementary dual (LCD) codes over finite fields. We study existence of self-dual basis with respect to Hermitian inner product, and as an application, we construct Euclidean LCD codes by projecting the Hermitian codes over such a basis. Many optimal quaternary Hermitian and ternary Euclidean LCD codes are obtained. Comparisons with classical constructions are made.     

A generalization of quasi-twisted codes: Multi-twisted codes

Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this work we introduce a new generalization of QT codes that we call multi-twisted (MT) codes and study some of their basic properties. Presenting several methods of constructing codes in this class and obtaining bounds on the minimum distances, we show that there exist codes with good parameters in this class that cannot be obtained as QT or constacyclic codes. This suggests that considering this larger class in computer searches is promising for constructing codes with better parameters than currently best-known linear codes. Working with this new class of codes motivated us to consider a problem about binomials over finite fields and to discover a result that is interesting in its own right.     

Constructions of optimal LCD codes over large finite fields

In this paper¹, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.     

On Anosov automorphisms of nilmanifolds

The only known examples of Anosov diffeomorphisms are hyperbolic automorphisms of infranilmanifolds, and the existence of such automorphisms is a really strong condition on the rational nilpotent Lie algebra determined by the lattice, so called an Anosov Lie algebra. We prove that n⊕?⊕n (s times, s≥2) has an Anosov rational form for any graded real nilpotent Lie algebra n having a rational form. We also obtain some obstructions for the types of nilpotent Lie algebras allowed, and use the fact that the eigenvalues of the automorphism are algebraic integers (even units) to show that the types (5,3) and (3,3,2) are not possible for Anosov Lie algebras.     

Exponentiation of infinite dimensional Z-graded lie algebras

In this article we give a new technique for exponentiating infinite dimensional graded representations of graded Lie algebras that allows for the exponentiation of some non-locally nilpotent elements. Our technique is to naturally extend the representation of the Lie algebra g on the space V naturally to a representation on a subspace £ of the dual space V ^*. After introducing the technique, we prove that it enables the exponentiation of all elements of free Lie Algebras and afhne Kac-Moody Lie algebras.     

Tensor products of ideal codes over Hopf algebras

We study indecomposable codes over a family of Hopf algebras introduced by Radford. We use properties of Hopf algebras to show that tensors of ideal codes are ideal codes, extending the corresponding result that was previously given in the case of Taft Hopf algebras and showing the differences with that case.