Gaps of Binary Numerical Semigroups and of Binary Inclusion-Exclusion Polynomials

Let $p$ be a given modulus, let $u$ be prime to $p$, and consider the linear permutation $u\cdot n(\mathrm{m}\mathrm{o}\mathrm{d}p)$ of the residue system modulo $p$. Writing $⟨x{⟩}_p$ to denote the least nonnegative residue of $x$ modulo $p$, we say that a pair of integers $(a,b)$ is a dominant pair of this permutation if either the inequality $\max (⟨ua{⟩}_p,⟨ub{⟩}_p)<{\min }_{a<n<b}⟨un{⟩}_p$, or the inequality $\min (⟨ua{⟩}_p,⟨ub{⟩}_p)>{\max }_{a<n<b}⟨un{⟩}_p$ hold. The main technical part of this work gives analysis of this property of linear permutations of residue systems. We then apply this analysis to the problems that motivated it, and give (i) complete description of the gapsets of binary inclusion-exclusion polynomials $Q_{\{p,q\}}$ (which include binary cyclotomic polynomials ${\mathrm{\Phi }}_{pq}$ as its principal special case), and (ii) complete description of all possible distances between consecutive elements of a numerical semigroup $⟨p,q⟩$.