Papers
Topics
Authors
Recent
Search
2000 character limit reached

On proportionally modular numerical semigroups that are generated by arithmetic progressions

Published 3 Nov 2020 in math.NT | (2011.01527v1)

Abstract: A numerical semigroup is a submonoid of ${\mathbb Z}{\ge 0}$ whose complement in ${\mathbb Z}{\ge 0}$ is finite. For any set of positive integers $a,b,c$, the numerical semigroup $S(a,b,c)$ formed by the set of solutions of the inequality $ax \bmod{b} \le cx$ is said to be proportionally modular. For any interval $[\alpha,\beta]$, $S\big([\alpha,\beta]\big)$ is the submonoid of ${\mathbb Z}{\ge 0}$ obtained by intersecting the submonoid of ${\mathbb Q}{\ge 0}$ generated by $[\alpha,\beta]$ with ${\mathbb Z}_{\ge 0}$. For the numerical semigroup $S$ generated by a given arithmetic progression, we characterize $a,b,c$ and $\alpha,\beta$ such that both $S(a,b,c)$ and $S\big([\alpha,\beta]\big)$ equal $S$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.