Refined upper bounds for the linear Diophantine problem of Frobenius
Matthias Beck, Shelemyahu Zacks
Abstract
We study the Frobenius problem: given relatively prime positive integers a1,...,ad, find the largest value of t (the Frobenius number g(a1,...,ad)) such that m1 a1 + ... md ad = t has no solution in nonnegative integers m1,...,md. We introduce a method to compute upper bounds for g(a1,a2,a3), which seem to grow considerably slower than previously known bounds. Our computations are based on a formula for the restricted partition function, which involves Dedekind-Rademacher sums, and the reciprocity law for these sums.
Create a lesson
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan