Bulletin of Irkutsk State University. Series Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Bulletin of Irkutsk State University. Series Mathematics:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Bulletin of Irkutsk State University. Series Mathematics, 2017, Volume 21, Pages 61–76
DOI: https://doi.org/10.26516/1997-7670.2017.21.61
(Mi iigum314)
 

This article is cited in 2 scientific papers (total in 2 papers)

On classes of hyperfunctions of rank 2 generated by maximal multiclones

V. I. Panteleyev, A. S. Zinchenko

Irkutsk State University, 1, K. Marx st., Irkutsk, 664003
Full-text PDF (343 kB) Citations (2)
References:
Abstract: The research of multifunctions is a one of the directions in discrete function's investigations. Multifunction is a discrete function from a finite set A to all subsets of A. The set of hyperfunctions is a subset of set of multifunctions. Hyperfunction is a discrete function from a finite set A to all nonempty subsets of A.
The subset relation of hyperfunctions to maximal multiclones is a relation of equivalence and according it all hyperfunctions are divided into equivalence classes. Based on this equivalence it is possible to estimate the cardinality of all possible bases, calculate the number of different types of bases of the same cardinality, and construct some intervals of the clone lattice.
Knowing the number of maximal clones, we can obtain upper-bound estimate of the number of such classes as the cardinality of the set of all subsets of the set of maximal clones. It possible to lower this estimate by using properties of the hyperfunctions . A lower-bound estimate for the number of classes can be obtained by constructing the corresponding classes.
It is noteworthy that the complexity of the problem of describing all equivalence classes increases essentially with the cardinality of the set of maximal clones increasing.
This paper considers multifunctions on a two-element set. The number of maximal multiclones equals to 15 (Panteleyev V. I., 2009).
The primary purpose of this research is describing the classification of the set of hyperfunctions into equivalence classes. As Kazimirov A. S. and Panteleyev V. I. showed there are 18 equivalence classes on the set of Boolean functions, which is a subset of the set of hyperfunctions. In this paper were obtained special properties of hyperfunctions and were described all the equivalence classes generated by functions of 3 arguments having applied a computer experiment. The obtained results made it possible to show that the subset relation of hyperfunctions to maximal multiclones splits the set of all hyperfunctions into 67 equivalence classes.
Keywords: hyperclone, basis; hyperfunction, complete set, superposition, closed set, multifunction.
Bibliographic databases:
Document Type: Article
UDC: 519.716
MSC: 08A99,03B50
Language: Russian
Citation: V. I. Panteleyev, A. S. Zinchenko, “On classes of hyperfunctions of rank 2 generated by maximal multiclones”, Bulletin of Irkutsk State University. Series Mathematics, 21 (2017), 61–76
Citation in format AMSBIB
\Bibitem{PanZin17}
\by V.~I.~Panteleyev, A.~S.~Zinchenko
\paper On classes of hyperfunctions of rank~2 generated by maximal multiclones
\jour Bulletin of Irkutsk State University. Series Mathematics
\yr 2017
\vol 21
\pages 61--76
\mathnet{http://mi.mathnet.ru/iigum314}
\crossref{https://doi.org/10.26516/1997-7670.2017.21.61}
Linking options:
  • https://www.mathnet.ru/eng/iigum314
  • https://www.mathnet.ru/eng/iigum/v21/p61
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:257
    Full-text PDF :97
    References:37
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024