Skip to main content Accessibility help
×
×
Home

A Construction for Partitions Which Avoid Long Arithmetic Progressions

  • E.R. Berlekamp (a1)
Extract

For k ≥2, t ≥2, let W(k, t) denote the least integer m such that in every partition of m consecutive integers into k sets, atleast one set contains an arithmetic progression of t+1 terms. This paper presents a construction which improves the best previously known lower bounds on W(k, t) for small k and large t.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      A Construction for Partitions Which Avoid Long Arithmetic Progressions
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      A Construction for Partitions Which Avoid Long Arithmetic Progressions
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      A Construction for Partitions Which Avoid Long Arithmetic Progressions
      Available formats
      ×
Copyright
References
Hide All
Erdös, P. and Radó, R., Combinatorial theorems on classifications of subsets of a given set. Proceedings of the London Mathematical Society (3) 2(1952)417-439.
Folkman, J., private communication (1967).
Moser, L., On a theorem of van der Waerden. Canadian Mathematical Bulletin, 3 (1960) 23-25.
Schmidt, W.M., Two combinatorial theorems on arithmetic progressions. Duke Math. J. 29(1962)129-140.
van der Waerden, B.L., Beweis einer Baudet'schen Vermutung. Niew Archief voor Wiskunde, 15 (1925) 212-216.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Canadian Mathematical Bulletin
  • ISSN: 0008-4395
  • EISSN: 1496-4287
  • URL: /core/journals/canadian-mathematical-bulletin
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed