A Combinatorial Decomposition of Knapsack Cones
Abstract
In this paper, we focus on knapsack cones, a specific type of simplicial cones that arise naturally in the context of the knapsack problem x1 a1 + ·s + xn an = a0. We present a novel combinatorial decomposition for these cones, named DecDenu, which aligns with Barvinok's unimodular cone decomposition within the broader framework of Algebraic Combinatorics. Computer experiments support us to conjecture that our DecDenu algorithm is polynomial when the number of variables n is fixed. If true, DecDenu will provide the first alternative polynomial algorithm for Barvinok's unimodular cone decomposition, at least for denumerant cones. The CTEuclid algorithm is designed for MacMahon's partition analysis, and is notable for being the first algorithm to solve the counting problem for Magic squares of order 6. We have enhanced the CTEuclid algorithm by incorporating DecDenu, resulting in the LLLCTEuclid algorithm. This enhanced algorithm makes significant use of LLL's algorithm and stands out as an effective elimination-based approach.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.