Expected Frobenius numbers

DOI10.1016/J.JCTA.2009.12.012MaRDI QIDQ618307zbMATHOpenAlexFDO

Authors Martin Henk, Aicke Hinrichs, Iskander Aliev

Publication date 14 January 2011

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0910.2620

zbMATH Keywords

geometry of numbersFrobenius numberArnold's conjectureknapsack polytope

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Counting solutions of Diophantine equations (11D45) The Frobenius problem (11D07) Linear Diophantine equations (11D04)

Abstract: We show that for large instances the order of magnitude of the expected Frobenius number is (up to a constant depending only on the dimension) given by its lower bound.

Recommendations

• Limit behaviour of large Frobenius numbers
• On the distribution of Frobenius numbers with three arguments
• The mean value of Frobenius numbers with three arguments
• Some properties of Frobenius numbers and a fraction of symmetric semigroups in the weak limit for \(n=3\)
• Generalized Frobenius numbers: bounds and average behavior

Cites work

• scientific article; zbMATH DE number 1975225 (Why is no real title available?)
• scientific article; zbMATH DE number 2086933 (Why is no real title available?)
• scientific article; zbMATH DE number 2106994 (Why is no real title available?)
• scientific article; zbMATH DE number 835749 (Why is no real title available?)
• scientific article; zbMATH DE number 3333393 (Why is no real title available?)
• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• An estimate for Frobenius' diophantine problem in three dimensions
• An optimal lower bound for the Frobenius problem
• Arithmetical turbulence of selfsimilar fluctuations statistics of large Frobenius numbers of additive semigroups of integers
• Faster algorithms for Frobenius numbers
• Frobenius numbers by lattice point enumeration
• Frobenius problem and the covering radius of a lattice
• Geometry and growth rate of Frobenius numbers of additive semigroups
• Integer knapsacks: average behavior of the Frobenius numbers
• Limit behaviour of large Frobenius numbers
• On a linear diophantine problem of Frobenius
• On test sets for nonlinear integer maximization
• On the linear diophantine problem of Frobenius
• Solving thousand-digit Frobenius problems using Gröbner bases
• Testing integer knapsacks for feasibility
• The Frobenius Problem and Maximal Lattice Free Bodies
• Wahrscheinlichkeitstheorie
• Weak asymptotics for the numbers of solutions of Diophantine problems

Cited in

(15)

• WHEN IS A NUMERICAL SEMIGROUP A QUOTIENT?
• Integer matrices, sublattices of \(\mathbb Z^m\), and Frobenius numbers
• On the limit distribution of Frobenius numbers
• Random numerical semigroups and a simplicial complex of irreducible semigroups
• Modular hyperbolas
• Arithmetical turbulence of selfsimilar fluctuations statistics of large Frobenius numbers of additive semigroups of integers
• Integer knapsacks: average behavior of the Frobenius numbers
• Distances to lattice points in knapsack polyhedra
• Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators
• Geometric proof of Rødseth's formula for Frobenius numbers
• Geometry and growth rate of Frobenius numbers of additive semigroups
• Limit behaviour of large Frobenius numbers
• Symmetric semigroups with three generators
• Effective limit distribution of the Frobenius numbers
• On a conjecture by Wilf about the Frobenius number

Describes a project that uses

Uses Software

• Frobby

This page was built for publication: Expected Frobenius numbers

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