<?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/150353">
<title>Algebra and Discrete Mathematics, 2008, № 2</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/150353</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/153371"/>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/153370"/>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/153363"/>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/153361"/>
</rdf:Seq>
</items>
<dc:date>2026-04-22T13:00:30Z</dc:date>
</channel>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/153371">
<title>Emmanuil Moiseevich Zhmud’ (1918-2007)</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/153371</link>
<description>Emmanuil Moiseevich Zhmud’ (1918-2007)
Favorov, S.; Novikov, B.; Vyshnevetskiy, A.; Zholtkevich, G.
</description>
<dc:date>2008-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/153370">
<title>Random walks on finite groups converging after finite number of steps</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/153370</link>
<description>Random walks on finite groups converging after finite number of steps
Vyshnevetskiy, A.L.; Zhmud, E.M.
Let P be a probability on a finite group G, P(n)=P∗…∗P (n times) be an n-fold convolution of P. If n→∞, then under mild conditions P(n) converges to the uniform probability U(g)=1|G| (g∈G). We study the case when the sequence P(n) reaches its limit U after finite number of steps: P(k)=P(k+1)=⋯=U for some k. Let Ω(G) be a set of the probabilities satisfying to that condition. Obviously, U∈Ω(G). We prove that Ω(G)≠U for ``almost all'' non-Abelian groups and describe the groups for which Ω(G)=U. If P∈Ω(G), then P(b)=U, where b is the maximal degree of irreducible complex representations of the group G.
</description>
<dc:date>2008-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/153363">
<title>On τ-closed totally saturated group formations with Boolean sublattices</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/153363</link>
<description>On τ-closed totally saturated group formations with Boolean sublattices
Safonov, V.G.
In the universe of finite groups the description of τ-closed totally saturated formations with Boolean sublattices of τ-closed totally saturated subformations is obtained. Thus, we give a solution of Question 4.3.16 proposed by A.N.Skiba in his monograph "Algebra of Formations" (1997).
</description>
<dc:date>2008-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/153361">
<title>Balleans of bounded geometry and G-spaces</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/153361</link>
<description>Balleans of bounded geometry and G-spaces
Protasov, I.V.
A ballean (or a coarse structure) is a set endowed with some family of subsets which are called the balls. The properties of the family of balls are postulated in such a way that a ballean can be considered as an asymptotical counterpart of a uniform topological space.&#13;
&#13;
We prove that every ballean of bounded geometry is coarsely equivalent to a ballean on some set X&#13;
determined by some group of permutations of X.
</description>
<dc:date>2008-01-01T00:00:00Z</dc:date>
</item>
</rdf:RDF>
