The Frobenius number for sequences of triangular numbers associated with number of solutions

DOI10.1007/S00026-022-00594-3MaRDI QIDQ2674372zbMATH OpenOpenAlexFDO

Publication date 12 September 2022

Published in Annals of Combinatorics (Search for Journal in Brave)

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

Frobenius numbers Frobenius problem number of representations triangular numbers

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Bernoulli and Euler numbers and polynomials (11B68) Linear Diophantine equations (11D04) The Frobenius problem (11D07) Elementary theory of partitions (11P81)

Abstract: The famous linear diophantine problem of Frobenius is the problem to determine the largest integer (Frobenius number) whose number of representations in terms of

a_{1}, d o t s, a_{k}

is at most zero, that is not representable. In other words, all the integers greater than this number can be represented for at least one way. One of the natural generalizations of this problem is to find the largest integer (generalized Frobenius number) whose number of representations is at most a given nonnegative integer

p

. It is easy to find the explicit form of this number in the case of two variables. However, no explicit form has been known even in any special case of three variables. In this paper we are successful to show explicit forms of the generalized Frobenius numbers of the triples of triangular numbers. When

p = 0

, their Frobenius number is given by Robles-P'erez and Rosales in 2018.

Review text

Let \(a_1,\ldots,a_k\) be positive coprime integers. For a given nonnegative integer \(p\) denote by \(g(a_1,\ldots,a_k;p)\) the largest integer \(N\) such that the number of solutions of the equation \(a_1x_1+\ldots+a_kx_k=N\) in nonnegative integers \(x_1,\ldots,x_k\) is at most \(p\). Let \(t_n=\binom{n}{2}\) be \(n\)-th triangular number. Then formulae for \(g(t_n,t_{n+1},t_{n+2};p)\) for \(p\leq 10\) are found. Also it is proved that for any even \(n\) \[ g\left(t_n,t_{n+1},t_{n+2};p(p+1)+\sum_{j=1}^p\left\lceil \frac{6j}{n}\right\rceil\right)= \frac{(n+1)(n+2)(2(n+3)p+3n}{4}-1 \] and for any odd \(n\geq 3\) \[ g\left(t_n,t_{n+1},t_{n+2};p(p+1)+\sum_{j=1}^p\left\lceil \frac{j}{2}\left( 1+\frac{3}{n}\right) \right\rceil\right)= \frac{(n+1)(n+2)((n+3)p+3(n-1)}{4}-1. \]

Recommendations

Cites work

Cited in

(17)

Describes a project that uses

Uses Software

OEIS

This page was built for publication: The Frobenius number for sequences of triangular numbers associated with number of solutions

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