<?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/150398">
<title>Algebra and Discrete Mathematics, 2017, Vol. 23, № 1</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/150398</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/155960"/>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/155938"/>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/155937"/>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/155936"/>
</rdf:Seq>
</items>
<dc:date>2026-04-21T01:12:12Z</dc:date>
</channel>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/155960">
<title>A criterion of elementary divisor domain for distributive domains</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/155960</link>
<description>A criterion of elementary divisor domain for distributive domains
Bokhonko, V.; Zabavsky, B.V.
In this paper we introduce the notion of the neat range one for Bezout duo-domains. We show that a distributive Bezout domain is an elementary divisor domain if and only if it is a duo-domain of neat range one.
</description>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/155938">
<title>Igor Rostislavovich Shafarevich (03.06.1923 -- 19.02.2017)</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/155938</link>
<description>Igor Rostislavovich Shafarevich (03.06.1923 -- 19.02.2017)
Drozd, Yu.; Kirichenko, V.; Petravhuk, A.; Petrychkvych, V.; Shapochka, I.; Zabavskiy, B.; Zhuchok, A.; Varbanets, P.
The great Russian mathematician Igor Rostislavovich Shafarevich died on February 19, 2017. This news grieved the whole mathematical society, since his name was inseparably linked to so many outstanding achievements and ideas of the modern mathematics, especially number theory and algebraic geometry.
</description>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/155937">
<title>Dg algebras with enough idempotents, their dg modules and their derived categories</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/155937</link>
<description>Dg algebras with enough idempotents, their dg modules and their derived categories
Saorín, M.
We develop the theory dg algebras with enough idempotents and their dg modules and show their equivalence with that of small dg categories and their dg modules. We introduce the concept of dg adjunction and show that the classical covariant tensor-Hom and contravariant Hom-Hom adjunctions of modules over associative unital algebras are extended as dg adjunctions between categories of dg bimodules. The corresponding adjunctions of the associated triangulated functors are studied, and we investigate when they are one-sided parts of bifunctors which are triangulated on both variables. We finally show that, for a dg algebra with enough idempotents, the perfect left and right derived categories are dual to each other.
</description>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/155936">
<title>Equivalence of Carter diagrams</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/155936</link>
<description>Equivalence of Carter diagrams
Stekolshchik, R.
We introduce the equivalence relation ρ on the set of Carter diagrams and construct an explicit transformation of any Carter diagram containing l-cycles with l&gt;4 to an equivalent Carter diagram containing only 4-cycles. Transforming one Carter diagram Γ₁ to another Carter diagram Γ₂ we can get a certain intermediate diagram Γ′ which is not necessarily a Carter diagram. Such an intermediate diagram is called a connection diagram. The relation ρ is the equivalence relation on the set of Carter diagrams and connection diagrams. The properties of connection and Carter diagrams are studied in this paper. The paper contains an alternative proof of Carter's classification of admissible diagrams.
</description>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</item>
</rdf:RDF>
