<?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, 2017, Vol. 23, № 2</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/150399" rel="alternate"/>
<subtitle/>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/150399</id>
<updated>2026-04-21T01:27:49Z</updated>
<dc:date>2026-04-21T01:27:49Z</dc:date>
<entry>
<title>On new multivariate cryptosystems with nonlinearity gap</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/156037" rel="alternate"/>
<author>
<name>Ustimenko, V.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/156037</id>
<updated>2019-06-17T22:31:12Z</updated>
<published>2017-01-01T00:00:00Z</published>
<summary type="text">On new multivariate cryptosystems with nonlinearity gap
Ustimenko, V.
The pair of families of bijective multivariate maps of kind Fn and Fn⁻¹ on affine space Kⁿ over finite commutative ring K given in their standard forms has a nonlinearity gap if the degree of Fn is bounded from above by independent constant d and degree of F⁻¹ is bounded from below by cⁿ, c&gt;1. We introduce examples of such pairs with invertible decomposition Fn=Gn¹Gn²…Gnk, i.e. the decomposition which allows to compute the value of Fⁿ⁻¹ in given point p=(p1,p2,…,pn) in a polynomial time O(n²).&#13;
 &#13;
 The pair of families Fn, F′n of nonbijective polynomial maps of affine space Kn such that composition FnF′n leaves each element of K∗n unchanged such that deg(Fn) is bounded by independent constant but deg(F′n) is of an exponential size and there is a decomposition Gn¹Gn²…Gnk of Fn which allows to compute the reimage of vector from F(K*ⁿ) in time 0(n²). We introduce examples of such families in cases of rings K=Fq and K=Zm.
</summary>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Profinite closures of the iterated monodromy groups associated with quadratic polynomials</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/156027" rel="alternate"/>
<author>
<name>Samoilovych, I.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/156027</id>
<updated>2019-06-17T22:31:19Z</updated>
<published>2017-01-01T00:00:00Z</published>
<summary type="text">Profinite closures of the iterated monodromy groups associated with quadratic polynomials
Samoilovych, I.
In this paper we describe the profinite closure of the iterated monodromy groups arising from the arbitrary post-critically finite quadratic polynomial.
</summary>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Generators and ranks in finite partial transformation semigroups</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/156026" rel="alternate"/>
<author>
<name>Garba, G.U.</name>
</author>
<author>
<name>Imam, A.T.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/156026</id>
<updated>2019-06-17T22:30:53Z</updated>
<published>2017-01-01T00:00:00Z</published>
<summary type="text">Generators and ranks in finite partial transformation semigroups
Garba, G.U.; Imam, A.T.
We extend the concept of path-cycle, to the semigroup Pn, of all partial maps on Xn={1,2,…,n}, and show that the classical decomposition of permutations into disjoint cycles can be extended to elements of Pn by means of path-cycles. The device is used to obtain information about generating sets for the semigroup Pn\Sn, of all singular partial maps of Xn. Moreover, we give a definition for the (m,r)-rank of Pn\Sn and show that it is n(n+1)/2.
</summary>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Nonuniqueness of semidirect decompositions for semidirect products with directly decomposable factors and applications for dihedral groups</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/156025" rel="alternate"/>
<author>
<name>Daugulis, P.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/156025</id>
<updated>2019-06-17T22:31:09Z</updated>
<published>2017-01-01T00:00:00Z</published>
<summary type="text">Nonuniqueness of semidirect decompositions for semidirect products with directly decomposable factors and applications for dihedral groups
Daugulis, P.
Nonuniqueness of semidirect decompositions of groups is an insufficiently studied question in contrast to direct decompositions. We obtain some results about semidirect decompositions for semidirect products with factors which are nontrivial direct products. We deal with a special case of semidirect product when the twisting homomorphism acts diagonally on a direct product, as well as with the case when the extending group is a direct product. We give applications of these results in the case of generalized dihedral groups and classic dihedral groups D2n. For D2n we give a complete description of semidirect decompositions and values of minimal permutation degrees.
</summary>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</entry>
</feed>
