pith. sign in

arxiv: 1605.03900 · v1 · pith:KCZGAEF3new · submitted 2016-05-12 · 🧮 math.GR · cs.DM· math.NT

Numerical semigroups in a problem about economic incentives for consumers

classification 🧮 math.GR cs.DMmath.NT
keywords incentivesnumericalincentivepseudo-varietyalgorithmalgorithmicbuildcompute
0
0 comments X
read the original abstract

Motivated by a promotion to increase the number of musical downloads, we introduce the concept of $C$-incentive and show an algorithm that compute the smallest $C$-incentive containing a subset $X \subseteq {\mathbb N}$. On the other hand, in order to study $C$-incentives, we see that we can focus on numerical $C$-incentives. Then, we establish that the set formed by all numerical $C$-incentives is a Frobenius pseudo-variety and we show an algorithmic process to recurrently build such a pseudo-variety.

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.