<?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, 2008, № 3</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/150354" rel="alternate"/>
<subtitle/>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/150354</id>
<updated>2026-04-22T13:14:24Z</updated>
<dc:date>2026-04-22T13:14:24Z</dc:date>
<entry>
<title>Algebra in superextensions of groups, I: zeros and commutativity</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/153373" rel="alternate"/>
<author>
<name>Banakh, T.T.</name>
</author>
<author>
<name>Gavrylkiv, V.</name>
</author>
<author>
<name>Nykyforchyn, O.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/153373</id>
<updated>2019-06-14T22:25:44Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Algebra in superextensions of groups, I: zeros and commutativity
Banakh, T.T.; Gavrylkiv, V.; Nykyforchyn, O.
Given a group X we study the algebraic structure of its superextension λ(X). This is a right-topological semigroup consisting of all maximal linked systems on X&#13;
&#13;
endowed with the operation &#13;
&#13;
&#13;
  A∘B={C⊂X:{x∈X:x−1C∈B}∈A}&#13;
 &#13;
 &#13;
that extends the group operation of X. We characterize right zeros of λ(X) as invariant maximal linked systems on X and prove that λ(X) has a right zero if and only if each element of X has odd order. On the other hand, the semigroup λ(X) contains a left zero if and only if it contains a zero if and only if X has odd order |X|≤5. The semigroup λ(X) is commutative if and only if |X|≤4. We finish the paper with a complete description of the algebraic structure of the semigroups λ(X) for all groups X of cardinality |X|≤5.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>On a question of A. N. Skiba about totally saturated formations</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/153366" rel="alternate"/>
<author>
<name>Safonov, V.G.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/153366</id>
<updated>2019-06-14T22:26:28Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">On a question of A. N. Skiba about totally saturated formations
Safonov, V.G.
It is proved that the lattice of τ-closed totally saturated formations of finite groups is distributive. This is a solution of Question 4.2.15 proposed by A. N. Skiba in his monograph "Algebra of Formations" (1997).
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Discrete limit theorems for Estermann zeta-functions. II</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/153365" rel="alternate"/>
<author>
<name>Laurincikas, A.</name>
</author>
<author>
<name>Macaitiene, R.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/153365</id>
<updated>2019-06-14T22:25:38Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Discrete limit theorems for Estermann zeta-functions. II
Laurincikas, A.; Macaitiene, R.
A discrete limit theorem in the sense of weak convergence of probability measures in the space of meromorphic functions for the Estermann zeta-function with explicitly given the limit measure is proved.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>The generalized dihedral groups Dih(Zn) as groups generated by time-varying automata</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/153364" rel="alternate"/>
<author>
<name>Woryna, A.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/153364</id>
<updated>2019-06-14T22:26:23Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">The generalized dihedral groups Dih(Zn) as groups generated by time-varying automata
Woryna, A.
Let Zn be a cubical lattice in the Euclidean space Rn. The generalized dihedral group  Dih(Zn) is  a topologically discrete group of isometries of Zn generated by  translations and reflections in all points from Zn. We study this group as a group generated by a (2n+2)-state time-varying  automaton over the changing alphabet. The corresponding action  on the set of words is described.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
</entry>
</feed>
