|
This article is cited in 2 scientific papers (total in 2 papers)
General numerical methods
On the number of solutions to linear Diophantine equation and Frobenius problem
E. N. Gordeeva, V. K. Leont'evb a Bauman Moscow State Technical University, Moscow, Russia
b Federal Research Center "Computer Science and Control" of Russian Academy of Sciences, Moscow, Russia
Abstract:
Issues concerning the solvability and number of solutions to linear Diophantine equations are considered. Along with the general case, combinatorial characteristics of the number of solutions and the mean number of solutions to equations of a special case are studied. One type of equation represents partitions of a natural number into natural additive components. Another type consists of linear equations in two unknowns that are usually studied in relation to the Frobenius problem. The focus is on three aspects. The first is the solvability and number of solutions of the Diophantine equation when the problem is parameterized with respect to the right-hand side. Formulas and bounds for finding this number both in the general case and in some particular cases are obtained. The second aspect is devoted to the partition problem. The third aspect concerns the Frobenius problem.
Key words:
Diophantine equation, partitions, Frobenius problem, Boolean equations, Frobenius number.
Received: 10.09.2021 Revised: 28.02.2022 Accepted: 11.04.2022
Citation:
E. N. Gordeev, V. K. Leont'ev, “On the number of solutions to linear Diophantine equation and Frobenius problem”, Zh. Vychisl. Mat. Mat. Fiz., 62:9 (2022), 1447–1457; Comput. Math. Math. Phys., 62:9 (2022), 1413–1423
Linking options:
https://www.mathnet.ru/eng/zvmmf11445 https://www.mathnet.ru/eng/zvmmf/v62/i9/p1447
|
Statistics & downloads: |
Abstract page: | 149 |
|