Unbounded discrepancy in Frobenius numbers

DOI10.1515/INTEG.2011.002MaRDI QIDQ3081576zbMATH OpenOpenAlexFDO

Authors James Stankewicz, Jeffrey Shallit

Publication date 9 March 2011

Published in Integers (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1003.0021, https://eudml.org/doc/224105, http://www.integers-ejcnt.org/vol11.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

linear Diophantine equation

Mathematics Subject Classification ID

Counting solutions of Diophantine equations (11D45) The Frobenius problem (11D07)

Abstract: Let g_j denote the largest integer that is represented exactly j times as a non-negative integer linear combination of { x_1, ... , x_n. We show that for any k > 0, and n = 5, the quantity g_0 - g_k is unbounded. Furthermore, we provide examples with g_0 > g_k for n >= 6 and g_0 > g_1 for n >= 4.

Recommendations

• An extreme family of generalized Frobenius numbers
• scientific article; zbMATH DE number 5041220
• scientific article; zbMATH DE number 953240
• On the distance between Frobenius numbers
• On a linear diophantine problem of Frobenius

Cited in

(4)

• Bounds on generalized Frobenius numbers
• The generalized Frobenius problem via restricted partition functions
• Integer points in knapsack polytopes and \(s\)-covering radius
• Frobenius Coin-Exchange Generating Functions

This page was built for publication: Unbounded discrepancy in Frobenius numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081576)