10.07.2015 Views

here - Sites personnels de TELECOM ParisTech - Télécom ParisTech

here - Sites personnels de TELECOM ParisTech - Télécom ParisTech

here - Sites personnels de TELECOM ParisTech - Télécom ParisTech

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

64 Chapter 2. On a conjecture about addition modulo 2 k − 1w<strong>here</strong>⎧⎨ A j + Bj+1j+1if j > 0C j = −⎩13 6if j = 01 if j = −1The exact values of I and J are not important, only their cardinalities are; so <strong>de</strong>fining I ={m + 1, . . . , m + i} and J = {n + 1, . . . , n + j}, we get( ) n−m ((i = ln − m1,...,i n) (−1)n+1 i 1 , . . . , i n ia d,n⎛⎝ ∑ k≥1∑i=02 k(h − k)!) d−n∑j=0( d − nj).∑k j≥0,j∈I∪Jk j≥i j−1,1≤j≤mS!l![ ] ⎞h − k ⎠ ∏ A kj∏ A kj − 3 kj=0S k j ! k j !j∈J j∈Im∏j=1C kj−i j|k j − i j |!We finally make the change of summation variables k j = k j − i j + 1 to obtain the <strong>de</strong>sire<strong>de</strong>xpression:( ) n−m(i = l ∑( n − m1,...,i n) (−1)n+1 i 1 , . . . , i n ii=0⎛a d,n⎝ ∑ k≥1( )= (−1) n+1 li 1 , . . . , i n) d−n∑j=0( d − nj)∑k j≥0,j∈I∪J,1≤j≤m2 k [ ] ⎞ h − k ⎠ ∏ A kj∏ A kj − 3 kj=0(h − k)! l + S − m k j ! k j !j∈J j∈Ib d,nl,m .2.5.6 An additional relationIn this subsection we prove the following experimental fact.Proposition 2.5.3. For n ≥ 2 and 0 < j ≤ i,(i,j,...) = i + 1 a d,nj(i+1,j−1,...) ;a d,ni.e. the value of b d,nl,mdoes not <strong>de</strong>pend on m.Proof. From Proposition 2.5.2,( )(i = l1,...,i n) (−1)n+1 i 1 , . . . , i na d,nb d,nl,m ,(l + S − m)!l!m∏j=1.C kj−1|k j − 1|!w<strong>here</strong> b d,nl,monly <strong>de</strong>pends on d, n, l and m. T<strong>here</strong>fore if j > 1, this value does not vary and thetheorem is a simple corollary of Proposition 2.5.2.If t<strong>here</strong> is some <strong>de</strong>gree equal to zero in (i, j, . . .), i.e. if n > m, then we can use the result ofCorollary 2.5.18:a d,n(i,j,...,0) + ad,n−1 (i,j,...) = 3ad−1,n−1 (i,j,...);hence we can restrict ourselves to the study of tuples w<strong>here</strong> n = m.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!