D:\sbornik\...\Chubaryan4.DVI


Mathematical Problems of Computer Science 33, 66{72, 2010.

On the N umber of I r r educible Linear ised Cover ings for

Subsets in Finite Fields

H o vh a n n e s K . N u r ija n ya n

Department of Applied Mathematics and Informatics, Yerevan State University

hovikn@gmail.com

Abstract

We present lower and upper bounds for the number of irreducible linearised cover-
ings of subsets in a ¯nite ¯eld with characteristic greater than 2. In case of ¯nite ¯eld
with characteristic equal to 2, these bounds are obtained by Alexanian.

Refer ences

[1 ] Â. Ãàáðèåëÿí, “Î ìåòðè÷åñêèõ õàðàêòåðèñòèêàõ, ñâÿçàííûõ ñ ïîêðûòèÿìè
ïîäìíîæåñòâ êîíå÷íûõ ïîëåé ñìåæíûìè êëàññàìè ëèíåéíûõ ïîäïðîñòðàíñòâ”,
Èíñòèòóò ïðîáëåì èíôîðìàòèêè è àâòîìàòèçàöèè, Åðåâàí, 2004.

[2] À. Àëåêñàíÿí, Äèçúþíêòèâíûå íîðìàëüíûå ôîðìû íàä ëèíåéíûìè ôóíêöèÿìè
(Òåîðèÿ è ïðèëîæåíèÿ), Åðåâàíñêèé ãîñóäàðñòâåííûé óíèâåðñèòåò 1990.

ì»ñç³íáñ ¹³ßï»ñÇ »Ýóµ³½ÙáõÃÛáõÝÝ»ñÇ ·Í³ÛݳóíáÕ
÷³ÏáõÕ³ÛÇÝ Í³ÍÏáõÛÃÝ»ñÇ ù³Ý³ÏÇ Ù³ëÇÝ

Ð. ÜáõñÇç³ÝÛ³Ý

²Ù÷á÷áõÙ

²ß˳ï³ÝùáõÙ Ý»ñϳ۳óí³Í ¿ 2-Çó Ù»Í µÝáõó·ñÇãáí í»ñç³íáñ ¹³ßïÇ
»Ýóµ³½ÙáõÃÛáõÝÝ»ñÇ ÷³ÏáõÕ³ÛÇÝ ·Í³ÛݳóíáÕ Í³ÍÏáõÛÃÝ»ñÇ ù³Ý³ÏÇ í»ñÇÝ ¨ ëïáñÇÝ
ë³ÑÙ³ÝÝ»ñÁ: 2 µÝáõó·ñÇã áõÝ»óáÕ í»ñç³íáñ ¹³ßïÇ ¹»åùáõÙ, ³Û¹ í»ñÇÝ ¨ ëïáñÇÝ
ë³ÑÙ³ÝÝ»ñÁ ëï³óí³Í »Ý ²É»ùë³ÝÛ³ÝÇ ÏáÕÙÇó:

6 6