Frobenius Coin-Exchange Generating Functions
From MaRDI portal
Publication:4960436
DOI10.1080/00029890.2020.1707625zbMath1444.11045arXiv1901.00554OpenAlexW3014547306MaRDI QIDQ4960436
Leonardo Bardomero, Matthias Beck
Publication date: 16 April 2020
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.00554
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) The Frobenius problem (11D07)
Related Items (3)
The Frobenius number for sequences of triangular numbers associated with number of solutions ⋮ The generalized Frobenius problem via restricted partition functions ⋮ On the solutions of three-variable Frobenius-related problems using order reduction approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for a linear Diophantine equation and a problem of Frobenius
- Lattice translates of a polytope and the Frobenius problem
- Symmetric semigroups of integers generated by 4 elements
- On the linear diophantine problem of Frobenius
- Short generating functions for some semigroup algebras
- Complexity of the Frobenius problem
- Generators and relations of abelian semigroups and semigroup rings
- 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
- A Minimal-Path Algorithm for the "Money Changing Problem"
- A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
- Short rational generating functions for lattice point problems
- Numerical Semigroups, Cyclotomic Polynomials, and Bernoulli Numbers
- Computing the Continuous Discretely
- The Number of Terms in the Cyclotomic Polynomial F pq (x)
This page was built for publication: Frobenius Coin-Exchange Generating Functions
