<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Статті</title>
<link>http://hdl.handle.net/123456789/141</link>
<description/>
<pubDate>Wed, 15 Apr 2026 21:28:00 GMT</pubDate>
<dc:date>2026-04-15T21:28:00Z</dc:date>
<item>
<title>Diagonalizability theorems for matrices over rings with finite stable range</title>
<link>http://hdl.handle.net/123456789/153</link>
<description>Diagonalizability theorems for matrices over rings with finite stable range
Zabavsky, Bogdan
We construct the theory of diagonalizability for matrices over Bezout ring with finite stable range. It is shown that every commutative Bezout ring with compact minimal prime spec-&#13;
trum is Hermite. It is also shown that a principal ideal domain with stable range 1 is Euclidean domain, and every semilocal principal ideal domain is Euclidean domain. It is proved that every matrix over an elementary divisor ring can be reduced to "almost"&#13;
diagonal matrix by elementary transformations.
</description>
<pubDate>Sat, 01 Jan 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://hdl.handle.net/123456789/153</guid>
<dc:date>2005-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Maximality of affine group, and hidden graph cryptosystems</title>
<link>http://hdl.handle.net/123456789/152</link>
<description>Maximality of affine group, and hidden graph cryptosystems
Ustimenko, Vasiliy A.
We describe a new algebraic-combinatorial method of public key encryption with a certain similarity to the well known Imai-Matsumoto. We use the general idea to treat vertices of a linguistic graph (see [21] and further references) as messages and use&#13;
the iterative process to walk on such graph as encryption process. To hide such encryption (graph and walk on it) we will use two affine transformation. Like in Imai Matsumoto encryption the public rule is just a direct polynomial map from the plaintext to&#13;
the ciphertext. The knowledge about graph and chosen walk on them (the key) allow to decrypt a ciphertext fast. We hope that the system is secure even in the case when the graph is Public but the walk is hidden. In case of "public" graph we can use same encryption as private key algorithm with the resistance to attacks when adversary knows several pairs:(plaintext, ciphertext). We shall discuss the general idea of combining affine transformations and chosen polynomial map of deg   2 in case of prime field Fp. As it follows from the maximality of affine group each bijection on Fp n can be obtained by such combining.
</description>
<pubDate>Sat, 01 Jan 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://hdl.handle.net/123456789/152</guid>
<dc:date>2005-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Wreath product of Lie algebras and Lie algebras associated with Sylow p-subgroups of finite symmetric groups</title>
<link>http://hdl.handle.net/123456789/151</link>
<description>Wreath product of Lie algebras and Lie algebras associated with Sylow p-subgroups of finite symmetric groups
Sushchansky, Vitaly I.; Netreba, Nataliya V.
We define a wreath product of a Lie algebra L with the one-dimensional Lie algebra L1 over Fp and determine some properties of this wreath product. We prove that the Lie&#13;
algebra associated with the Sylow p-subgroup of finite symmetric group Spm is isomorphic to the wreath product of m copies of L1. As a corollary we describe the Lie algebra associated with Sylow p-subgroup of any symmetric group in terms of wreath product of one-dimensional Lie algebras.
</description>
<pubDate>Sat, 01 Jan 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://hdl.handle.net/123456789/151</guid>
<dc:date>2005-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>On the mean square of the Epstein zeta-function</title>
<link>http://hdl.handle.net/123456789/150</link>
<description>On the mean square of the Epstein zeta-function
Savastru, O. V.; Varbanets, P. D.
We consider the second power moment of the Epstein zeta-function and construct the asymptotic formula in special case, when '0(u, v) = u2 + Av2, A &gt; 0, A   1, 2(mod 4) and&#13;
'0(u, v) belongs to the one-class kind G0 of the quadratic forms ofdiscriminant −4A
</description>
<pubDate>Sat, 01 Jan 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://hdl.handle.net/123456789/150</guid>
<dc:date>2005-01-01T00:00:00Z</dc:date>
</item>
</channel>
</rss>
