Effective Resistances for Ladder Like Chains

Size: px
Start display at page:

Download "Effective Resistances for Ladder Like Chains"

Transcription

1 Effetive Resistanes for Ladder Like Chains Carmona, A., Eninas, A.M., Mitjana, M. May 9, 04 Abstrat Here we onsider a lass of generalized linear hains; that is, the ladder like hains as a perturbation of a n path by adding onseutive weighted edges between opposite verties. This lass of hains in partiular inludes a big family of networks that goes from the yle, uniyle hains up to ladder networks. In this paper, we obtain the Green funtion, the effetive resistane and the Kirhhoff index of those ladder like hains as funtion of the the Green funtion, the effetive resistane and the Kirhhoff index of a path. Departament de Matemàtia Apliada III, UPC-BarelonaTeh Departament de Matemàtia Apliada I, UPC-BarelonaTeh

2 INTRODUCTION The Kirhhoff Index was introdued in Chemistry as a better alternative to other parameters used for disriminating among different moleules with similar shapes and strutures; see?. Sine then, a new line of researh with a onsiderable amount of prodution has been developed and the Kirhhoff Index has been omputed for some lasses of graphs with symmetries; see for instane 8? and the referenes therein. This index is defined as the sum of all effetive resistanes between any pair of verties of the network and it is also known as the Total Resistane;?. To find the Kirhhoff index of a general network has a high degree of omputational omplexity. Hene, it is of interest to find losed formulae for the effetive resistane and the Kirhhoff index. Some works have been published in this diretion, for networks suh that yles, hexagonal hain, distane regular graphs, see.one an also raise the problem of omputing the Kirhhoff index of omposite networks in terms of fators,. In this work we deal with the omputation of Green funtion, effetive resistane and Kirhhoff Index of generalized linear hain. These networks an be obtained from a n path by adding edges between opposite verties. Hene, they are a perturbation of the path and we an apply the result obtained in 5 to obtain the desired parameters. Let Γ = V, E, be a network; this is a simple and finite onneted graph with vertex set V = {,,..., n} and edge set E, where eah edge i, j has been assigned a ondutane ij > 0. Moreover, when i, j / E we define ij = 0, in partiular ii = 0 for any i =,..., n. The weighted degree of vertex i is defined as δ i = n j= ij. The ombinatorial Laplaian of Γ is the matrix L, whose entries are L ij = ij for all i j and L ii = δ i. Therefore, for eah vetor u R n and for eah i =,..., n n Lu i = δ i u i ij = j= n ij u i u j. j= It is well known that Lu = 0 iff u = ae, a R and e is the all vetor. Moreover, the multipliity of 0 as eigenvalue of L is equal to the number of onneted omponents of Γ. As Γ is onneted, the projetor onto the trivial eigenspae is J/n, where J is the all matrix,

3 onsequently L J/n is non singular and we define the Green matrix of Γ as G = L J/n J/n. In other words, G is the Moore Penrose inverse of the Laplaian matrix L. For any pair i, j V, the effetive resistane between i and j is defined as R ij = u i u j, where u R n is any solution of the linear system Lu = e i e j, where e i denotes the ith unit vetor with in the ith position and 0 elsewhere. Note that R ij does not depend on the hosen solution and in addition, the following equality holds, R ij = G ii G jj G ij. It is well known that, for any i, j, k V the triangular inequality R ij R ik R kj is an equality iff k separates verties i and j. The Kirhhoff index of Γ is the value, k = n n R ij = n G ii. i,j= i= In order to define the objets we are going to work with, we first onsider a fixed a path P on n verties, labelled as V = {,..., n}. The lass of generalized linear hains supported by the path P, denoted by L n, onsists of all onneted networks whose ondutane satisfies that i = i i > 0 for i =,..., n, a i = i n i 0 for any i =,..., n and ij = 0 otherwise. We define the link number of Γ as s = {i =,..., n : a i > 0} whih orresponds with the numbers of holes or quadrangles. So, the link number of Γ L n equals 0 iff a = = a n = 0; that is, iff the underlying graph of Γ is nothing but the path P. On the other hand, if the link number of Γ is positive there exist indexes i < < i s n suh that a ik > 0 when k =,..., s, whereas a j = 0 otherwise, see Figure. Generalized linear hains with link number s = are uniyle. In partiular, the n yle orresponds to the ase a > 0 and a j = 0, j =,..., n. A generalized linear hain whose link number equals n is alled a linear hain or ladder in the Graph Theory framework. Let G and R be the Green funtion and the effetive resistane of the path P. Sine eah interior vertex in a path is a ut vertex, we get R ij = R min{k,i} min{k,j} R max{k,i} max{k,j}, i, j, k =,..., n. 3 3

4 i k n n a i a ik a is n n n n n n i k n Figure : A Generalized Linear Chain The authors proved in 3 that for any i, j =,..., n, the Green funtion of a path is G ij = min{i,j} k n n k max{i,j} kn k, 4n k= k=max{i,j} k=min{i,j} where we use the usual onvention that empty sums are defined as zero. effetive resistane and the Kirhhoff index of the path are, Therefore, the R ij = max{i,j} k=min{i,j} n, i, j =,..., n and k = k= kn k. Moreover, for a path with onstant ondutanes, the expression of the Green funtion is G ij = n 4n 3 ii n jj n n i j n and hene, k = n i j 3 4n and R ij = for any i, j =,..., n. Given Γ L n, we denote its Green funtion as G Γ. If Γ has positive link number s and {i j } s j= is its link sequene, then the ombinatorial Laplaian of Γ appears as the ombinatorial Laplaian of the weighted path perturbed by adding for all j =,..., s, an edge with ondutane a ij between opposite verties i j and n i j 4,5. Sine we interpret a generalized linear hain as a perturbation of the path by adding weighted edges between opposite verties, we use 5 Theorem. to obtain the Green funtion, the effetive resistanes and the Kirhhoff index of suh a hain. To this end, we onsider the s s matrix Λ with entries Λ jk = a ij a ik R max{ij,i k } n max{i j,i k } and we take into aount that I Λ is non singular beause it is positive definite. Let M be its inverse. 4

5 For any j =,..., n, we define the vetor v j whose omponents are v jk = aik Rn ik j R ik j, k =,..., s, 4 and also the vetor u j = Mv j. Moreover, we onsider the vetor r = n Aording to the previous notation, the Green funtion, the effetive resistane and the Kirhhoff index of a generalized linear hain, are given by the following result. Theorem For any i, j =,..., n, we get n j= v j. G Γ ij = G ij Mr v i, r v j and R Γ ij = R ij u i u j, v i v j. In partiular, the Kirhhoff index of the generalized linear hain is given by k Γ = k 4n Mr, r n n j= u j, v j. Identity 3 allows us to give nie expressions for vetors v j and r. To do this, it is useful to define for any h =,..., n, the funtion φ h : {,..., n} {h,..., n h} given by φ h j = h, j h, j, h j n h, n h, n h j n. Clearly, φ h is nondereasing and moreover, given j, k =,..., s, we have that Λ jk = a ij a ik R φik i j φ ik n i j = a ij a ik R φij i k φ ij n i k. Lemma For any k =,..., s, we have v j,k = v j,k = v i,k v j,k = aik aik aik R ik n i k R ik φ ik j, j n, R φik j n ik R ik n ik, n j n, R φ ik i φ ik j, i j n. 5

6 aik s In partiular, v n i = v i = R i k n i k, v j = v i and v n j = v n i for k= n i aik k j n any j i. Moreover, r k =, whih in turns implies n j=i j k r k v j,k = aik n Uniyle linear hains n i k m=i k m n n i k m=φ ik j, j n. In this setion we obtain the Green funtion, the effetive resistane and the Kirhhoff index for uniyle linear hains; that is, for those generalized linear hains whose link number equals one. Therefore if i = h, then we add an edge with ondutane n = a h > 0 between verties h and n h. Sine s =, the omputation of M and u j, j =,..., n, is straightforward. Thus, I Λ = n R h n h = n n j=h. 5 Moreover, for any i, j =,..., n, we have the following useful version of Identity 3, j R ij = R min{h,i} min{h,j} R max{n h,i} max{n h,j} R φh i φ h j. 6 Proposition 3 For any i, j =,..., n, we get that G Γ ij = min{i,j} k n n k 4n R Γ ij = 4n k= n min{h,max{i,j}} k=min{h,i,j} n k=max{i,j} k n max{n h,i,j} k=φ h i k=max{n h,min{i,j}} φ h max{i,j} k=φ h min{i,j} n max{i,j} k=min{i,j} kn k φ h min{i,j} k n k=φ h j k=φ h max{i,j}. 6

7 In partiular, k Γ = n k= kn k n k n Proof. For any i, j =,..., n, we have m=k nh G Γ ij = G ij M r v i r v j and R Γ ij = R ij Mv i v j.. The expression for the Green funtion is a onsequene of the last identity in Lemma, whereas the expression for the effetive resistane appears as a onsequene of the mentioned Lemma and Identity 6. Finally, sine k Γ = n On the other hand, n m n j= sine m=h n j= k Γ = k n n j= m=φ h j n G Γ jj, we have n j= m=φ h j m=φ h j = n m=h n 4n j= = 4n h n = h m=h = h j= m 4n m=φ h j m n m=h m=h m=h m 4n j=h m=j m=h and hene, the expression for the Kirhhoff index follows. 7 j=h m=φ h j n j= m m=φ h j m=j = m=h j=h m=j m,. n m=h m,

8 Corollary 4 The Kirhhoff index of an uniyle hain with onstant ondutanes a and is k Γ = n 4n an h nn h 4hh. 3 an h Next, we partiularize the above theorem to h = that orresponds to the n yle. Although the ase of yles with onstant weight and ondutanes is well known, see for instane 6, as far as authors knowledge, this is the first time that the orthogonal Green funtion for a weighted yle is obtained. Corollary 5 The Green funtion and the effetive resistane for the weighted n yle are given by G Γ ij = 4n min{i,j} k= n 4n k= n Rij Γ = k= k n k= max{i,j} n k=max{i,j} k=min{i,j} Moreover, the Kirhhoff index is given by k Γ = n k= n kn k k= k n n k n k=i min{i,j} k= n k= max{i,j} k=min{i,j} n k n k= k n n kn k n k=j k=max{i,j} In partiular, if = for all k =,..., n and n = a, we get,. n n j= k=j. G Γ ij = n 4n 3 ii n jj n n i j n R Γ ij = a 4 an n i n j, i j an a n i j, and hene, k Γ = n4n an 3 an. 8

9 The last expression, when a =, oinides with the one obtained in 6. To end this setion we rise the problem of optimizing the Kirhhoff index of an uniyle linear hain. Firstly, we assume a =, then for h n, k Γ h = n8h3 h n 8hn 4n 3 h hn 8n h n 6a n h 7 and its derivative with respet to h is k Γ h = n6h3 36n h 4n h 4n 3 n 5n 4 6a n h. Let ψh = 6h 3 36n h 4n h 4n 3 n 5n 4, as ψ h = 48h n h n vanishes only at n / in the interval, n. Therefore, ψ vanishes at most one in, n/ and one at most in n/, n. Moreover, ψ < 0 on n/, n and ψn > 0, then ψ is positive on n/, n. On the other hand, ψ n = 3an < 0 4 and ψ n = 9 n 4 4 an > 0, so the k Γ h has a minimum for h, n. 4 4 Taking into aount that h Z, the minimum value of the Kirhhoff index for uniyle n linear hains is attained for h =. Finally, the maximum is attained for h = n sine 4 k Γ k Γ n. Let us now assume a, more preisely a = λ with λ. Then, for h n k Γ h, λ = n 8λh 3 λn h λ4n 6n h 4λn n λn 4n. 3hλ λn λ Let k Γ h, λ be its derivative with respet to h. It an be easily proved that for λ >, k Γ h, λ vanishes at the interval n, n 4 4 n and the minimum of the funtion is attained again for h =. On the other hand, for 4 λ < this is a <, there is a zero of k Γ h, λ in the interval n λ, n. Consequently, 4 4 when the ondutane a is very small ompared with, the Kirhhoff index of the uniyle hain is minimum for h =. In any ase, the Kirhhoff index of the uniyle hain with ondutanes a and, reahes its maximum for h = n. 9

10 Ladder like hains A ladder like hain is a generalized linear hain obtained by adding s onseutive edges, s n h, from vertex h with the same ondutane a > 0, to the path with onstant ondutane > 0, see Figure, so i k = h k and a ik = a > 0, k =,..., s. In partiular, when s = n the orresponding generalized linear hain is nothing else but a ladder network. In this setion, we aim to ompute the Green funtion, the effetive resistane and the Kirhhoff index for the ladder like hain. h h h s n a a a a n n h n h s n Figure : A ladder like hain Assoiated with the ladder like hain, we onsider q = a and we define the following auxiliary funtion in terms of Chebyshev polynomials n h s Vk q U k q, k 0, Q k q = n h s k 3 k 0, where V k q = U k q U k q and U k q is the k th Chebyshev polynomials of seond kind, see 7 and Annex A. Observe that Q 0 q is defined unambiguously, sine V 0 q = U 0 q =. Moreover, it is lear that {Q k q} k 0 is a Chebyshev sequene. aount that V k = and U k = k for any k Z, then Q k q = n h s V k U k, for any k 0, whih implies that {Q k q} k 0 is also a Chebyshev sequene. In addition, taking into From Lemma we get v n j = v j whih leads to u n j = u j, for any j =,..., n and moreover, r = 0. Therefore, for ladder like hains, Theorem reads as follows. 0

11 Corollary 6 For any i, j =,..., n, we get G Γ ij = G Γ n i n j = G ij u i, v j, G Γ i n j = G Γ n i j = G i n j u i, v j, Rij Γ = Rn i Γ n j = R ij u i, v i u j, v j u i, v j, Ri Γ n j = Rn i Γ j = R i n j u i, v i u j, v j u i, v j. Moreover, k Γ = n n 3 4n 4n u j, v j. j= Notie that in order to ompute the Green funtion and the effetive resistane for a ladder like hain, it suffies to obtain the values u i, v j for any i, j =,..., n. Therefore, the key is to ompute M. Applying the results of 5 Proposition.5 we get the following expression for M. Lemma 7 If M = b ij, then av min{i,j} qq s max{i,j} q b ij = δ ij V s q a n s h U s q Notie that when s =, the above formula gives b = with the inverse of 5 for onstant ondutanes., that oinides an h Next results are devoted to obtain the vetors v j, u j, j =,..., n and their inner produt. Proposition 8 It is satisfied that v j = v h and hene u j = u h, j =,..., h. Moreover, for any j =,..., n and any m =,..., s, we get a v j,m = n φ hm j, a u j,m = V min{φh j h,m }qq s max{φh j h,m }q V s q a n s h U s q. Proof. Given j =,..., n and m =,..., s, from Lemma we have v j,m = a n i m φ im j i m = a n φ im j, and the expression for v j,m follows bearing in mind that i m = h m.

12 Sine u j m =,..., s, we have a u j,m = a a α V m q = Mv j, if we onsider α = V s q a n s h U s q, then for n φ hm j a α s k=m a Q s mq m k= Q s k q n φ hk j V k q n φ hk j The result follows after arefully onsidering eah of the ases j h; h j h s ; h s j n and applying Lemma 3 in Annex A. Corollary 9 Given i, j n, then. u i, v j = a n i n j U s q 4 V s q a n s h U s q when h s i, j n, whereas u i, v j = n φh max{i, j} V φ h min{i,j} hqq s h φh max{i,j}q 4 V s q a n s h, U s q otherwise. One we have obtained the inner produt, the expression for the Green funtion of a ladder like hain is straightforward. Next we ompute the effetive resistane of a ladder like hain aording to the position in the path of the involved verties. Corollary 0 For any i, j =,..., n, we get i j V s q a n s h i j U s q Rij Γ = Rn i Γ n j = V s q a n s h U s q, Ri Γ n j = Rn i Γ j = n i j V s q a i j s h U s q V s q a n s h U s q. for h s i, j n and Rij Γ = Rn i Γ i j n j = V min{i,j} h q Q sh min{i,j} q Q sh max{i,j} q 4 V s q a n s h U s q Q sh max{i,j} q V max{i,j} h q V min{i,j} h q 4 V s q a n s h U s q

13 Ri Γ n j = Rn i Γ n max{i, j} j = V min{i,j} h q Q sh min{i,j} q Q sh max{i,j} q 4 V s q a n s h U s q Q sh max{i,j} q V max{i,j} h q V min{i,j} h q 4 V s q a n s h U s q for h i, j h s. Proposition The Kirhhoff index of the ladder like hain is where k Γ = n4n 3 n h s n h ss n h Q s q fn, h, su s q gn, h, su s q Vs q a n h s U s q, fn, h, s = gn, h, s = Proof. First, we have n u j, v j = a 4α U s q j=hs in addition, u j, v j = 4 hs j= Moreover, hs n h s as s a an h s n h s n h s 3 sn h s. a n j=hs 3 n j = a α U s q n h s n h s n h s 3, hs j= n φh j V φh j hqq s h φh jq V s q a n s h. U s q n φh j = h n h hs n j j= j=h = h s n h ss, 3

14 whereas taking into aount the last identity in Lemma 4, hs j= Thus, V φh j hqq s h φh jq = h Q s q k Γ = n4n 3 = n4n 3 na n j=hs = n4n 3 hs 4n u j, v j 4n n j= hs j= = h Q s q s V j qq s j q j= sn h s a U s q n h s as s U s q, a n u j, v j j=hs n φh j n j Us q 4 V s q a n s h U s q n h s n h ss V φh j hqq s h φh jq V s q a n s h U s q nh Q s q Vs q a n s h U s q snn h s U s q a V s q a n s h U s q n n h s as s U s q a V s q a n s h U s q nan h s n h s n h s 3 U s q 3 V s q a n s h U s q. result. For the standard ladder; that is, when s = n and hene h =, we have the following Corollary The Kirhhoff index of the standard ladder is k Γ = nn 3 In partiular, when a =, then n n U n q an a U n q a V n q au n q. k Γ = nn 3 n 4 n k=0 sin kπ n.

15 Proof. The first Identity follows substituting s = n and h = in Proposition. On the other hand, when a =, then q = and n n U n nu n 3U n = nu n U n = n n k= os kπ n sine { os kπ n } n k= are the zeroes of the Chebyshev polynomial U n, see 7. In the Chemistry ommunity, standard ladders are known as linear polyomino hains. Then, the last formula oinides with that obtained in 8 Theorem 4. for a linear polyomino hain with n squares. Annex A In this setion we write the results related with the Chebyshev sequenes that we need aross the paper. The following Lemma shows a useful property for the sum of Chebyshev polynomials, see for instane 7. Lemma 3 If {P k } k=0 is a Chebyshev sequene, given Sk = αk β, where α, β R, and r, t N suh that t r then, r k=t SkP k q = Sr P r q P r q St P t q P t q α P t q P r q. a From the expression for produts of Chebyshev polynomials, see 7 Chapter, we dedue the following equalities. Lemma 4 For any m s we have aq s m qu m q V m q Q s m q Q s m q = V s q a n s h U s q. Moreover, if for any k Z, T k and W k denote the k th Chebyshev polynomial of first and fourth kind, respetively; that is W k q = U k q U k q, then s V j qq s j q = j= s n h s T s q sw s q n h s U s q, a 5

16 whih is equivalent to s sn h s V j qq s j q = q j= Proof. s V j qq s j q = j= s j= = s j= n h s qs s U s q U s q q n U j q U j q h s Us j q U s j q U s j q n U j q U j q h s 3 Us j q n h s U s j q = n h s 3 s j= n h s s n h s 3 = q n h s j= q n h s s = q n h s q q U s j qu j q U s j qu j q U s j qu j q U s j qu j q st s q st s q s T s j q st s q j= s T s j q st s q j= T s q T s q T s q s T s j q j= s T s j q j= s j= T s j q s T s j q j= s q s T s j q j= s T s j q j= n h s sq = q T s q n h s q U s q s T s q T s q q s j= T s q T s q T s j q = sn h s q n h s qs s U s q U s q q taking into aount s s T s l q = T s l q = U s q T s q = qu s q, l= l= s T s l q = U s q. l= 6

17 CONCLUSIONS We have obtained the Green funtion, the effetive resistane, and the Kirhhoff index of a lass of generalized linear hains that inludes yles, uniyle hains and ladder hains also known as polyomino hains in the Chemistry ommunity. The starting point is a path with arbitrary ondutanes on their edges, then we interpret eah generalized hain as a onvenient perturbation of the mentioned path. Therefore, we obtain the expressions of the Green funtion, the effetive resistane, and the Kirhhoff index as funtion of its orresponding in the path. In partiular we obtain, as far as we know for the first time, the Green funtion of a weighted yle. We expliitly give the Kirhhoff index for uniyle hains with two different ondutanes and we disuss when the Kirhhoff index is optimum aording to the size of the yle. The last setion is devoted to the study of ladder like hains again as a perturbation of the path. For them we have also find the desired results. In order to ahieve the last goal, we have had to deal with Chebyshev polynomials tools that are inluded in Annex A. ACKNOWLEDGMENTS This work has been partly supported by the Spanish Researh Counil Comisión Interministerial de Cienia y Tenología, under projets MTM C0-0 and MTM C0-0. 7

18 Referenes. E. Bendito, A. Carmona, A. M. Eninas, and J. M. Gesto, Linear Algebra Appl. 430, , ISSN , URL E. Bendito, A. Carmona, A. M. Eninas, J. M. Gesto, and M. Mitjana, Linear Algebra Appl. 43, 78 00, ISSN , URL 3. E. Bendito, A. Carmona, A. Eninas, and M. Mitjana, Linear Algebra Appl. 436, 090 0, ISSN , URL 4. A. Carmona, A. M. Eninas, and M. Mitjana, Linear Algebra Appl. 44, 5 04, ISSN , URL 5. A. Carmona, A. Eninas, and M. Mitjana, Linear Algebra and its Appliations pp. 04, ISSN , URL 6. R. B. Ellis, Ph.D. thesis, University of California, San Diego J. Mason and D. Handsomb, Chebyshev Polynomials Chapman & Hall/CRC, Y. Yang and H. Zhang, Int. J. Quantum Chem. 08, , URL 8

19 Figure 3: Plae Figure aption here. In the ase of reprodued figures in review artiles, you must obtain the publisher s permission and state a suitable notie here along with a itation. Figure 4: Plae Figure aption here. Figures should be uploaded as individual files, preferably.tif or.eps files, at high enough resolution 600 to 00 dpi to ensure larity. Please see the authorâs guide for more details and speifiations. For high quality illustrations, we highly reommend the use of the TikZ pakage. 9

Advanced Computational Fluid Dynamics AA215A Lecture 4

Advanced Computational Fluid Dynamics AA215A Lecture 4 Advaned Computational Fluid Dynamis AA5A Leture 4 Antony Jameson Winter Quarter,, Stanford, CA Abstrat Leture 4 overs analysis of the equations of gas dynamis Contents Analysis of the equations of gas

More information

SURFACE WAVES OF NON-RAYLEIGH TYPE

SURFACE WAVES OF NON-RAYLEIGH TYPE SURFACE WAVES OF NON-RAYLEIGH TYPE by SERGEY V. KUZNETSOV Institute for Problems in Mehanis Prosp. Vernadskogo, 0, Mosow, 75 Russia e-mail: sv@kuznetsov.msk.ru Abstrat. Existene of surfae waves of non-rayleigh

More information

The Hanging Chain. John McCuan. January 19, 2006

The Hanging Chain. John McCuan. January 19, 2006 The Hanging Chain John MCuan January 19, 2006 1 Introdution We onsider a hain of length L attahed to two points (a, u a and (b, u b in the plane. It is assumed that the hain hangs in the plane under a

More information

LECTURE NOTES FOR , FALL 2004

LECTURE NOTES FOR , FALL 2004 LECTURE NOTES FOR 18.155, FALL 2004 83 12. Cone support and wavefront set In disussing the singular support of a tempered distibution above, notie that singsupp(u) = only implies that u C (R n ), not as

More information

Velocity Addition in Space/Time David Barwacz 4/23/

Velocity Addition in Space/Time David Barwacz 4/23/ Veloity Addition in Spae/Time 003 David arwaz 4/3/003 daveb@triton.net http://members.triton.net/daveb Abstrat Using the spae/time geometry developed in the previous paper ( Non-orthogonal Spae- Time geometry,

More information

A Characterization of Wavelet Convergence in Sobolev Spaces

A Characterization of Wavelet Convergence in Sobolev Spaces A Charaterization of Wavelet Convergene in Sobolev Spaes Mark A. Kon 1 oston University Louise Arakelian Raphael Howard University Dediated to Prof. Robert Carroll on the oasion of his 70th birthday. Abstrat

More information

SPLINE ESTIMATION OF SINGLE-INDEX MODELS

SPLINE ESTIMATION OF SINGLE-INDEX MODELS SPLINE ESIMAION OF SINGLE-INDEX MODELS Li Wang and Lijian Yang University of Georgia and Mihigan State University Supplementary Material his note ontains proofs for the main results he following two propositions

More information

max min z i i=1 x j k s.t. j=1 x j j:i T j

max min z i i=1 x j k s.t. j=1 x j j:i T j AM 221: Advaned Optimization Spring 2016 Prof. Yaron Singer Leture 22 April 18th 1 Overview In this leture, we will study the pipage rounding tehnique whih is a deterministi rounding proedure that an be

More information

Nonreversibility of Multiple Unicast Networks

Nonreversibility of Multiple Unicast Networks Nonreversibility of Multiple Uniast Networks Randall Dougherty and Kenneth Zeger September 27, 2005 Abstrat We prove that for any finite direted ayli network, there exists a orresponding multiple uniast

More information

1 sin 2 r = 1 n 2 sin 2 i

1 sin 2 r = 1 n 2 sin 2 i Physis 505 Fall 005 Homework Assignment #11 Solutions Textbook problems: Ch. 7: 7.3, 7.5, 7.8, 7.16 7.3 Two plane semi-infinite slabs of the same uniform, isotropi, nonpermeable, lossless dieletri with

More information

Hankel Optimal Model Order Reduction 1

Hankel Optimal Model Order Reduction 1 Massahusetts Institute of Tehnology Department of Eletrial Engineering and Computer Siene 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Hankel Optimal Model Order Redution 1 This leture overs both

More information

Discrete Bessel functions and partial difference equations

Discrete Bessel functions and partial difference equations Disrete Bessel funtions and partial differene equations Antonín Slavík Charles University, Faulty of Mathematis and Physis, Sokolovská 83, 186 75 Praha 8, Czeh Republi E-mail: slavik@karlin.mff.uni.z Abstrat

More information

7 Max-Flow Problems. Business Computing and Operations Research 608

7 Max-Flow Problems. Business Computing and Operations Research 608 7 Max-Flow Problems Business Computing and Operations Researh 68 7. Max-Flow Problems In what follows, we onsider a somewhat modified problem onstellation Instead of osts of transmission, vetor now indiates

More information

Maximum Entropy and Exponential Families

Maximum Entropy and Exponential Families Maximum Entropy and Exponential Families April 9, 209 Abstrat The goal of this note is to derive the exponential form of probability distribution from more basi onsiderations, in partiular Entropy. It

More information

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics Journal of Inequalities in Pure and Applied Mathematis A NEW ARRANGEMENT INEQUALITY MOHAMMAD JAVAHERI University of Oregon Department of Mathematis Fenton Hall, Eugene, OR 97403. EMail: javaheri@uoregon.edu

More information

Packing Plane Spanning Trees into a Point Set

Packing Plane Spanning Trees into a Point Set Paking Plane Spanning Trees into a Point Set Ahmad Biniaz Alfredo Garía Abstrat Let P be a set of n points in the plane in general position. We show that at least n/3 plane spanning trees an be paked into

More information

Integration of the Finite Toda Lattice with Complex-Valued Initial Data

Integration of the Finite Toda Lattice with Complex-Valued Initial Data Integration of the Finite Toda Lattie with Complex-Valued Initial Data Aydin Huseynov* and Gusein Sh Guseinov** *Institute of Mathematis and Mehanis, Azerbaijan National Aademy of Sienes, AZ4 Baku, Azerbaijan

More information

CMSC 451: Lecture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017

CMSC 451: Lecture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017 CMSC 451: Leture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017 Reading: Chapt 11 of KT and Set 54 of DPV Set Cover: An important lass of optimization problems involves overing a ertain domain,

More information

Complexity of Regularization RBF Networks

Complexity of Regularization RBF Networks Complexity of Regularization RBF Networks Mark A Kon Department of Mathematis and Statistis Boston University Boston, MA 02215 mkon@buedu Leszek Plaskota Institute of Applied Mathematis University of Warsaw

More information

Taste for variety and optimum product diversity in an open economy

Taste for variety and optimum product diversity in an open economy Taste for variety and optimum produt diversity in an open eonomy Javier Coto-Martínez City University Paul Levine University of Surrey Otober 0, 005 María D.C. Garía-Alonso University of Kent Abstrat We

More information

arxiv:math/ v1 [math.ca] 27 Nov 2003

arxiv:math/ v1 [math.ca] 27 Nov 2003 arxiv:math/011510v1 [math.ca] 27 Nov 200 Counting Integral Lamé Equations by Means of Dessins d Enfants Sander Dahmen November 27, 200 Abstrat We obtain an expliit formula for the number of Lamé equations

More information

arxiv:math/ v4 [math.ca] 29 Jul 2006

arxiv:math/ v4 [math.ca] 29 Jul 2006 arxiv:math/0109v4 [math.ca] 9 Jul 006 Contiguous relations of hypergeometri series Raimundas Vidūnas University of Amsterdam Abstrat The 15 Gauss ontiguous relations for F 1 hypergeometri series imply

More information

DIGITAL DISTANCE RELAYING SCHEME FOR PARALLEL TRANSMISSION LINES DURING INTER-CIRCUIT FAULTS

DIGITAL DISTANCE RELAYING SCHEME FOR PARALLEL TRANSMISSION LINES DURING INTER-CIRCUIT FAULTS CHAPTER 4 DIGITAL DISTANCE RELAYING SCHEME FOR PARALLEL TRANSMISSION LINES DURING INTER-CIRCUIT FAULTS 4.1 INTRODUCTION Around the world, environmental and ost onsiousness are foring utilities to install

More information

Counting Idempotent Relations

Counting Idempotent Relations Counting Idempotent Relations Beriht-Nr. 2008-15 Florian Kammüller ISSN 1436-9915 2 Abstrat This artile introdues and motivates idempotent relations. It summarizes haraterizations of idempotents and their

More information

Modal Horn Logics Have Interpolation

Modal Horn Logics Have Interpolation Modal Horn Logis Have Interpolation Marus Kraht Department of Linguistis, UCLA PO Box 951543 405 Hilgard Avenue Los Angeles, CA 90095-1543 USA kraht@humnet.ula.de Abstrat We shall show that the polymodal

More information

A NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM

A NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM NETWORK SIMPLEX LGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM Cen Çalışan, Utah Valley University, 800 W. University Parway, Orem, UT 84058, 801-863-6487, en.alisan@uvu.edu BSTRCT The minimum

More information

Beams on Elastic Foundation

Beams on Elastic Foundation Professor Terje Haukaas University of British Columbia, Vanouver www.inrisk.ub.a Beams on Elasti Foundation Beams on elasti foundation, suh as that in Figure 1, appear in building foundations, floating

More information

Quantum Mechanics: Wheeler: Physics 6210

Quantum Mechanics: Wheeler: Physics 6210 Quantum Mehanis: Wheeler: Physis 60 Problems some modified from Sakurai, hapter. W. S..: The Pauli matries, σ i, are a triple of matries, σ, σ i = σ, σ, σ 3 given by σ = σ = σ 3 = i i Let stand for the

More information

Millennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion

Millennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion Millennium Relativity Aeleration Composition he Relativisti Relationship between Aeleration and niform Motion Copyright 003 Joseph A. Rybzyk Abstrat he relativisti priniples developed throughout the six

More information

General Closed-form Analytical Expressions of Air-gap Inductances for Surfacemounted Permanent Magnet and Induction Machines

General Closed-form Analytical Expressions of Air-gap Inductances for Surfacemounted Permanent Magnet and Induction Machines General Closed-form Analytial Expressions of Air-gap Indutanes for Surfaemounted Permanent Magnet and Indution Mahines Ronghai Qu, Member, IEEE Eletroni & Photoni Systems Tehnologies General Eletri Company

More information

RIEMANN S FIRST PROOF OF THE ANALYTIC CONTINUATION OF ζ(s) AND L(s, χ)

RIEMANN S FIRST PROOF OF THE ANALYTIC CONTINUATION OF ζ(s) AND L(s, χ) RIEMANN S FIRST PROOF OF THE ANALYTIC CONTINUATION OF ζ(s AND L(s, χ FELIX RUBIN SEMINAR ON MODULAR FORMS, WINTER TERM 6 Abstrat. In this hapter, we will see a proof of the analyti ontinuation of the Riemann

More information

V. Interacting Particles

V. Interacting Particles V. Interating Partiles V.A The Cumulant Expansion The examples studied in the previous setion involve non-interating partiles. It is preisely the lak of interations that renders these problems exatly solvable.

More information

Sensitivity Analysis in Markov Networks

Sensitivity Analysis in Markov Networks Sensitivity Analysis in Markov Networks Hei Chan and Adnan Darwihe Computer Siene Department University of California, Los Angeles Los Angeles, CA 90095 {hei,darwihe}@s.ula.edu Abstrat This paper explores

More information

Math 220A - Fall 2002 Homework 8 Solutions

Math 220A - Fall 2002 Homework 8 Solutions Math A - Fall Homework 8 Solutions 1. Consider u tt u = x R 3, t > u(x, ) = φ(x) u t (x, ) = ψ(x). Suppose φ, ψ are supported in the annular region a < x < b. (a) Find the time T 1 > suh that u(x, t) is

More information

Ordered fields and the ultrafilter theorem

Ordered fields and the ultrafilter theorem F U N D A M E N T A MATHEMATICAE 59 (999) Ordered fields and the ultrafilter theorem by R. B e r r (Dortmund), F. D e l o n (Paris) and J. S h m i d (Dortmund) Abstrat. We prove that on the basis of ZF

More information

Perturbation Analyses for the Cholesky Factorization with Backward Rounding Errors

Perturbation Analyses for the Cholesky Factorization with Backward Rounding Errors Perturbation Analyses for the holesky Fatorization with Bakward Rounding Errors Xiao-Wen hang Shool of omputer Siene, MGill University, Montreal, Quebe, anada, H3A A7 Abstrat. This paper gives perturbation

More information

Lecture 7: Sampling/Projections for Least-squares Approximation, Cont. 7 Sampling/Projections for Least-squares Approximation, Cont.

Lecture 7: Sampling/Projections for Least-squares Approximation, Cont. 7 Sampling/Projections for Least-squares Approximation, Cont. Stat60/CS94: Randomized Algorithms for Matries and Data Leture 7-09/5/013 Leture 7: Sampling/Projetions for Least-squares Approximation, Cont. Leturer: Mihael Mahoney Sribe: Mihael Mahoney Warning: these

More information

A simple expression for radial distribution functions of pure fluids and mixtures

A simple expression for radial distribution functions of pure fluids and mixtures A simple expression for radial distribution funtions of pure fluids and mixtures Enrio Matteoli a) Istituto di Chimia Quantistia ed Energetia Moleolare, CNR, Via Risorgimento, 35, 56126 Pisa, Italy G.

More information

On Component Order Edge Reliability and the Existence of Uniformly Most Reliable Unicycles

On Component Order Edge Reliability and the Existence of Uniformly Most Reliable Unicycles Daniel Gross, Lakshmi Iswara, L. William Kazmierzak, Kristi Luttrell, John T. Saoman, Charles Suffel On Component Order Edge Reliability and the Existene of Uniformly Most Reliable Uniyles DANIEL GROSS

More information

Prediction on a Graph with a Perceptron

Prediction on a Graph with a Perceptron Predition on a Graph with a Pereptron Mark Herbster, Massimiliano Pontil Department of Computer Siene University College London Gower Street, London WC1E 6BT, England, UK {m.herbster, m.pontil}@s.ul.a.uk

More information

Relativity fundamentals explained well (I hope) Walter F. Smith, Haverford College

Relativity fundamentals explained well (I hope) Walter F. Smith, Haverford College Relativity fundamentals explained well (I hope) Walter F. Smith, Haverford College 3-14-06 1 Propagation of waves through a medium As you ll reall from last semester, when the speed of sound is measured

More information

Counting Arbitrary Subgraphs in Data Streams

Counting Arbitrary Subgraphs in Data Streams Counting Arbitrary Subgraphs in Data Streams Daniel M. Kane 1, Kurt Mehlhorn, Thomas Sauerwald, and He Sun 1 Department of Mathematis, Stanford University, USA Max Plank Institute for Informatis, Germany

More information

The Group Inverse of extended Symmetric and Periodic Jacobi Matrices

The Group Inverse of extended Symmetric and Periodic Jacobi Matrices GRUPO MAPTHE Preprint 206 February 3, 206. The Group Inverse of extended Symmetric and Periodic Jacobi Matrices S. Gago Abstract. In this work, we explicitly compute the group inverse of symmetric and

More information

PHYSICS 104B, WINTER 2010 ASSIGNMENT FIVE SOLUTIONS N { N 2 + 1, N 2 + 2, N

PHYSICS 104B, WINTER 2010 ASSIGNMENT FIVE SOLUTIONS N { N 2 + 1, N 2 + 2, N PHYSICS 4B, WINTER 2 ASSIGNMENT FIVE SOLUTIONS [.] For uniform m =. and springs g = 2. the eigenvalues have the analyti form, The ode jaobi test yields λ k = 2g ( os k) m k = k n = 2πn N = 2π N { N 2 +,

More information

the following action R of T on T n+1 : for each θ T, R θ : T n+1 T n+1 is defined by stated, we assume that all the curves in this paper are defined

the following action R of T on T n+1 : for each θ T, R θ : T n+1 T n+1 is defined by stated, we assume that all the curves in this paper are defined How should a snake turn on ie: A ase study of the asymptoti isoholonomi problem Jianghai Hu, Slobodan N. Simić, and Shankar Sastry Department of Eletrial Engineering and Computer Sienes University of California

More information

Where as discussed previously we interpret solutions to this partial differential equation in the weak sense: b

Where as discussed previously we interpret solutions to this partial differential equation in the weak sense: b Consider the pure initial value problem for a homogeneous system of onservation laws with no soure terms in one spae dimension: Where as disussed previously we interpret solutions to this partial differential

More information

A Recursive Approach to the Kauffman Bracket

A Recursive Approach to the Kauffman Bracket Applied Mathematis, 204, 5, 2746-2755 Published Online Otober 204 in SiRes http://wwwsirporg/journal/am http://ddoiorg/04236/am20457262 A Reursive Approah to the Kauffman Braet Abdul Rauf Nizami, Mobeen

More information

Danielle Maddix AA238 Final Project December 9, 2016

Danielle Maddix AA238 Final Project December 9, 2016 Struture and Parameter Learning in Bayesian Networks with Appliations to Prediting Breast Caner Tumor Malignany in a Lower Dimension Feature Spae Danielle Maddix AA238 Final Projet Deember 9, 2016 Abstrat

More information

Properties of Quarks

Properties of Quarks PHY04 Partile Physis 9 Dr C N Booth Properties of Quarks In the earlier part of this ourse, we have disussed three families of leptons but prinipally onentrated on one doublet of quarks, the u and d. We

More information

After the completion of this section the student should recall

After the completion of this section the student should recall Chapter I MTH FUNDMENTLS I. Sets, Numbers, Coordinates, Funtions ugust 30, 08 3 I. SETS, NUMERS, COORDINTES, FUNCTIONS Objetives: fter the ompletion of this setion the student should reall - the definition

More information

Lecture 3 - Lorentz Transformations

Lecture 3 - Lorentz Transformations Leture - Lorentz Transformations A Puzzle... Example A ruler is positioned perpendiular to a wall. A stik of length L flies by at speed v. It travels in front of the ruler, so that it obsures part of the

More information

Sensitivity analysis for linear optimization problem with fuzzy data in the objective function

Sensitivity analysis for linear optimization problem with fuzzy data in the objective function Sensitivity analysis for linear optimization problem with fuzzy data in the objetive funtion Stephan Dempe, Tatiana Starostina May 5, 2004 Abstrat Linear programming problems with fuzzy oeffiients in the

More information

arxiv: v1 [math.gt] 22 Nov 2018

arxiv: v1 [math.gt] 22 Nov 2018 SOME REMARKS ON THE CHORD INDEX ZHIYUN CHENG, HONGZHU GAO, AND MENGJIAN XU arxiv:1811.09061v1 [math.gt] 22 Nov 2018 ABSTRACT. In this paper we disuss how to define a hord index via smoothing a real rossing

More information

Symplectic Projector and Physical Degrees of Freedom of The Classical Particle

Symplectic Projector and Physical Degrees of Freedom of The Classical Particle Sympleti Projetor and Physial Degrees of Freedom of The Classial Partile M. A. De Andrade a, M. A. Santos b and I. V. Vanea arxiv:hep-th/0308169v3 7 Sep 2003 a Grupo de Físia Teória, Universidade Católia

More information

The Unified Geometrical Theory of Fields and Particles

The Unified Geometrical Theory of Fields and Particles Applied Mathematis, 014, 5, 347-351 Published Online February 014 (http://www.sirp.org/journal/am) http://dx.doi.org/10.436/am.014.53036 The Unified Geometrial Theory of Fields and Partiles Amagh Nduka

More information

LECTURE 22: MAPPING DEGREE, POINCARE DUALITY

LECTURE 22: MAPPING DEGREE, POINCARE DUALITY LECTURE 22: APPING DEGREE, POINCARE DUALITY 1. The mapping degree and its appliations Let, N be n-dimensional onneted oriented manifolds, and f : N a proper map. (If is ompat, then any smooth map f : N

More information

ELECTROMAGNETIC WAVES

ELECTROMAGNETIC WAVES ELECTROMAGNETIC WAVES Now we will study eletromagneti waves in vauum or inside a medium, a dieletri. (A metalli system an also be represented as a dieletri but is more ompliated due to damping or attenuation

More information

Supporting Information for

Supporting Information for Eletroni Supplementary Material (ESI) for Nanosale This journal is The Royal Soiety of Chemistry 013 Supporting Information for Exitation polarization modulation in loalization mirosopy allows to resolve

More information

Estimating the probability law of the codelength as a function of the approximation error in image compression

Estimating the probability law of the codelength as a function of the approximation error in image compression Estimating the probability law of the odelength as a funtion of the approximation error in image ompression François Malgouyres Marh 7, 2007 Abstrat After some reolletions on ompression of images using

More information

The gravitational phenomena without the curved spacetime

The gravitational phenomena without the curved spacetime The gravitational phenomena without the urved spaetime Mirosław J. Kubiak Abstrat: In this paper was presented a desription of the gravitational phenomena in the new medium, different than the urved spaetime,

More information

A variant of Coppersmith s Algorithm with Improved Complexity and Efficient Exhaustive Search

A variant of Coppersmith s Algorithm with Improved Complexity and Efficient Exhaustive Search A variant of Coppersmith s Algorithm with Improved Complexity and Effiient Exhaustive Searh Jean-Sébastien Coron 1, Jean-Charles Faugère 2, Guénaël Renault 2, and Rina Zeitoun 2,3 1 University of Luxembourg

More information

Some GIS Topological Concepts via Neutrosophic Crisp Set Theory

Some GIS Topological Concepts via Neutrosophic Crisp Set Theory New Trends in Neutrosophi Theory and Appliations A.A.SALAMA, I.M.HANAFY, HEWAYDA ELGHAWALBY 3, M.S.DABASH 4,2,4 Department of Mathematis and Computer Siene, Faulty of Sienes, Port Said University, Egypt.

More information

ON THE LEAST PRIMITIVE ROOT EXPRESSIBLE AS A SUM OF TWO SQUARES

ON THE LEAST PRIMITIVE ROOT EXPRESSIBLE AS A SUM OF TWO SQUARES #A55 INTEGERS 3 (203) ON THE LEAST PRIMITIVE ROOT EPRESSIBLE AS A SUM OF TWO SQUARES Christopher Ambrose Mathematishes Institut, Georg-August Universität Göttingen, Göttingen, Deutshland ambrose@uni-math.gwdg.de

More information

Tight bounds for selfish and greedy load balancing

Tight bounds for selfish and greedy load balancing Tight bounds for selfish and greedy load balaning Ioannis Caragiannis Mihele Flammini Christos Kaklamanis Panagiotis Kanellopoulos Lua Mosardelli Deember, 009 Abstrat We study the load balaning problem

More information

Conformal Mapping among Orthogonal, Symmetric, and Skew-Symmetric Matrices

Conformal Mapping among Orthogonal, Symmetric, and Skew-Symmetric Matrices AAS 03-190 Conformal Mapping among Orthogonal, Symmetri, and Skew-Symmetri Matries Daniele Mortari Department of Aerospae Engineering, Texas A&M University, College Station, TX 77843-3141 Abstrat This

More information

The Effectiveness of the Linear Hull Effect

The Effectiveness of the Linear Hull Effect The Effetiveness of the Linear Hull Effet S. Murphy Tehnial Report RHUL MA 009 9 6 Otober 009 Department of Mathematis Royal Holloway, University of London Egham, Surrey TW0 0EX, England http://www.rhul.a.uk/mathematis/tehreports

More information

Pseudo Spheres. A Sample of Electronic Lecture Notes in Mathematics. Eberhard Malkowsky.

Pseudo Spheres. A Sample of Electronic Lecture Notes in Mathematics. Eberhard Malkowsky. Pseudo Spheres A Sample of Eletroni Leture Notes in Mathematis Eberhard Malkowsky Mathematishes Institut Justus Liebig Universität Gießen Arndtstraße D-3539 Gießen Germany /o Shool of Informatis Computing

More information

Internet Appendix for Proxy Advisory Firms: The Economics of Selling Information to Voters

Internet Appendix for Proxy Advisory Firms: The Economics of Selling Information to Voters Internet Appendix for Proxy Advisory Firms: The Eonomis of Selling Information to Voters Andrey Malenko and Nadya Malenko The first part of the Internet Appendix presents the supplementary analysis for

More information

9 Geophysics and Radio-Astronomy: VLBI VeryLongBaseInterferometry

9 Geophysics and Radio-Astronomy: VLBI VeryLongBaseInterferometry 9 Geophysis and Radio-Astronomy: VLBI VeryLongBaseInterferometry VLBI is an interferometry tehnique used in radio astronomy, in whih two or more signals, oming from the same astronomial objet, are reeived

More information

MODELING MATTER AT NANOSCALES. 4. Introduction to quantum treatments Eigenvectors and eigenvalues of a matrix

MODELING MATTER AT NANOSCALES. 4. Introduction to quantum treatments Eigenvectors and eigenvalues of a matrix MODELING MATTER AT NANOSCALES 4 Introdution to quantum treatments 403 Eigenvetors and eigenvalues of a matrix Simultaneous equations in the variational method The problem of simultaneous equations in the

More information

ELECTROMAGNETIC WAVES WITH NONLINEAR DISPERSION LAW. P. М. Меdnis

ELECTROMAGNETIC WAVES WITH NONLINEAR DISPERSION LAW. P. М. Меdnis ELECTROMAGNETIC WAVES WITH NONLINEAR DISPERSION LAW P. М. Меdnis Novosibirs State Pedagogial University, Chair of the General and Theoretial Physis, Russia, 636, Novosibirs,Viljujsy, 8 e-mail: pmednis@inbox.ru

More information

c-perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories

c-perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories -Perfet Hashing Shemes for Binary Trees, with Appliations to Parallel Memories (Extended Abstrat Gennaro Cordaso 1, Alberto Negro 1, Vittorio Sarano 1, and Arnold L.Rosenberg 2 1 Dipartimento di Informatia

More information

Chapter 8 Hypothesis Testing

Chapter 8 Hypothesis Testing Leture 5 for BST 63: Statistial Theory II Kui Zhang, Spring Chapter 8 Hypothesis Testing Setion 8 Introdution Definition 8 A hypothesis is a statement about a population parameter Definition 8 The two

More information

Bäcklund Transformations: Some Old and New Perspectives

Bäcklund Transformations: Some Old and New Perspectives Bäklund Transformations: Some Old and New Perspetives C. J. Papahristou *, A. N. Magoulas ** * Department of Physial Sienes, Helleni Naval Aademy, Piraeus 18539, Greee E-mail: papahristou@snd.edu.gr **

More information

Optimization of Statistical Decisions for Age Replacement Problems via a New Pivotal Quantity Averaging Approach

Optimization of Statistical Decisions for Age Replacement Problems via a New Pivotal Quantity Averaging Approach Amerian Journal of heoretial and Applied tatistis 6; 5(-): -8 Published online January 7, 6 (http://www.sienepublishinggroup.om/j/ajtas) doi:.648/j.ajtas.s.65.4 IN: 36-8999 (Print); IN: 36-96 (Online)

More information

EDGE-DISJOINT CLIQUES IN GRAPHS WITH HIGH MINIMUM DEGREE

EDGE-DISJOINT CLIQUES IN GRAPHS WITH HIGH MINIMUM DEGREE EDGE-DISJOINT CLIQUES IN GRAPHS WITH HIGH MINIMUM DEGREE RAPHAEL YUSTER Abstrat For a graph G and a fixed integer k 3, let ν k G) denote the maximum number of pairwise edge-disjoint opies of K k in G For

More information

Directional Coupler. 4-port Network

Directional Coupler. 4-port Network Diretional Coupler 4-port Network 3 4 A diretional oupler is a 4-port network exhibiting: All ports mathed on the referene load (i.e. S =S =S 33 =S 44 =0) Two pair of ports unoupled (i.e. the orresponding

More information

Stability of alternate dual frames

Stability of alternate dual frames Stability of alternate dual frames Ali Akbar Arefijamaal Abstrat. The stability of frames under perturbations, whih is important in appliations, is studied by many authors. It is worthwhile to onsider

More information

The homopolar generator: an analytical example

The homopolar generator: an analytical example The homopolar generator: an analytial example Hendrik van Hees August 7, 214 1 Introdution It is surprising that the homopolar generator, invented in one of Faraday s ingenious experiments in 1831, still

More information

We will show that: that sends the element in π 1 (P {z 1, z 2, z 3, z 4 }) represented by l j to g j G.

We will show that: that sends the element in π 1 (P {z 1, z 2, z 3, z 4 }) represented by l j to g j G. 1. Introdution Square-tiled translation surfaes are lattie surfaes beause they are branhed overs of the flat torus with a single branhed point. Many non-square-tiled examples of lattie surfaes arise from

More information

On the density of languages representing finite set partitions

On the density of languages representing finite set partitions On the density of languages representing finite set partitions Nelma Moreira Rogério Reis Tehnial Report Series: DCC-04-07 Departamento de Ciênia de Computadores Fauldade de Ciênias & Laboratório de Inteligênia

More information

Chapter 9. The excitation process

Chapter 9. The excitation process Chapter 9 The exitation proess qualitative explanation of the formation of negative ion states Ne and He in He-Ne ollisions an be given by using a state orrelation diagram. state orrelation diagram is

More information

MOLECULAR ORBITAL THEORY- PART I

MOLECULAR ORBITAL THEORY- PART I 5.6 Physial Chemistry Leture #24-25 MOLECULAR ORBITAL THEORY- PART I At this point, we have nearly ompleted our rash-ourse introdution to quantum mehanis and we re finally ready to deal with moleules.

More information

Combined Electric and Magnetic Dipoles for Mesoband Radiation, Part 2

Combined Electric and Magnetic Dipoles for Mesoband Radiation, Part 2 Sensor and Simulation Notes Note 53 3 May 8 Combined Eletri and Magneti Dipoles for Mesoband Radiation, Part Carl E. Baum University of New Mexio Department of Eletrial and Computer Engineering Albuquerque

More information

On the M-matrix inverse problem for singular and symmetric Jacobi matrices

On the M-matrix inverse problem for singular and symmetric Jacobi matrices Electronic Journal of Linear Algebra Volume 4 Volume 4 (0/0) Article 7 0 On the M-matrix inverse problem for singular and symmetric Jacobi matrices Angeles Carmona Andres Encinas andres.marcos.encinas@upc.edu

More information

n n=1 (air) n 1 sin 2 r =

n n=1 (air) n 1 sin 2 r = Physis 55 Fall 7 Homework Assignment #11 Solutions Textbook problems: Ch. 7: 7.3, 7.4, 7.6, 7.8 7.3 Two plane semi-infinite slabs of the same uniform, isotropi, nonpermeable, lossless dieletri with index

More information

F = F x x + F y. y + F z

F = F x x + F y. y + F z ECTION 6: etor Calulus MATH20411 You met vetors in the first year. etor alulus is essentially alulus on vetors. We will need to differentiate vetors and perform integrals involving vetors. In partiular,

More information

Effective masses for zigzag nanotubes in magnetic fields

Effective masses for zigzag nanotubes in magnetic fields Effetive masses for zigzag nanotubes in magneti fields Evgeny Korotyaev February 7, 00 arxiv:math-ph/0703017v1 5 Mar 007 Abstrat We onsider the Shrödinger operator with a periodi potential on quasi-1d

More information

University of Groningen

University of Groningen University of Groningen Port Hamiltonian Formulation of Infinite Dimensional Systems II. Boundary Control by Interonnetion Mahelli, Alessandro; van der Shaft, Abraham; Melhiorri, Claudio Published in:

More information

Some Properties on Nano Topology Induced by Graphs

Some Properties on Nano Topology Induced by Graphs AASCIT Journal of anosiene 2017; 3(4): 19-23 http://wwwaasitorg/journal/nanosiene ISS: 2381-1234 (Print); ISS: 2381-1242 (Online) Some Properties on ano Topology Indued by Graphs Arafa asef 1 Abd El Fattah

More information

Wave Propagation through Random Media

Wave Propagation through Random Media Chapter 3. Wave Propagation through Random Media 3. Charateristis of Wave Behavior Sound propagation through random media is the entral part of this investigation. This hapter presents a frame of referene

More information

SECOND HANKEL DETERMINANT PROBLEM FOR SOME ANALYTIC FUNCTION CLASSES WITH CONNECTED K-FIBONACCI NUMBERS

SECOND HANKEL DETERMINANT PROBLEM FOR SOME ANALYTIC FUNCTION CLASSES WITH CONNECTED K-FIBONACCI NUMBERS Ata Universitatis Apulensis ISSN: 15-539 http://www.uab.ro/auajournal/ No. 5/01 pp. 161-17 doi: 10.1711/j.aua.01.5.11 SECOND HANKEL DETERMINANT PROBLEM FOR SOME ANALYTIC FUNCTION CLASSES WITH CONNECTED

More information

Berry s phase for coherent states of Landau levels

Berry s phase for coherent states of Landau levels Berry s phase for oherent states of Landau levels Wen-Long Yang 1 and Jing-Ling Chen 1, 1 Theoretial Physis Division, Chern Institute of Mathematis, Nankai University, Tianjin 300071, P.R.China Adiabati

More information

Vector Analysis in Three Dimensions

Vector Analysis in Three Dimensions Appendix 1 etor Analysis in Three Dimensions MULTIPLICATIE RELATIONHIP a (b ) = (a b) = b ( a) (A1.1) a (b ) = b(a ) (a b) (A1.2) a (b ) (b a) = b (a ) (A1.3) (a b) ( d) = (a )(b d) (a d)(b ) (A1.4) a

More information

UNIVERSAL POISSON AND NORMAL LIMIT THEOREMS IN GRAPH COLORING PROBLEMS WITH CONNECTIONS TO EXTREMAL COMBINATORICS

UNIVERSAL POISSON AND NORMAL LIMIT THEOREMS IN GRAPH COLORING PROBLEMS WITH CONNECTIONS TO EXTREMAL COMBINATORICS UNIVERSAL POISSON AND NORMAL LIMIT THEOREMS IN GRAPH COLORING PROBLEMS WITH CONNECTIONS TO EXTREMAL COMBINATORICS BHASWAR B. BHATTACHARYA, PERSI DIACONIS, AND SUMIT MUKHERJEE Abstrat. This paper proves

More information

arxiv:gr-qc/ v2 6 Feb 2004

arxiv:gr-qc/ v2 6 Feb 2004 Hubble Red Shift and the Anomalous Aeleration of Pioneer 0 and arxiv:gr-q/0402024v2 6 Feb 2004 Kostadin Trenčevski Faulty of Natural Sienes and Mathematis, P.O.Box 62, 000 Skopje, Maedonia Abstrat It this

More information

The law of the iterated logarithm for c k f(n k x)

The law of the iterated logarithm for c k f(n k x) The law of the iterated logarithm for k fn k x) Christoph Aistleitner Abstrat By a lassial heuristis, systems of the form osπn k x) k 1 and fn k x)) k 1, where n k ) k 1 is a rapidly growing sequene of

More information

SINCE Zadeh s compositional rule of fuzzy inference

SINCE Zadeh s compositional rule of fuzzy inference IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 14, NO. 6, DECEMBER 2006 709 Error Estimation of Perturbations Under CRI Guosheng Cheng Yuxi Fu Abstrat The analysis of stability robustness of fuzzy reasoning

More information

Lightpath routing for maximum reliability in optical mesh networks

Lightpath routing for maximum reliability in optical mesh networks Vol. 7, No. 5 / May 2008 / JOURNAL OF OPTICAL NETWORKING 449 Lightpath routing for maximum reliability in optial mesh networks Shengli Yuan, 1, * Saket Varma, 2 and Jason P. Jue 2 1 Department of Computer

More information

Simple FIR Digital Filters. Simple FIR Digital Filters. Simple Digital Filters. Simple FIR Digital Filters. Simple FIR Digital Filters

Simple FIR Digital Filters. Simple FIR Digital Filters. Simple Digital Filters. Simple FIR Digital Filters. Simple FIR Digital Filters Simple Digital Filters Later in the ourse we shall review various methods of designing frequeny-seletive filters satisfying presribed speifiations We now desribe several low-order FIR and IIR digital filters

More information