<?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. - № 2 (24). - 2017</title>
<link href="http://hdl.handle.net/123456789/4548" rel="alternate"/>
<subtitle/>
<id>http://hdl.handle.net/123456789/4548</id>
<updated>2026-04-15T20:19:45Z</updated>
<dc:date>2026-04-15T20:19:45Z</dc:date>
<entry>
<title>On locally finite groups whose cyclic subgroups  are GNA-subgroups</title>
<link href="http://hdl.handle.net/123456789/4568" rel="alternate"/>
<author>
<name>Pypka, A.A.</name>
</author>
<id>http://hdl.handle.net/123456789/4568</id>
<updated>2020-01-08T15:07:20Z</updated>
<published>2017-01-01T00:00:00Z</published>
<summary type="text">On locally finite groups whose cyclic subgroups  are GNA-subgroups
Pypka, A.A.
In this paper we obtain the description of locally finite groups whose cyclic subgroups are GNA-subgroups.
Pypka A.A. On locally finite groups whose cyclic subgroups are GNA-subgroups / A.A. Pypka // Algebra and Discrete Mathematics. - 2017. - Vol. 24. - Number 2. - Рp. 308-319
</summary>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>On disjoint union of M-graphs</title>
<link href="http://hdl.handle.net/123456789/4567" rel="alternate"/>
<author>
<name>Kozerenko, S.</name>
</author>
<id>http://hdl.handle.net/123456789/4567</id>
<updated>2020-01-08T15:07:16Z</updated>
<published>2017-01-01T00:00:00Z</published>
<summary type="text">On disjoint union of M-graphs
Kozerenko, S.
Given a pair (X, σ) consisting of a finite tree X and its vertex self-map σ one can construct the corresponding Markov graph Γ(X, σ) which is a digraph that encodes σ-covering relation between edges in X. M-graphs are Markov graphs up to isomorphism. We obtain several sufficient conditions for the disjoint union of M-graphs to be an M-graph and prove that each weak component of M-graph is an M-graph itself.
Kozerenko S. On disjoint union of M-graphs / S. Kozerenko // Algebra and Discrete Mathematics. - 2017. - Vol. 24. - Number 2. - Рp. 262-273
</summary>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Lattice rings: an interpretation of L-fuzzy rings  as habitual algebraic structures</title>
<link href="http://hdl.handle.net/123456789/4566" rel="alternate"/>
<author>
<name>Kurdachenko, L. A</name>
</author>
<author>
<name>Subbotin, I. Ya.</name>
</author>
<author>
<name>Yashchuk, V. S.</name>
</author>
<id>http://hdl.handle.net/123456789/4566</id>
<updated>2020-01-08T15:07:15Z</updated>
<published>2017-01-01T00:00:00Z</published>
<summary type="text">Lattice rings: an interpretation of L-fuzzy rings  as habitual algebraic structures
Kurdachenko, L. A; Subbotin, I. Ya.; Yashchuk, V. S.
In this paper, we introduce some algebraic structure associated with rings and lattices. It appeared as the result of our new approach to the fuzzy rings and L-fuzzy rings where L is a lattice. This approach allows us to employ more convenient language of algebraic structures instead of currently accepted language of functions.
Kurdachenko L.A. Lattice rings: an interpretation of L-fuzzy rings as habitual algebraic structures / L.A.Kurdachenko, I.Ya.Subbotin, V.S.Yashchuk // Algebra and Discrete Mathematics. - 2017. - Vol. 24. - Number 2. - Рp. 274-296
</summary>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Dickson’s theorem for Bol loops</title>
<link href="http://hdl.handle.net/123456789/4565" rel="alternate"/>
<author>
<name>Movsisyan, Yu.</name>
</author>
<id>http://hdl.handle.net/123456789/4565</id>
<updated>2020-01-08T15:07:19Z</updated>
<published>2017-01-01T00:00:00Z</published>
<summary type="text">Dickson’s theorem for Bol loops
Movsisyan, Yu.
Dickson characterized groups in terms of one-sided invertibility. In this note, we give comparable characterizations for Bol and Moufang loops.
Movsisyan Yu. Dickson’s theorem for Bol loops / Yu. Movsisyan // Algebra and Discrete Mathematics. - 2017. - Vol. 24. - Number 2. - Рp. 297-301
</summary>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</entry>
</feed>
