ON THE ENTRY SUM OF CYCLOTOMIC ARRAYS. Don Coppersmith IDACCR. John Steinberger UC Davis

Size: px
Start display at page:

Download "ON THE ENTRY SUM OF CYCLOTOMIC ARRAYS. Don Coppersmith IDACCR. John Steinberger UC Davis"

Transcription

1 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 ON THE ENTRY SUM OF CYCLOTOMIC ARRAYS Don Coppersmith IDACCR John Steinberger UC Dvis Received: 3/29/05, Revised: 0/8/06, Accepted: 0/0/06, Published: 0/3/06 Abstrct A cyclotomic rry is n rry of numbers tht cn be written s liner combintion of lines of s running prllel to the coordinte xes nd running the full length of the rry. In this pper we show tht the sum of the entries of cyclotomic rry with nonnegtive integer entries is nonnegtive integer liner combintion of the sidelengths of the rry. Introduction A cyclotomic rry is n rry of numbers tht cn be written s liner combintion of lines of s running prllel to the coordinte xes nd running the full length of the rry. Figure shows for exmple 2-dimensionl cyclotomic rry of size 3 4 nd how it is obtined s liner combintion of lines of s. Figure 2 shows similr exmple of 3-dimensionl cyclotomic rry. The purpose of this pper is to prove the following theorem: Theorem. The sum of the entries of cyclotomic rry with nonnegtive integer entries is nonnegtive integer liner combintion of the sidelengths of the rry. Lm nd Leung [6 prove the specil cse of Theorem when the two smllest sidelengths of the rry re coprime (Corollry 2 in our pper). Their pper, however, is written in the slightly different context of vnishing sums of roots of unity. The connection between vnishing sums of roots of unity nd cyclotomic rrys is briefly discussed below. A more complete discussion cn be found in [9 (where the term cyclotomic rry is lso coined). We shll refer to the lines of s in n rry s fibers. Thus n rry is cyclotomic if nd only if it cn be written s liner combintion of fibers. It is shown in [9 tht ny integervlued cyclotomic rry cn lwys be written s n integer liner combintion of fibers,

2 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A Figure : A 3 4 cyclotomic rry (on the left) shown decomposed s liner combintion of lines of s. Blnk entries denote zeroes. Figure 2: A cyclotomic rry shown decomposed s liner combintion of lines of s; shded cubes denote s, other entries re 0. from which it follows tht the entry sum of n integer-vlued cyclotomic rry is lwys n integer liner combintion of the sidelengths of the rry. Theorem shows this integer liner combintion cn be written with nonnegtive coefficients if the rry lso hppens to be nonnegtive. Theorem is trivil for -dimensionl cyclotomic rrys, which hve ll their entries equl. It is lso esy for 2-dimensionl cyclotomic rrys, s it turns out tht ny nonnegtive 2- dimensionl cyclotomic rry is just positive sum of fibers [9. The problem only becomes interesting for 3-dimensionl rrys nd higher, s nonnegtive 3-dimensionl cyclotomic rrys or higher re not lwys positive sums of fibers (such s the rry of Fig. 2). If one wishes one cn restrict one s ttention to rrys tht re miniml, in the sense of not being decomposble s the sum of two other (nonzero) cyclotomic rrys with nonnegtive integer entries, since if Theorem is true for miniml rrys then it obviously holds for ll rrys. However miniml cyclotomic rrys of 3 or more dimensions cn hve surprisingly complicted structures. For exmple they my contin entries tht re rbitrrily lrge, even superpolynomilly lrge compred to the volume of the rry [9. It is therefore not of much use to restrict one s ttention to miniml cyclotomic rrys. An exception is Lm nd Leung s proof of Theorem for rrys whose two smllest sidelengths re coprime, which cn be obtined simply by giving lower bound on the entry sum of non-fiber miniml cyclotomic rrys (see Corollries nd 2 in our pper). Another promising but ultimtely doomed pproch for proving Theorem, s noted by Lm nd Leung, is to show tht ny integervlued nonnegtive cyclotomic rry hs representtion s n integer liner combintion of fibers where the sum of the coefficients of fibers prllel to the j-th coordinte direction is nonnegtive for ech j. In fct, even the rry of Fig. 2 does not dmit such representtion, s the reder my verify.

3 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 3 As just mentioned, Theorem for 2-dimensionl rrys is consequence of the fct tht nonnegtive 2-dimensionl cyclotomic rrys re positive sums of fibers (or lterntively, tht the only miniml 2-dimensionl cyclotomic rrys re fibers). A proof of this cn be found in [9 or cn be deduced from Proposition below. To wrm up we give slightly different rgument showing Theorem for 2-dimensionl rrys; this rgument is closer in structure to our proof for n-dimensionl rrys. If A is cyclotomic rry we write [A for the sum of the entries, [A + for the sum of the positive entries nd [A for the sum of the negtive entries in bsolute vlue (so [A = [A + [A ). A j-fiber mens fiber prllel to the j-th coordinte direction nd j-lyer mens n rry lyer perpendiculr to the j-th coordinte direction (thus j-lyer of n rry of size n is n rry of size j j+ n ). We index coordintes strting t 0 insted of t, so the j-th coordinte of cyclotomic rry of size n is number in Z j = {0,, 2,..., j }. We first note defining feture of cyclotomic rrys: Proposition. The difference of two j-lyers of cyclotomic rry of dimension n > is cyclotomic rry of dimension n. Proof. Let A be cyclotomic rry of size n. Fix some representtion of A s liner combintion of fibers. When we tke the difference of two j-lyers of A the contribution of j-fibers to those lyers cncels, leving only the contributions of i-fibers for i j. Thus the result of the difference is cyclotomic rry of size j j+ n. Thus two -lyers or two 2-lyers of 2-dimensionl cyclotomic rry differ only by n dditive constnt, since -dimensionl cyclotomic rrys hve ll their entries equl. From this we cn esily find proof of Theorem for 2-dimensionl cyclotomic rrys. The nottion Z + (, 2 ) mens the set of nonnegtive integer liner combintions of, 2 : Proposition 2. If A is nonnegtive integer-vlued cyclotomic rry of size 2 then [A Z + (, 2 ). Proof. Let A 0,..., A 2 be the 2 2-lyers of A, nd let A be 2-lyer of A such tht [A = min([a r : r Z 2 ). Also let A r = A r A for ll r Z 2. We hve [A = [A 2 + r Z 2 [A r. () By Proposition ech A r is -dimensionl integer-vlued cyclotomic rry of size, so [A r is multiple of for every r (recll tht the entries of -dimensionl cyclotomic rry re ll equl). But [A r = [A r [A 0 so [A r is nonnegtive multiple of for ll r. It thus directly follows from () tht [A Z + (, 2 ).

4 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A b b 2 b 3 Figure 3: Inflting n rry. t 3 t 2 t s 3 s 2 r r 3 s 2 r Figure 4: Another infltion. (Note tht the sme type of proof cnnot work for 3-dimensionl cyclotomic rrys becuse 2-dimensionl integer-vlued cyclotomic rry A cn hve [A 0 but [A / Z + (, 2 ), such s the rry of Fig..) Some interesting pplictions of Theorem cn be found by exhibiting cyclotomic rrys whose entry sums re not obviously nonnegtive integer liner combintion of the sidelengths. A simple wy to construct cyclotomic rrys is to use process clled infltion. Let A i,...,i n denote the (i,..., i n )-th entry of n rry A of dimension n. Formlly, cyclotomic rry A of size n is sid to be n inflte of cyclotomic rry A of size n if there re functions κ : Z Z,..., κ n : Z n Z n such tht A i,...,i n = A κ (i ),..., κ n(i n) for ll (i,..., i n ) Z Z n (this notion of infltion differs slightly from the one defined in [9, where the functions κ j re required to be surjections). The bsic ide behind infltion is shown in Fig. 3. It is esy to check tht the infltes of cyclotomic rrys re gin cyclotomic. The sum of the entries of n inflte of the Fig. 2 cyclotomic rry is equl to b b 2 b 3 + ( b )( 2 b 2 )( 3 b 3 ) for some integers, 2, 3, b, b 2, b 3 with 0 b, 0 b 2 2, 0 b 3 3. It follows from Theorem tht b b 2 b 3 + ( b )( 2 b 2 )( 3 b 3 ) Z + (, 2, 3 ) (2) for ll integers, 2, 3, b, b 2, b 3 such tht 0 b, 0 b 2 2, 0 b 3 3. The inclusion (2) is not esy to verify without Theorem nd this pper is, s fr s we know, the first plce it hs been noted. Considering more generlly the infltes of odd-dimensionl

5 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 5 Figure 5: The two fiber tilings of 5 4 rry. The shded strips represent the fibers used. 2 2 rrys with two entries of t opposing corners of the rry nd entries of 0 elsewhere (which re esily verified to be cyclotomic), we get tht n b i + i= n ( i b i ) Z + (,..., n ) (3) i= for ll integers,..., n nd b,..., b n such tht 0 b i i for ll i, for ll odd n. At the end of this section we give self-contined proof of (3) tht does not rely on cyclotomic rrys. Any number of identities of the type (2) nd (3) cn be found using Theorem. For nother exmple, it follows from considering infltes of the cyclotomic rry on the left of Fig. 4 tht t (r s + r s 2 + r 2 s ) + t 2 (r 2 s + r 2 s 3 + r 3 s 3 ) + t 3 (r s 2 + r 3 s 2 + r 3 s 3 ) Z + (r, s, t) (4) for ll integers r, r 2, r 3, s, s 2, s 3, t, t 2, t 3 0, where r = r + r 2 + r 3, s = s + s 2 + s 3, t = t + t 2 + t 3. We hve lso found n musing ppliction of Theorem which concerns the notion of fiber tiling of n rry. A fiber tiling is collection F of fibers in n rry of size n such tht the sum of ll the fibers in F is the ll s rry (put nother wy, F is fiber tiling if nd only if the supports of the fibers in F prtition the set Z Z n ). There re only two kinds of two-dimensionl fiber-tilings: the tiling by horizontl fibers nd the tiling by verticl fibers (Fig. 5). Three-dimensionl fiber tilings re only slightly more vried, since these cn lwys be decomposed s sndwich of two-dimensionl fiber tilings, while four-dimensionl fiber tilings strt showing better diversity (in prticulr, four is the first dimension for which fibers in ll the coordinte directions cn pper simultneously in the sme tiling, if we exclude one-dimensionl tilings). Theorem gives us: Theorem 2. Let F be fiber tiling of n rry of size n where n 2. Then the number of j-fibers in F is in Z + (,..., j, j+,..., n ). Proof. Let F 0 denote ll i-fibers in F, i j, tht re contined in the first j-lyer of the rry, nd let A be the 0- j j+ n cyclotomic rry obtined by

6 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 6 dding ll the fibers in F 0. Note tht the j-fibers of F re in -to- correspondence with the 0 entries of A. Let B denote the ll s j j+ n rry. Becuse the dimension of B is greter thn or equl to (s we supposed n 2) B is lso cyclotomic rry, so B A is nother 0- j j+ n cyclotomic rry. But the number of j-fibers in F is the entry sum of B A, so is in Z + (,..., j, j+,..., n ) by Theorem. We cn lso mention s n ppliction of Theorem the originl result of Lm nd Leung [6 on vnishing sums of roots of unity: Theorem 3. (Lm nd Leung [6) Let ζ n be primitive n-th root of unity nd let n c i ζn i = 0 i=0 be vnishing sum of n-th roots of unity where the c i s re nonnegtive integers. n i=0 c i is nonnegtive integer liner combintion of the primes dividing n. Then We only sketch the reduction from Theorem 3 to Theorem, since detiled ccount of the reltionship between cyclotomic rrys nd vnishing sums of roots of unity cn be found in [9. Firstly Theorem 3 cn be reduced to the cse where n is squrefree (becuse Φ np (x) = Φ n (x p ) if p is prime dividing n, where Φ m (x) is the m-th cyclotomic polynomil). Then if n = p p k is squrefree there is bijection between vnishing sums of n-th roots of unity nd cyclotomic rrys of size p p k, given by putting the coefficient of ζn i in the vnishing sum s the vlue of the entry with coordintes (i mod p,..., i mod p k ) in the rry (note tht under this bijection, j-fiber mps to regulr p j -gon in the complex plne, so the bijection essentilly sttes tht ny vnishing sum of roots of unity cn be obtined by ddition nd subtrction of regulr p-gons from one nother). Thus if the coefficients c i re nonnegtive integers it directly follows from Theorem tht n i=0 c i is in Z + (p,..., p k ). Conversely, Theorem 3 implies Theorem for rrys whose sides re distinct primes, though the proof technique of Lm nd Leung cn be more generlly dpted to prove Theorem for ll rrys whose two smllest sides re coprime (cf. Corollry 2). Lm nd Leung show some further pplictions of Theorem 3 to representtion theory nd there re mny other independent pplictions of vnishing sums of roots of unity (e.g. [3, 8, 0). Since the j-fibers of n n rry re the incidence vectors of cosets of the cnonicl copy of Z j in Z Z n, Theorem suggests the question of whether, more generlly, ny nonnegtive vector obtined s the integer combintion of cosets in finite belin group hs entry sum equl to some nonnegtive integer combintion of the sizes of the cosets used. This is flse; Fig. 6 shows n exmple where single element of G = (Z 3 ) 2 (Z 2 ) 3 is written s the difference of seven cosets of size 2 from five cosets of size 3, wheres / Z + (2, 3) ( similr exmple fits in the group G = (Z 3 ) 2 (Z 2 ) 2, but is hrder to drw due to overlp between the cosets of size 3). However Theorem does hve generliztion in the non-belin setting, essentilly due to Hertweck [5:

7 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 7 f g c d e f g b c b e d Figure 6: An integer combintion of cosets of sizes 2 nd 3 in G = (Z 3 ) 2 (Z 2 ) 3 resulting in single element. Ech group of 3 dots connected by lines is coset of size 3 dded to the liner combintion nd ech pir of dots with the sme letter is coset of size 2 subtrcted from the liner combintion. The shded dot is the leftover element. Theorem 4. Let G be finite group nd let N,..., N k be norml subgroups of G such tht N N k = N N k. Then ny nonnegtive integer-vlued vector in Z G obtined s liner combintion of cosets of N,..., N k hs entry sum in Z + ( N,..., N k ). Proof. (Reducing from Theorem.) It obviously suffices to consider the cse where G = N N k. Then every element of G cn be uniquely written s product n n 2... n k where n i N i. For ech N i choose n rbitrry one-to-one mp f i from N i to Z Ni, nd define f : G Z N Z Nk by f(n n k ) = (f (n ),..., f k (n k )). If N i is coset of N i we cn write N i = n... n i N i n i+... n k for some n,..., n i, n i+,..., n k with n j N j for ll j (using the normlity of N,..., N k ) so f(n i) = f (n ) f i (n i ) Z Ni f i+ (n i+ ) f k (n k ) is coset of Z Ni in Z N Z Nk. Therefore every liner combintion of cosets of N,..., N k in G corresponds to liner combintion of fibers in n rry of size N N k nd Theorem 4 follows directly from Theorem. (Hertweck [5 did the equivlent generliztion for Lm nd Leung s result rther thn for Theorem, of which he ws unwre; he lso dpted Lm nd Leung s proof to the nonbelin setting insted of reducing the non-belin cse to the belin one.) The reder will hve noted tht the counterexmple of Fig. 6 uses digonl cosets of size 3 (for lck of better term). It seems hrd to construct counterexmple without using such digonl cosets. In this connection we offer up the following conjecture generlizing Theorem : Conjecture. Let G = Z Z n nd let v (Z + ) G be obtined s n integer liner combintion of incidence vectors of cosets of subgroups H,..., H m of G where ech H i is of the form J i J in for some subgroups J i,..., J in of Z,..., Z n respectively. Then the sum of the entries of v is in Z + ( H,..., H m ).

8 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 8 Conjecture reduces to Theorem if we let m = n nd let H i = 0 Z i 0 for i n. If on the other hnd we set n = then Conjecture simply stipultes tht ny nonnegtive vector obtined s the integer liner combintion of cosets in cyclic group hs entry sum equl to some nonnegtive integer liner combintion of the sizes of the cosets used. It is noteworthy tht Conjecture cn be reduced to the cse where every J ik is either 0 or Z k : Proposition 3. Conjecture reduces to the cse where for ll i m ech J ik 0 or Z k. is either Proof. We cn ssume without loss of generlity tht ech i is prime power, since otherwise Z i cn be expnded s the direct product of cyclic groups of prime power order. It is now sufficient to show tht if = p α is prime power then there is -to- mpping f from Z to (Z p ) α such tht for ny subgroup J of Z nd ny j Z the imge f(j + j) of the coset J + j is direct product coset of (Z p ) α, nmely coset of the form J + j where J = J J α where ech J k is either 0 or Z p nd where j (Z p ) α. A simple mp f with this property is the rdix p mp, defined by setting the i-th coordinte of f(j) equl to the i-th digit of j written bse p. It is then esy to verify tht cosets of Z re mpped to direct product cosets of (Z p ) α under f, which completes the reduction. We finish the introduction with purely number-theoretic proof of (3). This proof is independent of the min result, so cn be sfely skipped if wished. We should still quickly mention, however, tht our min result is ctully stronger thn Theorem, s we hve shown tht Theorem lso holds for cyclotomic rrys with limited number of negtive entries. Theorem 6 in the next section gives the full sttement. Our proof of (3), s well s much else tht we do, relies on the following proposition: Proposition 4. (Buer [, Buer nd Shockley [2) Let 2 n be nturl numbers. Let λ n = gcd(,..., n ) nd let z > n /λ n n be divisible by λ n. Then z Z + (,..., n ). Proof. We do the proof by induction on n, s the conclusion obviously holds for n =. Let n 2 nd let λ n = gcd(,..., n ). Let u 0 be the lest integer such tht z u n 0 mod λ n. Notice u λ n /λ n. We hve z u n > n /λ n n u n n /λ n n (λ n /λ n ) n = n ( λ n )/λ n n ( λ n )/λ n = n /λ n n so tht, by induction, z u n Z + (,..., n ), which implies z Z + (,..., n ).

9 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 9 Theorem 5. (Proof of (3)) Let n be odd nd let,..., n, b,..., b n be integers such tht 0 b i i for i n. Then n b i + i= n ( i b i ) Z + (,..., n ) (5) i= Proof. We do the proof by induction on n with the cse n = being obvious nd the cse n = 3 serving s our induction bsis. Assume therefore tht n = 3. We cn ssume without loss of generlity tht 2 3 nd tht 0 < b i < i since if b i = 0 or b i = i for some i the conclusion is obvious. We cn lso ssume tht b b 2 ( b )( 2 b 2 ) since otherwise we cn effect the chnge of vribles b = b, b 2 = 2 b 2. Put N = b b 2 b 3 + ( b )( 2 b 2 )( 3 b 3 ). Note tht N = b b (( b )( 2 b 2 ) b b 2 )( 3 b 3 ) b b (( b )( 2 b 2 ) b b 2 ). (6) The minimum of the function f(b, B 2 ) = ( B )( 2 B 2 ) B B 2 = 2 B 2 B 2 subject to the constrints B, B 2, B B 2 = b b 2 is ttined t B = b b 2, B 2 = (since 2 ) so f(b, B 2 ) ( b b 2 )( 2 ) b b 2 = ( b b 2 ) 2 for ll B, B 2 such tht B B 2 = b b 2. Since b, b 2 we get in prticulr tht so (6) implies tht ( b )( 2 b 2 ) b b 2 ( b b 2 ) 2 (7) N b b ( b b 2 ) 2. (8) Now put λ 2 = gcd(, 2 ), λ 3 = gcd(, 2, 3 ) (note N 0 mod λ 3, since the b b 2 b 3 cncels out with its negtive in the expnsion of ( b )( 2 b 2 )( 3 b 3 )). Let u 0 be the lest integer such tht N u 3 0 mod λ 2. Then u λ 2 /λ 3 nd lso u b b 2 since N b b 2 3 = (( b )( 2 b 2 ) b b 2 )( 3 b 3 ) 0 mod λ 2. From (8) we hve N u 3 (b b 2 u) 3 + ( b b 2 ) 2 (b b 2 u) 2 + ( b b 2 ) 2 = 2 /λ 2 + ( 2 2 /λ 2 ) u 2 2 /λ 2 + λ 2 ( 2 2 /λ 2 ) (λ 2 /λ 3 ) 2 = 2 /λ (λ 2 λ 2 /λ 3 ) 2 /λ 2 > 2 /λ 2 2 which mens tht N u 3 Z + (, 2 ) by Proposition 4 nd thus tht N Z + (, 2, 3 ). This disptches the cse n = 3.

10 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 0 Assume now tht n 5. Assume first tht l = m for some l m. Put = l = m. By symmetry we cn ssume tht ( b l )( b m ) b l b m (or else effect the chnge of vribles b i = i b i ). This implies tht b l b m 0. But then n b i + i= n n ( i b i ) = b l b m b i + ( b l )( b m ) i= = b l b m ( i= i l,m n i= i l,m b i + n ( i b i ) i= i l,m n ( i b i )) + ( b l b m ) i= i l,m n ( i b i ). Here the term b l b m ( n i= b i + n i= ( i b i )) is in Z + ({ i : i l, m}) by induction on n i l,m i l,m ( i b i ) is nonnegtive multiple of = l = m. nd the second term ( b l b m ) n i= i l,m Therefore n i= b i + n ll i, j, nd by symmetry tht < < n. Put i= i l,m i= ( i b i ) is in Z + (,..., n ). We cn thus ssume tht i j for β = gcd(,..., n ), X = n ( i b i ), Y = i= n b i, i= N = X( n b n ) + Y b n. Note tht X Y 0 mod β s n is odd. Our job is to prove N Z + (,..., n ). We cn ssume without loss of generlity tht X Y. If Y /β + β then we cn write Y = mβ + r for some m, r 0 such tht mβ > /β, nd we will hve N = Y n + (X Y )( n b n ) = r n + {mβ n + [(X Y )( n b n )} where the quntity in brckets {...} is multiple of β strictly greter thn n /β, so is in Z + (,..., n ) by Proposition 4. But then N Z + (,..., n ). So we cn ssume Y < /β + β. Recll X Y 0 mod β. If we ssume tht X Y > n /β n then X Y Z + (,..., n ) nd N = (X Y )( n b n ) + Y n Z + (,..., n ). We cn therefore ssume X Y n /β n. We now hve X = (X Y ) + Y ( n /β n ) + ( /β + β ) = (/β)( β)( n β + ) ( ) n

11 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 b 2 2 b Figure 7: An 2 cyclotomic rry with [A = ( b )( 2 b 2 ) b b 2 nd [A = b b 2. so tht XY ( ) n. On the other hnd XY = n i= b i( i b i ) n i= ( i ), so we get n n ( i ). (9) i=2 But since < < n, n 5, we hve tht ( n 2 )( n ) > n, 2 < n 2, nd so n < ( 2 )( n 2 )( n ) n i=2 ( i ), contrdiction. Results We will strt by showing tht cyclotomic rry whose negtive entries hve smll but nonzero sum in bsolute vlue hs lrge overll entry sum. More precisely, we will show tht if A is n integer-vlued cyclotomic rry with two smllest sidelengths nd 2, 2, nd if [A > 0, then [A ( [A ) 2. (0) Note tht if [A is very smll compred to then (0) gives tht [A 2, which fits somewht well with Proposition 4 (see Corollries nd 2 nd the remrks therefter for the continution of this ide). Also note tht (7) is specil cse of (0), s illustrted by Fig. 7. Inequlity (0) ws first proved under different form by Lm nd Leung (cf. [6 Thm. 4.). Lm nd Leung in fct prove the stronger inequlity {A} + {A} ( {A} ) 2 () where {A} + is the number of positive entries of A nd {A} is the number of negtive entries of A, where () holds provided A is integer-vlued nd {A} > 0. We will not require this stronger version of (0). The proof tht we give here of Inequlity (0) is different from Lm

12 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 2 (x, x 2, x 3 ) (y, y 2, y 3 ) Figure 8: An rry with entries of 0 nd ±; + symbols denote entries of nd symbols denote entries of. Since this rry is orthogonl in R to ll fibers it is lso orthogonl to ll cyclotomic rrys. Therefore if A is cyclotomic rry of size we hve A x,x 2,x 3 A x,x 2,y 3 A x,y 2,x 3 A y,x 2,x 3 + A x,y 2,y 3 + A y,x 2,y 3 + A y,y 2,x 3 A y,y 2,y 3 = 0, i.e. (j,j 2,j 3 ) {0,} ( ) j +j 2 +j 3 A 3 j x +( j )y, j 2 x 2 +( j 2 )y 2, j 3 x 3 +( j 3 )y 3 = 0. nd Leung s proof, with the min dvntge tht it is shorter nd does not require induction on the dimension of the rry. Since the n-dimensionl cse of our proof of (0) is bit opque we will first give proof of the 2-dimensionl cse to illustrte the bsic ide (we will generlly be in the hbit of proving things severl times over in successive degrees of generlity, which we hope the reder will find more instructive thn nnoying). We strt by noting tht if A is n n cyclotomic rry then ( ) (j,...,jn) {0,} n j +...+j n A j x +( j )y,...,j nx n+( j n)y n = 0 (2) for ll pirs of coordintes (x,..., x n ), (y,..., y n ) in Z Z n. To understnd why (2) holds it suffices to look t Fig. 8 illustrting the 3-dimensionl cse. Proposition 5. Let A be n 2 cyclotomic rry such tht 2 nd such tht [A > 0. Then [A ( [A ) 2. Proof. Assume tht counterexmple exists with [A s smll s possible. If [A 2 then we cn dd either -fiber or 2-fiber to A (depending on whether the negtive entries of A re contined in common -fiber or not) such s to decrese [A by t lest nd increse [A by t most 2 while keeping [A > 0, thus obtining counterexmple with smller [A. It is therefore sufficient to consider the cse when [A =. In prticulr, we cn ssume tht A 0,0 = nd tht A i,j 0 for (i, j) (0, 0). Eq. (2) gives us tht A x,x 2 A y,x 2 A x,y 2 + A y,y 2 = 0 for ll (x, x 2 ), (y, y 2 ) Z Z 2. Summing up the reltions A 0,0 A i,0 A 0,j + A i,j = 0

13 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 3 over ll (i, j) Z Z 2 such tht i 0, j 0, we get ( )( 2 )A 0,0 ( ) A 0,j ( 2 ) A i,0 + A i,j = 0. j Z 2 j 0 i Z i 0 (i,j) Z Z 2 i 0,j 0 But A 0,0 = nd A i,0, A 0,j 0 for ll i, j 0, so we get or, since [A =, (i,j) Z Z 2 i 0,j 0 A i,j ( )( 2 ) [A + ( [A ) 2 + [A, which is to sy tht [A ( [A ) 2, contrdiction. At this point, before moving on to prove the equivlent of Proposition 5 for n-dimensionl rrys, we note tht we cn lredy use Proposition 5 to prove Theorem for 3-dimensionl rrys. The proof is quite similr to the proof of the cse n = 3 of Theorem 5, reflecting the prllel between inequlities (7) nd (0). Proposition 6. Theorem is true for 3-dimensionl rrys. Proof. Let 2 3 nd let λ 2 = gcd(, 2 ), λ 3 = gcd(, 2, 3 ). Let A be nonnegtive integer-vlued 2 3 cyclotomic rry. Let A 0,..., A 3 be the 3-lyers of A. Let A be 3-lyer chosen such tht [A = min([a r : r Z 3 ). Put A r = A r A for ll r Z 3. Then A r is cyclotomic rry of size 2 by Proposition nd [A r 0 for ll r. If A r 0 for ll r then [A r Z + (, 2 ) for ll r by Theorem for 2-dimensionl rrys, so tht [A = [A 3 + r Z 3 [A r Z + (, 2, 3 ). We cn therefore ssume there is some s Z 3 such tht [A s > 0. Becuse [A s [A, Proposition 5 gives tht [A s ( [A ) 2. Therefore, since [A r 0 for ll r, r Z 3 [A r [A s ( [A ) 2. As the sum of the entries of ny integer-vlued cyclotomic rry is congruent to 0 modulo the gcd of the sidelengths (becuse ny integer-vlued cyclotomic rry cn be written s n integer liner combintion of fibers, cf. [9) we hve [A 0 mod λ 3 nd [A r 0 mod λ 2 for ll r. Let u 0 be the lest integer such tht [A u 3 0 mod λ 2. Note tht u λ 2 /λ 3 nd tht u [A since [A [A 3 = r Z 3 [A r 0 mod λ 2. We thus get [A u 3 = ([A u) 3 + r Z 3 [A r ([A u) 2 + ( [A ) 2

14 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 4 = 2 u 2 2 (λ 2 /λ 3 ) 2 = 2 /λ 2 + ( 2 2 /λ 2 ) (λ 2 /λ 3 ) 2 2 /λ 2 + λ 2 ( 2 2 /λ 2 ) (λ 2 /λ 3 ) 2 2 /λ 2 > 2 /λ 2 2 so [A u 3 Z + (, 2 ) by Proposition 4, nd [A Z + (, 2, 3 ). We now prove inequlity (0) by generlizing the proof of Proposition 5 to n-dimensionl rrys: Lemm. (cf. [6 Thm. 4.) Let A be n integer-vlued n cyclotomic rry such tht n nd such tht [A > 0. Then [A ( [A ) 2. Proof. Assume tht counterexmple exists with [A s smll s possible. We cn gin ssume (by dding -fibers or 2-fibers to the rry) tht [A = nd tht A 0,...,0 = (mening A i,...,i n 0 for (i,..., i n ) (0,..., 0)). Put F = Z Z n nd let E F be the set of coordintes in Z Z n tht hve ll nonzero entries. Summing up the reltions over ll (i,..., i n ) E, we get (i,...,in) E F E (i,...,in) F {h: i h >0} 2 contrdiction. (i,...,in) E E E ( ) (j,...,jn) {0,} n ( ) (j,...,jn) {0,} n ( ) {h: i h>0} A i,...,i n ( ) {h: i h>0} A i,...,i n (i,...,in) F {h: i h >0} 2 j +...+j n A i j,...,i nj n = 0 j +...+j n A i j,...,i nj n = 0 A i,...,i n h n i h =0 h n i h =0 3 h n ( h ) = 0 ( h ) h n ( h ) h n ( h ) ( h ) [A + ( )( 2 ) [A + ( [A ) 2 + [A [A ( [A ) 2,

15 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 5 The estimte of Lemm is enough to prove Theorem in the specil cse when the two smllest dimensions of the rry re coprime, s shown by the next two corollries lso due to Lm nd Leung. These corollries do not enter into our proof of Theorem but re interesting nonetheless since they suffice, for exmple, to prove Theorem 3 on vnishing sums of roots of unity. (We lso include them to fcilitte comprison between our results nd those of [6, which re written up in different lnguge.) Corollry. (cf. [6 Thm 4.8) Let A be non-fiber miniml n cyclotomic rry where n. Then n 3 nd [A ( 3 ) + ( )( 2 ). Proof. The fct tht n 3 is simply becuse the only miniml - nd 2-dimensionl cyclotomic rrys re fibers. Let A 0,..., A n be the n-lyers of A. If A r = 0 for some r then only one n-lyer of A is nonzero nd this n-lyer is n n cyclotomic rry, so tht the corollry is estblished by induction on the dimension of the rry. We cn therefore ssume tht none of the n-lyers of A re zero. Let A be n n-lyer of A such tht [A = min([a i : i Z n ) (by the previous remrk, [A ). Put A r = A r A for ll r Z n. Thus A r is cyclotomic rry of size n by Proposition. Since A is not n n-fiber there must be some s Z n such tht A s A. We cnnot hve A s A since A is miniml, so [A s > 0. Since [A s [A we then hve [A s ( [A ) 2 by Lemm. Now becuse [A nd n 2, we hve [A = [A r r Z n s desired. ( n )[A + [A s = ( n )[A + [A + [A s n [A + ( [A ) 2 n + ( ) 2 ( 3 ) + ( )( 2 ) Corollry 2. (cf. [6 Thm 5.2) If A is nonnegtive integer-vlued cyclotomic rry of size n where n nd where, 2 re coprime, then [A Z + (,..., n ). Proof. It suffices to consider the cse when the rry A is miniml. If A is fiber then [A = i for some i, nd the result is trivil. Otherwise n 3 nd [A ( 3 ) + ( )( 2 ) > 2 2 by Corollry, which implies [A Z + (, 2 ) by Proposition 4. From Lemm nd Proposition 4 we know tht if A is n integer-vlued 2 cyclotomic rry such tht [A > 0 nd such tht ( [A ) 2 > 2 /λ 2, where λ = gcd(, 2 ), then [A Z + (, 2 ) since [A 0 mod λ. Solving this inequlity for [A, we get: ( [A ) 2 > 2 /λ 2

16 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 6 ( [A ) 2 > 2 /λ 2 [A > /λ [A /λ. Therefore [A Z + (, 2 ) for ny 2 integer-vlued cyclotomic rry A such tht [A /λ, where λ = gcd(, 2 ). This strengthening of the 2-dimensionl cse of Theorem surprisingly extends to ll dimensions. More precisely, we hve the following generliztion of Theorem : Theorem 6. If n nd A is n integer-vlued cyclotomic rry of size n such tht [A /λ where λ = gcd(,..., n ), then [A Z + (,..., n ). Theorem will be estblished s corollry of Theorem 6, whose proof is found further down. Theorem 6 is trivilly true for -dimensionl rrys nd is true for 2-dimensionl rrys by the preceding remrks. We prove the 3-dimensionl cse next. This result is lso covered by our generl proof of Theorem 6, which hndles ll rrys of dimension 3 or more, so the reder cn skip it if they wish. Proposition 7. Theorem 6 is true for n = 3. Proof. Let 2 3 nd let λ 2 = gcd(, 2 ), λ 3 = gcd(, 2, 3 ). Let A be n 2 3 integer-vlued cyclotomic rry such tht [A /λ 3. Let A 0,..., A 3 be the 3-lyers of A. Since [A < 3 there is t lest one 3-lyer of A with no negtive entries. Let A be such nonnegtive 3-lyer, chosen such tht [A = min([a r : A r 0). Put A r = A r A for ll r. We cn ssume [A < since otherwise [A [A r r Z 3 [A r [A r:a r 0 [A {r : A rn 0} [A ( 3 [A ) [A ( 3 ( /λ 3 )) ( /λ 3 ) ( 3 3 ( /λ 3 )) ( /λ 3 ) = 3 /λ 3 ( /λ 3 ) > 3 /λ 3 3 which implies by Proposition 4 tht [A Z + (, 2, 3 ). If A r 0 for ll r then [A r Z + (, 2 ) by Theorem for 2-dimensionl rrys, so tht [A = [A 3 + r Z 3 [A r Z + (, 2, 3 ).

17 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 7 We cn therefore ssume there is some s Z 3 such tht [A s > 0. Using Lemm we get [A r = [A s + [A r r Z 3 r s ( [A s ) 2 + r s [A r >0 [A r ( [A s [A ) 2 + r s [A r >0 2 [A 2 2 [A s + r s [A r >0 2 [A 2 2 [A + r s [A r >0 2 [A 2 2 [A 2 [A 2 2 ( /λ 3 ) = 2 /λ 3 [A 2. (( [A r ) 2 ) (( [A r [A ) 2 ) (( [A ) 2 ) Let u 0 be the lest integer such tht [A u 3 0 mod λ 2. Note tht u λ 2 /λ 3 nd tht u [A since [A [A 3 = r [Ar 0 mod λ 2. We thus get [A u 3 = ([A u) 3 + r [A r ([A u) /λ 3 [A 2 = 2 /λ 3 u 2 2 /λ 3 (λ 2 /λ 3 ) 2 = 2 /λ 2 + ( 2 /λ 3 2 /λ 2 ) (λ 2 /λ 3 ) 2 2 /λ 2 + λ 2 ( 2 /λ 3 2 /λ 2 ) (λ 2 /λ 3 ) 2 = 2 /λ 2 > 2 /λ 2 2 so [A u 3 Z + (, 2 ) by Proposition 4, nd thus [A Z + (, 2, 3 ). The proof of Theorem 6 requires number-theoretic proposition generlizing the bound u λ 2 /λ 3 found in the proofs of Propositions 6 nd 7. To better understnd the sttement, note tht if λ,,..., n re nturl numbers nd λ = gcd(λ,,..., n ) then the quntity λ/λ is equl to the number of different possible vlues tht n integer combintion of the i s cn tke mod λ. Proposition 8. Let λ,,..., n N, U,..., U n Z +. Let λ = gcd(λ,,..., n ). Then there re u,..., u n Z, 0 u i U i for i n, such tht (U u ) + +(U n u n ) n 0 mod λ nd such tht u + + u n λ/λ.

18 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 8 Proof. There obviously exist integers u,..., u n such tht 0 u i U i for ll i nd such tht (U u ) + + (U n u n ) n 0 mod λ, nmely u i = U i for ll i. Now mong ll such choices of tuples (u,..., u n ) we cn ssume tht we hve chosen tuple tht minimizes the sum u + + u n. All tht we hve left to prove is tht u + + u n λ/λ. Let S 0 = U + + U n n. For t u let S t = S 0 t. For t u 2 let S u +t = S u t 2. Continue like this until S u + +u n hs been defined, which is equl to (U u ) + + (U n u n ) n. Note tht for ech 0 g < h u u n we hve S g S h = n i= v i i for some v,..., v n such tht 0 v i u i for ll i. If S g S h mod λ then the tuple u = u v,..., u n = u n v n hs 0 u i U i for ll i, nd (U u ) + +(U n u n ) n 0 mod λ nd u + +u n < u + +u n, contrdiction. Therefore no two S h s hve the sme vlue mod λ. However since ech S h is n integer liner combintion of the i s there re only λ/λ different possible vlues for the S h s mod λ. It follows tht {0,, 2,..., u + + u n } λ/λ, i.e., tht u + + u n λ/λ. We still need to finlize some nottion before proving Theorem 6. If A is cyclotomic rry of size n then A r stnds for the r-th n-lyer of A, A r,t stnds for the t-th (n )-lyer of the r-th n-lyer of A, nd so forth. We sy tht r is the index of the n-lyer A r. If {r Z n : A r 0} then we define A to be nonnegtive n-lyer of A such tht [A = min([a r : A r 0, r Z n ). If severl choices re vilble for A then we cn choose the n-lyer with lest index (this convention simply llows A to be uniquely defined, nd is not otherwise importnt). If {r Z n : A r 0} = then A is undefined. Note tht A is lwys well-defined if [A < n, for then t lest one n-lyer of A is nonnegtive. If A is well-defined then we let A r = A r A for ll r Z n. Thus A r is cyclotomic rry of size n by Proposition. To prctice this nottion little more, note for exmple tht A r,s = A r,s A r, = A r,s A,s A r, provided A nd A r, re well-defined (the prerequisite for A r,s to be well-defined). On the other hnd A r, is generlly not equl to A r, A,, since the quntity represented by the rightmost vries ccording to the superscript preceding it. We will mostly be deling with rrys of the form A rn,r n,...,r k+,,r k,...,r i. It is worth emphsizing tht ny rry of this type is nonnegtive (s A r n,r n,...,r k+, is nonnegtive rry). We cn now prove Theorem 6 nd thus estblish the pper s min result. Proof of Theorem 6: Let A be n integer-vlued cyclotomic rry of size n such tht n nd [A /λ n, where λ n = gcd(,..., n ). We need to show [A Z + (,..., n ). We cn ssume tht n 3. We define sttements X i, Y i nd Z i for 3 i n by X i = A r n,r n,...,r i+, is well-defined for ll (r n, r n,..., r i+ ) Z n Z i+

19 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 9 Y i = X i nd [A rn,r n,...,r i+, < for ll (r n, r n,..., r i+ ) Z n Z i+ Z i = X i nd n [Arn,...,r k+,,r k,...,r i < for ll (r n,..., r i ) Z n Z i (The vrible r k will lwys denote n index tking vlues in the set Z k, for k n. In prticulr we will use r k s shorthnd for r k Z k.) Note tht A rn,...,r k+,,r k,...,r i is well-defined whenever A rn,r n,...,r i+, is well-defined, so the sttement Z i mkes sense. The reder my check the following esy implictions: X i = A r n,r n,...,r i+,r i is well-defined for ll (r n, r n,..., r i ) Z n Z i X i Z i = X i+ for 3 i < n = (X i Y i ) for 3 i n The Theorem will follow from proving the following clims C C5: C : X n nd ((Y n Z n ) [A Z + (,..., n )) re true sttements C2 : Z i = (X i [A Z + (,..., n )) for i > 3 C3 : (Z i X i ) = (Y i [A Z + (,..., n )) for i > 3 C4 : (Z i Y i ) = (Z i [A Z + (,..., n )) for i > 3 C5 : Z 3 = [A Z + (,..., n ) Note tht clims C2 C4 imply Z i = (Z i [A Z + (,..., n )). Before proving clims C C5 we wish to mke one observtion nd prove two mini-lemms. Observtion: If 3 i n nd X i holds (i.e. if A rn,r n,...,r i is well-defined for ll (r n, r n,..., r i ) Z n Z i ) then we hve [A = [A n + r n [A rn = [A n + ( [A rn, n + ) r n r n [A r n,r n ( = [A n + [A rn, ) n + [A rn,rn r n r n,r n =... ( ) ( ) = [A n + [A rn, n + [A rn,rn, n r n r n,r n ( + [A rn,...,ri+, ) i + [A rn,...,ri, r n,...,r i+ r n,...,r i

20 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 20 which we cn rewrite more succinctly s [A = U n n + U n n + + U i i + r n,...,r i [A rn,...,ri (3) where U n = [A nd U k = r n,...,r k+ [A rn,...,rk+, for i k n. We will keep this definition of the U k s for the rest of the proof (thus U k is well-defined if nd only if X k is true). Note the U k s re nonnegtive integers becuse rrys of the type A rn,r n,...,r k+, re nonnegtive. Mini-Lemm : If A rn,...,r i is well-defined then [A rn,...,r i [A rn,...,r i + n [Arn,...,r k+,,r k,...,r i. Proof: This follows simply becuse so s climed. A r n,...,r i = A r n,...,r i+,r i A r n,...,r i+, = A rn,...,r i+2,r i+,r i A rn,...,r i+2,,r i A rn,...,r i+, =... = A rn,...,r i A r n,...,r k+,,r k,...,r i [A r n,...,r i [A rn,...,r i + [A r n,...,r k+,,r k,...,r i Mini-Lemm 2: If 3 i n nd Z i is true then [A rn,...,r i 2 [A rn,...,r i for ny subset R of Z n Z i. (r n,...,r i ) R (r n,...,r i ) R Proof: Z i implies n [Ar n,...,r k+,,r k,...,r i <, so by Mini-Lemm we hve [A rn,...,r i [A rn,...,r i + [A rn,...,r k+,,r k,...,r i [A rn,...,r i + for ll (r n,..., r i ) Z n Z i. Now since A rn,...,r i is cyclotomic rry of dimension i nd i 2 we cn pply Lemm to get: [A r n,...,r i [A r n,...,r i (r n,...,r i ) R (rn,...,r i ) R: [A rn,...,r i >0

21 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 2 s climed. (rn,...,r i ) R: [A rn,...,r i >0 (rn,...,r i ) R: [A rn,...,r i >0 2 2 (( [A rn,...,r i ) 2 ) (( [A rn,...,r i + ) 2 ) r [A n,...,r i (rn,...,r i ) R: [A r n,...,r i >0 (r n,...,r i ) R [A rn,...,r i We now prove clims C-C5, from which the Theorem follows. Proof of clim C: The sttement X n is A is well-defined. However [A /λ n < n so the sttement X n is true. Becuse X n is true the sttements Y n nd Z n re both equivlent to [A <. It is thus sufficient to show ([A ) = [A Z + (,..., n ) in order to show ((Y n Z n ) [A Z + (,..., n )). Thus, ssume tht [A. Then [A = r n [A rn r n:a rn 0 [A rn [A [A {r n : A rn 0} [A ( n [A ) [A ( n ( /λ n )) ( /λ n ) ( n n ( /λ n )) ( /λ n ) = n /λ n ( /λ n ) > n /λ n n which implies by Proposition 4 (since [A 0 mod λ n ) tht [A Z + (,..., n ), s desired. This completes the proof of clim C. Proof of clim C2: We will prove (Z i X i ) = [A Z + (,..., n ). Note tht Z i = X i so A r n,r n,...,r i is well-defined for ll (r n,..., r i ) Z n Z i. Since A rn,r n,...,r i, is well-defined if [A rn,...,r i < i (s A rn,...,r i is n rry of size i ), X i implies there exists some (s n,..., s i ) Z n Z i such tht [A s n,...,s i i.

22 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 22 Since i 2, Mini-Lemm 2 implies [A r n,...,r i i nd by Mini-Lemm, (rn,...,r i ) (sn,...,s i ) (rn,...,r i ) (sn,...,s i ) [A rn,...,r i (4) [A s n,...,s i [A s n,...,s i [A sn,...,s i [A sn,...,s i [A s n,...,s k+,,s k,...,s i U k. (5) Let λ i = gcd(,..., i ) for i n (λ n ws lredy defined like this). Then r n,...,r i [A rn,...,r i 0 mod λ i since ech A rn,...,r i is n i cyclotomic rry. It follows from (3) nd Proposition 8 tht there exist nonnegtive integers u i,..., u n with u k U k nd u i + + u n λ i /λ n such tht [A u n n u i i 0 mod λ i. Since [A s n,...,s i i we hve by Mini-Lemm tht so [A sn,...,s i + U k Therefore, using (3), (4) nd (5), = = [A u k k [A s n,...,s k+,,s k,...,s i [A sn,...,s k+,,s k,...,s i (U k u k ) k + [A s n,...,s i + (U k u k ) i [A sn,...,s i ( [A sn,...,s i. (rn,...,r i ) (sn,...,s i ) [A r n,...,r i U k i U k ) ( i ) [A sn,...,s i i (rn,...,r i ) (sn,...,s i ) (rn,...,r i ) (sn,...,s i ) ( [A sn,...,s i )( i ) [A sn,...,s i i [A rn,...,r i [A rn,...,r i (rn,...,r i ) (sn,...,s i ) u k i [A rn,...,r i u k i

23 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 23 = ( i ) i [A u k i ( i ) i ( /λ n ) (λ i /λ n ) i (6) = i /λ i + ( i /λ n i /λ i ) (λ i /λ n ) i (7) i /λ i + λ i ( i /λ n i /λ i ) (λ i /λ n ) i (8) = i /λ i (9) > i /λ i i (20) which mens [A n u k k Z + (,..., i ) by Proposition 4 nd so [A Z + (,..., n ), s desired. This concludes the proof of clim C2. Proof of clim C3: We will prove tht (Z i X i Y i ) = [A Z + (,..., n ). Since Y i = X i nd [A rn,...,r i, < for ll (r n,..., r i ) Z n Z i, (X i Y i ) implies there exists (s n,..., s i ) Z n Z i such tht [A s n,...,s i,. By the proof of clim C2 we cn ssume tht [A rn,...,r i < i for ll (r n,..., r i ) Z n Z i. If i = then = 2 =... = i so [A rn,...,r i 0 mod i for ll (r n,..., r i ) Z n Z i. But since [A rn,...,r i [A rn,...,r i > i we then hve [A rn,...,r i Z + ( i ) so [A Z + (,..., n ) by (3). We cn therefore ssume i >. Mini-Lemm 2 implies tht [A r n,...,r i i (rn,...,r i ) (sn,...,s i ) On the other hnd, since i > we now hve [A sn,...,s i = r i [A sn,...,s i,r i r i :A sn,...,s i,r i 0 Combining (2) nd (22) we obtin (rn,...,r i ) (sn,...,s i ) [A sn,...,s i,r i [A sn,...,s i [A sn,...,s i, {r i : A sn,...,s i,r i 0} [A sn,...,s i ( i [A sn,...,s i ) [A sn,...,s i i i [A sn,...,s i i i ([A sn,...,s i + [A rn,...,r i. (2) ) [A sn,...,s k+,,s k,...,s i. (22) r n,...,r i [A rn,...,ri i i [A i [A sn,...,s k+,,s k,...,s i. (23)

24 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 24 Tke u i,..., u n s in the proof of clim C2. By (23) nd becuse U k = r n,...,r k+ [A rn,...,r k+, [A sn,...,s k+,,s k,...,s i we get = = [A u k k (U k u k ) k + [A rn,...,ri r n,...,r i (U k u k ) i + i i [A i [A sn,...,s k+,,s k,...,s i (U k [A sn,...,s k+,,s k,...,s i ) i u k i + i i [A (λ i /λ n ) i + i i ( /λ n ) = i /λ i + ( i /λ n i /λ i ) (λ i /λ n ) i i /λ i + λ i ( i /λ n i /λ i ) (λ i /λ n ) i = i /λ i > i /λ i i so [A n u k k Z + (,..., i ) by Proposition 4 nd [A Z + (,..., n ), s desired. This concludes the proof of clim C3. Proof of clim C4: We prove (Z i Y i Z i ) = [A Z + (,..., n ). If Z i then there exists some (s n,..., s i ) Z Z i such tht n [As n,...,s k+,,s k,...,s i. Let A = {r i : n [Asn,...,s k+,,s k,...,s i,r i } (we know A since s i A). We hve [A sn,...,s i,r i r i / A r i / A: [A sn,...,s i,r i >0 r i / A: [A s n,...,s i,r i >0 r i / A: [A sn,...,s i,r i >0 2 r i / A: [A sn,...,s i,r i >0 [A sn,...,s i,r i (( [A sn,...,s i,r i ) 2 ) ( ( [A sn,...,s i,r i [A sn,...,s i,r i ) [A sn,...,s k+,,s k,...,s i,r i ) 2

25 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A [A sn,...,s i,r i r i / A nd r i A r i A r i A [A s n,...,s i,r i [A sn,...,s i,r i ( [A sn,...,s i,r i ) [A sn,...,s k+,,s k,...,s i,r i [A s n,...,s k+,,s k,...,s i [A s n,...,s i, A [A sn,...,s i,r i. r i A Therefore [A sn,...,si,ri r i [A sn,...,s k+,,s k,...,s i [A sn,...,si, A 2 [A sn,...,s i so we get [A s n,...,s i = [A s n,...,s i, i + r i [A s n,...,s i,r i [A s n,...,s i, i 2 [A sn,...,s i [A s n,...,s k+,,s k,...,s i [A s n,...,s i, A (24) On the other hnd, since we re ssuming Z i nd since i 2, Mini-Lemm 2 implies tht [A rn,...,r i i [A rn,...,r i. (25) (rn,...,r i ) (sn,...,s i ) Combining (24) nd (25) gives us r n,...,r i [A rn,...,ri [A sn,...,si, i (rn,...,r i ) (sn,...,s i ) [A s n,...,s k+,,s k,...,s i [A sn,...,s i, A i [A. Since we know [A sn,...,si, < (from Y i ) we know tht r i A = [A sn,...,s k+,,s k,...,s i,r i,

26 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 26 therefore r i s i [A sn,...,s k+,,s k,...,s i,r i A nd [A s n,...,s k+, [A s n,...,s i, + [A s n,...,s k+,,s k,...,s i = [A sn,...,si, + [A sn,...,s k+,,s k,...,s i,r i r i + [A sn,...,s k+,,s k,...,s i,r i r i s i + A. Becuse U k = r n,...,r k+ [A r n,...,r k+, [A s n,...,s k+, we then obtin U k + [A sn,...,si, + A. Let u i,..., u n be defined s in the proofs of clims C2 nd C3. We now hve tht = [A u k k (U k u k ) k + [A rn,...,ri r n,...,r i (U k u k ) i + [A sn,...,si, i [A sn,...,s k+,,s k,...,s i [A s n,...,s i, A i [A U k ( i ) + [A sn,...,si, ( i ) [A sn,...,si, ( A ) i [A u k i ( + A )( i ) [A sn,...,si, ( A ) i [A ( i ) i [A u k i ( i ) i ( /λ n ) (λ i /λ n ) i u k i

27 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 27 > i /λ i i (where the lst inequlity is obtined s in (6)-(20)), so [A n u k k Z + (,..., i ) nd [A Z + (,..., n ), s desired. This concludes the proof of clim C4. Proof of clim C5: Assume Z 3. Then A rn,...,r 3 is well-defined for ll (r n,..., r 3 ) Z n Z 3 nd n k=3 [Ar n,...,r k+,,r k,...,r 3 < for ll (r n,..., r 3 ) Z n Z 3. Note tht A rn,...,r 3 is cyclotomic rry of size 2. If A rn,...,r 3 0 for ll (r n,..., r 3 ) Z n Z 3 then [A r n,...,r 3 Z + (, 2 ) by Proposition 2 so [A Z + (,..., n ) by (3). Therefore we cn ssume there is some (s n,..., s 3 ) Z n Z 3 such tht [A sn,...,s 3 > 0. We hve tht (rn,...,r 3 ) (sn,...,s 3 ) [A rn,...,r 3 2 (rn,...,r 3 ) (sn,...,s 3 ) [A rn,...,r 3 nd tht So [A sn,...,s 3 ( [A sn,...,s 3 ) 2 ( ) [A sn,...,s 3 [A sn,...,s k+,,s k,...,s 3 2 k=3 = 2 2 [A sn,...,s k+,,s k,...,s 3 2 [A sn,...,s 3. k=3 r n,...,r 3 [A rn,...,r3 2 2 [A s n,...,s k+,,s k,...,s 3 2 [A. (26) k=3 Becuse X 3 is true, [A = U n n + + U r n,...,r 3 [A rn,...,r3 where r n,...,r 3 [A rn,...,r 3 0 mod λ 2. By Proposition 8 there exist integers u 3,..., u n such tht (i) 0 u k U k for ll 3 k n, (ii) u 3 + +u n λ 2 /λ n, nd (iii) [A n k=3 u k k 0 mod λ 2. Using (26) we get = [A u k k k=3 (U k u k ) k + [A rn,...,r3 r n,...,r 3 (U k u k ) [A sn,...,s k+,,s k,...,s 3 2 [A k=3 k=3 k=3

28 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 28 = (U k [A s n,...,s k+,,s k,...,s 3 ) [A 2 k=3 2 2 [A 2 k=3 2 2 ( /λ n ) 2 (λ 2 /λ n ) = 2 /λ 2 + ( 2 /λ n 2 /λ 2 ) 2 (λ 2 /λ n ) 2 /λ 2 + λ 2 ( 2 /λ n 2 /λ 2 ) 2 (λ 2 /λ n ) = 2 /λ 2 > 2 /λ 2 2 u k which shows [A n k=3 u k k Z + (, 2 ) nd thus [A Z + (,..., n ), s desired. This concludes the proof of clim C5 nd the proof of Theorem 6. k=3 u k References [ A. Bruer, On problem of prtitions, Amer. J. Mth. 64 (942), [2 A. Bruer nd J. E. Shockley, On problem of Frobenius, J. Reine Angew. Mth. 2 (962), [3 J.H. Conwy nd A.J. Jones, Trigonometric diophntine equtions (On vnishing sums of roots of unity), Act Arithmetic, 30 (976), [4 P. Erdős nd R. L. Grhm, On liner Diophntine problem of Frobenius, Act Arith., 2 (972), [5 M. Hertweck, Contributions to the integrl representtion theory of groups, Hbilittionsschrift, University of Stuttgrt (2004). [6 T.Y. Lm nd K.H. Leung, On vnishing sums of roots of unity, J. Algebr, 224 no. (2000), [7 H. B. Mnn, On liner reltions between roots of unity, Mthemtik, 2 Prt 2 no. 24 (965), [8 B. Poonen nd M. Rubinstein, The number of intersection points mde by the digonls of regulr polygon, SIAM J. on Disc. Mth., no. (998), [9 J.P. Steinberger, Miniml vnishing sums of roots of unity with lrge coefficients, preprint. [0 J.P. Steinberger, Indecomposble tilings of the integers with exponentilly long periods, Electronic Journl of Combintorics, 2 (2005).

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004 Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when

More information

Theoretical foundations of Gaussian quadrature

Theoretical foundations of Gaussian quadrature Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

UniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that

UniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that Problemen/UWC NAW 5/7 nr juni 006 47 Problemen/UWC UniversitireWiskundeCompetitie Edition 005/4 For Session 005/4 we received submissions from Peter Vndendriessche, Vldislv Frnk, Arne Smeets, Jn vn de

More information

Frobenius numbers of generalized Fibonacci semigroups

Frobenius numbers of generalized Fibonacci semigroups Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:

More information

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ

More information

MAA 4212 Improper Integrals

MAA 4212 Improper Integrals Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which

More information

13.3 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS

13.3 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS 33 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS As simple ppliction of the results we hve obtined on lgebric extensions, nd in prticulr on the multiplictivity of extension degrees, we cn nswer (in

More information

Lecture 1. Functional series. Pointwise and uniform convergence.

Lecture 1. Functional series. Pointwise and uniform convergence. 1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is

More information

Physics 116C Solution of inhomogeneous ordinary differential equations using Green s functions

Physics 116C Solution of inhomogeneous ordinary differential equations using Green s functions Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner

More information

The First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).

The First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a). The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples

More information

Quadratic Forms. Quadratic Forms

Quadratic Forms. Quadratic Forms Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte

More information

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below. Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we

More information

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),

More information

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz

More information

Lecture 3: Equivalence Relations

Lecture 3: Equivalence Relations Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts

More information

Improper Integrals, and Differential Equations

Improper Integrals, and Differential Equations Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted

More information

Euler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), )

Euler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), ) Euler, Iochimescu nd the trpezium rule G.J.O. Jmeson (Mth. Gzette 96 (0), 36 4) The following results were estblished in recent Gzette rticle [, Theorems, 3, 4]. Given > 0 nd 0 < s

More information

Math 1B, lecture 4: Error bounds for numerical methods

Math 1B, lecture 4: Error bounds for numerical methods Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the

More information

Lecture 3. Limits of Functions and Continuity

Lecture 3. Limits of Functions and Continuity Lecture 3 Limits of Functions nd Continuity Audrey Terrs April 26, 21 1 Limits of Functions Notes I m skipping the lst section of Chpter 6 of Lng; the section bout open nd closed sets We cn probbly live

More information

and that at t = 0 the object is at position 5. Find the position of the object at t = 2.

and that at t = 0 the object is at position 5. Find the position of the object at t = 2. 7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we

More information

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS. THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4

More information

Integral points on the rational curve

Integral points on the rational curve Integrl points on the rtionl curve y x bx c x ;, b, c integers. Konstntine Zeltor Mthemtics University of Wisconsin - Mrinette 750 W. Byshore Street Mrinette, WI 5443-453 Also: Konstntine Zeltor P.O. Box

More information

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.

More information

Convex Sets and Functions

Convex Sets and Functions B Convex Sets nd Functions Definition B1 Let L, +, ) be rel liner spce nd let C be subset of L The set C is convex if, for ll x,y C nd ll [, 1], we hve 1 )x+y C In other words, every point on the line

More information

UNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3

UNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,

More information

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

SUMMER KNOWHOW STUDY AND LEARNING CENTRE SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18

More information

Exam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1

Exam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1 Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution

More information

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b

More information

Review of Calculus, cont d

Review of Calculus, cont d Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some

More information

Abstract inner product spaces

Abstract inner product spaces WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the

More information

Review of basic calculus

Review of basic calculus Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below

More information

SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 2014

SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 2014 SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 014 Mrk Scheme: Ech prt of Question 1 is worth four mrks which re wrded solely for the correct nswer.

More information

Is there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them!

Is there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them! PUSHING PYTHAGORAS 009 Jmes Tnton A triple of integers ( bc,, ) is clled Pythgoren triple if exmple, some clssic triples re ( 3,4,5 ), ( 5,1,13 ), ( ) fond of ( 0,1,9 ) nd ( 119,10,169 ). + b = c. For

More information

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.

More information

20 MATHEMATICS POLYNOMIALS

20 MATHEMATICS POLYNOMIALS 0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of

More information

Math 61CM - Solutions to homework 9

Math 61CM - Solutions to homework 9 Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ

More information

Math 4310 Solutions to homework 1 Due 9/1/16

Math 4310 Solutions to homework 1 Due 9/1/16 Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1

More information

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

8 Laplace s Method and Local Limit Theorems

8 Laplace s Method and Local Limit Theorems 8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved

More information

Handout: Natural deduction for first order logic

Handout: Natural deduction for first order logic MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes

More information

Self-similarity and symmetries of Pascal s triangles and simplices mod p

Self-similarity and symmetries of Pascal s triangles and simplices mod p Sn Jose Stte University SJSU ScholrWorks Fculty Publictions Mthemtics nd Sttistics Februry 2004 Self-similrity nd symmetries of Pscl s tringles nd simplices mod p Richrd P. Kubelk Sn Jose Stte University,

More information

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system. Section 24 Nonsingulr Liner Systems Here we study squre liner systems nd properties of their coefficient mtrices s they relte to the solution set of the liner system Let A be n n Then we know from previous

More information

Main topics for the First Midterm

Main topics for the First Midterm Min topics for the First Midterm The Midterm will cover Section 1.8, Chpters 2-3, Sections 4.1-4.8, nd Sections 5.1-5.3 (essentilly ll of the mteril covered in clss). Be sure to know the results of the

More information

Math Advanced Calculus II

Math Advanced Calculus II Mth 452 - Advnced Clculus II Line Integrls nd Green s Theorem The min gol of this chpter is to prove Stoke s theorem, which is the multivrible version of the fundmentl theorem of clculus. We will be focused

More information

MORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)

MORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.) MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give

More information

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar) Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of

More information

Recitation 3: More Applications of the Derivative

Recitation 3: More Applications of the Derivative Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties

More information

1 Sets Functions and Relations Mathematical Induction Equivalence of Sets and Countability The Real Numbers...

1 Sets Functions and Relations Mathematical Induction Equivalence of Sets and Countability The Real Numbers... Contents 1 Sets 1 1.1 Functions nd Reltions....................... 3 1.2 Mthemticl Induction....................... 5 1.3 Equivlence of Sets nd Countbility................ 6 1.4 The Rel Numbers..........................

More information

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007 A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus

More information

1.9 C 2 inner variations

1.9 C 2 inner variations 46 CHAPTER 1. INDIRECT METHODS 1.9 C 2 inner vritions So fr, we hve restricted ttention to liner vritions. These re vritions of the form vx; ǫ = ux + ǫφx where φ is in some liner perturbtion clss P, for

More information

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite

More information

1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ),

1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ), 1. Guss-Jcobi qudrture nd Legendre polynomils Simpson s rule for evluting n integrl f(t)dt gives the correct nswer with error of bout O(n 4 ) (with constnt tht depends on f, in prticulr, it depends on

More information

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct

More information

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by. NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with

More information

Line and Surface Integrals: An Intuitive Understanding

Line and Surface Integrals: An Intuitive Understanding Line nd Surfce Integrls: An Intuitive Understnding Joseph Breen Introduction Multivrible clculus is ll bout bstrcting the ides of differentition nd integrtion from the fmilir single vrible cse to tht of

More information

Math 360: A primitive integral and elementary functions

Math 360: A primitive integral and elementary functions Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:

More information

4.4 Areas, Integrals and Antiderivatives

4.4 Areas, Integrals and Antiderivatives . res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order

More information

ON THE EXCEPTIONAL SET IN THE PROBLEM OF DIOPHANTUS AND DAVENPORT

ON THE EXCEPTIONAL SET IN THE PROBLEM OF DIOPHANTUS AND DAVENPORT ON THE EXCEPTIONAL SET IN THE PROBLEM OF DIOPHANTUS AND DAVENPORT Andrej Dujell Deprtment of Mthemtics, University of Zgreb, 10000 Zgreb, CROATIA The Greek mthemticin Diophntus of Alexndri noted tht the

More information

Before we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!!

Before we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!! Nme: Algebr II Honors Pre-Chpter Homework Before we cn begin Ch on Rdicls, we need to be fmilir with perfect squres, cubes, etc Try nd do s mny s you cn without clcultor!!! n The nth root of n n Be ble

More information

arxiv: v1 [math.ra] 1 Nov 2014

arxiv: v1 [math.ra] 1 Nov 2014 CLASSIFICATION OF COMPLEX CYCLIC LEIBNIZ ALGEBRAS DANIEL SCOFIELD AND S MCKAY SULLIVAN rxiv:14110170v1 [mthra] 1 Nov 2014 Abstrct Since Leibniz lgebrs were introduced by Lody s generliztion of Lie lgebrs,

More information

A recursive construction of efficiently decodable list-disjunct matrices

A recursive construction of efficiently decodable list-disjunct matrices CSE 709: Compressed Sensing nd Group Testing. Prt I Lecturers: Hung Q. Ngo nd Atri Rudr SUNY t Bufflo, Fll 2011 Lst updte: October 13, 2011 A recursive construction of efficiently decodble list-disjunct

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn

More information

7.2 The Definite Integral

7.2 The Definite Integral 7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where

More information

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph

More information

Section 14.3 Arc Length and Curvature

Section 14.3 Arc Length and Curvature Section 4.3 Arc Length nd Curvture Clculus on Curves in Spce In this section, we ly the foundtions for describing the movement of n object in spce.. Vector Function Bsics In Clc, formul for rc length in

More information

Chapter 3. Vector Spaces

Chapter 3. Vector Spaces 3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce

More information

Calculus. Rigor, Concision, Clarity. Jishan Hu, Jian-Shu Li, Wei-Ping Li, Min Yan

Calculus. Rigor, Concision, Clarity. Jishan Hu, Jian-Shu Li, Wei-Ping Li, Min Yan Clculus Rigor, Concision, Clrity Jishn Hu, Jin-Shu Li, Wei-Ping Li, Min Yn Deprtment of Mthemtics The Hong Kong University of Science nd Technology ii Contents Rel Numbers nd Functions Rel Number System

More information

Infinite Geometric Series

Infinite Geometric Series Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to

More information

DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS

DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS DISCRETE MATHEMATICS 21228 HOMEWORK 3 SOLUTIONS JC Due in clss Wednesdy September 17. You my collborte but must write up your solutions by yourself. Lte homework will not be ccepted. Homework must either

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, Lecture 15: Equations for Deterministic Automata Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined

More information

Taylor Polynomial Inequalities

Taylor Polynomial Inequalities Tylor Polynomil Inequlities Ben Glin September 17, 24 Abstrct There re instnces where we my wish to pproximte the vlue of complicted function round given point by constructing simpler function such s polynomil

More information

The Henstock-Kurzweil integral

The Henstock-Kurzweil integral fculteit Wiskunde en Ntuurwetenschppen The Henstock-Kurzweil integrl Bchelorthesis Mthemtics June 2014 Student: E. vn Dijk First supervisor: Dr. A.E. Sterk Second supervisor: Prof. dr. A. vn der Schft

More information

Introduction to Group Theory

Introduction to Group Theory Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements

More information

Linear Algebra 1A - solutions of ex.4

Linear Algebra 1A - solutions of ex.4 Liner Algebr A - solutions of ex.4 For ech of the following, nd the inverse mtrix (mtritz hofkhit if it exists - ( 6 6 A, B (, C 3, D, 4 4 ( E i, F (inverse over C for F. i Also, pick n invertible mtrix

More information

II. Integration and Cauchy s Theorem

II. Integration and Cauchy s Theorem MTH6111 Complex Anlysis 2009-10 Lecture Notes c Shun Bullett QMUL 2009 II. Integrtion nd Cuchy s Theorem 1. Pths nd integrtion Wrning Different uthors hve different definitions for terms like pth nd curve.

More information

Lecture 3: Curves in Calculus. Table of contents

Lecture 3: Curves in Calculus. Table of contents Mth 348 Fll 7 Lecture 3: Curves in Clculus Disclimer. As we hve textook, this lecture note is for guidnce nd supplement only. It should not e relied on when prepring for exms. In this lecture we set up

More information

STUDY GUIDE FOR BASIC EXAM

STUDY GUIDE FOR BASIC EXAM STUDY GUIDE FOR BASIC EXAM BRYON ARAGAM This is prtil list of theorems tht frequently show up on the bsic exm. In mny cses, you my be sked to directly prove one of these theorems or these vrints. There

More information

Zero-Sum Magic Graphs and Their Null Sets

Zero-Sum Magic Graphs and Their Null Sets Zero-Sum Mgic Grphs nd Their Null Sets Ebrhim Slehi Deprtment of Mthemticl Sciences University of Nevd Ls Vegs Ls Vegs, NV 89154-4020. ebrhim.slehi@unlv.edu Abstrct For ny h N, grph G = (V, E) is sid to

More information

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors: Vectors 1-23-2018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2-dimensionl vectors: (2, 3), ( )

More information

ODE: Existence and Uniqueness of a Solution

ODE: Existence and Uniqueness of a Solution Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =

More information

Let S be a numerical semigroup generated by a generalized arithmetic sequence,

Let S be a numerical semigroup generated by a generalized arithmetic sequence, Abstrct We give closed form for the ctenry degree of ny element in numericl monoid generted by generlized rithmetic sequence in embedding dimension three. While it is known in generl tht the lrgest nd

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

Lecture 19: Continuous Least Squares Approximation

Lecture 19: Continuous Least Squares Approximation Lecture 19: Continuous Lest Squres Approximtion 33 Continuous lest squres pproximtion We begn 31 with the problem of pproximting some f C[, b] with polynomil p P n t the discrete points x, x 1,, x m for

More information

ECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance

ECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance Generl structure ECO 37 Economics of Uncertinty Fll Term 007 Notes for lectures 4. Stochstic Dominnce Here we suppose tht the consequences re welth mounts denoted by W, which cn tke on ny vlue between

More information

Fourier series. Preliminary material on inner products. Suppose V is vector space over C and (, )

Fourier series. Preliminary material on inner products. Suppose V is vector space over C and (, ) Fourier series. Preliminry mteril on inner products. Suppose V is vector spce over C nd (, ) is Hermitin inner product on V. This mens, by definition, tht (, ) : V V C nd tht the following four conditions

More information

SOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL (1 + µ(f n )) f(x) =. But we don t need the exact bound.) Set

SOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL (1 + µ(f n )) f(x) =. But we don t need the exact bound.) Set SOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL 28 Nottion: N {, 2, 3,...}. (Tht is, N.. Let (X, M be mesurble spce with σ-finite positive mesure µ. Prove tht there is finite positive mesure ν on (X, M such

More information

p(t) dt + i 1 re it ireit dt =

p(t) dt + i 1 re it ireit dt = Note: This mteril is contined in Kreyszig, Chpter 13. Complex integrtion We will define integrls of complex functions long curves in C. (This is bit similr to [relvlued] line integrls P dx + Q dy in R2.)

More information

Recitation 3: Applications of the Derivative. 1 Higher-Order Derivatives and their Applications

Recitation 3: Applications of the Derivative. 1 Higher-Order Derivatives and their Applications Mth 1c TA: Pdric Brtlett Recittion 3: Applictions of the Derivtive Week 3 Cltech 013 1 Higher-Order Derivtives nd their Applictions Another thing we could wnt to do with the derivtive, motivted by wht

More information

A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE. In the study of Fourier series, several questions arise naturally, such as: c n e int

A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE. In the study of Fourier series, several questions arise naturally, such as: c n e int A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE HANS RINGSTRÖM. Questions nd exmples In the study of Fourier series, severl questions rise nturlly, such s: () (2) re there conditions on c n, n Z, which ensure

More information

Convergence of Fourier Series and Fejer s Theorem. Lee Ricketson

Convergence of Fourier Series and Fejer s Theorem. Lee Ricketson Convergence of Fourier Series nd Fejer s Theorem Lee Ricketson My, 006 Abstrct This pper will ddress the Fourier Series of functions with rbitrry period. We will derive forms of the Dirichlet nd Fejer

More information

Counting intersections of spirals on a torus

Counting intersections of spirals on a torus Counting intersections of spirls on torus 1 The problem Consider unit squre with opposite sides identified. For emple, if we leve the centre of the squre trveling long line of slope 2 (s shown in the first

More information

Best Approximation in the 2-norm

Best Approximation in the 2-norm Jim Lmbers MAT 77 Fll Semester 1-11 Lecture 1 Notes These notes correspond to Sections 9. nd 9.3 in the text. Best Approximtion in the -norm Suppose tht we wish to obtin function f n (x) tht is liner combintion

More information