On Frobenius Formulas of Power Sequences

MaRDI QIDQ6413073zbMATH OpenFDO

Authors Feihu Liu, Guoce Xin

Publication date 6 October 2022

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Other combinatorial number theory (11B75) Linear Diophantine equations (11D04) The Frobenius problem (11D07) Elementary theory of partitions (11P81)

Abstract: Let $A=(a_1,a_2,\mathrm{...},a_n)$ be relative prime positive integers with $a_{i}geq2$. The Frobenius number $g(A)$ is the greatest integer that can not be written as a nonnegative integer linear combination of the $a_i$'s. Recently we developed a combinatorial approach to $g(A)$ for $A=(a,a+B)=(a,a+b_1,dots,a+b_k)$. The problem is reduced to solving an easier optimization problem $O_B(M)$. In this paper, we use this approach to solve the open problem of characterizing $g(A)$ for the square sequence $A=(a,a+1,a+2^2,\mathrm{...},a+k^2)$. Our point is that the Frobenius number $g(a,a+1^2,a+2^2,dots)$ of infinite square sequence is easier to solve, since the corresponding $O_B(M)$ has a solution in Number Theory in terms of Lagrange's Four-Square Theorem and related results. This leads to a solution to the open problem by using Lagrange's Four-Square Theorem and generating functions. Moreover, the technique can be used for power sequence, i.e., the $b_i=i^s$ case where $s$ is a fixed positive integer.

This page was built for publication: On Frobenius Formulas of Power Sequences

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