We define a code in a sofic shift as a set of blocks of symbols of the shift such that any block of the shift has at most one decomposition into code words. It is maximal if it is not strictly included in another one. Such a code is complete in the sofic shift if any block of the shift occurs within some concatenation of code words. We prove that a maximal code in an irreducible sofic shift is ...

The decompositions of the Fock and Basic modules of the affine Lie algebra ŝlN into irreducible submodules of the Yangian algebra Y (glN ) are constructed. Each of the irreducible submodules admits the unique up to normalization eigenbasis of the maximal commutative subalgebra of the Yangian. The elements of this eigenbasis are identified with specializations of Macdonald symmetric functions wh...

Usually, it is difficult to determine the weight distribution of an irreducible cyclic code. In this paper, we discuss the case when an irreducible cyclic code has the maximal number of distinct nonzero weights and give a necessary and sufficient condition. In this case, we also obtain a divisible property for the weight of a codeword. Further, we present a necessary and sufficient condition fo...

We give a characterization for irreducible numerical semi-groups. From this characterization we obtain that every irre-ducible numerical semigroup is either a symmetric or pseudo-symmetric numerical semigroup. We study the minimal presentations of an irreducible numerical semigroup. Separately, we deal with the cases of maximal embedding dimension and multiplicity 3 and 4.

We extend the Gröbner basis theory developed in [10, 11] to certain non-homogeneous, locally filtered finitely generated ideals in R0 , and to certain admissible orders. The main tool used is the study of two homogeneous ideals that may be associated to an ideal I R0 , namely the ideal grT (I) generated by all homogenous components of maximal degree of elements in I , and the “homogenized” idea...

abstract. in this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.

the aim of this note is to characterize the finite groups in which all non-linear irreducible characters have distinct zero entries number.