On some developments of the Erdős Ginzburg Ziv Theorem II
|
|
- Reynard Wood
- 6 years ago
- Views:
Transcription
1 ACTA ARITHMETICA 1102 (2003) On some developments of the Erdős Gnzburg Zv Theorem II by Are Balostock (Moscow, ID), Paul Derker (Moscow, ID), Davd Grynkewcz (Pasadena, CA) and Mark Lotspech (Caldwell, ID) 1 Introducton Let S be a sequence of elements from the cyclc group Z m We say S s zsf (zero-sum free) f there does not exst an m-term subsequence of S whose sum s zero Let g(m, k) (resp g (m, k)) denote the least nteger such that every sequence S wth at least (resp wth exactly) k dstnct elements and length g(m, k) (resp g (m, k)) must contan an m-term subsequence whose sum s zero By an affne transformaton n Z m we mean a map of the form x ax + b, wth a, b Z m and gcd(a, m) = 1 Furthermore, let E(m, s) denote the set of all equvalence classes of zsf sequences S of length s, up to order and affne transformaton, that are not a proper subsequence of another zsf sequence Usng the above notaton, the renowned Erdős Gnzburg Zv Theorem ([1], [11]) states that g(m, 1) = g(m, 2) = 2m 1 for m 2 The functon g(m, k) was ntroduced n [4], where t was shown that g(m, 4) = 2m 3 for m 4 Furthermore, based on a lower bound constructon the authors conectured the value of g(m, k) for fxed k and suffcently large m Concernng the upper bound, they establshed an upper bound for m prme modulo the affrmaton of the Erdős Helbronn conecture (EHC) Snce then, the EHC has been affrmed [9], [2], moreover, the bound gven n [4] was extended for nonprmes n [19] As wll later be seen, t s worthwhle to menton that the affrmaton of the EHC has resulted n several attempted generalzatons and related results [6], [15], [22],[25] Other relevant developments concernng g(m, k) appear n [3], [5], [7], [13], [14], [16], [23] For example, the value g(m, 3) = 2m 2 was determned n [3], and the closely related functon g (m, k), ntroduced n [5] and further nvestgated n [4], [14], [16], was determned for all m and k satsfyng k > m/ Mathematcs Subect Classfcaton: Prmary 11B75; Secondary 11B50, 05D10 [173]
2 174 A Balostock et al Ths paper started under the authorshp of the frst, second and fourth authors, and was cted n [4] as n preparaton Actually, a rough draft was ready determnng g(m, 5) usng the methods of [4] The motvaton for the current paper s twofold Frst, the thrd author was able to determne exactly g(m, k) for fxed k and large m by mprovng the known lower bound constructon and adaptng the proof used by Gao and Hamdoune [19] to obtan a better upper bound than the one conectured n [4] Consequently, the followng conecture of [4] has been affrmed Conecture 11 For every k 2, there exsts an nteger m 0 = m 0 (k) such that f m > m 0, then (a) g(m, k) = 2m c, where c = c(k) s ndependent of m, (b) g (m, k) = g(m, k) Thus, the g(m, k) problem for fxed k and large m has been put to rest Second, as several recent works, eg [21], [27], use the known values of g(m, k) and E(m, s) for k 4 and s 2m 3, and as t s lkely that g(m, 5) wll be needed for further zero-sum applcatons, we determne g(m, 5) for every m 5 The paper s organzed as follows In Secton 2, defntons and notaton are ntroduced and known results needed later n the paper are lsted In Secton 3, frst the upper bound proof of [19] s adapted to fnd, for a sequence S wth S 2m m/4 2, necessary and suffcent condtons n terms of a system of nequaltes over the ntegers for S to be zsf Ths result and a lower bound constructon mply the value of g(m, k) for fxed k and large m Followng s the affrmaton of Conecture 11 Secton 4 contans the evaluaton of g(m, 5) for every m 5 The paper concludes wth an appendx lstng the elements of E(m, s) for every m and s satsfyng 2m 2 s max{2m 8, 2m m/4 2} 2 Prelmnares Let G denote an abelan group of order m As we work smultaneously wth the cyclc group Z m of resdue classes modulo m and the addtve group of the ntegers Z, for α Z m we denote by α the least postve nteger that s congruent to α modulo m A sequence S of elements from G s abbrevated as a strng usng exponental notaton (eg the sequence 1, 1, 1, 2, 2, 2, 2 s abbrevated by ) Furthermore, the length of S s denoted by S Let t be a nonnegatve nteger Denote by S the set of all sums over nonempty subsequences of S, and by t S (resp t S) the set of all sums over subsequences of S of length exactly (resp at least) t If A, B G, then ther sumset, A + B, s the set of all possble parwse sums, e {a + b a A, b B} Followng Kemperman [24], a set A G s H-perodc f t s the unon of H-cosets for some nontrval subgroup H G Furthermore, an n-set
3 Erdős Gnzburg Zv Theorem II 175 partton of S s a sequence of n nonempty subsequences of S, parwse dsont as sequences, such that every term of S belongs to exactly one subsequence, and the terms n each subsequence are dstnct Thus such subsequences can be consdered sets Fnally let ϕ be the map that takes a sequence to ts underlyng set (eg ϕ(1, 1, 1, 2, 2, 4) = {1, 2, 4}) Frst, we state three well known theorems: the frst one s a generalzed verson of what s known as the Caveman Theorem [12], followed by a generalzed form of the Erdős Gnzburg Zv (EGZ) Theorem [1], [11], and the affrmed EHC [2], [9] The orgnal EGZ Theorem s Theorem 22 wth r = 1; and Theorem 22 s obtaned by r applcatons of the EGZ Theorem Theorem 21 s smlarly obtaned, where the orgnal Caveman Theorem s the case S = m Theorem 21 Let S be a sequence of elements from an abelan group G of order m If S m, then there exsts a subsequence of S of length r whose terms sum to zero, where r satsfes S (m 1) r S Theorem 22 Let r be a postve nteger If S s a sequence of (r + 1)m 1 elements from an abelan group G of order m, then S contans an rm-term subsequence whch sums to zero Theorem 23 Let S be a sequence of k dstnct elements from Z m If m s prme, then h S mn{m, hk h2 + 1} The followng two theorems of Gao [17], [18], respectvely, are central to the proof of Theorem 31 Theorem 24 Let l and m be postve ntegers satsfyng 2 l m/4 + 2, and let S be a sequence of elements from Z m satsfyng S = 2m l If 0 m S, then up to order and affne transformaton, S = 0 u 1 v c 1 c w, where m 2l + 3 v u m 1 and w l 2 Theorem 25 Let m, n and h be postve ntegers Suppose G s a fnte abelan group of order m, and g G Furthermore, let S = 0 h a 1 a n be a sequence of elements from G such that the multplcty of every element n the subsequence T = a 1 a n s at most h If g m h T, then g m S Next, we state the Cauchy Davenport Theorem [8], [26], and a recently proved composte analog of t [20] Theorem 26 For postve ntegers n and m, let A 1,, A n Z p If m s prme, then n n } A mn {m, A n + 1 Theorem 27 Let n be an nteger and let S be a sequence of elements from an abelan group G of order m such that S n and every element of
4 176 A Balostock et al S appears at most n tmes n S Furthermore, let p be the smallest prme dvsor of m Then ether () there exsts an n-set partton, A 1,, A n, of S such that n n } A mn {m, (n + 1)p, A n + 1, or () there exsts α G and a nontrval proper subgroup H of ndex a, such that all but at most a 2 terms of S are from the coset α+h, and there exsts an n-set partton, A 1,, A n, of the subsequence of S consstng of terms of S from α + H such that n A = nα + H When applyng the above theorem, the followng two basc propostons about n-set parttons and sumsets are often used, and for the sake of clarty, we provde ther proofs Proposton 21 A sequence S has an n-set partton A f and only f the multplcty of each element n S s at most n and S n Furthermore, a sequence S wth an n-set partton has an n-set partton A = A 1 A n such that A A 1 for all and satsfyng 1 n Proof Suppose S has an n-set partton Then from the defnton the multplcty of each element n S s at most n, and snce empty sets are not allowed n the n-set partton, t follows that S n Next suppose that the multplcty of each element n S s at most n and S n Let ϕ(s) = {s 1,, s u }, and rearrange the terms of S so that all the terms that are equal to s 1 come frst, followed by all the terms that are equal to s 2, and so forth, termnatng wth the terms equal to s u Let us denote ths new sequence by S = x 1 x 2 x kn+r, where S = S = kn + r and 0 r < n Consder the followng sequence A of n subsequences of S wrtten vertcally: A = x 1 x n+1 x (k 1)n+1 x kn+1 x r x n+r x (k 1)n+r x kn+r x r+1 x n+r+1 x (k 1)n+r+1 x n x 2n x kn We wll show that A s an n-set partton of S and hence of S Indeed, snce S n, t follows that none of the sets n A are empty Furthermore, n vew of the defnton of S and the fact that the maxmum multplcty of a term n S does not exceed n, t follows that x 1 n+ x 2 n+, for every and every 1 2 Thus A s an n-set partton of S The furthermore part s clear from the defnton of A
5 Erdős Gnzburg Zv Theorem II 177 Proposton 22 Let S be a sequence of elements from a fnte abelan group G, and let A = A 1 A n be an n-set partton of S, where n A = r, and s s the cardnalty of the largest set n A Furthermore, let a 1 a n be a subsequence of S such that a A for = 1,, n () There exsts a subsequence S of S and an n -set partton A = A 1 A n of S, whch s a subsequence of the n-set partton A = A 1 A n, such that n r s + 1 and n A = r () There exsts a subsequence S of S of length at most n+r 1, and an n-set partton A = A 1 A n that n A = n A Furthermore, a A of S, where A A for = 1,, n, such for = 1,, n Proof We frst prove () Assume wthout loss of generalty that A 1 = s We wll construct the n -set partton A n n steps as follows; and S wll be mpled mplctly Denote by A (k) = A 1 A a k the sequence constructed after k steps, and hence A = A (n) and n = a n Let A (1) = A 1, and for k = 1,, n 1, let A (k+1) = { A (k) A (k) A k+1 f a k A + A k+1 = a k f a k A + A k+1 > a k A A, It s easly seen by the above algorthm that a n A = n A = r Furthermore, snce each kept term ncreases the cardnalty of the sumset of the prevous terms of A by at least one, and snce A 1 = s, t follows that at most r s terms, excludng A 1, were kept, and thus a n = n 1 + r s The proof of () s smlar to that of () Frst, for = 1,, n, let the elements of A be {a () 1,, a() A }, where a() 1 = a We wll construct the n- set partton A n a two loop algorthm The outer loop has n steps, where at the th step the set A s constructed usng the nner loop In turn, the nner loop, at the th step of the outer loop, constructs A n A steps For a gven, where 1 n, let A (k) denote the set constructed after k steps of the nner loop at the th step of the outer loop, and hence A = A ( A 1 ) 1 A ( A n ) n wth S mpled mplctly For a gven, where 1 n, let A (1) = {a }, and for k = 1,, A 1, let A (k+1) = A ( A ) n A( A ) A (k) A (k) f 1 A( A ) {a () k+1 } f 1 A( A ) + A (k) = 1 + A (k) < 1 A( A ) A( A ) + (A (k) + (A (k) {a () k+1 }), {a () k+1 }) It s easly seen by the above algorthm that A ( A ) A and a for = 1,, n, and that n A( A ) = n A = r; and snce n A, t follows that n A( A ) = n A Further-
6 178 A Balostock et al more, snce each kept element a () k, where k 1 f 1, ncreases the cardnalty of the sumset by at least one, t follows that at most r 1 terms, excludng the a s, were kept, and hence S n + r 1 We wll also need the followng theorem of [16] Theorem 28 Let m and k be ntegers wth m k 2 and m 5 (a) If m/2 + 1 < k m 1, then { g(m, k) = m + 2 m, m odd, (b) If k = m, then g(m, k) = m + 1, m even We conclude the prelmnares wth a theorem of Eggleton and Erdős [10] Theorem 29 Let S be a sequence of k dstnct elements from a fnte abelan group If 0 S and k 4, then S 2k 3 A theorem of Gao and Hamdoune revsted Theorem 31 gves necessary and suffcent condtons for a sequence S of suffcent length to be zsf More precsely, t reduces the problem of determnng extremal zsf sequences of suffcent length to the problem of fndng nteger parttons wth a fxed number of parts and all parts greater than 1 Its proof s an adapton of a proof of Gao and Hamdoune [19] Theorem 31 For ntegers m and l, let S be a sequence of elements from Z m, satsfyng S = 2m l 2m m/4 2 The sequence S does not contan an m-term zero-sum subsequence f and only f there exsts a sequence S = 0 u 1 v a 1 a w1 b 1 b w2, where 1 < a m/2 and 1 b < m/2, that s equvalent to S up to order and affne transformaton, and for whch the followng four nequaltes are satsfed: w 1 w 2 (1) a m v 1 and b m u 1 w 2, (2) m 2l + 3 v u m 1 and w 1 + w 2 l 2 Moreover, equalty holds n both nequaltes of (1) f and only f S belongs to an equvalence class of E(m, 2m l) Proof Frst, suppose S s a sequence of elements from Z m, satsfyng S = 2m l 2m m/4 2, and 0 m S Hence from Theorem 24 t follows that S s equvalent, up to order and affne transformaton, to a sequence S = 0 u 1 v a 1 a w1 b 1 b w2 satsfyng the nequaltes n (2), where 1 < a m/2 and 1 b < m/2 Snce the fact that S s zsf mples that S s zsf, t follows from Theorem 25 that for any gven subsequence T of a 1 a w1 b 1 b w2, (3) ether t m v 1 or t u T t T t T
7 Erdős Gnzburg Zv Theorem II 179 and (4) ether t T t m u 1 T or t T t v + 1 Inducton on r, n vew of (3) and the followng three nequaltes () l m/4 + 2, () m v 1 m/2 (follows from (2) and l m/4 + 2), () 3m 4l + 5 u + 2v (follows from (2)), mples r r (5) a = a m v 1 for every r satsfyng 1 r w 1 Smlarly, nducton on r, n vew of (4) and the nequaltes () (), and the fact that u v, mples r r (6) b = b m u 1 r for every r satsfyng 1 r w 2 Hence (5) and (6) mply (1) Next suppose S s an arbtrary sequence of resdues from Z m that satsfes (1) and (2) Actually, we wll use only the fact that (1) s satsfed and v u m 1 It follows from (1) that any m-term zero-sum modulo m subsequence of S must be zero-sum n Z as well In addton, t follows from (1) that the longest zero-sum n Z subsequence of S that does not contan a zero s of length w 2 + w 2 b m u 1 Hence any m-term zero-sum subsequence must use at least u + 1 zeros, whch exceeds the multplcty of zero n S Thus S s zsf, and as affne transformatons and reorderng preserve m-term zero-sum subsequences, the proof of the man part of the theorem s complete Notce that the two nequaltes n (1) are nterchanged by the affne transformaton whch nterchanges 0 and 1 Hence, the moreover part of the theorem s easly deduced from the man part of the theorem Theorem 32 Let m k 2 be postve ntegers If k s odd and m (k 2 + 4k + 3)/8 + 1 or k s even and m (k 2 + 2k)/8 + 1, then g (m, k) 2m (k 2 2k + 5)/4 Proof If k s even, consder the sequence ( S 0 = k 2 2 ) ( 1)(0) m (k2 +2k)/8 (1) m (k2 +2k)/8 (2) and f k s odd, consder the sequence ( S 1 = k 3 ) ( 1)(0) m (k2 1)/8 (1) m (k2 +4k+3)/8 (2) 2 ( ) k, 2 ( k + 1 It follows from the hypotheses that both strngs are well defned Snce both S 1 and S 2 satsfy (1), and snce v u m 1, where u and v are the 2 )
8 180 A Balostock et al multplctes of 0 and 1 respectvely, t follows from the proof of the second drecton of Theorem 31 that S 1 and S 2 are zsf We conclude the secton wth Theorem 33, whch determnes the value of g(m, k) for fxed k and suffcently large m, dsprovng Conecture 51 of [4], and provng Conectures 11(a) and 11(b) n parts (a) and (b) respectvely Agan, ts proof s an adaptaton of the proof n [19] Theorem 33 Let m k 2 be postve ntegers If k s even and m k 2 2k 4 or k s odd and m k 2 2k 3, then (a) g(m, k) = 2m (k 2 2k + 5)/4, (b) g (m, k) = g(m, k) Proof From Theorem 32, and from the trval fact that g (m, k) g(m, k), t suffces for both parts (a) and (b) to show g(m, k) 2m (k 2 2k + 5)/4 Assume to the contrary that there s a sequence S of elements from Z m wth S = 2m (k 2 2k + 5)/4 and 0 m S From the hypotheses and the fact that k 2 0 or 1 mod 4, t follows that (k 2 2k + 5)/4 m/4 + 2 Hence from Theorem 31 t follows that wthout loss of generalty S satsfes (1) and (2) Let c 1 = {a 1,, a w1 } and c 2 = {b 1,, b w2 } It follows from the frst nequalty n (1) that (c 1 + 1) + 2(w 1 c 1 ) m v 1, mplyng that c 2 1 c 1 (7) + 2w 1 m v 1 2 Lkewse from the second nequalty n (1), t follows that c 2 2 c 2 (8) + 2w 2 m u 1 w 2 2 Inequaltes (7) and (8) mply c 2 1 c 1 + c2 2 c 2 m v 1 w 1 + m u 1 w 2 = l 2, 2 2 whch, n turn, yelds l (c 1 + c 2 ) 2 + c 1 + c 2 (k 2) k = k2 2k > l, whch s a contradcton; and the proof s complete 4 The Erdős Helbronn conecture and g(m, 5) In vew of Theorem 33, g(m, 5) has been determned for m 12 In ths secton, we present an abbrevated proof determnng g(m, 5) for all m 5 We wll make use of the followng conecture, whch can be verfed for k 5 wth some effort by consderng the equatons generated by the 2-sums of a 5-set S wth 2 S < 7
9 Erdős Gnzburg Zv Theorem II 181 Conecture 41 Let S be a sequence of k 2 dstnct elements from Z m If 2 S < 2k 3, then ether h S s H-perodc, where H > 2, or S s K-perodc, where K = 2 Theorem 41 Let m 5 Then g(6, 5) = 8, and f m 6, then g(m, 5) = 2m 5 Proof For m 6 the result follows from Theorem 28 Suppose S s zsf and S = 2m 5 We may assume that 0 has the greatest multplcty n S Case 1: The multplcty of 0 n S s at most m 2 Applyng Conecture 41 wth k = 5 to all possble 5-sets of ϕ(s) that nclude 0, we can ether fnd a 5-set A ϕ(s) such that 2 A = 3 A 7 and 0 A, or else there exsts a subgroup H of cardnalty h = 5 or h = 6 such that ϕ(s) H In the latter case, m 10, and so from Theorem 22 t follows that any subsequence wth length m + h 1 2m 5 must contan an m-term zero-sum subsequence, a contradcton So 3 A 7 In vew of the assumpton of the case and Proposton 21, there exsts an (m 3)-set partton P of S \ A wth m 7 sets of cardnalty two Applyng Theorem 27 to S \ A, and usng 3 A 7, we obtan an m-term zero-sum subsequence of S, provded concluson () of Theorem 27 holds Hence we are done for m 8 So assume that concluson () of Theorem 27 holds wth coset α + H of ndex a, and wthout loss of generalty assume α = 0 Let P be the (m 3)-set partton mpled by concluson () of Theorem 27 Applyng Proposton 22() followed by Proposton 22() to P we obtan an (m/a 1)-set partton P of a subsequence Q of S \ A of length at most 2m/a 2, whose sumset s also H Then there exsts a subsequence R of S \ A of length a 1 whose terms are from H and are not used n P We can apply Theorem 21 to a subsequence of S \ {Q R} of length m m/a + 1 wth ts terms consdered as elements from Z m /H to obtan a subsequence T of S \ {Q R} whose sum s an element of H and of length r, where r satsfes m m/a a + 2 r m m/a + 1 Snce the sumset of P s H, we can fnd m/a 1 terms from P whch along wth T and an approprate number of terms from R gve an m-term subsequence wth sum zero Case 2: The multplcty of 0 n S s m 1 Let T be a subsequence of S that conssts of 4 dstnct nonzero resdue classes and 3 zeros In vew of Proposton 21, t follows that there exsts an (m 4)-set partton P of S\T wth m 8 cardnalty two sets Applyng Theorem 27 to P and Theorem 29 to ϕ(t )\{0}, we fnd an m-term zero-sum subsequence provded concluson () of Theorem 27 holds If concluson () of Theorem 27 holds nstead, then snce m 4 > a 2 mples 0 α+h, the arguments from the end of Case 1 complete the proof
10 182 A Balostock et al Appendx In the followng table, Theorem 31 s used to lst the values of E(m, s) for all m and s satsfyng 2m 2 s max{2m 8, 2m m/4 2} m s E(m, s) m 2 2m 2 0 m 1 1 m 1 m 4 2m 3 0 m 1 1 m 3 2 m 8 2m 4 0 m 1 1 m ( 1)0 m 3 1 m m 1 1 m 4 3 m 12 2m 5 0 m 1 1 m ( 1)0 m 3 1 m m 1 1 m 6 23 ( 1)0 m 3 1 m m 1 1 m 5 4 m 16 2m 6 0 m 1 1 m ( 1)0 m 3 1 m ( 1) 2 0 m 5 1 m m 1 1 m ( 1)0 m 3 1 m 6 23 ( 2)0 m 4 1 m m 1 1 m m 1 1 m ( 1)0 m 3 1 m 5 4 ( 2)0 m 4 1 m m 1 1 m 6 5 m 20 2m 7 0 m 1 1 m ( 1)0 m 3 1 m ( 1) 2 0 m 5 1 m m 1 1 m ( 1)0 m 3 1 m ( 2)0 m 4 1 m ( 1) 2 0 m 5 1 m m 1 1 m m 1 1 m ( 1)0 m 3 1 m 7 24 ( 1)0 m 3 1 m ( 2)0 m 4 1 m 6 23 ( 1) 2 0 m 5 1 m m 1 1 m m 1 1 m 8 34 ( 1)0 m 3 1 m 6 5 ( 2)0 m 4 1 m m 1 1 m 7 6 m 24 2m 8 0 m 1 1 m ( 1)0 m 3 1 m ( 1) 2 0 m 5 1 m ( 1) 3 0 m 7 1 m m 1 1 m ( 1)0 m 3 1 m ( 2)0 m 4 1 m ( 1) 2 0 m 5 1 m ( 2)( 1)0 m 6 1 m m 1 1 m m 1 1 m ( 1)0 m 3 1 m ( 1)0 m 3 1 m ( 2)0 m 4 1 m ( 1) 2 0 m 5 1 m 7 24 ( 1) 2 0 m 5 1 m ( 3)0 m 5 1 m ( 2)( 1)0 m 6 1 m m 1 1 m m 1 1 m m 1 1 m ( 1)0 m 3 1 m 8 25 ( 1)0 m 3 1 m 8 34 ( 2)0 m 4 1 m 7 24 ( 2)0 m 4 1 m ( 1) 2 0 m 5 1 m 6 5 ( 3)0 m 5 1 m m 1 1 m m 1 1 m m 1 1 m ( 1)0 m 3 1 m 7 6 ( 2)0 m 4 1 m 6 5 ( 3)0 m 5 16 m m 1 1 m 8 7 References [1] N Alon and M Dubner, Zero-sum sets of prescrbed sze, n: Combnatorcs, Paul Erdős s Eghty, Vol 1, Bolya Soc Math Stud, János Bolya Math Soc, Budapest, 1993, [2] N Alon, M B Nathanson and I Ruzsa, The polynomal method and restrcted sums of congruence classes, J Number Theory 56 (1996),
11 Erdős Gnzburg Zv Theorem II 183 [3] A Balostock and P Derker, On the Erdős Gnzburg Zv theorem and the Ramsey numbers for stars and matchngs, Dscrete Math 110 (1992), 1 8 [4] A Balostock and M Lotspech, Some developments of the Erdős Gnzburg Zv Theorem I, n: Sets, Graphs and Numbers (Budapest, 1991), Colloq Math Soc János Bolya 60, North-Holland, Amsterdam, 1992, [5] W Brakemeer, Ene Anzahlformel von Zahlen modulo n, Monatsh Math 85 (1978), [6] H Cao and Z Sun, On sums of dstnct representatves, Acta Arth 87 (1998), [7] Y Caro, Remarks on a zero-sum theorem, J Combn Theory Ser A 76 (1996), [8] H Davenport, On the addton of resdue classes, J London Math Soc 10 (1935), [9] J A Das da Slva and Y O Hamdoune, A note on the mnmal polynomal of the Kronecker sum of two lnear operators, Lnear Algebra Appl 141 (1990), [10] R B Eggleton and P Erdős, Two combnatoral problems n group theory, Acta Arth 21 (1972), [11] P Erdős, A Gnzburg and A Zv, Theorem n addtve number theory, Bull Res Councl Israel 10F (1961), [12] P Erdős and R L Graham, Old and new problems and results n combnatoral number theory, Monographe 28 de L Ensegnement Mathématque, Unv de Genève, 1980 [13] C Flores and O Ordaz, On the Erdős Gnzburg Zv theorem, Dscrete Math 152 (1996), [14] L Gallardo and G Grekos, On Brakemeer s varant of the Erdős Gnzburg Zv problem, Number Theory (Lptovský Ján, 1999), Tatra Mt Math Publ 20 (2000), [15] L Gallardo, G Grekos, L Habseger, F Hennecart, B Landreau and A Plagne, Restrcted addton n Z/n and an applcaton to the Erdős Gnzburg Zv problem, J London Math Soc (2) 65 (2002), [16] L Gallardo, G Grekos and J Phko, On a varant of the Erdős Gnzburg Zv problem, Acta Arth 89 (1999), [17] W D Gao, An addton theorem for fnte cyclc groups, Dscrete Math 163 (1997), [18], Addton theorems for fnte abelan groups, J Number Theory 53 (1995), [19] W D Gao and Y O Hamdoune, Zero sums n abelan groups, Combn Probab Comput 7 (1998), [20] D Grynkewcz, On a partton analog of the Cauchy Davenport Theorem, preprnt [21] D Grynkewcz and R Sabar, Monochromatc and zero-sum sets of nondecreasng modfed-dameter, preprnt [22] Y O Hamdoune, A S Lladó and O Serra, On restrcted sums, Combn Probab Comput 9 (2000), [23] Y O Hamdoune, O Ordaz and A Ortuño, On a combnatoral theorem of Erdős, Gnzburg and Zv, Combn Probab Comput 7 (1998), [24] J H B Kemperman, On small sumsets n an abelan group, Acta Math 103 (1960), [25] V F Lev, Restrcted set addton n groups I The classcal settng, J London Math Soc (2) 62 (2000), 27 40
12 184 A Balostock et al [26] M B Nathanson, Addtve Number Theory Inverse Problems and the Geometry of Sumsets, Grad Texts n Math 165, Sprnger, New York, 1996 [27] R Sabar, On a famly of nequaltes and the Erdős Gnzburg Zv Theorem, preprnt Department of Mathematcs Unversty of Idaho Moscow, ID 83844, USA E-mal: math@udahoedu Department of Mathematcs Albertson College Caldwell, ID 83605, USA E-mal: mlotspech@albertsonedu Mathematcs Caltech Pasadena, CA 91125, USA E-mal: dambr@hotmalcom Receved on and n revsed form on (4359)
On Some Developments of the Erdős-Ginzburg-Ziv Theorem II (personal/extended copy)
On Some Developments of the Erdős-Gnzburg-Zv Theorem II (personal/extended copy) Are Balostock, Paul Derker, Davd Grynkewcz and Mark Lotspech August 19, 2001 Abstract. Let S be a sequence of elements from
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationn ). This is tight for all admissible values of t, k and n. k t + + n t
MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what
More informationChristian Aebi Collège Calvin, Geneva, Switzerland
#A7 INTEGERS 12 (2012) A PROPERTY OF TWIN PRIMES Chrstan Aeb Collège Calvn, Geneva, Swtzerland chrstan.aeb@edu.ge.ch Grant Carns Department of Mathematcs, La Trobe Unversty, Melbourne, Australa G.Carns@latrobe.edu.au
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationSmarandache-Zero Divisors in Group Rings
Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the
More informationOn the size of quotient of two subsets of positive integers.
arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationOn Finite Rank Perturbation of Diagonalizable Operators
Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable
More informationSTEINHAUS PROPERTY IN BANACH LATTICES
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS
More informationPartitions and compositions over finite fields
Parttons and compostons over fnte felds Muratovć-Rbć Department of Mathematcs Unversty of Saraevo Zmaa od Bosne 33-35, 71000 Saraevo, Bosna and Herzegovna amela@pmf.unsa.ba Qang Wang School of Mathematcs
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationDONALD M. DAVIS. 1. Main result
v 1 -PERIODIC 2-EXPONENTS OF SU(2 e ) AND SU(2 e + 1) DONALD M. DAVIS Abstract. We determne precsely the largest v 1 -perodc homotopy groups of SU(2 e ) and SU(2 e +1). Ths gves new results about the largest
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationZhi-Wei Sun (Nanjing)
Acta Arth. 1262007, no. 4, 387 398. COMBINATORIAL CONGRUENCES AND STIRLING NUMBERS Zh-We Sun Nanng Abstract. In ths paper we obtan some sophstcated combnatoral congruences nvolvng bnomal coeffcents and
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationDiscrete Mathematics. Laplacian spectral characterization of some graphs obtained by product operation
Dscrete Mathematcs 31 (01) 1591 1595 Contents lsts avalable at ScVerse ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc Laplacan spectral characterzaton of some graphs obtaned
More informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationSPECIAL SUBSETS OF DIFFERENCE SETS WITH PARTICULAR EMPHASIS ON SKEW HADAMARD DIFFERENCE SETS
SPECIAL SUBSETS OF DIFFERENCE SETS WITH PARTICULAR EMPHASIS ON SKEW HADAMARD DIFFERENCE SETS ROBERT S. COULTER AND TODD GUTEKUNST Abstract. Ths artcle ntroduces a new approach to studyng dfference sets
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationRestricted divisor sums
ACTA ARITHMETICA 02 2002) Restrcted dvsor sums by Kevn A Broughan Hamlton) Introducton There s a body of work n the lterature on varous restrcted sums of the number of dvsors of an nteger functon ncludng
More informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More informationCaps and Colouring Steiner Triple Systems
Desgns, Codes and Cryptography, 13, 51 55 (1998) c 1998 Kluwer Academc Publshers, Boston. Manufactured n The Netherlands. Caps and Colourng Stener Trple Systems AIDEN BRUEN* Department of Mathematcs, Unversty
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationDiscrete Mathematics
Dscrete Mathematcs 30 (00) 48 488 Contents lsts avalable at ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc The number of C 3 -free vertces on 3-partte tournaments Ana Paulna
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationSUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)
SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,
More informationJ. Number Theory 130(2010), no. 4, SOME CURIOUS CONGRUENCES MODULO PRIMES
J. Number Theory 30(200, no. 4, 930 935. SOME CURIOUS CONGRUENCES MODULO PRIMES L-Lu Zhao and Zh-We Sun Department of Mathematcs, Nanjng Unversty Nanjng 20093, People s Republc of Chna zhaollu@gmal.com,
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationEvery planar graph is 4-colourable a proof without computer
Peter Dörre Department of Informatcs and Natural Scences Fachhochschule Südwestfalen (Unversty of Appled Scences) Frauenstuhlweg 31, D-58644 Iserlohn, Germany Emal: doerre(at)fh-swf.de Mathematcs Subject
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationLinear Algebra and its Applications
Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
More informationarxiv: v6 [math.nt] 23 Aug 2016
A NOTE ON ODD PERFECT NUMBERS JOSE ARNALDO B. DRIS AND FLORIAN LUCA arxv:03.437v6 [math.nt] 23 Aug 206 Abstract. In ths note, we show that f N s an odd perfect number and q α s some prme power exactly
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationA combinatorial proof of multiple angle formulas involving Fibonacci and Lucas numbers
Notes on Number Theory and Dscrete Mathematcs ISSN 1310 5132 Vol. 20, 2014, No. 5, 35 39 A combnatoral proof of multple angle formulas nvolvng Fbonacc and Lucas numbers Fernando Córes 1 and Dego Marques
More informationREDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].
REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationTHE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS
Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationExact k-wise intersection theorems
Exact k-wse ntersecton theorems Tbor Szabó V. H. Vu Abstract A typcal problem n extremal combnatorcs s the followng. Gven a large number n and a set L, fnd the maxmum cardnalty of a famly of subsets of
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationOn the average number of divisors of the sum of digits of squares
Notes on Number heory and Dscrete Mathematcs Prnt ISSN 30 532, Onlne ISSN 2367 8275 Vol. 24, 208, No. 2, 40 46 DOI: 0.7546/nntdm.208.24.2.40-46 On the average number of dvsors of the sum of dgts of squares
More information28 Finitely Generated Abelian Groups
8 Fntely Generated Abelan Groups In ths last paragraph of Chapter, we determne the structure of fntely generated abelan groups A complete classfcaton of such groups s gven Complete classfcaton theorems
More informationRapid growth in finite simple groups
Rapd growth n fnte smple groups Martn W. Lebeck, Gl Schul, Aner Shalev March 1, 016 Abstract We show that small normal subsets A of fnte smple groups grow very rapdly namely, A A ɛ, where ɛ > 0 s arbtrarly
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationOn C 0 multi-contractions having a regular dilation
SUDIA MAHEMAICA 170 (3) (2005) On C 0 mult-contractons havng a regular dlaton by Dan Popovc (mşoara) Abstract. Commutng mult-contractons of class C 0 and havng a regular sometrc dlaton are studed. We prove
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationarxiv: v1 [quant-ph] 6 Sep 2007
An Explct Constructon of Quantum Expanders Avraham Ben-Aroya Oded Schwartz Amnon Ta-Shma arxv:0709.0911v1 [quant-ph] 6 Sep 2007 Abstract Quantum expanders are a natural generalzaton of classcal expanders.
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationErdős-Burgess constant of the multiplicative semigroup of the quotient ring off q [x]
Erdős-Burgess constant of the multplcatve semgroup of the quotent rng off q [x] arxv:1805.02166v1 [math.co] 6 May 2018 Jun Hao a Haol Wang b Lzhen Zhang a a Department of Mathematcs, Tanjn Polytechnc Unversty,
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationP.P. PROPERTIES OF GROUP RINGS. Libo Zan and Jianlong Chen
Internatonal Electronc Journal of Algebra Volume 3 2008 7-24 P.P. PROPERTIES OF GROUP RINGS Lbo Zan and Janlong Chen Receved: May 2007; Revsed: 24 October 2007 Communcated by John Clark Abstract. A rng
More informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
More informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More informationSome Consequences. Example of Extended Euclidean Algorithm. The Fundamental Theorem of Arithmetic, II. Characterizing the GCD and LCM
Example of Extended Eucldean Algorthm Recall that gcd(84, 33) = gcd(33, 18) = gcd(18, 15) = gcd(15, 3) = gcd(3, 0) = 3 We work backwards to wrte 3 as a lnear combnaton of 84 and 33: 3 = 18 15 [Now 3 s
More informationChowla s Problem on the Non-Vanishing of Certain Infinite Series and Related Questions
Proc. Int. Conf. Number Theory and Dscrete Geometry No. 4, 2007, pp. 7 79. Chowla s Problem on the Non-Vanshng of Certan Infnte Seres and Related Questons N. Saradha School of Mathematcs, Tata Insttute
More informationMATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1
MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationREGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction
REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationDiscussion 11 Summary 11/20/2018
Dscusson 11 Summary 11/20/2018 1 Quz 8 1. Prove for any sets A, B that A = A B ff B A. Soluton: There are two drectons we need to prove: (a) A = A B B A, (b) B A A = A B. (a) Frst, we prove A = A B B A.
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More information