We propose generating functions, $\textrm {RGF}_p(x)$, for the quotients of numerical semigroups which are related to the Sylvester denumerant. Using MacMahon’s partition analysis, we can obtain $\textrm {RGF}_p(x)$ by extracting the constant term of a rational function. We use $\textrm {RGF}_p(x)$ to give a system of generators for the quotient of the numerical semigroup $\langle a_1,a_2,a_3\rangle $ by p for a small positive integer p, and we characterise the generators of ${\langle A\rangle }/{p}$ for a general numerical semigroup A and any positive integer p.

A natural operation on numerical semigroups is taking a quotient by a positive integer. If $\mathcal {S}$ is a quotient of a numerical semigroup with k generators, we call $\mathcal {S}$ a k-quotient. We give a necessary condition for a given numerical semigroup $\mathcal {S}$ to be a k-quotient and present, for each $k \ge 3$, the first known family of numerical semigroups that cannot be written as a k-quotient. We also examine the probability that a randomly selected numerical semigroup with k generators is a k-quotient.

We establish the limiting distribution of certain subsets of Farey sequences, i.e., sequences of primitive rational points, on expanding horospheres in covers $\unicode[STIX]{x1D6E5}\backslash \text{SL}(n+1,\mathbb{R})$ of $\text{SL}(n+1,\mathbb{Z})\backslash \text{SL}(n+1,\mathbb{R})$, where $\unicode[STIX]{x1D6E5}$ is a finite-index subgroup of $\text{SL}(n+1,\mathbb{Z})$. These subsets can be obtained by projecting to the hyperplane $\{(x_{1},\ldots ,x_{n+1})\in \mathbb{R}^{n+1}:x_{n+1}=1\}$ sets of the form $\mathbf{A}=\bigcup _{j=1}^{J}\mathbf{a}_{j}\unicode[STIX]{x1D6E5}$, where for all $j$, $\mathbf{a}_{j}$ is a primitive lattice point in $\mathbb{Z}^{n+1}$. Our method involves applying the equidistribution of expanding horospheres in quotients of $\text{SL}(n+1,\mathbb{R})$ developed by Marklof and Strömbergsson, and more precisely understanding how the full Farey sequence distributes in $\unicode[STIX]{x1D6E5}\backslash \text{SL}(n+1,\mathbb{R})$ when embedded on expanding horospheres as done in previous work by Marklof. For each of the Farey sequence subsets, we extend the statistical results by Marklof regarding the full multidimensional Farey sequences, and solutions by Athreya and Ghosh to Diophantine approximation problems of Erdős–Szüsz–Turán and Kesten. We also prove that Marklof’s result on the asymptotic distribution of Frobenius numbers holds for sets of primitive lattice points of the form $\mathbf{A}$.

The pseudo-Frobenius numbers of a numerical semigroup are those gaps of the numerical semigroup that are maximal for the partial order induced by the semigroup. We present a procedure to detect if a given set of integers is the set of pseudo-Frobenius numbers of a numerical semigroup and, if so, to compute the set of all numerical semigroups having this set as set of pseudo-Frobenius numbers.

The Frobenius number $F(\boldsymbol{a})$ of a lattice point $\boldsymbol{a}$ in $\mathbb{R}^{d}$ with positive coprime coordinates, is the largest integer which can not be expressed as a non-negative integer linear combination of the coordinates of $\boldsymbol{a}$. Marklof in [The asymptotic distribution of Frobenius numbers, Invent. Math. 181 (2010), 179–207] proved the existence of the limit distribution of the Frobenius numbers, when $\boldsymbol{a}$ is taken to be random in an enlarging domain in $\mathbb{R}^{d}$. We will show that if the domain has piecewise smooth boundary, the error term for the convergence of the distribution function is at most a polynomial in the enlarging factor.

We consider which integers g can occur as the genus and of a curve defined over a field of characteristic p which admits an automorphism of degree pq, where p and q are distinct primes. This investigation leads us to consider a certain family of three-dimensional Frobenius problems and prove explicit formulas giving their solution in many cases.