<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/150385">
<title>Algebra and Discrete Mathematics, 2014, Vol. 18, № 2</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/150385</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/153355"/>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/153354"/>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/153353"/>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/153333"/>
</rdf:Seq>
</items>
<dc:date>2026-04-09T14:18:42Z</dc:date>
</channel>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/153355">
<title>On elements of high order in general finite fields</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/153355</link>
<description>On elements of high order in general finite fields
Popovych, R.
</description>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/153354">
<title>The endomorphisms monoids of graphs of order n with a minimum degree n − 3</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/153354</link>
<description>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.
</description>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/153353">
<title>A nilpotent non abelian group code</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/153353</link>
<description>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.
</description>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/153333">
<title>A geometrical interpretation of infinite wreath powers</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/153333</link>
<description>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.
</description>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</item>
</rdf:RDF>
