pp-numerical semigroups of Pell triples

preprint2024arXivOpen access

Abstract

For a nonnegative integer pp, the pp-numerical semigroup SpS_p is defined as the set of integers whose nonnegative integral linear combinations of given positive integers a1,a2,…,aκa_1,a_2,\dots,a_κ with gcd⁡(a1,a2,…,aκ)=1\gcd(a_1,a_2,\dots,a_κ)=1 are expressed in more than pp ways. When p=0p=0, S=S0S=S_0 is the original numerical semigroup. The largest element and the cardinality of N0\Sp\mathbb N_0\backslash S_p are called the pp-Frobenius number and the pp-genus, respectively. Their explicit formulas are known for κ=2κ=2, but those for κ≥3κ\ge 3 have been found only in some special cases. For some known cases, such as the Fibonacci and the Jacobsthal triplets, similar techniques could be applied and explicit formulas such as the pp-Frobenius number could be found. In this paper, we give explicit formulas for the pp-Frobenius number and the pp-genus of Pell numerical semigroups (Pi(u),Pi+2(u),Pi+k(u))\bigl(P_i(u),P_{i+2}(u),P_{i+k}(u)\bigr). Here, for a given positive integer uu, Pell-type numbers Pn(u)P_n(u) satisfy the recurrence relation Pn(u)=uPn−1(u)+Pn−2(u)P_n(u)=u P_{n-1}(u)+P_{n-2}(u) (n≥2n\ge 2) with P0(u)=0P_0(u)=0 and P1(u)=1P_1(u)=1. The pp-Apéry set is used to find the formulas, but it shows a different pattern from those in the known results, and some case by case discussions are necessary.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.