Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions (Q3807217): Difference between revisions

@@ label / en / label / en @@
+Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions
@@ Property / full work available at URL @@
+https://doi.org/10.2307/2047261
@@ Property / full work available at URL: https://doi.org/10.2307/2047261 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4246167497
@@ Property / OpenAlex ID: W4246167497 / rank @@
+Normal rank
@@ Property / title @@
+Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions (English)
+Normal rank
@@ Property / cites work @@
+The ergodic theoretical proof of Szemerédi’s theorem
+Normal rank
@@ Property / cites work @@
+Irregular Sets of Integers Generated by the Greedy Algorithm
+Normal rank
@@ Property / cites work @@
+Sets of Integers With No Long Arithmetic Progressions Generated by the Greedy Algorithm
+Normal rank
@@ Property / cites work @@
+Unsolved problems in number theory
@@ Property / cites work: Unsolved problems in number theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5809257
@@ Property / cites work: Q5809257 / rank @@
+Normal rank
@@ Property / cites work @@
+On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
+Normal rank
@@ Property / cites work @@
+On sets of integers containing k elements in arithmetic progression
+Normal rank