Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretnaya Matematika, 2015, Volume 27, Issue 4, Pages 79–93
DOI: https://doi.org/10.4213/dm1349
(Mi dm1349)
 

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

Galois theory for clones and superclones

N. A. Peryazeva, I. K. Sharankhaevb

a Saint Petersburg Electrotechnical University "LETI"
b Buryat State University
Full-text PDF (461 kB) Citations (6)
References:
Abstract: We study clones (closed sets of operations that contain projections) and superclones on finite sets. According to A. I. Mal'tsev a clone may be considered as an algebra. If we replace algebra universe with a set of multioperations and add the operation of simplest equation solvability then we will obtain an algebra called a superclone. The paper establishes Galois connection between clones and superclones.
Keywords: clone, superclone, operation, multioperation, superposition.
Funding agency Grant number
Russian Foundation for Basic Research 12-01-000351a
Research was supported by RFBR, project number 12-01-000351a.
Received: 20.06.2015
English version:
Discrete Mathematics and Applications, 2016, Volume 26, Issue 4, Pages 227–238
DOI: https://doi.org/10.1515/dma-2016-0020
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: N. A. Peryazev, I. K. Sharankhaev, “Galois theory for clones and superclones”, Diskr. Mat., 27:4 (2015), 79–93; Discrete Math. Appl., 26:4 (2016), 227–238
Citation in format AMSBIB
\Bibitem{PerSha15}
\by N.~A.~Peryazev, I.~K.~Sharankhaev
\paper Galois theory for clones and superclones
\jour Diskr. Mat.
\yr 2015
\vol 27
\issue 4
\pages 79--93
\mathnet{http://mi.mathnet.ru/dm1349}
\crossref{https://doi.org/10.4213/dm1349}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3497374}
\elib{https://elibrary.ru/item.asp?id=24849942}
\transl
\jour Discrete Math. Appl.
\yr 2016
\vol 26
\issue 4
\pages 227--238
\crossref{https://doi.org/10.1515/dma-2016-0020}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000384440500004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84984982184}
Linking options:
  • https://www.mathnet.ru/eng/dm1349
  • https://doi.org/10.4213/dm1349
  • https://www.mathnet.ru/eng/dm/v27/i4/p79
  • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:559
    Full-text PDF :168
    References:76
    First page:64
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024