User contributions for Alec
From Polymath Wiki
Jump to navigationJump to search
12 January 2010
- 12:4812:48, 12 January 2010 diff hist +88 m Longest constrained sequences No edit summary
11 January 2010
- 23:2723:27, 11 January 2010 diff hist +1,392 N Sequence of length 1112 New page: This sequence, of length 1112 (close to the current record) may be of interest because it was derived differently from the 1124 sequences, by a depth-first search starting with a sequence ...
- 23:2323:23, 11 January 2010 diff hist +86 Experimental results →Experimental data
- 15:3915:39, 11 January 2010 diff hist +19 m Longest constrained sequences No edit summary
- 13:2413:24, 11 January 2010 diff hist −8 m Longest constrained sequences No edit summary
- 13:2413:24, 11 January 2010 diff hist +25 Longest constrained sequences No edit summary
- 13:2313:23, 11 January 2010 diff hist +35 m Longest constrained sequences No edit summary
- 13:2213:22, 11 January 2010 diff hist +38 m Longest constrained sequences No edit summary
- 13:1813:18, 11 January 2010 diff hist +17 m Longest constrained sequences No edit summary
- 13:1313:13, 11 January 2010 diff hist +25 Longest constrained sequences No edit summary
- 13:0913:09, 11 January 2010 diff hist +14 Longest constrained sequences No edit summary
- 13:0713:07, 11 January 2010 diff hist +417 N Longest constrained sequences New page: The numbers in square brackets show (what we know of) the longest sequence satisfying the given constraints exactly. The notation <math>a=b</math> is shorthand for <math>T_a(x) = T_b(x)</m...
- 13:0013:00, 11 January 2010 diff hist +47 Experimental results →Experimental data
- 12:3712:37, 11 January 2010 diff hist +38 T m(x) = (+/-)T n(x) No edit summary
- 12:3612:36, 11 January 2010 diff hist +606 T m(x) = (+/-)T n(x) 1=-2=-3
- 11:2211:22, 11 January 2010 diff hist +1,055 T m(x) = (+/-)T n(x) Sequence of length 974.
10 January 2010
- 23:5123:51, 10 January 2010 diff hist +7 T m(x) = (+/-)T n(x) No edit summary
- 23:5023:50, 10 January 2010 diff hist +920 T m(x) = (+/-)T n(x) Sequence of length 854.
- 22:1322:13, 10 January 2010 diff hist +204 The Erdős discrepancy problem →Some definitions and notational conventions: Definition of the maps Tk.
- 21:3521:35, 10 January 2010 diff hist +897 N T m(x) = (+/-)T n(x) New page: This sequence, of length 688, satisfies the following relations exactly: <math>x_{2n} = -x_n</math> <math>x_{5n} = -x_n</math> <math>x_{13n} = -x_{11n}</math> 0+--+-++--+--+-++-++--+-...
- 21:2821:28, 10 January 2010 diff hist +5 Experimental results →Experimental data
- 21:2721:27, 10 January 2010 diff hist +72 Experimental results →Experimental data
- 14:3914:39, 10 January 2010 diff hist +705 T2(x) = T5(x) = -x Sequence of length 636. current
- 13:5013:50, 10 January 2010 diff hist +740 N T2(x) = T5(x) = -x New page: This sequence of length <math>594</math> satisfies <math>x_{2n} = x_{5n} = -x_n</math> for all <math>n</math>: 0+--+-++--+--+-++-++--+-++-++--+-++ --+--+-+--++--+-+++-+--+-++-++--+-+ +...
- 13:4613:46, 10 January 2010 diff hist +51 Experimental results →Experimental data
- 13:3813:38, 10 January 2010 diff hist +686 T2(x) = -x Sequence of length 614. current
- 13:0313:03, 10 January 2010 diff hist +735 N T2(x) = -T3(x) New page: This sequence of length <math>587</math> satisfies <math>x_{2n} = -x_{3n}</math> for all <math>n</math>: 0+-++----++-+++--+-++---+-++ -+--++-+--+--++-++---+++--+- +--++++--+--++--+++--... current
- 12:5812:58, 10 January 2010 diff hist +48 Experimental results →Experimental data
- 10:3810:38, 10 January 2010 diff hist +715 T2(x) = -x No edit summary
- 10:3410:34, 10 January 2010 diff hist −1 Experimental results →Experimental data
- 10:1710:17, 10 January 2010 diff hist +715 N T2(x) = -x New page: This sequence, of length <math>584</math>, satisfies <math>x_{2n} = -x_n</math> for all <math>n</math>: 0+--+-++--++---++-+--+-++++-+--+-++---+-++--+ +-+-+-+-++---+-++--++---++-+++---++...
- 10:0710:07, 10 January 2010 diff hist +48 Experimental results →Experimental data
- 07:2107:21, 10 January 2010 diff hist +32 m T32-invariant sequences No edit summary current
- 07:2007:20, 10 January 2010 diff hist +720 N Multiplicative sequences Longest completely multiplicative sequence.
- 07:1107:11, 10 January 2010 diff hist +37 Experimental results →Experimental data
- 07:0707:07, 10 January 2010 diff hist 0 m Length 1124 sequences →The data: Update with number of sequences found after program had tracked back to 233.
- 07:0207:02, 10 January 2010 diff hist +1,038 N T32-invariant sequences Sequence of length 417.
- 06:5406:54, 10 January 2010 diff hist −115 Experimental results →Experimental data
- 06:5306:53, 10 January 2010 diff hist +151 Experimental results →Experimental data: add link to page containing T32-invariant sequences.
- 00:4200:42, 10 January 2010 diff hist +18 m Length 1124 sequences →The data: Update with number of sequences found after program had tracked back to 262.
9 January 2010
- 11:4911:49, 9 January 2010 diff hist +509 N Talk:Length 1124 sequences New page: I think the method used to find it was the same as for the first one. A I understand it, Klas has a program that searches for sequences of length over <math>100n</math> extended from a lis...
- 09:2109:21, 9 January 2010 diff hist +12 m Experimental results →The seven-point hexagon
- 09:1609:16, 9 January 2010 diff hist +42 m Experimental results No edit summary
- 08:2408:24, 9 January 2010 diff hist +2,382 Experimental results No edit summary
- 07:4207:42, 9 January 2010 diff hist +4,229 Experimental results No edit summary
- 07:2307:23, 9 January 2010 diff hist +278 m Experimental results →Varying the upper and lower bounds
- 06:5106:51, 9 January 2010 diff hist +6 m Experimental results →Sequences with different upper and lower bounds
- 06:4606:46, 9 January 2010 diff hist +1,190 Experimental results No edit summary
- 02:0102:01, 9 January 2010 diff hist +398 Talk:The Erdős discrepancy problem No edit summary
- 01:4701:47, 9 January 2010 diff hist +269 N Talk:The Erdős discrepancy problem New page: == Terminology for zero-based APs == Could we abbreviate 'zero-based arithmetic progression' to ZAP (the 'H' for 'homogeneous' being redundant)? We'd then need a term for the discrepancy...
