Searcharxiv⌕ Search

arXiv subjects

Melvyn B. Nathanson

Publications and source records attributed to Melvyn B. Nathanson.

148 records · Page 9Linked to original sources
arXiv2000

On Erdos's elementary method in the asymptotic theory of partitions

Let m be a positive integer, and let A be the set of all positive integers that belong to a union of r distinct congruence classes modulo m. We assume that the elements of A are relatively prime, that is, gcd(A) = 1. Let p_A(n) denote the number of partitions of n into parts belonging to A. We obtain the asymptotic formula log p_A(n) ~ π\sqrt(2rn/3m). The proof is based on Erdos's elementary method to obtain the asymptotic formula for the usual partition function p(n).

math.NT↗
arXiv2000

Growth of sumsets in abelian semigroups

Let S be an abelian semigroup, written additively. Let A be a finite subset of S. We denote the cardinality of A by |A|. For any positive integer h, the sumset hA is the set of all sums of h not necessarily distinct elements of A. We define 0A = {0}. If A_1,...,A_r, and B are finite sumsets of A and h_1,...,h_r are nonnegative integers, the sumset h_1A + ... + h_rA_r + B is the set of all elements of S that can be represented in the form u_1 + ... + u_r + b, where u_i \in h_iA_i and b \in B. The growth function of this sumset is γ(h_1,...,h_r) = |h_1A + ... + h_rA_r + B|. Applying the Hilbert function for graded modules over graded algebras, where the grading is over the semigroup of r-tuples of nonnegative integers, we prove that there is a polynomial p(t_1,...,t_r) such that γ(h_1,...,h_r) = p(t_1,...,t_r) if min(h_1,...,h_r) is sufficienlty large.

math.NT↗
arXiv2000

Partitions with parts in a finite set

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

math.NT↗