|
Systems of diophantine equations over finite configurations
N. T. Kogabaev Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Abstract:
Under study are the finite systems of Diophantine equations over finite configurations. We propose some consistency verification procedure for such a system and use the output of the procedure to constructing the complete solution set. We estimate the running time of the procedure in general and distinguish the class of systems for which the consistency problem is decidable in polynomial time.
Keywords:
configuration, incidence, system of equations, computational complexity.
Received: 27.11.2022 Revised: 27.11.2022 Accepted: 10.01.2023
Citation:
N. T. Kogabaev, “Systems of diophantine equations over finite configurations”, Sibirsk. Mat. Zh., 64:2 (2023), 321–338; Siberian Math. J., 64:2 (2023), 325–337
Linking options:
https://www.mathnet.ru/eng/smj7764 https://www.mathnet.ru/eng/smj/v64/i2/p321
|
|