Counting numerical sets with no small atoms

Details Counting numerical sets with no small atoms Counting numerical sets with no small atoms

2008-05-22

arxiv.org/abs/0805.3493v1

Mathematics

Combinatorics

19 pages, 5 figures

Scientific paper

A numerical set $S$ with Frobenius number $g$ is a set of integers with $\min(S) = 0$ and $\max(\Zbb - S)=g$, and its atom monoid is $A(S) = \setpres{n \in \Zbb}{$n+s \in S$ for all $s \in S$}$. Let $\gamma_g$ be the number of numerical sets $S$ having $A(S) = \set{0} \cup (g,\infty)$ divided by the total number of numerical sets with Frobenius number $g$. We show that the sequence $\set{\gamma_g}$ is decreasing and converges to a number $\gamma_\infty \approx .4844$ (with accuracy to within $.0050$). We also examine the singularities of the generating function for $\set{\gamma_g}$. Parallel results are obtained for the ratio $\gsymm{g}$ of the number of symmetric numerical sets $S$ with $A(S) = \set{0} \cup (g,\infty)$ 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.

Affiliated with

Also associated with

No associations

Rating

Counting numerical sets with no small atoms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting numerical sets with no small atoms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting numerical sets with no small atoms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-511318