Longest constrained sequences: Difference between revisions
From Polymath Wiki
Jump to navigationJump to search
No edit summary |
mNo edit summary |
||
| Line 1: | Line 1: | ||
The numbers in square brackets show (what we know of) the length of the longest sequence of discrepancy | The numbers in square brackets show (what we know of) the length of the longest sequence of discrepancy 2 satisfying the given constraints exactly. The notation <math>a=b</math> is shorthand for <math>T_a(x) = T_b(x)</math>, and <math>a=-b</math> for <math>T_a(x) = -T_b(x)</math>. | ||
1 = +2 : [170] | 1 = +2 : [170] | ||
Revision as of 12:24, 11 January 2010
The numbers in square brackets show (what we know of) the length of the longest sequence of discrepancy 2 satisfying the given constraints exactly. The notation [math]\displaystyle{ a=b }[/math] is shorthand for [math]\displaystyle{ T_a(x) = T_b(x) }[/math], and [math]\displaystyle{ a=-b }[/math] for [math]\displaystyle{ T_a(x) = -T_b(x) }[/math].
1 = +2 : [170] 1 = -2 : [>=974] 1 = -2, 1 = +3 : [188] 1 = -2, 1 = -3 : [470] 1 = -2, 1 = +5 : [356] 1 = -2, 1 = -5 : [>=974] 1 = -2, 1 = -5, 1 = +7 : [>=566] 1 = -2, 1 = -5, 1 = -7 : [284] 1 = -2, 1 = -5, 11 = -13 : [>=974] 2 = +3 : [>=514] 2 = -3 : [>=587]
