On the variety of linear recurrences and numerical semigroups
classification
🧮 math.AC
keywords
linearnumericalrecurrencessemigroupsexactlyexistencefinitelyfunction
read the original abstract
In this work, we prove the existence of linear recurrences of order M with a non-trivial solution vanishing exactly on the set of gaps (or a subset) of a numerical semigroup S finitely generated by a1 < a2 <...< aN and M = aN. Keywords: numerical semigroups, linear recurrences, generating function.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.