<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Algebra and Discrete Mathematics, 2014, Vol. 18, № 2</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/150385" rel="alternate"/>
<subtitle/>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/150385</id>
<updated>2026-04-09T14:18:00Z</updated>
<dc:date>2026-04-09T14:18:00Z</dc:date>
<entry>
<title>On elements of high order in general finite fields</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/153355" rel="alternate"/>
<author>
<name>Popovych, R.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/153355</id>
<updated>2019-06-14T22:27:00Z</updated>
<published>2014-01-01T00:00:00Z</published>
<summary type="text">On elements of high order in general finite fields
Popovych, R.
</summary>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>The endomorphisms monoids of graphs of order n with a minimum degree n − 3</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/153354" rel="alternate"/>
<author>
<name>Pipattanajinda, N.</name>
</author>
<author>
<name>Knauer, U.</name>
</author>
<author>
<name>Gyurov, B.</name>
</author>
<author>
<name>Panma, S.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/153354</id>
<updated>2019-06-14T22:26:56Z</updated>
<published>2014-01-01T00:00:00Z</published>
<summary type="text">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.
</summary>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>A nilpotent non abelian group code</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/153353" rel="alternate"/>
<author>
<name>Nebe, G.</name>
</author>
<author>
<name>Schäfer, A.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/153353</id>
<updated>2019-06-14T22:27:00Z</updated>
<published>2014-01-01T00:00:00Z</published>
<summary type="text">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.
</summary>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>A geometrical interpretation of infinite wreath powers</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/153333" rel="alternate"/>
<author>
<name>Mikaelian, V.H.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/153333</id>
<updated>2019-06-14T22:26:59Z</updated>
<published>2014-01-01T00:00:00Z</published>
<summary type="text">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.
</summary>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</entry>
</feed>
