A Hölder-type inequality on a regular rooted tree
|
|
- Duane Clarke
- 5 years ago
- Views:
Transcription
1 A Hölder-type nequalty on a regular rooted tree K.J. Falconer Mathematcal Insttute, Unversty of St Andrews, North Haugh, St Andrews, Ffe, KY6 9SS, Scotland arxv:40.635v [math.ca] 23 Oct 204 Abstract We establsh an nequalty whch nvolves a non-negatve functon defned on the vertces of a fnte m-ary regular rooted tree. The nequalty may be thought of as relatng an nteracton energy defned on the free vertces of the tree summed over automorphsms of the tree, to a product of sums of powers of the functon over vertces at certan levels of the tree. Conjugate powers arse naturally n the nequalty, ndeed, Hölder s nequalty s a key tool n the proof whch uses nducton on subgroups of the automorphsm group of the tree. Introducton The energy of an nteractng partcle system wth a fnte number of stes s typcally gven by a sum (, 2 µ( µ( 2 F (, 2 over pars of partcles (, 2 where F (, 2 represents the force or nteracton between the partcles located at and 2 whch have masses or weghts µ( and µ( 2 respectvely. A more complex system may nvolve nteractons between three or more partcles smultaneously rather than just two. Thus we are led to consder energes of the form (,..., n µ( µ( n F (,..., n resultng from nteractons F (,..., n whch depend on n partcles and ther confguraton. Typcally each partcle may be affected most by those other partcles that are closest, so the nteracton should take nto account the nearest neghbor structure of the partcle confguraton. One convenent way of ncorporatng such a structure s by representng the stes as the free vertces (.e. vertces of valence of a regular m-ary tree, so that the dstance between a par of stes s an ultrametrc determned by the level of ther frst common ancestor. The arrangement of common ancestors or jons of a collecton of n partcles determnes ther nearest neghbor confguraton. Our man results and detaled notaton are set out n Secton 2, but to fx deas we gve here a bref overvew and an example. We work on an m-ary regular rooted tree T of k levels, where the level or generaton of a vertex s ts edge dstance from the root. In the usual parlance, each vertex has m chldren, except for the free vertces at level k whch have no chldren; we let T 0 denote the set of free vertces. We wrte for the jon of, T 0, that s the vertex j T of maxmum level that les on both of the paths from the root to and from to. The jon set of n partcles located at stes,..., n T 0, s the set of vertces of T gven by j for all < j n (ths s made a lttle more precse n the next secton where we allow for multple jon ponts.
2 For f a non-negatve functon defned on the vertces of T, we wll consder nteractons that can be expressed as the product of the values of f over the jon ponts, that s, F (,..., n = f(j f(j 2 f(j n where j, j 2,..., j n are the jon ponts of,..., n. Then the energy s of the form µ( µ( n F (,..., n. (. (,..., n Typcally, f(j wll be large f the jon pont j s a hgh level vertex correspondng to a sgnfcant nteracton component resultng from nearby partcles. For many problems one needs to bound the energy of a system, perhaps n the lmt as the number of generatons becomes large. Such estmates are requred, for example, n estmatng hgh moments of certan measures, see for [2, 3]. Whlst one may wsh to estmate the sum (. over all arrangements of n partcles, the sum breaks down naturally nto sub-sums over confguratons of partcles whch have somorphc jon structures. Thus we consder the set of confguratons of n partcles on T 0 that may be obtaned from each other under some automorphsm of the rooted tree, n other words the equvalence classes of confguratons defned by the automorphsms. These equvalence classes are the orbts of the automorphsm group of T actng on the ordered n-tuples from T 0. Wrtng [I] for such an equvalence class or orbt, we are led to consder the sums µ( µ( n F (,..., n. (,..., n [I] We wll obtan upper bounds for these sums over the equvalence class [I] n terms of pth powers of f summed across certan levels of the tree T. Fgure : Partcles and jon ponts n the example To llustrate ths, consder a specfc case of the bnary rooted tree of k = 3 levels wth n = 4 partcles. Startng wth the confguraton (, 2, 2, 22 of ponts of T 0 (wth the usual codng of vertces of the bnary tree the jon ponts are at, and 2, see Fgure. Let [I] be the class of 64 dfferent equvalent ordered 4-tuples 2
3 (g(, g(2, g(2, g(22 obtanable under an automorphsm g of the rooted tree T. Assgn each free vertex T 0 a postve weght µ(. For each vertex j T wrte µ(j for the total weght of the free vertces below j, so, for example, µ(2 = µ(2 + µ(22. In ths specal case, our man nequalty becomes, for any non-negatve functon f on the vertces of T and for all p, p 2, p 3 > 2 satsfyng p + p 2 + p 3 =, (, 2, 3, 4 [I] µ( µ( 2 µ( 3 µ( 4 F (, 2, 3, 4 ( /p 4 /p2 2 /p 3 ( f( µ( +p /p ( f( p 2 µ( +p 2 + f(2 p 2 µ(2 +p 2 /p 2 ( f( p 3 µ( +p 3 + f(2 p 3 µ(2 +p 3 + f(2 p 3 µ(2 +p 3 + f(22 p 3 µ(22 +p 3 /p 3. (.3 The sum (.2 has 64 terms, each a product over 3 jon ponts, one at each level 0, and 2. The bound (.3 s a product of weghted p th power sums of f across each of the 3 levels of the tree at whch the jon ponts occur. A check shows that equalty holds f the weghts µ( are equal for all T 0 and f s constant across each level, that s f f( = f(2 and f( = f(2 = f(2 = f(22. We wll prove results of ths type n a general context by employng nducton wth respect to automorphsms fxng the jon ponts and ncorporatng Hölder s nequalty n a natural way. 2 Notaton and statement of results To state the man results we set out some further notaton relatng to the tree T. For ntegers m 2 and k, we ndex the vertces of T, the m-ary regular rooted tree of k + levels (ncludng the level of the root, by the symbolc space of words formed from the symbols {, 2,..., m}. Thus the vertces of T are gven by {(, 2,..., l : 0 l k, j m}, wth the root of the tree as the empty word. We often abbrevate a word by = (, 2,..., l and wrte = l for ts level or generaton. The set of free vertces, that s those wth = k, s denoted by T 0. We wrte j to mean that s a curtalment of j, that s s an ntal subword of j. If, T then the jon s the maxmal word such that both and. Wth each j T we assocate the cylnder C j = { T 0 : j } comprsng those ponts of T 0 below j. We next consder automorphsms of the rooted tree T, regarded as a graph, whch nduce permutatons of the vertces at each level of the tree. For each vertex v T and n m k we wrte S v (n = { (,..., n : j T 0, j v ( j n, j h (j h } (2. for the set of all ordered n-tuples of dstnct elements of T 0 that are descendents of v. Let Aut v be the group of automorphsms of the rooted tree T that fx v. Defne an equvalence relaton on S v (n by (,..., n (,..., n f there exsts g Aut v such that g( r = r for all r n; (2.2 3
4 thus the equvalence classes are the orbts of S v (n under Aut v. We wrte [I] v for the equvalence class contanng I = (,..., n. For notatonal smplcty, we often omt the subscrpt when v =, so that S(n = S (n and [I] = [I]. We requre some termnology relatng to the jons of subsets of T 0. Let I = (,..., n S v (n. The jon set of I, denoted by (I = (,..., n, s the set of vertces {j,..., j n } T consstng of the jon ponts j for all < j n, wth w (I occurrng wth multplcty r f there are (r + dstnct ndces <... < r+ n such that s t = w for all s t. Note that the jon set of n ponts always conssts of n ponts countng by multplcty. Moreover, f T s a bnary tree, so m = 2, all jon ponts have multplcty. Fgure 2: A 3-ary tree wth 8 partcles and 7 jon ponts, 2 of whch have multplcty 2 The set of jon levels L(I of I S v (n s { j,..., j n : j (I} wth levels repeated accordng to multplcty. Notce that f I I then L(I = L(I =: L([I] v,.e. the set of levels s constant across each equvalence class [I] v of S v (n. For a level L of T we wll, by slght abuse of notaton, wrte j L to mean that j = L, so we thnk of a vertex j belongng to a level of the tree. We now assgn a weght µ( 0 to each T 0. Then the weght of each cylnder s defned to be the sum of the weghts of the ponts n the cylnder, that s µ(c j = T 0,j µ( for each j T. Next we assgn a postve value f(j to each vertex j of T, that s f : T R +. Then for each I S(n we take the product of these values over the jon ponts of I. Thus f n 2 we defne F : S(n R + by F (,..., n = f(j f(j 2 f(j n, (2.3 where I = (,..., n S(n has jon set (,..., n = {j,..., j n }. For I = ( S( we make the trval assgnment F ( =. Note that f j s a jon pont of multplcty r then the factor f(j wll occur n (2.3 r tmes We can now state the man theorem. 4
5 Theorem 2. Let T be the rooted m-ary tree of k levels. Let 2 n m k. Let I S(n have jon ponts at levels L,..., L n and let p,..., p n > 0 satsfy n =. Then (,..., n [I] n ( /p, µ( µ( n F (,..., n K f(j p µ(c j +p (2.4 j L where K does not depend on f or µ. The value of the constant K wll be dscussed n Secton 4. We obtan the followng estmate, though ths s not n general optmal. j (m! Corollary 2.2 We may take K = (m n n (2.4, where the (m r! product s over the dstnct jon ponts whch have multplctes r,..., r j. In partcular, for a bnary tree, where m = 2, we can take K =. For a bnary tree we can, under certan condtons, mprove on ths to obtan the best possble value of K. Corollary 2.3 Let T be the rooted bnary tree of k levels. Let 2 n 2 k. Let I S(n have jon ponts {j,..., j n } at levels L,..., L n and let p,..., p n > 0 satsfy n p =. Suppose also that the followng condton s satsfed: If the jon ponts of I are ordered so that j s the top jon pont (.e. j j for all and {j 2,..., j m } and {j m+,..., j n } are the jon ponts below the left and rght edges abuttng j respectvely, then p m =2 p 2 and n =m+ p 2. (2.5 Then (,..., n [I] µ( µ( n F (,..., n n ( /p, f(j p µ(c 2 n j +p (2.6 j L wth equalty f µ( s constant for all T 0 and, for each level L, f(j s constant for all j L. 3 Proof of Theorem 2. We wll establsh the key Lemma 3. by nducton on the jon ponts, usng repeated applcatons of Hölder s nequalty and at each step carryng forward some of the weght to the next jon pont. Note that the proof s smpler when T s a bnary tree or when all the jon ponts have multplcty, n whch case d = 2 throughout the nducton. Theorem 2.3 follows mmedately from the lemma on takng v = to be the root of the tree T. 5
6 In the proof of Lemma 3. we wll refer to the numbers K(m; a,..., a m, defned as follows for m and a 0. Wth S m as the symmetrc group of all permutatons σ of (, 2,..., m, K(m; a,..., a m s the least number such that x a σ( xa 2 σ(2 xam σ(m K(m; a,..., a m (x + + x m a + +a m (3. σ S m for all x 0, where we make the consstent conventon that 0 0 =. It s easy to see that K(m; a,..., a m m! ; we wll dscuss the value of K n more detal n Secton 4. Lemma 3. Let T be the rooted m-ary tree of k levels. Let v T and n m k v. Let I S v (n have jon ponts at levels L,..., L n and let p,..., p n > 0 satsfy =. Then n p n ( µ( µ( n F (,..., n K (,..., n [I] v where K does not depend on f or µ. j L,j v f(j p µ(c j +p /p, (3.2 Proof. We proceed by strong nducton. We take the nductve hypothess P(n for n N to be as follows. P(n (n : For all v T, for all p,..., p n > 0 and α satsfyng n p =, f I S α v(n has jon levels L,..., L n, there s a constant K such that n ( µ( µ( n F (,..., n Kµ(C v /α (,..., n [I] v j L,j v f(j p µ(c j +p /p, for all µ and f. When n = then α = and we take the empty product to equal n (3.3. The proof falls nto several parts. (a Verfcaton of P(. If v T and I = ( S v ( then µ( F ( = µ( = µ(c v, ( [I] v v whch s P( wth K =, notng that α =. (3.3 (b The nductve step. Assume, for some nteger n 2, that P(l holds for all l n. We wll show that P(n holds. Let v T and I = (,..., n S v (n where, wthout loss of generalty, (,..., n are ndexed n lexcographcal order. We consder two cases. Case (b. Suppose that v T s a jon pont of I of multplcty d (2 d m. Let v,..., v d be the vertces of T that are chldren of v and are above at least one of the j, that s for each j, v j = v + and there s an k such that v v j k. Then I splts nto d non-empty parts, I j = ( j,..., j n j for j d, so that j v j for all, j, wth n j and n + + n d = n. Note that the jon ponts of I comprse the jon ponts of each of the I j together wth v. 6
7 Let p,..., p n > 0 be the exponents assocated wth the jon ponts of I where n p = wth < α. Re-ndex these exponents so that α pj,..., p j n j are those assocated wth the jon ponts of I j for each j and the exponents p 0,..., p 0 d are those assocated wth v. Let the correspondng jon levels of I j be Λ(I j = {L j,..., L j n j } for j d. Defne α,..., α d by n j p j = α j < (f n j 2 or α j = (f n j =. (3.4 Summng over j gves + + = d α α d p 0 p 0 d α = d + β (3.5 where, for convenence, we wrte /β = /p /p 0 d + /α. Now let (v,..., v d,..., v m be the set of all vertces of T mmedately below v. Let G be a subgroup of Aut v such that {(g(v,..., g(v m : g G} ncludes every permutaton of (v,..., v m exactly once, so that G has order m!. The orbts of I may be decomposed as [I] v = {([g(i ] g(v,..., [g(i d ] g(vd } g G, but f m d + 2 then (m d! elements g of G wll yeld each such decomposton of [I] v. Then, by defnton of F, (m d! µ( µ( n F (,..., n (,..., n [I] v = ( f(v d µ( µ( n F (,..., n g G (,..., n [g(i ] g(v ( µ( d µ( d n d F ( d,..., d n d f(v d g G ( K µ(c g(v /α ( d,...,d n d [g(i d ] g(vd ( K d µ(c g(vd /α d ( j L,j g(v d ( j L d,j g(v d f(j p µ(cj +p /p f(j pd µ(cj +pd /p d (on applyng (3.3 to each I j n the decomposton of I, wth K j as the correspondng constant K = K K d f(v ( ( d µ(c g(v /α µ(c g(vd /α d g G ( j L,j g(v K K d f(v d ( g G f(j p µ(cj +p /p d /β µ(c g(v β/α µ(c g(vd β/α d ( j L d,j g(v d f(j pd µ(cj +pd /p d 7
8 ( g G j L,j g(v f(j p µ(cj +p /p (usng Hölder s nequalty, notng that β + d j= nj d p j = ( g G j L d,j g(v d f(j pd µ(cj +pd K K d f(v d K(m; β/α,..., β/α d, 0,..., 0 /β( µ(c v + + µ(c vm /α + +/α d ((m! j L,j v f(j p (where K(m; s gven by (3. µ(cj +p /p = K 0 f(v d µ(c v d +/p0 + +/p0 d +/α j d, n j d ((m! j L d,j v f(j pd µ(cj +pd ( f(j p j /p j µ(cj +pj j L j,j v (where K 0 = K K d K(m; β/α,..., β/α d, 0,..., 0 /β (m! /β and usng (3.5 (3.6 = K 0 µ(c v /α( f(v p0 µ(cv /p +p0 0 (f(v p0 d µ(cv d /p +p0 0 d ( /p j f(j pj µ(cj +pj j d, n j = K 0 µ(c v /α j L,j v 0 j d, n j ( j L,j v f(j pj µ(cj +pj /p j (on ncorporatng the terms nvolvng p j 0 as sngle terms n the product n ( /p. = K 0 µ(c v /α f(j p µ(c j +p j L,j v Thus P(n holds wth K = K 0 /(m d!. Case (b2. Now suppose that v s not a jon pont of I. As before let p,..., p n > 0 be the exponents assocated wth the jon ponts of I where n p = wth < α. α Let w be the frst jon pont of I below v, so that,..., n w v, wth n 2. Let v,..., v r be the vertces of T such that v j v and v j = w, and let g j Aut v be such that g j (w = v j. We may decompose the orbts of I as [I] v = {[g j (I] vj } r j=. Applyng case (b to [g j (I] vj for j r, and lettng K be the correspondng constant gven by (3.3, whch wll be the same for each j, we obtan (,..., n [I] v µ( µ( n F (,..., n = r j= µ( µ( n F (,..., n (,..., n [g j (I] vj r n ( Kµ(C vj /α f(j p µ(c j +p j L,j v j j= 8 /p /p d /p d
9 ( r K µ(c vj j= /α n ( r n ( = Kµ(C v /α j L,j v j= j L,j v j f(j p µ(c j +p f(j p µ(c j +p usng Hölder s nequalty, to get (3.3 n ths case. Thus by nducton P(n holds for all n, and the Lemma follows f n > takng α =. /p Proof of Theorem 2. The theorem s mmedate on settng v = n ( Value of the constant K The constant K that occurs n (2.4 arses from a product of terms K(m; β/α,..., β/α d, 0,..., 0 that are ncorporated at (3.6 at each step of the nducton. Thus to estmate K we frst need to bound K(m; a,..., a m. Lemma 4. Let m and let a 0 for =, 2,..., m, wth 0 < a + a a m = s. Let S m be the symmetrc group of all permutatons σ of (, 2,..., m. Recall that K(m; a,..., a m s the least number such that x a σ( xa 2 σ(2 xam σ(m K(m; a,..., a m (x + x x m s (4. σ S m for all x 0, wth the conventon that 0 0 =. ( If 0 < s then K(m; a,..., a m = m! m s. ( If s then m! m s K(m; a,..., a m (m!. ( If s and a (s /m for all =,..., m then K(m; a,..., a m = m! m s. (v For m = 2, f (a a 2 2 a + a 2 then K(2; a, a 2 = 2 s = 2 a a 2. Wth the values gven n (, ( and (v there s equalty n (4. f and only f the x are all equal. Proof. It s enough to prove (4. wth the x > 0 and take the lmt of the nequalty for any x = 0. Modfyng the exponents to sum to and then usng Murhead s nequalty (see [4, 5] gves m! σ S m x a σ( xa 2 σ(2 xam σ(n = m! σ S m (x s σ( a/s (x s σ(2 a2/s (x s σ(m am/s 9 /p
10 m (xs + x s x s m. Then ( follows drectly on applyng the generalzed mean nequalty and ( follows usng Mnkowsk s nequalty. Note that n case (, settng K = m!m s n (4. we get equalty when the x are all equal but the nequalty may fal wth ths K for other x. For ( we have m! σ S m x a σ( xa 2 σ(2 xam σ(n = m! x a (s /m σ( σ S m x am (s /m ( (s /m σ(n xσ( x σ(2 x σ(m m (x + x x m ( (x + x x m /m s usng Murhead s nequalty and the geometrc-arthmetc mean nequalty. For (v we frst clam that for all r, q 0 such that (r q 2 r + q cosh(r qθ (cosh θ r+q < for all 0 θ R. (4.2 To see ths, assume, wthout loss of generalty, that 0 q < r. Dfferentatng and usng the addton formula for hyperbolc functons gves [ ] d cosh(r qθ = r snh ( (r q θ q snh ( (r q + θ. (4.3 dθ (cosh θ r+q (cosh θ r+q cosh θ Note that r(r q q(r q + = (r q 2 (r + q 0 from our assumpton. Snce (r q 2 < (r q + 2 and q(r q + 0 t follows nductvely that r(r q 2k+ q(r q + 2k+ < 0 (4.4 for all ntegers k. But the left-hand expresson n (4.4 s just the coeffcent of θ 2k+ /(2k +! n the power seres expanson of the numerator of the quotent n (4.3. Thus the dervatve (4.3 s strctly postve for θ < 0 and strctly negatve for θ > 0, from whch (4.2 follows. If x = λx 2 where λ > 0 and settng λ /2 = e θ, x r x q 2 + x r 2x q (x + x 2 = λ(r q/2 + λ (q r/2 r+q (λ /2 + λ /2 = e(r qθ + e (r qθ r q cosh(r qθ = 2 r+q (e θ + e θ r+q (cosh θ r+q 2 r q by (4.2, wth equalty f and only f x = x 2. Takng r = a and q = a 2 gves (v. Note that case (v of nequalty (4. when m = 2 s related to Murhead means and Schur convexty, whch has a substantal lterature, see [, 4]. Some related nequaltes are obtaned n [, 6] but we were unable to fnd the partcular nequalty that we requred. Note also n relaton to case (v that f (a a 2 2 > a + a 2 then the maxmum of σ S 2 x a σ( xa 2 σ(2/ (x + x 2 a +a 2 does not necessarly occur when x = x 2, n whch case K(2; a, a 2 > 2 a a2. Proof of Corollary 2.2 Each tme the nducton step s appled at a jon pont wth multplcty d the constant gets multpled at (3.6 by K(m; β/α,..., β/α d, 0,..., 0 /β (m! /β (m d! 0
11 (m! /β (m! /β (m d! = (m!(m d! usng Lemma 4.(. The nducton step s appled once at each jon pont, so the estmate for K follows. Notng that (m!/(m r! (m r for each and j r = n gves the stated nequalty. In general the value of K stated n Corollary 2.2 wll not be optmal whch n the case of a bnary tree gves K =. However, provded that the exponents p are reasonably well dstrbuted n the manner stated precsely n Corollary 2.3, we can reduce ths to K = 2 (n. Proof of Corollary 2.3 For a bnary tree, m = 2, all the jon ponts are of multplcty, and the nductve step s appled n tmes. Thus the corollary wll follow f we can show that the multpler ncorporated at (3.6 each tme the nductve step s used satsfes K(2; β/α, β/α 2 /β 2. Note that (2.5 mples that at each stage of the nducton /α, /α 2 each tme 2 (3.4 s used. In partcular (/α /4(/α 2 /4 /6 whch rearranges to Then + 4. (4.5 α α 2 α α 2 ( 2 = + 2 α α 2 α 2 α2 2 α α ( ( + α 2 α2 2 α α 2 α α ( 2 = + ( + α α 2 α α ( 2 = + α α 2 β usng (3.5, gvng Thus Lemma 4. (v gves ( β α β α 2 2 β α + β α 2. as requred. K(2; β/α, β/α 2 /β 2 ( β/α β/α 2 /β = 2 Fnally note that condtons for equalty are not n general easy to specfy. Ths requres equalty at each step of the nducton when Hölder s nequalty and (4. are appled. There wll be equalty n Theorem 2. f µ( s constant for all T 0 and f(j s constant for all j L for each level L provded that we have the optmal value of K. Ths we can do under the condtons of Corollary 2.3. However, as the value of K(m; a,..., a m for Lemma 4. case ( seems to be unknown when m 3 and s >, the value of K gven by Proposton 2.2 wll not n general be optmal.
12 5 Acknowledgement The author s most grateful to the referee for a number of helpful suggestons. References [] Yu-Mng Chu and We-Feng Xa, Necessary and suffcent condtons for the Schur harmonc convexty of the generalzed Murhead mean, Proc. A. Razmadze Math. Inst. 52 ( [2] K.J. Falconer, Generalzed dmensons of measures on almost self-affne sets, Nonlnearty 23 ( [3] K.J. Falconer and Ymn Xao, Generalzed dmensons of mages of measures under Gaussan processes, Adv. Math. 252 ( [4] D.J.H. Garlng, Inequaltes: a Journey nto Lnear Analyss, Cambrdge Unversty Press (2007. [5] G.H. Hardy, J.E. Lttlewood and G. Pólya, Inequaltes, Cambrdge Unversty Press, Pbk. Ed. (988. [6] Mao-Kun Wang, Yu-Mng Chu and Ye-Fang Qu, Some comparson nequaltes for generalzed Murhead and dentrc means, J. Inequal. Appl. 200 (200 Art. ID
More 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 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 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 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 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 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 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 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 informationDeterminants Containing Powers of Generalized Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal
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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
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 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 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 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 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 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 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 informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
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 informationPhysics 5153 Classical Mechanics. Principle of Virtual Work-1
P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal
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 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 informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
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 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 informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationCONJUGACY IN THOMPSON S GROUP F. 1. Introduction
CONJUGACY IN THOMPSON S GROUP F NICK GILL AND IAN SHORT Abstract. We complete the program begun by Brn and Squer of charactersng conjugacy n Thompson s group F usng the standard acton of F as a group of
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 informationA p-adic PERRON-FROBENIUS THEOREM
A p-adic PERRON-FROBENIUS THEOREM ROBERT COSTA AND PATRICK DYNES Advsor: Clayton Petsche Oregon State Unversty Abstract We prove a result for square matrces over the p-adc numbers akn to the Perron-Frobenus
More informationLimited Dependent Variables
Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages
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 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 informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationand problem sheet 2
-8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,
More informationk(k 1)(k 2)(p 2) 6(p d.
BLOCK-TRANSITIVE 3-DESIGNS WITH AFFINE AUTOMORPHISM GROUP Greg Gamble Let X = (Z p d where p s an odd prme and d N, and let B X, B = k. Then t was shown by Praeger that the set B = {B g g AGL d (p} s the
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 informationRandom Partitions of Samples
Random Parttons of Samples Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract In the present paper we construct a decomposton of a sample nto a fnte number of subsamples
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
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 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 informationOn the set of natural numbers
On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
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 informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
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 informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationRepresentation theory and quantum mechanics tutorial Representation theory and quantum conservation laws
Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac
More informationarxiv: v2 [math.ca] 24 Sep 2010
A Note on the Weghted Harmonc-Geometrc-Arthmetc Means Inequaltes arxv:0900948v2 [mathca] 24 Sep 200 Gérard Maze, Urs Wagner e-mal: {gmaze,uwagner}@mathuzhch Mathematcs Insttute Unversty of Zürch Wnterthurerstr
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 informationGames of Threats. Elon Kohlberg Abraham Neyman. Working Paper
Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
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 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 informationOpen Systems: Chemical Potential and Partial Molar Quantities Chemical Potential
Open Systems: Chemcal Potental and Partal Molar Quanttes Chemcal Potental For closed systems, we have derved the followng relatonshps: du = TdS pdv dh = TdS + Vdp da = SdT pdv dg = VdP SdT For open systems,
More informationSpectral Graph Theory and its Applications September 16, Lecture 5
Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph
More informationNOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules
NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules EVAN WILSON Quantum groups Consder the Le algebra sl(n), whch s the Le algebra over C of n n trace matrces together wth the commutator
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 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 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 informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
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 informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
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 informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More information( 1) i [ d i ]. The claim is that this defines a chain complex. The signs have been inserted into the definition to make this work out.
Mon, Apr. 2 We wsh to specfy a homomorphsm @ n : C n ()! C n (). Snce C n () s a free abelan group, the homomorphsm @ n s completely specfed by ts value on each generator, namely each n-smplex. There are
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
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 informationDistribution of subgraphs of random regular graphs
Dstrbuton of subgraphs of random regular graphs Zhcheng Gao Faculty of Busness Admnstraton Unversty of Macau Macau Chna zcgao@umac.mo N. C. Wormald Department of Combnatorcs and Optmzaton Unversty of Waterloo
More informationVapnik-Chervonenkis theory
Vapnk-Chervonenks theory Rs Kondor June 13, 2008 For the purposes of ths lecture, we restrct ourselves to the bnary supervsed batch learnng settng. We assume that we have an nput space X, and an unknown
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
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 informationCase A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.
THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More informationCurvature and isoperimetric inequality
urvature and sopermetrc nequalty Julà ufí, Agustí Reventós, arlos J Rodríguez Abstract We prove an nequalty nvolvng the length of a plane curve and the ntegral of ts radus of curvature, that has as a consequence
More informationOn intransitive graph-restrictive permutation groups
J Algebr Comb (2014) 40:179 185 DOI 101007/s10801-013-0482-5 On ntranstve graph-restrctve permutaton groups Pablo Spga Gabrel Verret Receved: 5 December 2012 / Accepted: 5 October 2013 / Publshed onlne:
More informationStatistical Mechanics and Combinatorics : Lecture III
Statstcal Mechancs and Combnatorcs : Lecture III Dmer Model Dmer defntons Defnton A dmer coverng (perfect matchng) of a fnte graph s a set of edges whch covers every vertex exactly once, e every vertex
More informationUniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity
Int. Journal of Math. Analyss, Vol. 6, 212, no. 22, 195-114 Unqueness of Weak Solutons to the 3D Gnzburg- Landau Model for Superconductvty Jshan Fan Department of Appled Mathematcs Nanjng Forestry Unversty
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
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 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 informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 6 Luca Trevisan September 12, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 6 Luca Trevsan September, 07 Scrbed by Theo McKenze Lecture 6 In whch we study the spectrum of random graphs. Overvew When attemptng to fnd n polynomal
More information