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, 2017, Volume 29, Issue 1, Pages 114–125
DOI: https://doi.org/10.4213/dm1409
(Mi dm1409)
 

This article is cited in 1 scientific paper (total in 1 paper)

Estimating the level of affinity of a quadratic form

A. V. Cheremushkin

Research Institute "Kvant"
Full-text PDF (433 kB) Citations (1)
References:
Abstract: The level of affinity of a Boolean function is defined as the minimum number of variables such that assigning any particular values to these variables makes the function affine. The generalized level of affinity is defined as the minimum number of linear combinations of variables the values of which may be specified in such a way that the function becomes affine. For a quadratic form of rank $2r$ the generalized level of affinity is equal to $r$. We present some properties of the distribution of the rank of the random quadratic form and, as a corollary, derive an asymptotic estimate for the generalized level of affinity of quadratic forms.
Keywords: Boolean functions, quadratic forms, level of affinity.
Received: 19.05.2016
English version:
Discrete Mathematics and Applications, 2017, Volume 27, Issue 6, Pages 339–347
DOI: https://doi.org/10.1515/dma-2017-0035
Bibliographic databases:
Document Type: Article
UDC: 519.115+519.719.1
Language: Russian
Citation: A. V. Cheremushkin, “Estimating the level of affinity of a quadratic form”, Diskr. Mat., 29:1 (2017), 114–125; Discrete Math. Appl., 27:6 (2017), 339–347
Citation in format AMSBIB
\Bibitem{Che17}
\by A.~V.~Cheremushkin
\paper Estimating the level of affinity of a quadratic form
\jour Diskr. Mat.
\yr 2017
\vol 29
\issue 1
\pages 114--125
\mathnet{http://mi.mathnet.ru/dm1409}
\crossref{https://doi.org/10.4213/dm1409}
\elib{https://elibrary.ru/item.asp?id=28405139}
\transl
\jour Discrete Math. Appl.
\yr 2017
\vol 27
\issue 6
\pages 339--347
\crossref{https://doi.org/10.1515/dma-2017-0035}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000417791200001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85038388111}
Linking options:
  • https://www.mathnet.ru/eng/dm1409
  • https://doi.org/10.4213/dm1409
  • https://www.mathnet.ru/eng/dm/v29/i1/p114
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:417
    Full-text PDF :41
    References:56
    First page:36
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024