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

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

 Prikl. Diskr. Mat., 2021, Number 52, Pages 5–15 (Mi pdm735)

Theoretical Backgrounds of Applied Discrete Mathematics

Binary solutions to large systems of linear equations

A. V. Seliverstov

Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow, Russia

Abstract: The concept of generic computational complexity has been extended to generalized register machines over an ordered field. In this case, the machine halts at every input and gives a meaningful answer at almost every input, but it can abandon the calculation using explicit notification, that is, there exists the vague halting state. Note that the machine does not make any error. A generic polynomial time algorithm is proposed to recognize systems of linear equations without any binary solution, when the number of equations $m$ is close to the number of unknowns $n$. More precisely, two conditions are required. Firstly, the inequality $2n\geqslant (n-m+1)(n-m+2)$ holds. Such systems are called large because the number of equations is close to the number of unknowns. Secondly, some assumptions of generality of the system of equations are fulfilled. Our approach is based on finding a positive definite quadratic form among the set of forms that depend on parameters. On the other hand, a counterexample has been found, whicht shows the inapplicability of this method for checking the absence of any binary solution to one equation.

Keywords: binary solution, linear equation, generalized register machine, computational complexity.

 Funding Agency Grant Number Russian Foundation for Basic Research 18-29-13037

DOI: https://doi.org/10.17223/20710410/52/1

Full text: PDF file (662 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 519.161

Citation: A. V. Seliverstov, “Binary solutions to large systems of linear equations”, Prikl. Diskr. Mat., 2021, no. 52, 5–15

Citation in format AMSBIB
\Bibitem{Sel21} \by A.~V.~Seliverstov \paper Binary solutions to large systems of linear equations \jour Prikl. Diskr. Mat. \yr 2021 \issue 52 \pages 5--15 \mathnet{http://mi.mathnet.ru/pdm735} \crossref{https://doi.org/10.17223/20710410/52/1}