Proportionally modular Diophantine inequalities and full semigroups. (Q2502256)

A proportionally modular Diophantine inequality is an expression of the form \(ax\bmod b\leq cx\), with \(a,b\) and \(c\) positive integers. The set \(S\) of integer solutions of a proportionally modular Diophantine inequality is a numerical semigroup, that is, it is a subset of the set of nonnegative integers \(\mathbb{N}\) that is closed under addition, \(0\in S\) and \(\mathbb{N}\setminus S\) has finitely many elements. Such \(S\) is called a proportionally modular numerical semigroup. If \(\{a_1,\dots,a_e\}\subseteq\mathbb{N}^r\), then \(\langle a_1,\dots,a_e\rangle\) denotes the subsemigroup of \(\mathbb{N}^r\) generated by \(\{a_1,\dots,a_e\}\) that is, \(\langle a_1,\dots,a_e\rangle=\{\lambda_1a_1+\cdots+\lambda_ea_e\mid\lambda_1,\dots,\lambda_e\in\mathbb{N}\}\). If \(S\) is a numerical semigroup and \(d\) is a positive integer, then \(\tfrac sd\) denotes the set \(\{x\in\mathbb{N}\mid dx\in S\}\). It is a numerical semigroup containing \(S\). We say that \(\tfrac sd\) is the quotient of \(S\) by \(d\). The following result is shown: Let \(n_1,n_2\) and \(d\) be positive integers such that \(n_1\) and \(n_2\) are relatively prime. Then \(\tfrac{\langle n_1,n_2\rangle}d\) is a proportionally modular numerical semigroup. Conversely, every proportionally modular numerical semigroup can be represented in this form. -- Furthermore, the authors determine minimal generating systems for the involved full affine semigroups.