Counting numerical sets with no small atoms

Abstract: A numerical set

S

with Frobenius number

g

is a set of integers with

m i n (S) = 0

and

, and its atom monoid is

n+s in S

f o r a l l

s in S

. Let

g a m m a_{g}

be the number of numerical sets

S

having

A (S) = s e t 0 c u p (g, i n f t y)

divided by the total number of numerical sets with Frobenius number

g

. We show that the sequence

s e t g a m m a_{g}

is decreasing and converges to a number

g a m m a_{i} n f t y a p p r o x .4844

(with accuracy to within

.0050

). We also examine the singularities of the generating function for

s e t g a m m a_{g}

. Parallel results are obtained for the ratio

g s y m m g

of the number of symmetric numerical sets

S

with

A (S) = s e t 0 c u p (g, i n f t y)

by the number of symmetric numerical sets with Frobenius number

g

. These results yield information regarding the asymptotic behavior of the number of finite additive 2-bases.

Recommendations

Cites work

Cited in

(7)

Describes a project that uses

Uses Software

This page was built for publication: Counting numerical sets with no small atoms