Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Ordinal Sum-Sets

Martin M. Zuckerman
Proceedings of the American Mathematical Society
Vol. 35, No. 1 (Sep., 1972), pp. 242-248
DOI: 10.2307/2038479
Stable URL: http://www.jstor.org/stable/2038479
Page Count: 7
  • Read Online (Free)
  • Download ($30.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Ordinal Sum-Sets
Preview not available

Abstract

A finite set, $B$, of ordinals will be called a sum-set if there are nonzero ordinals $\alpha_1, \alpha_2, \cdots, \alpha_n$ such that the set of sums of $\alpha_1, \alpha_2, \cdots, \alpha_n$, in all $n$! permutations of the summands, is $B$. Let $B_k$ denote an arbitrary $k$-element sum-set; we consider various matters related to the set of numbers $n$ for which there are $n$ summands for $B_k$.

Page Thumbnails

  • Thumbnail: Page 
242
    242
  • Thumbnail: Page 
243
    243
  • Thumbnail: Page 
244
    244
  • Thumbnail: Page 
245
    245
  • Thumbnail: Page 
246
    246
  • Thumbnail: Page 
247
    247
  • Thumbnail: Page 
248
    248