http://dspace.nbuv.gov.ua:80/handle/123456789/150385 Thu, 09 Apr 2026 14:12:53 GMT 2026-04-09T14:12:53Z http://dspace.nbuv.gov.ua:80/bitstream/id/448158/ http://dspace.nbuv.gov.ua:80/handle/123456789/150385 http://dspace.nbuv.gov.ua:80/handle/123456789/153355 On elements of high order in general finite fields Popovych, R. Wed, 01 Jan 2014 00:00:00 GMT http://dspace.nbuv.gov.ua:80/handle/123456789/153355 2014-01-01T00:00:00Z http://dspace.nbuv.gov.ua:80/handle/123456789/153354 The endomorphisms monoids of graphs of order n with a minimum degree n − 3 Pipattanajinda, N.; Knauer, U.; Gyurov, B.; Panma, S. We characterize the endomorphism monoids, End(G), of the generalized graphs G of order n with a minimum degree n − 3. Criteria for regularity, orthodoxy and complete regularity of those monoids based on the structure of G are given. Wed, 01 Jan 2014 00:00:00 GMT http://dspace.nbuv.gov.ua:80/handle/123456789/153354 2014-01-01T00:00:00Z http://dspace.nbuv.gov.ua:80/handle/123456789/153353 A nilpotent non abelian group code Nebe, G.; Schäfer, A. The paper reports an example for a nilpotent group code which is not monomially equivalent to some abelian group code. Wed, 01 Jan 2014 00:00:00 GMT http://dspace.nbuv.gov.ua:80/handle/123456789/153353 2014-01-01T00:00:00Z http://dspace.nbuv.gov.ua:80/handle/123456789/153333 A geometrical interpretation of infinite wreath powers Mikaelian, V.H. A geometrical construction based on an infinite tree graph is suggested to illustrate the concept of infinite wreath powers of P.Hall. We use techniques based on infinite wreath powers and on this geometrical constriction to build a 2-generator group which is not soluble, but in which the normal closure of one of the generators is locally soluble. Wed, 01 Jan 2014 00:00:00 GMT http://dspace.nbuv.gov.ua:80/handle/123456789/153333 2014-01-01T00:00:00Z