Let n be a positive integer and let k be a field (of arbitrary characteristic) accessible to symbolic computation. We describe an algorithmic test for determining whether or not a finitely presented k-algebra R has infinitely many equivalence classes of semisimple representations R → Mn(k′), where k is the algebraic closure of k. The test reduces the problem to computational commutative algebra...

let r be a commutative ring with identity. let n and k be two submodules of a multiplication r-module m. thenn=im and k=jm for some ideals i and j of r. the product of n and k denoted by nk is defined by nk=ijm. inthis paper we characterize some particular cases of multiplication modules by using the product of submodules.

The main aim of this work is to introduce and study the notions ideal direct product d-algebras, d-ideal sub-direct edge positive implicative d-algebras investigate their characterizations.

Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided. The presence of weights slightly complicates the situation in comparison to the unweighted case. In addition, the first hyper-minimization algorithm for deterministic weighted tree automata, weighted over commutati...

The fuzzy p-ideals, fuzzy H-ideals and fuzzy BCI-positive implicative ideals of BCI-algebras are studied, and related properties are investigated. We also give some characterizations of these ideals. Mathematics Subject Classifications (2000). 03G25, 06F35, 06B99

It was known that the quaternion group and the octic group could not be generated by the squares of any group [5, pp. 193-194]. A natural question is which groups are generated by the squares of some groups. Clearly, groups of odd order and simple groups are generated by their own squares. In this paper, we show in a concrete manner that abelian groups are generated by the squares of some group...