Bounds for a Linear Diophantine Problem of Frobenius

DOI10.1112/jlms/s2-10.1.79zbMath0301.10020OpenAlexW2083869960MaRDI QIDQ4056082

Yehoshua Vitek

Publication date: 1975

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-10.1.79

zbMATH Keywords

boundsFrobenius problemlinear Diophantine equations

Mathematics Subject Classification ID

The Frobenius problem (11D07)

Related Items

Refined upper bounds for the linear Diophantine problem of Frobenius, On the exponents of primitive, ministrong digraphs with shortest elementary circuit length \(s\), On the exponents of primitive digraphs with the shortest elementary circuit length s, Some Experimental Results on the Frobenius Problem, An optimal lower bound for the Frobenius problem, A diophantine problem of Frobenius in terms of the least common multiple, Local exponents of primitive digraphs, A diameter bound on the exponent of a primitive directed graph, Some estimated formulas for the Frobenius numbers, A bound on the exponent of primitivity in terms of diameter, Scrambling index set of primitive digraphs, A bound for Wilson's general theorem, Proof of a conjecture about the exponent of primitive matrices, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, On the exponent of a primitive digraph, On a linear diophantine problem for geometrical type sequences, A bound connected with primitive matrices, On a conjecture about the exponent set of primitive matrices, The existence of resolvable BIBD with \(\lambda=1\)