Mathematics – Combinatorics
Scientific paper
2011-07-14
Mathematics
Combinatorics
19 pages, submitted to Integers in July 2011
Scientific paper
In this paper, we consider a certain variation of the "isoperimetric problem" adopted for subsets of nonnegative integers. More specifically, we explore the sequence P(n) as described in OEIS A186053. We provide the first exact formulas for P(n) including multiple recursive relations involving auxiliary functions as well as concise and satisfying representations and quasi-explicit formulas. We also discuss some of the intricate fractal-like symmetry of the sequence as well as the development of algorithms for computing P(n). We conclude with open questions for further research.
No associations
LandOfFree
Sets with High Volume and Low Perimeter 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 Sets with High Volume and Low Perimeter, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sets with High Volume and Low Perimeter will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-224424