The generalized Frobenius problem via restricted partition functions

DOI10.37236/11161arXiv2011.00600MaRDI QIDQ6199186

No author found.

Publication date: 23 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) The Frobenius problem (11D07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on generalized Frobenius numbers
• Lattice translates of a polytope and the Frobenius problem
• Short generating functions for some semigroup algebras
• Complexity of the Frobenius problem
• On the number of integer points in translated and expanded polyhedra
• Generalized Frobenius numbers: bounds and average behavior
• Parametric polyhedra with at least k lattice points: Their semigroup structure and the k-Frobenius problem
• Unbounded Discrepancy in Frobenius Numbers
• An Extreme Family of Generalized Frobenius Numbers
• Computing the Continuous Discretely
• Short rational generating functions for lattice point problems
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Frobenius Coin-Exchange Generating Functions

This page was built for publication: The generalized Frobenius problem via restricted partition functions