Frobenius numbers by lattice point enumeration

MaRDI QIDQ3428596zbMATH OpenFDO

Authors David Einstein, Stan Wagon, Daniel A. Lichtblau, Adam Strzeboński

Publication date 28 March 2007

Full work available at URL https://eudml.org/doc/116772

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

fast algorithminteger linear programmingFrobenius numberdiscrete tiling of integer lattice of dimension \(n-1\)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Integer programming (90C10) Congruences in many variables (11D79) The Frobenius problem (11D07) Representation problems (11D85)

Recommendations

• Faster algorithms for Frobenius numbers
• scientific article; zbMATH DE number 18540
• The Frobenius Problem and Maximal Lattice Free Bodies
• Lattice translates of a polytope and the Frobenius problem
• On the linear diophantine problem of Frobenius

Cited in

(24)

• The Frobenius number for the triple of the 2-step star numbers
• Commutative algebra of generalised Frobenius numbers
• Parametric polyhedra with at least k lattice points: their semigroup structure and the k-Frobenius problem
• A combinatorial approach to Frobenius numbers of some special sequences
• The short resolution of a semigroup algebra
• Factoring in the Chicken McNugget monoid
• The slice algorithm for irreducible decomposition of monomial ideals
• Formulae for the Frobenius number in three variables
• Mathematics and \texttt{Mathematica}
• Faster algorithms for Frobenius numbers
• Integer matrices, sublattices of Z^m, and Frobenius numbers
• Expected Frobenius numbers
• The parametric Frobenius problem
• A fast and simple algorithm for the money changing problem
• Geometric proof of Rødseth's formula for Frobenius numbers
• p-numerical semigroup of the sequence of consecutive integers
• Weak asymptotics for the numbers of solutions of Diophantine problems
• A ``pseudo-polynomial algorithm for the Frobenius number and Gröbner basis
• Computing and Combinatorics
• Solving thousand-digit Frobenius problems using Gröbner bases
• Computing the Frobenius number
• The Frobenius formula for \(A=(a,ha+d,ha+b_2 d, \ldots, ha+b_k d)\)
• Lattice Point Enumeration on Block Reduced Bases
• The Frobenius Problem and Its Generalizations

Describes a project that uses

Uses Software

• Frobby

This page was built for publication: Frobenius numbers by lattice point enumeration

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