Secure Frameproof Codes Through Biclique Covers
|
|
- Benedict Mason
- 6 years ago
- Views:
Transcription
1 Discee Mahemaics and Theoeical Compue Science DMTCS vol. 4:2, 202, Secue Famepoof Codes Though Biclique Coves Hossein Hajiabolhassan,2 and Faokhlagha Moazami 3 Depamen of Mahemaical Sciences, Shahid Beheshi Univesiy, Tehan, Ian 2 School of Mahemaics, Insiue fo Reseach in Fundamenal Sciences (IPM), Tehan, Ian 3 Depamen of Mahemaics, Alzaha Univesiy, Tehan, Ian eceived 0 h Apil 202, evised 26 h Ocobe 202, acceped 5 h Novembe 202. Fo a binay code of lengh v,av-wod w poduces by a se of codewods {w,...,w } if fo all i =,...,v, we have w i 2{wi,...,wi }. We call a code -secue famepoof of size if = and fo any v-wod ha is poduced by wo ses C and C 2 of size a mos, hen he inesecion of hese ses is non-empy. A d-biclique cove of size v of a gaph G is a collecion of v complee bipaie subgaphs of G such ha each edge of G belongs o a leas d of hese complee bipaie subgaphs. In his pape, we show ha fo 2, an -secue famepoof code of size and lengh v exiss if and only if hee exiss a -biclique cove of size v fo he Knese gaph KG(, ) whose veices ae all -subses of a -elemen se and wo -subses ae adjacen if hei inesecion is empy. Then we invesigae some connecion beween he minimum size of d-biclique coves of Knese gaphs and cove-fee families, whee an (, w; d) cove-fee family is a family of subses of a finie se X such ha he inesecion of any membes of he family conains a leas d elemens ha ae no in he union of any ohe w membes. The minimum size of a se X fo which hee exiss an (, w; d) cove-fee family wih blocks is denoed by N((, w; d),). We pove ha fo >2and >s, we have bc d (KG(, )) bc m(kg(, s)), whee m = N(( s, s; d), 2s). Finally, we show ha fo any apple i<, apple j<w, and + w we have N((, w; d),) N(( i, w j; m),), whee m = N((i, j; d), w + i + j). Keywods: cove-fee family, secue famepoof code, biclique cove, Hadamad maix Inoducion Illegal copy is a majo poblem in digial daa. Famepoof codes ae one of many diffeen echniques o peven poducs agains illegal copy ha wee fis inoduced by Boneh and Shaw [2]. To poec digial daa, he disibuo maks each copy uniquely wih a codewod. These codewods have he popey ha an illegal copy can ace and back o he buye. Also, hese maks ae impossible o emove o change fo non-colluding buyes. Bu, wheneve some malicious buyes (ha ae called piaes) ae colluding, hey can compae hei copies and deec diffeen posiions. Colluding buyes have he abiliy o ease o change deeced posiions and consuc some illegal maks. In ode o fomulae hese condiions we hhaji@sbu.ac.i. This eseach was in pa suppoed by a gan fom IPM (No ). f.moazami@alzaha.ac.i c 202 Discee Mahemaics and Theoeical Compue Science (DMTCS), Nancy, Fance
2 262 Hossein Hajiabolhassan and Faokhlagha Moazami conside he following definiions and noaions. Le {0, } v and =. is called a (v, )-code and evey elemen of is said o be a codewod. We wie w i fo he ih componen of a wod w. Also, he incidence maix of is a v maix whose ows ae he codewods in. Suppose C = {w (u),w (u2),...,w (ud) } {0, } v. Fo i 2{, 2,...,v}, he ih componen is said undeecable fo he coaliion C if w (u) i = w (u2) i = = w (u d) i. Le U(C) be he se of undeecable componens fo C. The se F (C) ={x 2{0, } v : x U(C) = w (ui) U(C) fo all w (ui) 2 C} epesens all possible v-uples ha could be poduced by he coaliion C by compaing he d codewods. Definiion An -famepoof code is a subse {0, } v such ha fo evey C whee C apple, we have F (C) \ =C. Le FPC(v, b) denoes an -famepoof code {0, } v such ha = b. The codewods in he se ae called egiseed codewods. Theefoe, if we have an -famepoof code, hen he piae in he se C couldn poduce a egiseed illegal codewod ohe han hei maks; ha is no appopiae fo he piae copy. Fo moe deails abou famepoof codes; see [, 2,, 3, 4]. The following heoem was poved by Sinson, Tung, and Wei [0]. Theoem [0] Suppose is an FPC(v, b) wih b>2. Suppose D, whee D =2. Then hee exiss an unegiseed wod, say maj(d) 2{0, } v, such ha maj(d) 2 F (C) fo any C D wih C =. In view of he afoemenioned heoem, maj(d) is a codewod ha is poduced by he coaliion of evey -subse of he se D. Theefoe, in an FPC, hee exis some illegal maks such ha i is no possible o idenify a piae use. So hey consideed anohe condiion and defined secue famepoof codes in which disibuo is able o idenify a leas one piae of he guily coaliions. Definiion 2 Suppose ha is a (v, )-code. is said o be an -secue famepoof code if fo any C,C 2 wih C apple, C 2 apple, and C \ C 2 =?, we have F (C ) \ F (C 2 )=?. Also, is emed an SFPC(v, ), fo sho. In fac, when an illegal mak can be poduced by wo diffeen -subses, in an SFPC, hee exiss a leas one use in hei inesecion; whose can be consideed as a piae use. Sinson and Wei in [0] sudied he elaionship beween binay secue famepoof codes and combinaoial aspecs. In his pape, we esablish he elaionship beween his concep and biclique cove. By a biclique we mean a bipaie gaph wih veex se (X, Y ) such ha evey veex in X is adjacen o evey veex in Y. Noe ha evey empy gaph is a biclique. A d-biclique cove of a gaph G of size s is a collecion of s bicliques of G such ha each edge of G is in a leas d of he bicliques. The d-biclique coveing numbe of G, denoed by bc d (G), is defined o be he minimum numbe of s such ha hee exiss a d-biclique cove of size s fo he gaph G. Fo abbeviaion, le bc(g) sand fo bc (G). Definiion 3 Le X be an n-se and F = {B,...,B } be a family of subses of X. F is called an (, w; d)-cove-fee family if fo any wo subses I, J [] such ha I =, J = w, and I \ J =?, he following condiion holds ( \ B i ) \ ( [ B j ) d. i2i j2j
3 Secue Famepoof Codes Though Biclique Coves 263 We denoe i biefly by (, w; d) CFF(n, ). The minimum numbe of elemens of X fo which hee exiss an (, w; d) CFF wih membes is denoed by N((, w; d),). Fo convenience, we use he noaion N((, w),) insead of N((, w; ),). This paamee has been sudied exensively in he lieaue; see [4, 5, 7, 2]. The incidence maix of an (, w; d) CFF is a n binay maix A such ha a ij =wheneve j 2 B i and a ij =0ohewise. As usual, we denoe by [] he se {, 2,...,}, and denoe by [] he collecion of all -subses of[]. The gaph I (, w) is a bipaie gaph wih he veex se ( [] w, [] ) fo which a w-subse is adjacen o an -subse wheneve hei inesecion is empy. Theoem 2 [5] Fo any posiive ineges, w, d, and, whee N((, w; d),)=bc d (I (, w)). + w, we have Thoughou his pape, we only conside finie simple gaphs. Fo a gaph G, le V (G) and E(G) denoe [] is veex and edge ses, especively. The Knese gaph KG(, ) is he gaph wih veex se, and A is adjacen o B if A \ B =?. Ahomomophism fom G o H is a map : V (G)! V (H) such ha adjacen veices in G ae mapped ino adjacen veices in H, i.e., uv 2 E(G) implies (u) (v) 2 E(H). In addiion, if any edge in H is he image of some edge ing, hen is emed an ono-edge homomophism. In his pape, by A c we mean he complemen of he se A. In Secion 2, we show ha fo 2, an -secue famepoof code of size and lengh v exiss if and only if hee exiss a -biclique cove of size v fo he Knese gaph KG(, ). Also, we wish o invesigae some connecion beween he d-biclique coveing numbe of Knese gaphs and cove-fee families. Moeove, we pesen an uppe bound fo he biclique coveing numbe of Knese gaphs. In Secion 3, we will look moe closely a he biclique coveing numbe of Knese gaphs. Also, i is shown ha if hee exiss a Hadamad maix of ode 4d, hen N((, ; d), 8d 2) = 4d and bc 2d (K 8d )=4d. 2 Secue Famepoof Codes Fo a subse A i of [], he indicao veco of A i is he veco v Ai =(v,...,v ), whee v j =if j 2 A i and v j =0ohewise. Theoem 3 Le,, and v be posiive ineges, whee 2. An SFPC(v, ) exiss if and only if hee exiss a biclique cove of size v fo he Knese gaph KG(, ). Poof: Assume ha A is he incidence maix of an se A j as follows A j def = {i apple i apple, a ij =}. SFPC(v, ). Assign o he jh column of A, he Now, fo apple j apple v, consuc he bicliques G j wih veex se (X j,y j ), whee he veices ofx j ae all -subses of A j and he veices of Y j ae all -subses of A c j, i.e., [] \ A j. I is easily seen ha G j, fo apple j apple v, is a complee bipaie gaph of KG(, ). Le C C 2 be an abiay edge of KG(, ). So C,C 2 [], and C \ C 2 =?. Since A is he incidence maix of an SFPC(v, ), we have F (C ) \ F (C 2 )=?. This means ha hee exiss a bi posiion i such ha he ih bi of all code wods of C is c i, fo some c i 2{0, }, and also he ih bi of all codewods of C 2 is c i + (mod 2). So hee exiss a column of A such ha all enies coesponding o he ows of C ae equal o and all enies coesponding o he ows ofc 2 ae equal o 0, o vice vesa. Hence, C C 2 2 E(G i ). Convesely, assume
4 264 Hossein Hajiabolhassan and Faokhlagha Moazami ha we have a biclique cove of size v fo he gaph KG(, ). Ou objecive is o consuc an -SFPC. Label gaphs in his biclique cove wih G,...,G v, whee G i has as is veex se (X i,y i ). Le A i be he union of ses ha lie in X i. Conside he indicao vecos of A i s, fo apple i apple v, and consuc he maix A whose columns ae hese vecos. Assume ha C and C 2 ae wo disjoin subses of [] of size, i.e., C C 2 2 E(KG(, )). Le G i be he complee bipaie gaph ha coves he edge C C 2. Then in he ih column of he maix A all enies coesponding o he ows of C ae equal o and all enies coesponding o he ows of C 2 ae equal o 0, o vice vesa. Consequenly, F (C ) \ F (C 2 )=?. 2 A coveing of a gaph G is a subse K of V (G) such ha evey edge of G has a leas one end in K. The numbe of veices in a minimum coveing of G is called he coveing numbe of G and denoed by (G). In [0], Sinson, Tung, and Wei consuc an SFPC(2 2, 2 + ). Coollay [0] Fo any inege 0, hee exiss an SFPC(2 2, 2 + ). Poof: Easily, one can check ha he biclique coveing numbe of a gaph G wihou C 4 as a subgaph is equal o he coveing numbe of G. On he ohe hand, KG(2 +,) does no conain C 4 as a subgaph. So bc(kg(2 +,))) = (KG(2 +,)). Also, i is a well-known fac ha (KG(, )) =. An easy compuaion confims he asseion. 2 In he nex heoem, we show he elaionship beween he d-biclique cove of Knese gaphs and covefee families. Theoem 4 Fo any posiive ineges, d, and, whee 2, i holds ha bc 2d (KG(, )) apple N((, ; d),) apple 2bc d (KG(, )). Poof: Fis, assume ha we have an opimal (, ; d) CFF(n, ), i.e., n = N((, ; d),) wih incidence maix A. Assign o he jh column of A, he se A j as follows A j def = {i apple i apple, a ij =}. Conside he biclique G j wih veex se (X j,y j ), whee he veices of X j ae all -subses of A j and he veices of Y j ae all -subses of A c j. Also, wo veices ae adjacen if he subses coesponding o hese veices ae disjoin. I is no difficul o see ha G j s, fo apple j apple N((, ; d),), fom a 2d-biclique cove of KG(, ). So bc 2d (KG(, )) apple N((, ; d),). Convesely, assume ha we have a d-biclique cove of KG(, ). Label gaphs in his biclique cove wih G,...,G l, whee G i has as is veex se (X i,y i ). Le A i be he union of ses ha lie in X i and B i be he union of ses ha lie in Y i. Obviously, A i and B i ae disjoin. Conside he indicao vecos of A i s and B i s, fo i =,...,l. Consuc he maix A whose columns ae hese vecos. Then A is he incidence maix of an (, ; d) CFF(2l, ). So N((, ; d),) apple 2bc d (KG(, )). 2 Coollay 2 Fo any posiive ineges, and, whee 2, i holds ha bc 2 (KG(, )) apple N((, ),) apple 2bc(KG(, )). A simila esul has been obained by Sinson e al. [0]. Theoem 5 [0] Le and be posiive ineges, whee 2, hen. If hee exiss an SFPC(v, ), hen hee exiss an (, ) CFF(2v, ).
5 Secue Famepoof Codes Though Biclique Coves Any (, )-cove fee family is an -secue famepoof code. Sinson e al. [0] have obained he following uppe bounds fo SFPC. Theoem 6 [0] Suppose ha and ae posiive ineges and p = 2 2. If hen hee exiss an SFPC(v, ). v ln( 2( )( )) ln p, The following uppe bound is shown in Deng e al. [3], by he Lovász Local Lemma. Theoem 7 [3] Thee exiss an whee SFPC(v, ) if v ln(e(( )( ) ( 2 )( 3 ))) ln p, p = 2. 2 Le p = 2. Using he appoximaion e x x, if we se x = 2 2, hen we can see ha 2 ln p 22. In he nex heoem, by he alenaion mehod, we pesen a bound ha is a sligh impovemen of Theoem 6. Also, i is a sligh impovemen of Theoem 7 povided ha is no lage elaive o. Theoem 8 Le and be posiive ineges. If >3 and hen hee exiss an v 2 2 ( + ln( d 2 e SFPC(v, ). Poof: We show ha if v b2 2 ( + ln( d 2 e Q b 2 c )) i=0 Q b 2 c )) i=0 ( 2i+ ), ( 2i+ )c, hen hee exiss a biclique [] cove of size v fo he Knese gaph KG(, ). Le A be d 2 e. Fo evey membe of A, say A i, we can consuc he biclique G i wih veex se (X i,y i ), whee he veices of X i ae all -subses of A i and he veices of Y i ae all -subses of A c i. We define B o be he collecion of hese bicliques. Le p 2 [0, ] be abiay, lae, we specify an opimized value fo p. Le us pick, andomly and independenly, each biclique of B wih pobabiliy p and F be he andom se of all bicliques picked and le Y F be he se of all edges AB of he gaph KG(, ) which ae no coveed by he se F. The expeced value of F is clealy d 2 e p. Fo evey edge AB, p(ab 2 Y F)=( p) l whee l =2 2 d 2 e. So he expeced value of he F + Y F is a mos d 2 e p + 2 ( p) 2( 2 d 2 e ). If we se F 0 = F S Y F, hen clealy all edges of he gaph KG(, ) ae coveed by F 0. So we wan o esimae p such ha F 0 is minimum. Fo convenien, we bound p apple e p o obain E( F + Y F ) apple d 2 e p + 2 e 2( 2 d 2 e )p. The igh hand side is minimized a p = ln, which = d 2 e b 2 c and =2 2 d 2 e whee p 2 [0, ] if is sufficienly lage espec o (e.g., >3). So we have an SFPC(v, ) ha
6 266 Hossein Hajiabolhassan and Faokhlagha Moazami v apple ( d 2 e ) 2( 2 d 2 e Fuhemoe, i is saighfowad o check ha 2 e ) ( + ln( d b 2 c )). ( d 2 ) Q e apple 2( 2 22 ( d ) 2 2i+ ). e Hence, he bound follows. 2 i=0 3 Biclique Cove of Knese Gaphs By he menioned esuls in he pevious secion, i may be of inees o find some bounds fo he biclique coveing numbe of Knese gaphs. Theoem 9 Fo any posiive ineges d,, s, and, whee >2 and >s, we have whee m = N(( s, s; d), 2s). bc d (KG(, )) bc m (KG(, s)), Poof: Le {G,G 2,...,G l } be an opimal d-biclique cove of KG(, ). Also, assume ha G i has as is veex se (X i,y i ). Le A i and B i be he union of ses ha lie in X i and Y i, especively. Fo any apple i apple l, conside he biclique G 0 i, as a subgaph of KG(, s), wih veex se (X0 i,y0 i ), whee X0 i is he se of all s-subses of A i and Yi 0 is he se of all s-subses of B i. One can check hag 0 i s cove all edges of KG(, s). Moeove, any edge UV 2 E(KG(, s)) is conained in a leas m-bicliques, whee m = N(( s, s; d), 2s). To see his, conside he bipaie gaph I {U,V } (as an induced subgaph of KG(, )) wih veex se (X U,Y V ), whee X U = {W U W [],W \ V = ;, W = } Y V = {W V W [],W \ U = ;, W = }. I is a simple mae o check ha I {U,V } and I 2s ( s, s) ae isomophic. Also, if G j coves any edge of I {U,V }, hen UV is conained in G 0 j. Consequenly, by Theoem 2 he asseion follows. 2 In view of he poof of Theoem 9, similaly, one can exend any biclique of I (, w) o a biclique of I ( i, w j). Consequenly, we have he following heoem. Theoem 0 Le d,, w, and be posiive ineges, whee + w. Fo any apple i<and apple j<w, we have N((, w; d),) N(( i, w j; m),), whee m = N((i, j; d), w + i + j). The facional biclique coveing numbe bc (G) is defined as follows bc bc d (G) bc d (G) (G) =inf = lim. d d d! d I is known ha if a gaph is edge-ansiive, hen one can compue is facional biclique coveing numbe, see [9] fo moe abou facional gaph heoy. Theoem [9] Fo evey non-empy edge-ansiive gaph G, bc (G) = E(G) B(G), whee B(G) is he maximum numbe of edges among he bicliques of G.
7 Secue Famepoof Codes Though Biclique Coves 267 The nex esul is a consequence of Theoem 0. Theoem 2 [2] Le d,, w, i, j, and be non-negaive ineges, whee apple j<w. Then N((, w; d),) N((i, j; d), w + i + j) min w japplemapple +i + w, apple i<, and m w+i+j m w+j. Poof: In view of definiion of facional biclique cove and since bc s (G) apple s.bc (G) fo evey posiive ineges and s, one can conclude ha fo evey gaph G, we have.bc (G) apple bc (G). By his fac and using Theoem 0, we have N((, w; d),) N((i, j; d), w + i + j)bc (I ( i, w j)). () The gaph I (, w) is an edge-ansiive gaph. Theefoe, using Theoem and an easy calculaion bc (I (, w)) = min = w 0 00 w Theefoe, accoding o he inequaliy i follows ha = min wapplemapple m w m w N((, w; d),) N((i, j; d), w + i + j) min w japplemapple +i. m w+i+j m w+j We know ha he image of a biclique unde a gaph homomophism is a biclique. This leads us o he following lemma. Lemma Le G and H be wo gaphs and : G! H be an ono-edge homomophism. Also, assume ha d and ae posiive ineges and fo any edge e 2 E(H), bc d ( (e)). Then bc d (G) bc (H). Poof: Le {K,K 2,...,K l } be an opimal d-biclique cove of G. One can check ha fo any 0 apple i apple l, (K i ) is a biclique and he family { (K ), (K 2 ),..., (K l )} is a -biclique cove of H. 2 Poposiion Fo any posiive ineges and, whee >2, we have bc d (KG(, )) bc 3d (KG( 2, )). Poof: Fis, we pesen an ono-edge homomophism fom KG(, ) o KG( 2, ). To see his, fo evey veex A of KG(, ), define (A) :=A 0 as follows. If A does no conain boh and, hen define A 0 := A \{maxa}. Ohewise, se A 0 := {x}[a\{, }, whee x is he maximum elemen of [ 2] absen fom A. I is simple o check ha he subgaph induced by he invese image of any edge of KG( 2, ) conains an induced cycle of size six o an induced maching of size hee. Hence, in view of Lemma, if {K,...,K l } is a d-biclique cove of KG(, ), hen { (K ),..., (K l )} is a 3dbiclique cove of KG( 2, ). 2 The afoemenioned esuls moivae us o conside he following quesion. Quesion Le d,, and be posiive ineges, whee >2. Wha is he exac value of bc d (KG(, ))?. 2
8 268 Hossein Hajiabolhassan and Faokhlagha Moazami Deemining he exac value of he paamee N((, w; d),), even fo special, w, d and, is an ineesing and challenging poblem ha is sudied in he lieaue; see [5, 6, 7, 8]. An n n maix H wih enies + and is called a Hadamad maix of ode n wheneve HH = ni. I is no difficul o see ha any wo columns of H ae also ohogonal. If we pemue ows o columns o if we muliply some ows o columns by, hen his popey does no change. Two such Hadamad maices ae called equivalen. Fo a given Hadamad maix, we can find an equivalen one fo which he fis ow and he fis column consis eniely of +ï 2s. Such a Hadamad maix is called nomalized. We will denoe by K m,m he complee bipaie gaph wih a pefec maching emoved. Obviously, K m,m is isomophic o I m (, ). Theoem 3 Le d be a posiive inege such ha hee exiss a Hadamad maix of ode 4d, hen. bc 2d (K 8d )=4d, 2. N((, ; d), 8d 2) = bc d (K 8d 2,8d 2 )=4d. Poof: Le H =[h ij ] be a Hadamad maix of ode 4d. Suppose ha K 8d has {u,...,u 4d,v,...,v 4d } as is veex se. Fo he jh column of H, wo ses X j and Y j ae defined as follows X j := {u i h ij =+}[{v i h ij = } & Y j := {u i h ij = }[{v i h ij =+}. By consucing a bipaie gaph G j wih veex se (X j,y j ), indeed, we assign a biclique o each column. I is well-known ha fo any wo ows of a Hadamad maix, he numbe of columns fo which coesponding enies in hese ows ae diffeen in sign, ae equal o 2d. So, fo i 6= j he edges u i u j, v i v j, and u i v j of he gaph K 8d ae coveed by 2d bicliques. Also, fo he edge u i v i, hee exis 4d bicliques ha cove i. Accoding o he above agumen evey edge is coveed a leas 2d imes, so bc 2d (K 8d ) apple 4d. On he ohe hand, fo evey gaph G, we have E(G) B(G) edges among he bicliques of G. Theefoe, apple bc d(g) d 4d 2 apple bc 2d(K 8d )., whee B(G) is he maximum numbe of Since bc 2d (K 8d ) is an inege, we have 4d apple bc 2d (K 8d ) which complees he poof. Fo he poof of he second pa, assume ha H is a nomalized Hadamad maix of ode 4d. Delee he fis ow of H and denoe i by H 0 =[h 0 ij ]. Also, assume ha K 8d 2,8d 2 has (X, Y ) as is veex se whee X = {u,...,u 4d,v,...,v 4d }, Y = {u 0,...,u 0 4d,v0,...,v4d 0 }, and u iu 0 i,v ivi 0 62 E(K 8d 2,8d 2 ). Assign o he jh column of H 0, wo ses X j and Y j as follows X j := {u i h 0 ij =+}[{v i h 0 ij = } & Y j := {u 0 i h0 ij = }[{v0 i h0 ij =+}. By he same agumen in he fis pa of he poof and using he well-known fac ha in H 0 evey wo disinc ows i, j and fo any a, b 2 {, +} hee ae exacly dcolumns ha he coesponding enies ae a and b in he ows i and j, especively, one can see ha evey edge is coveed a leas d imes. So 2d bc d (K 8d 2,8d 2 ) apple 4d. On he ohe hand, 4d 4d apple bc d(k 8d 2,8d 2 ), and 2d 4d <. Theefoe, 4d apple bc d (K 8d 2,8d 2 ) which esablishes he second pa. 2
9 Secue Famepoof Codes Though Biclique Coves 269 Acknowledgemens This pape has been evised and esubmied fo eview while Hossein Hajiabolhassn was on leave a Technical Univesiy of Denmak (he academic yea ). Hossein Hajiabolhassan is gaeful o pofesso Casen Thomassen fo his hospialiy and suppo. Also, he auhos wish o hank he anonymous efeees fo hei useful commens. Refeences [] Simon R. Blackbun. Famepoof codes. SIAM J. Discee Mah., 6(3): (eleconic), [2] Dan Boneh and James Shaw. Collusion-secue fingepining fo digial daa. IEEE Tans. Infom. Theoy, 44(5): , 998. [3] D. Deng, D. R. Sinson, and R. Wei. The Lovász local lemma and is applicaions o some combinaoial aays. Des. Codes Cypog., 32(-3):2 34, [4] A. D yachkov, P. Vilenkin, and S. Yekhanin. Uppe bounds on he ae of supeimposed (s, l)- codes based on engel s inequaliy. In Poceedings of he Inenaional Conf. on Algebaic and Combinaoial Coding Theoy (ACCT), pages 95 99, [5] H. Hajiabolhassan and F. Moazami. Some new bounds on cove-fee families hough biclique coves. Discee Mah., 32(24): , 202. [6] Hyun Kwang Kim, Vladimi Lebedev, and Dong Yeol Oh. Some new esuls on supeimposed codes. J. Combin. Des., 3(4): , [7] Sh. Kh. Kim and V. S. Lebedev. On he opimaliy of ivial (w, )-cove-fee codes. Poblemy Peedachi Infomasii, 40(3):3 20, [8] P. C. Li, G. H. J. van Rees, and R. Wei. Consucions of 2-cove-fee families and elaed sepaaing hash families. J. Combin. Des., 4(6): , [9] E. R. Scheineman and D. H. Ullman. Facional gaph heoy. Wiley-Inescience Seies in Discee Mahemaics and Opimizaion. John Wiley & Sons Inc., New Yok, 997. A aional appoach o he heoy of gaphs, Wih a foewod by Claude Bege, A Wiley-Inescience Publicaion. [0] D. R. Sinson, Tan van Tung, and R. Wei. Secue famepoof codes, key disibuion paens, goup esing algoihms and elaed sucues. J. Sais. Plann. Infeence, 86(2):595 67, Special issue in hono of Pofesso Ralph Sanon. [] D. R. Sinson and R. Wei. Combinaoial popeies and consucions of aceabiliy schemes and famepoof codes. SIAM J. Discee Mah., ():4 53 (eleconic), 998. [2] D. R. Sinson and R. Wei. Genealized cove-fee families. Discee Mah., 279(-3): , In honou of Zhu Lie. [3] Gábo Tados. Opimal pobabilisic fingepin codes. In Poceedings of he Thiy-Fifh Annual ACM Symposium on Theoy of Compuing, pages 6 25 (eleconic), New Yok, ACM. [4] Gábo Tados. Opimal pobabilisic fingepin codes. J. ACM, 55(2):A. 0, 24, 2008.
10 270 Hossein Hajiabolhassan and Faokhlagha Moazami
Extremal problems for t-partite and t-colorable hypergraphs
Exemal poblems fo -paie and -coloable hypegaphs Dhuv Mubayi John Talbo June, 007 Absac Fix ineges and an -unifom hypegaph F. We pove ha he maximum numbe of edges in a -paie -unifom hypegaph on n veices
More informationOn Control Problem Described by Infinite System of First-Order Differential Equations
Ausalian Jounal of Basic and Applied Sciences 5(): 736-74 ISS 99-878 On Conol Poblem Descibed by Infinie Sysem of Fis-Ode Diffeenial Equaions Gafujan Ibagimov and Abbas Badaaya J'afau Insiue fo Mahemaical
More information336 ERIDANI kfk Lp = sup jf(y) ; f () jj j p p whee he supemum is aken ove all open balls = (a ) inr n, jj is he Lebesgue measue of in R n, () =(), f
TAMKANG JOURNAL OF MATHEMATIS Volume 33, Numbe 4, Wine 2002 ON THE OUNDEDNESS OF A GENERALIED FRATIONAL INTEGRAL ON GENERALIED MORREY SPAES ERIDANI Absac. In his pape we exend Nakai's esul on he boundedness
More informationThe shortest path between two truths in the real domain passes through the complex domain. J. Hadamard
Complex Analysis R.G. Halbud R.Halbud@ucl.ac.uk Depamen of Mahemaics Univesiy College London 202 The shoes pah beween wo uhs in he eal domain passes hough he complex domain. J. Hadamad Chape The fis fundamenal
More informationWide-sense fingerprinting codes and honeycomb arrays
Wide-sense fingepining codes and honeycomb aays Anasasia Panoui Technical Repo RHUL MA 01 5 9Febuay01 Depamen of Mahemaics Royal Holloway, Univesiy of London Egham, Suey TW0 0EX, England hp://www.hul.ac.uk/mahemaics/echepos
More informationSections 3.1 and 3.4 Exponential Functions (Growth and Decay)
Secions 3.1 and 3.4 Eponenial Funcions (Gowh and Decay) Chape 3. Secions 1 and 4 Page 1 of 5 Wha Would You Rahe Have... $1million, o double you money evey day fo 31 days saing wih 1cen? Day Cens Day Cens
More informationCombinatorial Approach to M/M/1 Queues. Using Hypergeometric Functions
Inenaional Mahemaical Foum, Vol 8, 03, no 0, 463-47 HIKARI Ld, wwwm-hikaicom Combinaoial Appoach o M/M/ Queues Using Hypegeomeic Funcions Jagdish Saan and Kamal Nain Depamen of Saisics, Univesiy of Delhi,
More informationVariance and Covariance Processes
Vaiance and Covaiance Pocesses Pakash Balachandan Depamen of Mahemaics Duke Univesiy May 26, 2008 These noes ae based on Due s Sochasic Calculus, Revuz and Yo s Coninuous Maingales and Bownian Moion, Kaazas
More informationQuantum Algorithms for Matrix Products over Semirings
CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE 2017, Aicle 1, pages 1 25 hp://cjcscsuchicagoedu/ Quanum Algoihms fo Maix Poducs ove Semiings Fançois Le Gall Haumichi Nishimua Received July 24, 2015; Revised
More informationarxiv: v1 [math.co] 4 Apr 2019
Dieced dominaion in oiened hypegaphs axiv:1904.02351v1 [mah.co] 4 Ap 2019 Yai Cao Dep. of Mahemaics Univesiy of Haifa-Oanim Tivon 36006, Isael yacao@kvgeva.og.il This pape is dedicaed o Luz Volkmann on
More information7 Wave Equation in Higher Dimensions
7 Wave Equaion in Highe Dimensions We now conside he iniial-value poblem fo he wave equaion in n dimensions, u c u x R n u(x, φ(x u (x, ψ(x whee u n i u x i x i. (7. 7. Mehod of Spheical Means Ref: Evans,
More information@FMI c Kyung Moon Sa Co.
Annals of Fuzzy Mahemaics Infomaics Volume, No. 2, (Apil 20), pp. 9-3 ISSN 2093 930 hp://www.afmi.o.k @FMI c Kyung Moon Sa Co. hp://www.kyungmoon.com On lacunay saisical convegence in inuiionisic fuzzy
More informationFuzzy Hv-submodules in Γ-Hv-modules Arvind Kumar Sinha 1, Manoj Kumar Dewangan 2 Department of Mathematics NIT Raipur, Chhattisgarh, India
Inenaional Jounal of Engineeing Reseach (IJOER) [Vol-1, Issue-1, Apil.- 2015] Fuzz v-submodules in Γ-v-modules Avind Kuma Sinha 1, Manoj Kuma Dewangan 2 Depamen of Mahemaics NIT Raipu, Chhaisgah, India
More informationON 3-DIMENSIONAL CONTACT METRIC MANIFOLDS
Mem. Fac. Inegaed As and Sci., Hioshima Univ., Se. IV, Vol. 8 9-33, Dec. 00 ON 3-DIMENSIONAL CONTACT METRIC MANIFOLDS YOSHIO AGAOKA *, BYUNG HAK KIM ** AND JIN HYUK CHOI ** *Depamen of Mahemaics, Faculy
More informationDegree of Approximation of a Class of Function by (C, 1) (E, q) Means of Fourier Series
IAENG Inenaional Jounal of Applied Mahemaic, 4:, IJAM_4 7 Degee of Appoximaion of a Cla of Funcion by C, E, q Mean of Fouie Seie Hae Kihna Nigam and Kuum Shama Abac In hi pape, fo he fi ime, we inoduce
More informationMEEN 617 Handout #11 MODAL ANALYSIS OF MDOF Systems with VISCOUS DAMPING
MEEN 67 Handou # MODAL ANALYSIS OF MDOF Sysems wih VISCOS DAMPING ^ Symmeic Moion of a n-dof linea sysem is descibed by he second ode diffeenial equaions M+C+K=F whee () and F () ae n ows vecos of displacemens
More informationSTUDY OF THE STRESS-STRENGTH RELIABILITY AMONG THE PARAMETERS OF GENERALIZED INVERSE WEIBULL DISTRIBUTION
Inenaional Jounal of Science, Technology & Managemen Volume No 04, Special Issue No. 0, Mach 205 ISSN (online): 2394-537 STUDY OF THE STRESS-STRENGTH RELIABILITY AMONG THE PARAMETERS OF GENERALIZED INVERSE
More informationAn Automatic Door Sensor Using Image Processing
An Auomaic Doo Senso Using Image Pocessing Depamen o Elecical and Eleconic Engineeing Faculy o Engineeing Tooi Univesiy MENDEL 2004 -Insiue o Auomaion and Compue Science- in BRNO CZECH REPUBLIC 1. Inoducion
More informationLecture 22 Electromagnetic Waves
Lecue Elecomagneic Waves Pogam: 1. Enegy caied by he wave (Poyning veco).. Maxwell s equaions and Bounday condiions a inefaces. 3. Maeials boundaies: eflecion and efacion. Snell s Law. Quesions you should
More informationOn The Estimation of Two Missing Values in Randomized Complete Block Designs
Mahemaical Theoy and Modeling ISSN 45804 (Pape ISSN 505 (Online Vol.6, No.7, 06 www.iise.og On The Esimaion of Two Missing Values in Randomized Complee Bloc Designs EFFANGA, EFFANGA OKON AND BASSE, E.
More informationMATHEMATICAL FOUNDATIONS FOR APPROXIMATING PARTICLE BEHAVIOUR AT RADIUS OF THE PLANCK LENGTH
Fundamenal Jounal of Mahemaical Phsics Vol 3 Issue 013 Pages 55-6 Published online a hp://wwwfdincom/ MATHEMATICAL FOUNDATIONS FOR APPROXIMATING PARTICLE BEHAVIOUR AT RADIUS OF THE PLANCK LENGTH Univesias
More informationBMOA estimates and radial growth of B φ functions
c Jounal of echnical Univesiy a Plovdiv Fundamenal Sciences and Applicaions, Vol., 995 Seies A-Pue and Applied Mahemaics Bulgaia, ISSN 3-827 axiv:87.53v [mah.cv] 3 Jul 28 BMOA esimaes and adial gowh of
More informationDeviation probability bounds for fractional martingales and related remarks
Deviaion pobabiliy bounds fo facional maingales and elaed emaks Buno Sausseeau Laboaoie de Mahémaiques de Besançon CNRS, UMR 6623 16 Roue de Gay 253 Besançon cedex, Fance Absac In his pape we pove exponenial
More informationComputer Propagation Analysis Tools
Compue Popagaion Analysis Tools. Compue Popagaion Analysis Tools Inoducion By now you ae pobably geing he idea ha pedicing eceived signal sengh is a eally impoan as in he design of a wieless communicaion
More informationReinforcement learning
Lecue 3 Reinfocemen leaning Milos Hauskech milos@cs.pi.edu 539 Senno Squae Reinfocemen leaning We wan o lean he conol policy: : X A We see examples of x (bu oupus a ae no given) Insead of a we ge a feedback
More informationRepresenting Knowledge. CS 188: Artificial Intelligence Fall Properties of BNs. Independence? Reachability (the Bayes Ball) Example
C 188: Aificial Inelligence Fall 2007 epesening Knowledge ecue 17: ayes Nes III 10/25/2007 an Klein UC ekeley Popeies of Ns Independence? ayes nes: pecify complex join disibuions using simple local condiional
More informationOrthotropic Materials
Kapiel 2 Ohoopic Maeials 2. Elasic Sain maix Elasic sains ae elaed o sesses by Hooke's law, as saed below. The sesssain elaionship is in each maeial poin fomulaed in he local caesian coodinae sysem. ε
More informationNOTE. Some New Bounds for Cover-Free Families
Jounal of Combinatoial Theoy, Seies A 90, 224234 (2000) doi:10.1006jcta.1999.3036, available online at http:.idealibay.com on NOTE Some Ne Bounds fo Cove-Fee Families D. R. Stinson 1 and R. Wei Depatment
More information, on the power of the transmitter P t fed to it, and on the distance R between the antenna and the observation point as. r r t
Lecue 6: Fiis Tansmission Equaion and Rada Range Equaion (Fiis equaion. Maximum ange of a wieless link. Rada coss secion. Rada equaion. Maximum ange of a ada. 1. Fiis ansmission equaion Fiis ansmission
More informationResearch on the Algorithm of Evaluating and Analyzing Stationary Operational Availability Based on Mission Requirement
Reseach on he Algoihm of Evaluaing and Analyzing Saionay Opeaional Availabiliy Based on ission Requiemen Wang Naichao, Jia Zhiyu, Wang Yan, ao Yilan, Depamen of Sysem Engineeing of Engineeing Technology,
More informationLecture-V Stochastic Processes and the Basic Term-Structure Equation 1 Stochastic Processes Any variable whose value changes over time in an uncertain
Lecue-V Sochasic Pocesses and he Basic Tem-Sucue Equaion 1 Sochasic Pocesses Any vaiable whose value changes ove ime in an unceain way is called a Sochasic Pocess. Sochasic Pocesses can be classied as
More informationLOGARITHMIC ORDER AND TYPE OF INDETERMINATE MOMENT PROBLEMS
LOGARITHMIC ORDER AND TYPE OF INDETERMINATE MOMENT PROBLEMS CHRISTIAN BERG AND HENRIK L. PEDERSEN WITH AN APPENDIX BY WALTER HAYMAN We invesigae a efined gowh scale, logaihmic gowh, fo indeeminae momen
More informationReichenbach and f-generated implications in fuzzy database relations
INTERNATIONAL JOURNAL O CIRCUITS SYSTEMS AND SIGNAL PROCESSING Volume 08 Reichenbach and f-geneaed implicaions in fuzzy daabase elaions Nedžad Dukić Dženan Gušić and Nemana Kajmoić Absac Applying a definiion
More information[ ] 0. = (2) = a q dimensional vector of observable instrumental variables that are in the information set m constituents of u
Genealized Mehods of Momens he genealized mehod momens (GMM) appoach of Hansen (98) can be hough of a geneal pocedue fo esing economics and financial models. he GMM is especially appopiae fo models ha
More informationResearch Article A Note on Multiplication and Composition Operators in Lorentz Spaces
Hindawi Publishing Copoaion Jounal of Funcion Spaces and Applicaions Volume 22, Aicle ID 29363, pages doi:.55/22/29363 Reseach Aicle A Noe on Muliplicaion and Composiion Opeaos in Loenz Spaces Eddy Kwessi,
More informationTHE MODULAR INEQUALITIES FOR A CLASS OF CONVOLUTION OPERATORS ON MONOTONE FUNCTIONS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 5, Numbe 8, Augus 997, Pages 93 35 S -9939(973867-7 THE MODULAR INEQUALITIES FOR A CLASS OF CONVOLUTION OPERATORS ON MONOTONE FUNCTIONS JIM QILE
More informationK. G. Malyutin, T. I. Malyutina, I. I. Kozlova ON SUBHARMONIC FUNCTIONS IN THE HALF-PLANE OF INFINITE ORDER WITH RADIALLY DISTRIBUTED MEASURE
Математичнi Студiї. Т.4, 2 Maemaychni Sudii. V.4, No.2 УДК 57.5 K. G. Malyuin, T. I. Malyuina, I. I. Kozlova ON SUBHARMONIC FUNCTIONS IN THE HALF-PLANE OF INFINITE ORDER WITH RADIALLY DISTRIBUTED MEASURE
More informationGeneral Non-Arbitrage Model. I. Partial Differential Equation for Pricing A. Traded Underlying Security
1 Geneal Non-Abiage Model I. Paial Diffeenial Equaion fo Picing A. aded Undelying Secuiy 1. Dynamics of he Asse Given by: a. ds = µ (S, )d + σ (S, )dz b. he asse can be eihe a sock, o a cuency, an index,
More informationNew sufficient conditions of robust recovery for low-rank matrices
New sufficien condiions of ous ecovey fo low-an maices Jianwen Huang a, Jianjun Wang a,, Feng Zhang a, Wendong Wang a a School of Mahemaics and Saisics, Souhwes Univesiy, Chongqing, 400715, China Reseach
More informationExponential and Logarithmic Equations and Properties of Logarithms. Properties. Properties. log. Exponential. Logarithmic.
Eponenial and Logaihmic Equaions and Popeies of Logaihms Popeies Eponenial a a s = a +s a /a s = a -s (a ) s = a s a b = (ab) Logaihmic log s = log + logs log/s = log - logs log s = s log log a b = loga
More information11!Hí MATHEMATICS : ERDŐS AND ULAM PROC. N. A. S. of decomposiion, properly speaking) conradics he possibiliy of defining a counably addiive real-valu
ON EQUATIONS WITH SETS AS UNKNOWNS BY PAUL ERDŐS AND S. ULAM DEPARTMENT OF MATHEMATICS, UNIVERSITY OF COLORADO, BOULDER Communicaed May 27, 1968 We shall presen here a number of resuls in se heory concerning
More informationLecture 18: Kinetics of Phase Growth in a Two-component System: general kinetics analysis based on the dilute-solution approximation
Lecue 8: Kineics of Phase Gowh in a Two-componen Sysem: geneal kineics analysis based on he dilue-soluion appoximaion Today s opics: In he las Lecues, we leaned hee diffeen ways o descibe he diffusion
More informationThe sudden release of a large amount of energy E into a background fluid of density
10 Poin explosion The sudden elease of a lage amoun of enegy E ino a backgound fluid of densiy ceaes a song explosion, chaaceized by a song shock wave (a blas wave ) emanaing fom he poin whee he enegy
More informationCS 188: Artificial Intelligence Fall Probabilistic Models
CS 188: Aificial Inelligence Fall 2007 Lecue 15: Bayes Nes 10/18/2007 Dan Klein UC Bekeley Pobabilisic Models A pobabilisic model is a join disibuion ove a se of vaiables Given a join disibuion, we can
More informationLow-complexity Algorithms for MIMO Multiplexing Systems
Low-complexiy Algoihms fo MIMO Muliplexing Sysems Ouline Inoducion QRD-M M algoihm Algoihm I: : o educe he numbe of suviving pahs. Algoihm II: : o educe he numbe of candidaes fo each ansmied signal. :
More informationDual Hierarchies of a Multi-Component Camassa Holm System
Commun. heo. Phys. 64 05 37 378 Vol. 64, No. 4, Ocobe, 05 Dual Hieachies of a Muli-Componen Camassa Holm Sysem LI Hong-Min, LI Yu-Qi, and CHEN Yong Shanghai Key Laboaoy of uswohy Compuing, Eas China Nomal
More informationON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS. D.A. Mojdeh and B. Samadi
Opuscula Math. 37, no. 3 (017), 447 456 http://dx.doi.og/10.7494/opmath.017.37.3.447 Opuscula Mathematica ON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS D.A. Mojdeh and B. Samadi Communicated
More informationAVERAGING OF ENTIRE FUNCTIONS OF IMPROVED REGULAR GROWTH WITH ZEROS ON A FINITE SYSTEM OF RAYS R.V. Khats
ÂIÑÍÈÊ ÍÀÖIÎÍÀËÜÍÎÃÎ ÓÍIÂÅÐÑÈÒÅÒÓ ËÜÂIÂÑÜÊÀ ÏÎËIÒÅÕÍIÊÀ Ôiçèêî-ìàòåìàòè íi íàóêè Âèï.718 718, (211) c. 114 JOURNAL OF NATIONAL UNIVERSITY LVIVSKA POLITECHNIKA Physical & mahemaical sciences Vol.718 No
More information156 There are 9 books stacked on a shelf. The thickness of each book is either 1 inch or 2
156 Thee ae 9 books sacked on a shelf. The hickness of each book is eihe 1 inch o 2 F inches. The heigh of he sack of 9 books is 14 inches. Which sysem of equaions can be used o deemine x, he numbe of
More informationDistribution Free Evolvability of Polynomial Functions over all Convex Loss Functions
Disibuion Fee Evolvabiliy of Polynomial Funcions ove all Convex Loss Funcions Paul Valian UC Beeley Beeley, Califonia pvalian@gmail.com ABSTRACT We fomulae a noion of evolvabiliy fo funcions wih domain
More informationMonochromatic Wave over One and Two Bars
Applied Mahemaical Sciences, Vol. 8, 204, no. 6, 307-3025 HIKARI Ld, www.m-hikai.com hp://dx.doi.og/0.2988/ams.204.44245 Monochomaic Wave ove One and Two Bas L.H. Wiyano Faculy of Mahemaics and Naual Sciences,
More informationAN EVOLUTIONARY APPROACH FOR SOLVING DIFFERENTIAL EQUATIONS
AN EVOLUTIONARY APPROACH FOR SOLVING DIFFERENTIAL EQUATIONS M. KAMESWAR RAO AND K.P. RAVINDRAN Depamen of Mechanical Engineeing, Calicu Regional Engineeing College, Keala-67 6, INDIA. Absac:- We eploe
More informationOn the Semi-Discrete Davey-Stewartson System with Self-Consistent Sources
Jounal of Applied Mahemaics and Physics 25 3 478-487 Published Online May 25 in SciRes. hp://www.scip.og/jounal/jamp hp://dx.doi.og/.4236/jamp.25.356 On he Semi-Discee Davey-Sewason Sysem wih Self-Consisen
More informationWe just finished the Erdős-Stone Theorem, and ex(n, F ) (1 1/(χ(F ) 1)) ( n
Lecure 3 - Kövari-Sós-Turán Theorem Jacques Versraëe jacques@ucsd.edu We jus finished he Erdős-Sone Theorem, and ex(n, F ) ( /(χ(f ) )) ( n 2). So we have asympoics when χ(f ) 3 bu no when χ(f ) = 2 i.e.
More informationLecture 20: Riccati Equations and Least Squares Feedback Control
34-5 LINEAR SYSTEMS Lecure : Riccai Equaions and Leas Squares Feedback Conrol 5.6.4 Sae Feedback via Riccai Equaions A recursive approach in generaing he marix-valued funcion W ( ) equaion for i for he
More informationSUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER
Discussiones Mathematicae Gaph Theoy 39 (019) 567 573 doi:10.7151/dmgt.096 SUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER Lutz Volkmann
More informationOnline Completion of Ill-conditioned Low-Rank Matrices
Online Compleion of Ill-condiioned Low-Rank Maices Ryan Kennedy and Camillo J. Taylo Compue and Infomaion Science Univesiy of Pennsylvania Philadelphia, PA, USA keny, cjaylo}@cis.upenn.edu Laua Balzano
More informationGRADIENT ESTIMATES, POINCARÉ INEQUALITIES, DE GIORGI PROPERTY AND THEIR CONSEQUENCES
GRADIENT ESTIMATES, POINCARÉ INEQUALITIES, DE GIORGI PROPERTY AND THEIR CONSEQUENCES FRÉDÉRIC ERNICOT, THIERRY COULHON, DOROTHEE FREY Absac. On a doubling meic measue space endowed wih a caé du champ,
More informationENGI 4430 Advanced Calculus for Engineering Faculty of Engineering and Applied Science Problem Set 9 Solutions [Theorems of Gauss and Stokes]
ENGI 44 Avance alculus fo Engineeing Faculy of Engineeing an Applie cience Poblem e 9 oluions [Theoems of Gauss an okes]. A fla aea A is boune by he iangle whose veices ae he poins P(,, ), Q(,, ) an R(,,
More informationPOSITIVE SOLUTIONS WITH SPECIFIC ASYMPTOTIC BEHAVIOR FOR A POLYHARMONIC PROBLEM ON R n. Abdelwaheb Dhifli
Opuscula Mah. 35, no. (205), 5 9 hp://dx.doi.og/0.7494/opmah.205.35..5 Opuscula Mahemaica POSITIVE SOLUTIONS WITH SPECIFIC ASYMPTOTIC BEHAVIOR FOR A POLYHARMONIC PROBLEM ON R n Abdelwaheb Dhifli Communicaed
More informationModelling Dynamic Conditional Correlations in the Volatility of Spot and Forward Oil Price Returns
Modelling Dynamic Condiional Coelaions in he Volailiy of Spo and Fowad Oil Pice Reuns Maeo Manea a, Michael McAlee b and Magheia Gasso c a Depamen of Saisics, Univesiy of Milan-Bicocca and FEEM, Milan,
More informationA note on characterization related to distributional properties of random translation, contraction and dilation of generalized order statistics
PobSa Foum, Volume 6, July 213, Pages 35 41 ISSN 974-3235 PobSa Foum is an e-jounal. Fo eails please visi www.pobsa.og.in A noe on chaaceizaion elae o isibuional popeies of anom anslaion, conacion an ilaion
More informationMatrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality
Marix Versions of Some Refinemens of he Arihmeic-Geomeric Mean Inequaliy Bao Qi Feng and Andrew Tonge Absrac. We esablish marix versions of refinemens due o Alzer ], Carwrigh and Field 4], and Mercer 5]
More informationThe Production of Polarization
Physics 36: Waves Lecue 13 3/31/211 The Poducion of Polaizaion Today we will alk abou he poducion of polaized ligh. We aleady inoduced he concep of he polaizaion of ligh, a ansvese EM wave. To biefly eview
More informationMonochromatic Infinite Sumsets
Monochromaic Infinie Sumses Imre Leader Paul A. Russell July 25, 2017 Absrac WeshowhahereisaraionalvecorspaceV suchha,whenever V is finiely coloured, here is an infinie se X whose sumse X+X is monochromaic.
More informationOn the local convexity of the implied volatility curve in uncorrelated stochastic volatility models
On he local conexiy of he implied olailiy cue in uncoelaed sochasic olailiy models Elisa Alòs Dp. d Economia i Empesa and Bacelona Gaduae School of Economics Uniesia Pompeu Faba c/ramon Tias Fagas, 5-7
More informationOscillation of an Euler Cauchy Dynamic Equation S. Huff, G. Olumolode, N. Pennington, and A. Peterson
PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON DYNAMICAL SYSTEMS AND DIFFERENTIAL EQUATIONS May 4 7, 00, Wilmingon, NC, USA pp 0 Oscillaion of an Euler Cauchy Dynamic Equaion S Huff, G Olumolode,
More informationFig. 1S. The antenna construction: (a) main geometrical parameters, (b) the wire support pillar and (c) the console link between wire and coaxial
a b c Fig. S. The anenna consucion: (a) ain geoeical paaees, (b) he wie suppo pilla and (c) he console link beween wie and coaial pobe. Fig. S. The anenna coss-secion in he y-z plane. Accoding o [], he
More informationMath 301: The Erdős-Stone-Simonovitz Theorem and Extremal Numbers for Bipartite Graphs
Math 30: The Edős-Stone-Simonovitz Theoem and Extemal Numbes fo Bipatite Gaphs May Radcliffe The Edős-Stone-Simonovitz Theoem Recall, in class we poved Tuán s Gaph Theoem, namely Theoem Tuán s Theoem Let
More informationOn Measuring Pro-Poor Growth. 1. On Various Ways of Measuring Pro-Poor Growth: A Short Review of the Literature
On Measuring Pro-Poor Growh 1. On Various Ways of Measuring Pro-Poor Growh: A Shor eview of he Lieraure During he pas en years or so here have been various suggesions concerning he way one should check
More informationNew problems in universal algebraic geometry illustrated by boolean equations
New poblems in univesal algebaic geomety illustated by boolean equations axiv:1611.00152v2 [math.ra] 25 Nov 2016 Atem N. Shevlyakov Novembe 28, 2016 Abstact We discuss new poblems in univesal algebaic
More informationChapter 3: Theory of Modular Arithmetic 38
Chapte 3: Theoy of Modula Aithmetic 38 Section D Chinese Remainde Theoem By the end of this section you will be able to pove the Chinese Remainde Theoem apply this theoem to solve simultaneous linea conguences
More informationInternational Journal of Pure and Applied Sciences and Technology
In. J. Pue Appl. Sci. Technol., 4 (211, pp. 23-29 Inenaional Jounal of Pue and Applied Sciences and Technology ISS 2229-617 Available online a www.ijopaasa.in eseach Pape Opizaion of he Uiliy of a Sucual
More informationarxiv: v1 [math.co] 6 Mar 2008
An uppe bound fo the numbe of pefect matchings in gaphs Shmuel Fiedland axiv:0803.0864v [math.co] 6 Ma 2008 Depatment of Mathematics, Statistics, and Compute Science, Univesity of Illinois at Chicago Chicago,
More informationToday - Lecture 13. Today s lecture continue with rotations, torque, Note that chapters 11, 12, 13 all involve rotations
Today - Lecue 13 Today s lecue coninue wih oaions, oque, Noe ha chapes 11, 1, 13 all inole oaions slide 1 eiew Roaions Chapes 11 & 1 Viewed fom aboe (+z) Roaional, o angula elociy, gies angenial elociy
More information( ) exp i ω b ( ) [ III-1 ] exp( i ω ab. exp( i ω ba
THE INTEACTION OF ADIATION AND MATTE: SEMICLASSICAL THEOY PAGE 26 III. EVIEW OF BASIC QUANTUM MECHANICS : TWO -LEVEL QUANTUM SYSTEMS : The lieaue of quanum opics and lase specoscop abounds wih discussions
More informationMath-Net.Ru All Russian mathematical portal
Mah-NeRu All Russian mahemaical poral Roman Popovych, On elemens of high order in general finie fields, Algebra Discree Mah, 204, Volume 8, Issue 2, 295 300 Use of he all-russian mahemaical poral Mah-NeRu
More informationOrder statistics and concentration of l r norms for log-concave vectors
Jounal of Funcional Analysis 61 011 681 696 www.elsevie.com/locae/jfa Ode saisics and concenaion of l noms fo log-concave vecos Rafał Laała a,b, a Insiue of Mahemaics, Univesiy of Wasaw, Banacha, 0-097
More informationT L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB
Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal
More informationarxiv: v1 [math.ca] 15 Jan 2019
DORRONSORO S THEOREM IN HEISENBERG GROUPS KATRIN FÄSSLER AND TUOMAS ORPONEN axiv:9.4767v [mah.ca] 5 Jan 29 ABSTRACT. A heoem of Doonsoo fom he 98s quanifies he fac ha eal-valued Sobolev funcions on Euclidean
More informationThe Asymptotic Behavior of Nonoscillatory Solutions of Some Nonlinear Dynamic Equations on Time Scales
Advances in Dynamical Sysems and Applicaions. ISSN 0973-5321 Volume 1 Number 1 (2006, pp. 103 112 c Research India Publicaions hp://www.ripublicaion.com/adsa.hm The Asympoic Behavior of Nonoscillaory Soluions
More informationt j i, and then can be naturally extended to K(cf. [S-V]). The Hasse derivatives satisfy the following: is defined on k(t) by D (i)
A NOTE ON WRONSKIANS AND THE ABC THEOREM IN FUNCTION FIELDS OF RIME CHARACTERISTIC Julie Tzu-Yueh Wang Insiue of Mahemaics Academia Sinica Nankang, Taipei 11529 Taiwan, R.O.C. May 14, 1998 Absrac. We provide
More informationEnergy dispersion relation for negative refraction (NR) materials
Enegy dispesion elaion fo negaive efacion (NR) maeials Y.Ben-Ayeh Physics Depamen, Technion Isael of Technology, Haifa 3, Isael E-mail addess: ph65yb@physics.echnion,ac.il; Fax:97 4 895755 Keywods: Negaive-efacion,
More informationKINEMATICS OF RIGID BODIES
KINEMTICS OF RIGID ODIES In igid body kinemaics, we use he elaionships govening he displacemen, velociy and acceleaion, bu mus also accoun fo he oaional moion of he body. Descipion of he moion of igid
More informationChristos Papadimitriou & Luca Trevisan November 22, 2016
U.C. Bereley CS170: Algorihms Handou LN-11-22 Chrisos Papadimiriou & Luca Trevisan November 22, 2016 Sreaming algorihms In his lecure and he nex one we sudy memory-efficien algorihms ha process a sream
More informationRainbow saturation and graph capacities
Rainbow sauraion and graph capaciies Dániel Korándi Absrac The -colored rainbow sauraion number rsa (n, F ) is he minimum size of a -edge-colored graph on n verices ha conains no rainbow copy of F, bu
More informationKOEBE DOMAINS FOR THE CLASSES OF FUNCTIONS WITH RANGES INCLUDED IN GIVEN SETS
Jounal of Applied Analysis Vol. 14, No. 1 2008), pp. 43 52 KOEBE DOMAINS FOR THE CLASSES OF FUNCTIONS WITH RANGES INCLUDED IN GIVEN SETS L. KOCZAN and P. ZAPRAWA Received Mach 12, 2007 and, in evised fom,
More information5.1 - Logarithms and Their Properties
Chaper 5 Logarihmic Funcions 5.1 - Logarihms and Their Properies Suppose ha a populaion grows according o he formula P 10, where P is he colony size a ime, in hours. When will he populaion be 2500? We
More informationnon -negative cone Population dynamics motivates the study of linear models whose coefficient matrices are non-negative or positive.
LECTURE 3 Linear/Nonnegaive Marix Models x ( = Px ( A= m m marix, x= m vecor Linear sysems of difference equaions arise in several difference conexs: Linear approximaions (linearizaion Perurbaion analysis
More informationAvailable online through ISSN
Intenational eseach Jounal of Pue Algeba -() 01 98-0 Available online though wwwjpainfo ISSN 8 907 SOE ESULTS ON THE GOUP INVESE OF BLOCK ATIX OVE IGHT OE DOAINS Hanyu Zhang* Goup of athematical Jidong
More informationFinish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details!
MAT 257, Handou 6: Ocober 7-2, 20. I. Assignmen. Finish reading Chaper 2 of Spiva, rereading earlier secions as necessary. handou and fill in some missing deails! II. Higher derivaives. Also, read his
More informationUnsupervised Segmentation of Moving MPEG Blocks Based on Classification of Temporal Information
Unsupevised Segmenaion of Moving MPEG Blocs Based on Classificaion of Tempoal Infomaion Ofe Mille 1, Ami Avebuch 1, and Yosi Kelle 2 1 School of Compue Science,Tel-Aviv Univesiy, Tel-Aviv 69978, Isael
More informationLower Bounds for Cover-Free Families
Loe Bouds fo Cove-Fee Families Ali Z. Abdi Covet of Nazaeth High School Gade, Abas 7, Haifa Nade H. Bshouty Dept. of Compute Sciece Techio, Haifa, 3000 Apil, 05 Abstact Let F be a set of blocks of a t-set
More informationarxiv: v1 [math.ca] 25 Sep 2013
OUNDEDNESS OF INTRINSIC LITTLEWOOD-PALEY FUNCTIONS ON MUSIELAK-ORLICZ MORREY AND CAMPANATO SPACES axiv:39.652v [mah.ca] 25 Sep 23 YIYU LIANG, EIICHI NAKAI 2, DACHUN YANG AND JUNQIANG ZHANG Absac. Le ϕ
More informationApproximation Algorithms for Unique Games via Orthogonal Separators
Approximaion Algorihms for Unique Games via Orhogonal Separaors Lecure noes by Konsanin Makarychev. Lecure noes are based on he papers [CMM06a, CMM06b, LM4]. Unique Games In hese lecure noes, we define
More informationk-remainder Cordial Graphs
Journal of Algorihms and Compuaion journal homepage: hp://jac.u.ac.ir k-remainder Cordial Graphs R. Ponraj 1, K. Annahurai and R. Kala 3 1 Deparmen of Mahemaics, Sri Paramakalyani College, Alwarkurichi
More information4 Sequences of measurable functions
4 Sequences of measurable funcions 1. Le (Ω, A, µ) be a measure space (complee, afer a possible applicaion of he compleion heorem). In his chaper we invesigae relaions beween various (nonequivalen) convergences
More informationNotes for Lecture 17-18
U.C. Berkeley CS278: Compuaional Complexiy Handou N7-8 Professor Luca Trevisan April 3-8, 2008 Noes for Lecure 7-8 In hese wo lecures we prove he firs half of he PCP Theorem, he Amplificaion Lemma, up
More informationInventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions
Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.
More informationt is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...
Mah 228- Fri Mar 24 5.6 Marix exponenials and linear sysems: The analogy beween firs order sysems of linear differenial equaions (Chaper 5) and scalar linear differenial equaions (Chaper ) is much sronger
More information