We study ideal languages generated by a single word. We provide an algorithm to construct a strongly connected synchronizing automaton for which such a language serves as the language of synchronizing words. Also we present a compact formula to calculate the syntactic complexity of this language.

We consider the Whitehead problem for principal ideal domains of large size. It is proved, in ZFC, that some p.i.d.’s of size ≥ א2 have nonfree Whitehead modules even though they are not complete discrete valuation rings. A module M is a Whitehead module if ExtR(M,R) = 0. The second author proved that the problem of whether every Whitehead Z-module is free is independent of ZFC + GCH (cf. [5], ...

Let R be a finite principal left ideal ring. Via a total ordering of the ring elements and an ordered basis a lexicographic ordering of the module R is produced. This is used to set up a greedy algorithm that selects vectors for which all linear combination with the previously selected vectors satisfy a pre-specified selection property and updates the to-be-constructed code to the linear hull o...

an ideal i of a ring r is called right baer-ideal if there exists an idempotent e 2 r such that r(i) = er. we know that r is quasi-baer if every ideal of r is a right baer-ideal, r is n-generalized right quasi-baer if for each i e r the ideal in is right baer-ideal, and r is right principaly quasi-baer if every principal right ideal of r is a right baer-ideal. therefore the concept of baer idea...