<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Algebra and Discrete Mathematics, 2013, Vol. 16, № 1</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/150379</link>
<description/>
<pubDate>Sat, 18 Apr 2026 21:24:19 GMT</pubDate>
<dc:date>2026-04-18T21:24:19Z</dc:date>
<image>
<title>Algebra and Discrete Mathematics, 2013, Vol. 16, № 1</title>
<url>http://dspace.nbuv.gov.ua:80/bitstream/id/472566/</url>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/150379</link>
</image>
<item>
<title>Joseph Solomonovich Ponizovskii (1928 – 2012)</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/158466</link>
<description>Joseph Solomonovich Ponizovskii (1928 – 2012)
</description>
<pubDate>Tue, 01 Jan 2013 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://dspace.nbuv.gov.ua:80/handle/123456789/158466</guid>
<dc:date>2013-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>The monoid of endomorphisms of disconnected hypergraphs</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/152316</link>
<description>The monoid of endomorphisms of disconnected hypergraphs
Zhuchok, Yu.V.
We prove that the monoid of endomorphisms of an arbitrary disconnected hypergraph is isomorphic to a wreath product of a transformation semigroup with a certain small category. For disconnected hypergraphs we also study the structure of the monoid of strong endomorphisms and the group of automorphisms.
</description>
<pubDate>Tue, 01 Jan 2013 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://dspace.nbuv.gov.ua:80/handle/123456789/152316</guid>
<dc:date>2013-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>On one class of partition polynomials</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/152315</link>
<description>On one class of partition polynomials
Zatorsky, R.; Stefluk, S.
We consider relations between one class of partition polynomials, parafunctions of triangular matrices (tables), and linear recurrence relations.
</description>
<pubDate>Tue, 01 Jan 2013 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://dspace.nbuv.gov.ua:80/handle/123456789/152315</guid>
<dc:date>2013-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Inverse semigroups generated by group congruences. The Möbius functions</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/152314</link>
<description>Inverse semigroups generated by group congruences. The Möbius functions
Schwab, E.D.
The computation of the Möbius function of a Möbius category that arises from a combinatorial inverse semigroup has a distinctive feature. This computation is done on the field of finite posets. In the case of two combinatorial inverse semigroups, order isomorphisms between corresponding finite posets reduce the computation to one of the semigroups. Starting with a combinatorial inverse monoid and using a group congruence we construct a combinatorial inverse semigroup such that the Möbius function becomes an invariant to this construction. For illustration, we consider the multiplicative analogue of the bicyclic semigroup and the free monogenic inverse monoid.
</description>
<pubDate>Tue, 01 Jan 2013 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://dspace.nbuv.gov.ua:80/handle/123456789/152314</guid>
<dc:date>2013-01-01T00:00:00Z</dc:date>
</item>
</channel>
</rss>
