Cyclotomic numerical semigroups

Given a numerical semigroup $S$, we let $\mathrm P_S(x)=(1-x)\sum_{s\in S}x^s$ be its semigroup polynomial. We study cyclotomic numerical semigroups; these are numerical semigroups $S$ such that $\mathrm P_S(x)$ has all its roots in the unit disc. We conjecture that $S$ is a cyclotomic numerical semigroup if and only if $S$ is a complete intersection numerical semigroup and present some evidence for it. Aside from the notion of cyclotomic numerical semigroup we introduce the notion of cyclotomic exponents and polynomially related numerical semigroups. We derive some properties and give some applications of these new concepts.Comment: 17 pages, accepted for publication in SIAM J. Discrete Mat

On the distribution of sums of residues

We generalize and solve the \roman{mod}\,q analogue of a problem of Littlewood and Offord, raised by Vaughan and Wooley, concerning the distribution of the $2^n$ sums of the form $\sum_{i=1}^n\varepsilon_ia_i$, where each $\varepsilon_i$ is $0$ or $1$. For all $q$, $n$, $k$ we determine the maximum, over all reduced residues $a_i$ and all sets $P$ consisting of $k$ arbitrary residues, of the number of these sums that belong to $P$.Comment: 5 page

Note on Ward-Horadam H(x) - binomials' recurrences and related interpretations, II

We deliver here second new $\textit{H(x)}-binomials'$ recurrence formula, were $H(x)-binomials'$ array is appointed by $Ward-Horadam$ sequence of functions which in predominantly considered cases where chosen to be polynomials . Secondly, we supply a review of selected related combinatorial interpretations of generalized binomial coefficients. We then propose also a kind of transfer of interpretation of $p,q-binomial$ coefficients onto $q-binomial$ coefficients interpretations thus bringing us back to $Gy{\"{o}}rgy P\'olya$ and Donald Ervin Knuth relevant investigation decades ago.Comment: 57 pages, 8 figure

Practical numbers among the binomial coefficients

A practical number is a positive integer n such that every positive integer less than n can be written as a sum of distinct divisors of n. We prove that most of the binomial coefficients are practical numbers. Precisely, letting f(n) denote the number of binomial coefficients (nk), with 0≤k≤n, that are not practical numbers, we show that f(n