PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION ON QUANTUM GRAPHS AND THE RESONANCE ASYMPTOTICS
|
|
- Willa Justina Harrington
- 5 years ago
- Views:
Transcription
1 PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION ON QUANTUM GRAPHS AND THE RESONANCE ASYMPTOTICS JIŘÍ LIPOVSKÝ Department of Physcs, Faculty of Scence, Unversty of Hradec Králové, Roktanského 6, Hradec Králové, Czecha Abstract. In ths note we explan the method how to fnd the resonance condton on quantum graphs, whch s called pseudo orbt expanson. In three examples wth standard couplng we show n detal how to obtan the resonance condton. We focus on non-weyl graphs,.e. the graphs whch have fewer resonances than expected. For these graphs we explan benefts of the method of deletng edges for smplfyng the graph. PACS: Ge, Nk, 0.0.Ox. Introducton Resonances are a phenomenon, whch occurs often n physcs and can be easly understood heurstcally. Nevertheless, studyng t mathematcally rgorously s more dffcult. There are two man defntons of resonances resolvent resonances poles of the meromorphc contnuaton of the resolvent nto the non-physcal sheet) and scatterng resonances poles of the meromorphc contnuaton of the scatterng matrx). Non-compact quantum graph, where halflnes are attached to a compact part of the graph, provdes a good background for studyng resonances. It has been proven n [EL07] that on quantum graph the above two defntons are almost equvalent; to be precse, the set of resolvent resonances s equal to the unon of the set of scatterng resonances and the set of the egenvalues supported only on the nternal part of the graph. There s a large bblography on resonances n quantum graphs; for the quantum chaos communty e.g. the papers [KS03, KS04] mght be nterestng. The pseudo orbt expanson s a powerful tool for the trace formula expanson and the secular equaton on compact quantum graphs. We refer the reader to [BHJ] and the references theren. The method has been recently adjusted to fndng the resonance condton for non-compact quantum graphs [Lp5]. The resonance asymptotcs on non-compact quantum graphs was frst studed n [DP], where t was observed that some graphs do not obey expected Weyl behavour and a crteron for dstngushng non-weyl graphs wth standard couplng has been obtaned. Ths crteron was later generalzed n [DEL0] to all possble couplngs. Asymptotcs for magnetc graphs was studed n [EL]. The paper [Lp5] shows how to fnd the constant by the leadng term of the asymptotcs for non-weyl graphs and gves bounds on ths constant. E-mal address: jr.lpovsky@uhk.cz.
2 PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION In the current note we contnue n nvestgatng ths problem and llustrate the man results of [Lp5] on several smple examples wth standard couplng. In partcular, we focus on the pseudo orbt expanson and explan to the reader n detal how to construct the resonance condton by ths method. The paper s structured as follows. In the second secton we ntroduce the model and the resonance asymptotcs. The thrd secton deals wth the pseudo orbt expanson. In the secton 4 we gve two theorems on the effectve sze of an equlateral graph. In all these three secton we gve theorems wthout proofs, whch can be found n the referred papers. The only excepton s the theorem 3., where a smpler proof than the general one from [Lp5] s gven. The last three secton are devoted the the examples of non-weyl graphs. In all of them the resonance condton s obtaned from a regular drected graph and then from a smplfed graph after deletng some of ts edges.. Prelmnares We assume a quantum graph wth attached halflnes. We consder a metrc graph Γ, whch conssts of the set of vertces V and the set of edges E. There are N fnte edges, parametrzed by the segments 0, l j ), and M nfnte edges, parametrzed by 0, ). The graph s equpped wth the quantum Hamltonan H actng as negatve second dervatve wth the doman consstng of functons n the Sobolev space W, Γ) ths space conssts of Sobolev spaces on the edges) whch fulfll the couplng condtons at the vertces U j I)Ψ j + U j + I)Ψ j = 0..) Here U j s a d d untary matrx d s the degree of the gven vertex), I s d d unt matrx, Ψ j s the vector of lmts of functonal values at the gven vertex and Ψ j s the vector of lmts of outgong dervatves. In ths paper, we wll mostly consder standard couplng sometmes also known as Krchhoff, free or Neumann) n ths case the functonal values are contnuous n the vertex and the sum of outgong dervatves s equal to zero. The correspondng couplng matrx s U j = J I, where J s a d d matrx wth all entres equal to one. d We wll study resolvent resonances. The resolvent resonance s often defned as pole of the meromorphc contnuaton of the resolvent H λd). We wll use a smpler defnton, proof that both defntons are equvalent can be done by the method of complex scalng [EL07]. Defnton.. We say that λ = k s a resolvent resonance of H f there s a generalzed egenfuncton f, whch satsfes f x) = k fx) on all edges of the graph, satsfes the couplng condtons.) at the vertces and ts restrcton to each halflne s β j expkx). Defnton.. The countng functon NR) gves the number of all resolvent resonances ncludng multplctes) n the crcle of radus R centered at the orgn n the k-plane. Now we state the surprsng result of Daves and Pushntsk [DP] on the exstence of graphs wth non-weyl asymptotcs. Theorem.3. For graphs wth standard couplng the followng bound on the countng functon holds NR) = π W R + O) as R
3 PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION 3 wth 0 W vol Γ, where vol Γ s the sum of the lengths of the nternal edges of the graph. W s strctly smaller than vol Γ ff there exsts a balanced vertex, the vertex for whch there s the same number of nternal and external edges. 3. Pseudo orbt expanson for the resonance condton In ths secton, we lay theoretcal grounds for the method of pseudo orbt expanson. The method of pseudo orbt expanson was used to fndng the spectrum and trace formula for compact quantum graphs we refer to [BHJ]). The method was recently adjusted by the author to obtan the resonance condton for graphs wth attached halflnes [Lp5]. We explan here the method, n most cases omttng the proofs, whch can be found n the above references. We defne an effectve vertex-scatterng matrx, whch gves effectve scatterng from the nternal edges to other nternal edges emanatng from a vertex wth radatng condton on the halflnes. Defnton 3.. Let us assume a vertex v of the graph wth n nternal edges, whch emanate from ths vertex, parametrzed by 0, l j ) wth x = 0 correspondng to v and m halflnes. Let the soluton of the Schrödnger equaton on these nternal edges be f j x) = αj n exp kx) + αj out exp kx) and on the external edges g s x) = β s exp kx). Then the effectve vertex-scatterng matrx σ v) s gven by the relaton α v out = σ v) α v n, where the vectors α v out and α v n have as entres the above coeffcents of the outgong and ncomng waves, respectvely. Theorem 3.. The effectve vertex-scatterng matrx for the vertex v wth n nternal and m external edges and the standard couplng s σ v) = J n+m n I n, where J n s n n matrx wth all entres equal to one and I n s n n unt matrx. In partcular, for a balanced vertex σ v) = J n n I n. Proof. The theorem s proven as corollary 4.3 n [Lp5], we wll show here a drect proof. The couplng condton yeld α out j + α n j = α out Now we fx and substtute for β s = α out n j= + α n = β s, j =,... n, s =,..., m, n m k αj out αj n ) + k β j = 0. α out From ths equaton we have from whch the result follows. + α n j= + α n and α out j = α out s= αj n ) + mα out + α n ) = 0. n ) α out = αj n α n n + m j= + α n α n j. We obtan Now we ntroduce the orented graph Γ, whch s made from the compact part of the graph Γ. Each edge s replaced by two orented edges b j, ˆb j of the same length and opposte drectons. We wll defne the followng matrces.
4 4 PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION Defnton 3.3. The N N matrx Σ s a block-dagonalzable matrx wrtten n the bass correspondng to α = αb n,..., αb n N, α n,..., α n ) T ˆb ˆbN whch s block dagonal wth blocks σ v f transformed to the bass α n b v,..., αn b v d, α n b v,..., αn b v d,... ) T, where b v j s the j-th edge endng at the vertex v. Moreover, we defne N N matrx Q = and L = dag l,..., l N, l,..., l N ). 0 IN I N 0 ), the scatterng matrx S = Q Σ Note that Σ and S may for general couplng be energy dependent. However, ths s not the case for standard couplng, snce the matrx σ s not energy dependent. The matrx S = Q Σ s constructed n the followng way. We denote ts frst N rows by b,... b N and the other N rows by the edges n the opposte drecton ˆb,... ˆb N ; smlarly we denote the columns. If b j ends n the vertex v, then we wrte nto the b j -th column and all rows correspondng to orented edges startng from v the entres of the vertex-scatterng matrx σ v). To the ˆb j -th row we wrte the dagonal term of σ v), to the other rows whch correspond to the edges emanatng from v the nondagonal terms; n the rest of the rows n ths column s zero. We contnue wth the theorem whch s proven n [Lp5], but the proof s wth the excepton of the effectve vertex-scatterng matrx the same as e.g. n [BHJ]. Theorem 3.4. The resonance condton s where I N s a N N unt matrx. det e kl Q Σ I N ) = 0, Now we defne perodc orbts, pseudo orbts and rreducble pseudo orbts. Defnton 3.5. A perodc orbt γ on the graph Γ s a closed path on Γ. A pseudo orbt γ s a collecton of perodc orbts. An rreducble pseudo orbt γ s a pseudo orbt, whch does not use any drected edge more than once. We defne length of a perodc orbt by l γ = j,b j γ l j; the length of pseudo orbt and hence rreducble pseudo orbt) s the sum of the lengths of the perodc orbts from whch t s composed. We defne product of scatterng ampltudes for a perodc orbt γ = b, b,..., b n ) t uses frst the bond b, then t contnues to b, etc., t ends n the bond b n whch s connected to b ) as A γ = S b b S b3 b... S b b n, where S b b s the entry of the matrx S n the b -th row and b -th column. For a pseudo orbt we defne A γ = Π γn γa γj. Fnally, by m γ we denote the number of perodc orbts n the pseudo orbt γ. Now we restate the prevous theorem usng rreducble pseudo orbts; the proof can be found n [BHJ]. Theorem 3.6. The resonance condton s gven by the sum over rreducble pseudo orbts ) m γ A γ e kl γ = 0. γ Note that n general A γ can be energy dependent, but ths s not the case for standard couplng.
5 PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION 5 v v v 3 ˆ ˆ Fgure. Graph Γ for two abscssas and two halflnes 4. Theorems on the effectve sze of an equlateral graph Now we focus on equlateral graphs the graphs whch have all the nternal edges of the length l. Frst, we gve a theorem how to fnd the effectve sze of an equlateral graph. Then we ntroduce a method how to reduce the number of orented edges of the graph Γ for an equlateral graph wth standard couplng and balanced vertces. Both theorems were proven n [Lp5]. Theorem 4.. Let us assume an equlateral graph nternal edges of lengths l). Then the effectve sze s l n nonzero, where n nonzero s the number of nonzero egenvalues of the matrx S = Q Σ. Theorem 4.. Let us assume an equlateral graph Γ for whch no edge starts and ends n one vertex and no two vertces are connected by more than one edge. Let us assume standard couplng and let there be a balanced vertex v n whch drected edges b, b,..., b d end. Then the followng constructon does not change the resonance condton. We delete the drected edge b of the graph Γ, whch starts n the vertex v, and replace t by ghost edges b, b,..., b d ), where the ghost edge b j) starts n the vertex v and contnues to the drected edge b j+. Contrbuton of the rreducble pseudo orbt contanng ghost edge b to the resonance condton gven by theorem 3.6 s the followng. The ghost edge does not contrbute to the length of the pseudo orbt. The scatterng ampltude from the bond b, whch ends n v, to the bond b s equal to the scatterng ampltude from b to b taken wth the opposte sgn. Every ghost edge can be n the rreducble pseudo orbt used only once. Smlarly, one can delete more edges; for each balanced vertex we delete an edge whch ends n ths vertex. 5. Example : two abscssas and two halflnes In the followng sectons we use prevous theorems n several smple examples. Graph n the frst example conssts of two nternal edges of length l connected n one vertex wth two halflnes. There s Drchlet couplng f0) = 0) at the spare ends vertces v and v 3 ) of the abscssas and standard couplng n the central vertex v ). The orented graph Γ s shown n) fgure. Snce the vertex v s balanced, we have by theorem 3. σ v) =. The vertex-scatterng matrces for the vertces v and v 3 are σ v) = σ v3) =. The matrx S = Q Σ s ˆ ˆ / 0 0 / ˆ / 0 0 / ˆ
6 6 PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION v v v 3 ˆ ˆ Fgure. Graph Γ after deletng the edge We explctly mark the edges to whch the columns and rows correspond. Egenvalues of S are, and 0 wth multplcty. From theorem 4. we obtan that the effectve sze of the graph s l. Now we fnd the resonance condton usng pseudo orbts. The contrbuton of the pseudo orbts whch do not nclude any bond s. Clearly, there are no rreducble pseudo orbts on one or three bonds. Let us look at the contrbuton of the rreducble pseudo orbts on two edges,.e. fnd the coeffcent by expkl). We have two rreducble pseudo orbts, ˆ) and, ˆ). The scatterng ampltude between ˆ and s, the scatterng ampltude between and ˆ s /. There s one perodc orbt n the pseudo orbt, ˆ), hence there s a factor of ). The contrbuton of the rreducble pseudo orbt, ˆ) s ) /) ) = /, smlarly for the pseudo orbt, ˆ). Hence the coeffcent by expkl) s. Fnally, we fnd the contrbuton the rreducble pseudo orbts on four edges. There are two rreducble pseudo orbts:,, ˆ, ˆ) and, ˆ), ˆ); the former conssts of one perodc orbt, the latter of two perodc orbts. The contrbuton of the rreducble pseudo orbt,, ˆ, ˆ) s ) /) ) = /4, the contrbuton of the rreducble pseudo orbt, ˆ), ˆ) s ) /) ) = /4. Hence the coeffcent by exp4kl) s 0, because contrbuton of the two rreducble pseudo orbts cancel. The resonance condton s expkl) = 0. Snce the vertex v s balanced, we can also delete one bond whch ends n ths vertex, say bond. We replace t by a ghost edge whch starts at v and contnues to the only other edge whch ends n v, the bond ˆ see fgure ). Now we can do pseudo orbt expanson agan. The contrbuton of pseudo orbt whch does not nclude any bond s. We have two rreducble pseudo orbts on two non-ghost edges ˆ,, ˆ) and, ˆ). The former has contrbuton / ) = / we have used the fact that the scatterng ampltude between ˆ and ˆ s +, because the scatterng ampltude between ˆ and was ), the contrbuton of the latter s ) /) ) = /. Agan we obtan that the coeffcent by expkl) s. There s no rreducble pseudo orbt, whch would use all the three remanng non-ghost edges, even f t would use the ghost edge. Clearly, there cannot be also any pseudo orbt on four edges, because we have deleted one. Agan, we obtan the same resonance condton. In ths case t was easer to fnd that the coeffcent by exp4kl) s zero. We conclude that the resolvent resonances n ths case are only egenvalues λ = k wth k = nπ, n Z. 6. Example : trangle wth attached halflnes Let us consder a graph wth three nternal edges of the lengths l n the trangle. To each vertex two halflnes are attached, so every vertex s balanced. The graph
7 PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION 7 ˆ3 ˆ ˆ3 3 ˆ Fgure 3. Graph Γ for the trangle wth attached halflnes ˆ 3 ˆ Fgure 4. Graph Γ for the trangle wth attached halflnes after deletng the edges ˆ, ˆ, ˆ3 Γ s shown) n fgure 3. The vertex scatterng matrces are n all the vertces σ v) =. The matrx S = Q Σ s 3 ˆ ˆ ˆ3 0 0 / / 0 0 / / / / ˆ / / 0 ˆ 0 / / ˆ3 0 0 / / 0 0. Its egenvalues are, / wth multplcty and 0 wth multplcty 3. Hence the effectve sze of ths graph s 3l/. Now we fnd the contrbutons of the pseudo orbts to the resonance condton. There s no rreducble pseudo orbt on edge and on 5 edges. We have the followng three rreducble pseudo orbts on two edges:, ˆ);, ˆ); 3, ˆ3). There are two rreducble pseudo orbts on three edges,, 3) and ˆ, ˆ3, ˆ), sx on four edges, ˆ), ˆ);, ˆ)3, ˆ3); 3, ˆ3), ˆ);,, ˆ, ˆ);, 3, ˆ3, ˆ); 3,, ˆ, ˆ3) and eght rreducble pseudo orbts on sx edges, ˆ), ˆ)3, ˆ3);,, ˆ, ˆ)3, ˆ3);, 3, ˆ3, ˆ), ˆ); 3,, ˆ, ˆ3), ˆ);,, 3)ˆ, ˆ3, ˆ);,, 3, ˆ3, ˆ, ˆ);, 3,, ˆ, ˆ3, ˆ); 3,,, ˆ, ˆ, ˆ3). Below, we compute ther
8 8 PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION contrbutons exp 0 :, exp kl) : ) ) 3 = 3 4, ) 3 exp 3kl) : ) = 4, exp 4kl) : 4 ) ) 3 + ) ) ) 3 = 0, exp 6kl) : ) 6 ) 3 + ) ) ) ) 3 + ) 3 ) 3 + ) + ) ) 4 ) 3 = 0. The resonance condton s 3 4 exp kl) exp 3kl) = 0. 4 The alternatve way of constructng the resonance condton s usng the method of deletng the edges. We have three balanced vertces, hence we can delete the edges ˆ, ˆ and ˆ3 and replace them by ghost edges ˆ, ˆ and ˆ3 see fgure 4). It s clear that there are no rreducble pseudo orbts on 4, 5 or 6 edges and snce no ghost edge contnues to an edge endng n a vertex from whch ths ghost edge starts, there are also no pseudo orbts on one edge. There are three rreducble pseudo orbts on two non-ghost edges,, ˆ );, 3, ˆ3 ); 3,, ˆ ) and there are two rreducble pseudo orbts on three edges,, 3) and, ˆ, 3, ˆ3,, ˆ ). Ther contrbutons are exp 0 :, ) exp kl) : ) 3 = 3 4, ) 3 exp 3kl) : ) = 4, whch gves the same resonance condton. The resonances are such λ = k wth k = nπ/l and k = π + nπ ln )/l wth multplcty two, n Z.
9 PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION 9 v v ˆ 4 ˆ4 ˆ v v ˆ3 ˆ4 4 ˆ ˆ v 4 ˆ3 3 Fgure 5. Graph Γ for the square wth attached halflnes v 3 v 4 3 Fgure 6. Graph Γ for the square wth attached halflnes after deletng the edges ˆ, ˆ, ˆ3, ˆ4 v 3 7. Example 3: square wth attached halflnes We consder a square of the edges of lengths l, n each vertex two halflnes are attached, hence every vertex s balanced. The) graph Γ s n fgure 5. The vertexscatterng matrces are agan σ v) =. The matrx S = Q Σ s 3 4 ˆ ˆ ˆ3 ˆ / / / / / / / / ˆ / / 0 0 ˆ 0 / / 0 ˆ3 0 0 / / ˆ / / 0 0 0, ts egenvalues are, and 0 wth multplcty 6; the effectve sze s l. One can see that there are no rreducble pseudo orbts on odd number of edges. The rreducble pseudo orbts on two edges are, ˆ);, ˆ); 3, ˆ3); 4, ˆ4), on four edges, ˆ), ˆ);, ˆ)3, ˆ3);, ˆ)4, ˆ4);, ˆ)3, ˆ3);, ˆ)4, ˆ4); 3, ˆ3)4, ˆ4);,, ˆ, ˆ);, 3, ˆ3, ˆ); 3, 4, ˆ4, ˆ3); 4,, ˆ, ˆ4);,, 3, 4); ˆ4, ˆ3, ˆ, ˆ), on sx edges, ˆ), ˆ)3, ˆ3);, ˆ), ˆ)4, ˆ4);, ˆ)3, ˆ3)4, ˆ4);, ˆ)3, ˆ3)4, ˆ4);,, ˆ, ˆ)3, ˆ3);,, ˆ, ˆ)4, ˆ4);, 3, ˆ3, ˆ), ˆ);, 3, ˆ3, ˆ)4, ˆ4); 3, 4, ˆ4, ˆ3), ˆ); 3, 4, ˆ4, ˆ3), ˆ); 4,, ˆ, ˆ4), ˆ); 4,, ˆ, ˆ4)3, ˆ3);,, 3, ˆ3, ˆ, ˆ);, 3, 4, ˆ4, ˆ3, ˆ); 3, 4,, ˆ, ˆ4, ˆ3); 4,,, ˆ, ˆ, ˆ4) and on eght edges, ˆ), ˆ)3, ˆ3)4, ˆ4);,, ˆ, ˆ)3, ˆ3)4, ˆ4);, 3, ˆ3, ˆ), ˆ)4, ˆ4); 3, 4, ˆ4, ˆ3), ˆ), ˆ); 4,, ˆ, ˆ4), ˆ)3, ˆ3);,, ˆ, ˆ)3, 4, ˆ4, ˆ3);, 3, ˆ3, ˆ)4,, ˆ, ˆ4);,, 3, ˆ3, ˆ, ˆ)4, ˆ4);, 3, 4, ˆ4, ˆ3, ˆ), ˆ); 3, 4,, ˆ, ˆ4, ˆ3), ˆ); 4,,, ˆ, ˆ, ˆ4)3, ˆ3);
10 0 PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION 3 4 Fgure 7. Graph Γ smplfed after deletng the edges,, 3, 4)ˆ4, ˆ3, ˆ, ˆ);,, 3, 4, ˆ4, ˆ3, ˆ, ˆ);, 3, 4,, ˆ, ˆ4, ˆ3, ˆ); 3, 4,,, ˆ, ˆ, ˆ4, ˆ3); 4,,, 3, ˆ3, ˆ, ˆ, ˆ4). Ther contrbutons to the resonance condtons are exp 0 :, exp kl) : ) ) 4 =, exp 4kl) : exp 6kl) : exp 8kl) : ) ) ) 6 + ) ) ) ) ) ) 4 ) 4 = 0, + ) ) ) ) ) ) 4 + ) ) ) 4 + ) ) ) 4 + ) ) ) 4 4 ) ) + ) 4 ) = 0 ) ) ) ) 8 + ) ) ) + ) ) ) ) ) ) 4 ) 6 ) 4 = 0. If we delete the edges ˆ, ˆ, ˆ3 and ˆ4, we obtan fgure 6. Note that the scatterng ampltude for path from to s the same as the scatterng ampltude from to 4 through ˆ ; n both cases we obtan /. Smlarly for other vertces, so the graph s equvalent to a graph n fgure 7, where all the scatterng ampltudes are /. Ths smplfes fndng the resonance condton. We have four rreducble pseudo orbts on two edges ); 4); 3); 34) and four on four edges )34); 4)3); 34); 43). Ther contrbuton s exp 0 :, ) exp kl) : ) 4 =, ) ) ) 4 exp 4kl) : ) + ) = 0.
11 PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION The resonance condton s exp kl) = 0, the postons of resonances are λ = k wth k = nπ/l, n Z. Acknowledgements Support of the grant 5-480Y of the Grant Agency of the Czech Republc s acknowledged. The author thanks to R. Band for a useful dscusson. References [BHJ] R. Band, J. M. Harrson, C. H. Joyner, Fnte pseudo orbt expansons for spectral quanttes of quantum graphs, J. Phys. A: Math. Theor. 45, ). DOI: 0.088/75-83/45/3/3504 [DEL0] E. B. Daves, P. Exner, J. Lpovský, Non-Weyl asymptotcs for quantum graphs wth general couplng condtons, J. Phys. A: Math. Theor. 43, ). DOI: 0.088/75-83/43/47/47403 [DP] E. B. Daves, A. Pushntsk, Non-Weyl resonance asymptotcs for quantum graphs, Analyss and PDE 4, ). DOI: 0.40/apde [EL07] P. Exner, J. Lpovský, Equvalence of resolvent and scatterng resonances on quantum graphs, n Adventures n Mathematcal Physcs Proceedngs, Cergy-Pontose 006) vol 447 Provdence, R.I.), pp ). DOI: 0.090/conm/447 [EL] P. Exner, J. Lpovský, Non-Weyl resonance asymptotcs for quantum graphs n a magnetc feld, Phys. Lett. A 375, ). DOI: 0.06/j.physleta [KS03] T. Kottos, U. Smlansky, Quantum graphs: a smple model for chaotc scatterng, J. Phys. A: Math. Gen. 36, , 003). DOI: 0.088/ /36//337 [KS04] T. Kottos, H. Schanz, Statstcal propertes of resonance wdth for open quantum systems Waves n Random Meda 4, S9 S05 004). DOI: 0.088/ /4//03 [Lp5] J. Lpovský, On the effectve sze of a non-weyl graph, arxv: [math-ph] 05).
More metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationNon-interacting Spin-1/2 Particles in Non-commuting External Magnetic Fields
EJTP 6, No. 0 009) 43 56 Electronc Journal of Theoretcal Physcs Non-nteractng Spn-1/ Partcles n Non-commutng External Magnetc Felds Kunle Adegoke Physcs Department, Obafem Awolowo Unversty, Ile-Ife, Ngera
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationProf. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model
EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationDensity matrix. c α (t)φ α (q)
Densty matrx Note: ths s supplementary materal. I strongly recommend that you read t for your own nterest. I beleve t wll help wth understandng the quantum ensembles, but t s not necessary to know t n
More information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More informationPHYS 215C: Quantum Mechanics (Spring 2017) Problem Set 3 Solutions
PHYS 5C: Quantum Mechancs Sprng 07 Problem Set 3 Solutons Prof. Matthew Fsher Solutons prepared by: Chatanya Murthy and James Sully June 4, 07 Please let me know f you encounter any typos n the solutons.
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationRepresentation theory and quantum mechanics tutorial Representation theory and quantum conservation laws
Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationNOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules
NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules EVAN WILSON Quantum groups Consder the Le algebra sl(n), whch s the Le algebra over C of n n trace matrces together wth the commutator
More informationLecture Note 3. Eshelby s Inclusion II
ME340B Elastcty of Mcroscopc Structures Stanford Unversty Wnter 004 Lecture Note 3. Eshelby s Incluson II Chrs Wenberger and We Ca c All rghts reserved January 6, 004 Contents 1 Incluson energy n an nfnte
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationProblem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?
Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2
More informationEPR Paradox and the Physical Meaning of an Experiment in Quantum Mechanics. Vesselin C. Noninski
EPR Paradox and the Physcal Meanng of an Experment n Quantum Mechancs Vesseln C Nonnsk vesselnnonnsk@verzonnet Abstract It s shown that there s one purely determnstc outcome when measurement s made on
More informationA how to guide to second quantization method.
Phys. 67 (Graduate Quantum Mechancs Sprng 2009 Prof. Pu K. Lam. Verson 3 (4/3/2009 A how to gude to second quantzaton method. -> Second quantzaton s a mathematcal notaton desgned to handle dentcal partcle
More informationDifferential Polynomials
JASS 07 - Polynomals: Ther Power and How to Use Them Dfferental Polynomals Stephan Rtscher March 18, 2007 Abstract Ths artcle gves an bref ntroducton nto dfferental polynomals, deals and manfolds and ther
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationOn Finite Rank Perturbation of Diagonalizable Operators
Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationWorkshop: Approximating energies and wave functions Quantum aspects of physical chemistry
Workshop: Approxmatng energes and wave functons Quantum aspects of physcal chemstry http://quantum.bu.edu/pltl/6/6.pdf Last updated Thursday, November 7, 25 7:9:5-5: Copyrght 25 Dan Dll (dan@bu.edu) Department
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationIntroduction. - The Second Lyapunov Method. - The First Lyapunov Method
Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationThe equation of motion of a dynamical system is given by a set of differential equations. That is (1)
Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence
More informationTHERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS
Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg
More informationAsymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation
Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton
More informationStatistical Mechanics and Combinatorics : Lecture III
Statstcal Mechancs and Combnatorcs : Lecture III Dmer Model Dmer defntons Defnton A dmer coverng (perfect matchng) of a fnte graph s a set of edges whch covers every vertex exactly once, e every vertex
More informationLinear Algebra and its Applications
Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationQuantum Mechanics for Scientists and Engineers. David Miller
Quantum Mechancs for Scentsts and Engneers Davd Mller Types of lnear operators Types of lnear operators Blnear expanson of operators Blnear expanson of lnear operators We know that we can expand functons
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More informationThe Feynman path integral
The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space
More informationPhys304 Quantum Physics II (2005) Quantum Mechanics Summary. 2. This kind of behaviour can be described in the mathematical language of vectors:
MACQUARIE UNIVERSITY Department of Physcs Dvson of ICS Phys304 Quantum Physcs II (2005) Quantum Mechancs Summary The followng defntons and concepts set up the basc mathematcal language used n quantum mechancs,
More informationSupplemental document
Electronc Supplementary Materal (ESI) for Physcal Chemstry Chemcal Physcs. Ths journal s the Owner Socetes 01 Supplemental document Behnam Nkoobakht School of Chemstry, The Unversty of Sydney, Sydney,
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More information763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.
7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator  are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationThe Two-scale Finite Element Errors Analysis for One Class of Thermoelastic Problem in Periodic Composites
7 Asa-Pacfc Engneerng Technology Conference (APETC 7) ISBN: 978--6595-443- The Two-scale Fnte Element Errors Analyss for One Class of Thermoelastc Problem n Perodc Compostes Xaoun Deng Mngxang Deng ABSTRACT
More information14 The Postulates of Quantum mechanics
14 The Postulates of Quantum mechancs Postulate 1: The state of a system s descrbed completely n terms of a state vector Ψ(r, t), whch s quadratcally ntegrable. Postulate 2: To every physcally observable
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introducton to Cluster Algebra Ivan C.H. Ip Updated: Ma 7, 2017 3 Defnton and Examples of Cluster algebra 3.1 Quvers We frst revst the noton of a quver. Defnton 3.1. A quver s a fnte orented
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationEvery planar graph is 4-colourable a proof without computer
Peter Dörre Department of Informatcs and Natural Scences Fachhochschule Südwestfalen (Unversty of Appled Scences) Frauenstuhlweg 31, D-58644 Iserlohn, Germany Emal: doerre(at)fh-swf.de Mathematcs Subject
More informationCurvature and isoperimetric inequality
urvature and sopermetrc nequalty Julà ufí, Agustí Reventós, arlos J Rodríguez Abstract We prove an nequalty nvolvng the length of a plane curve and the ntegral of ts radus of curvature, that has as a consequence
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationMATH Sensitivity of Eigenvalue Problems
MATH 537- Senstvty of Egenvalue Problems Prelmnares Let A be an n n matrx, and let λ be an egenvalue of A, correspondngly there are vectors x and y such that Ax = λx and y H A = λy H Then x s called A
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationCS 468 Lecture 16: Isometry Invariance and Spectral Techniques
CS 468 Lecture 16: Isometry Invarance and Spectral Technques Justn Solomon Scrbe: Evan Gawlk Introducton. In geometry processng, t s often desrable to characterze the shape of an object n a manner that
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationOpen Systems: Chemical Potential and Partial Molar Quantities Chemical Potential
Open Systems: Chemcal Potental and Partal Molar Quanttes Chemcal Potental For closed systems, we have derved the followng relatonshps: du = TdS pdv dh = TdS + Vdp da = SdT pdv dg = VdP SdT For open systems,
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationProjective change between two Special (α, β)- Finsler Metrics
Internatonal Journal of Trend n Research and Development, Volume 2(6), ISSN 2394-9333 www.jtrd.com Projectve change between two Specal (, β)- Fnsler Metrcs Gayathr.K 1 and Narasmhamurthy.S.K 2 1 Assstant
More informationAdvanced Quantum Mechanics
Advanced Quantum Mechancs Rajdeep Sensarma! sensarma@theory.tfr.res.n ecture #9 QM of Relatvstc Partcles Recap of ast Class Scalar Felds and orentz nvarant actons Complex Scalar Feld and Charge conjugaton
More informationNon-negative Matrices and Distributed Control
Non-negatve Matrces an Dstrbute Control Yln Mo July 2, 2015 We moel a network compose of m agents as a graph G = {V, E}. V = {1, 2,..., m} s the set of vertces representng the agents. E V V s the set of
More informationAn Introduction to Morita Theory
An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationh-analogue of Fibonacci Numbers
h-analogue of Fbonacc Numbers arxv:090.0038v [math-ph 30 Sep 009 H.B. Benaoum Prnce Mohammad Unversty, Al-Khobar 395, Saud Araba Abstract In ths paper, we ntroduce the h-analogue of Fbonacc numbers for
More informationThis model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as:
1 Problem set #1 1.1. A one-band model on a square lattce Fg. 1 Consder a square lattce wth only nearest-neghbor hoppngs (as shown n the fgure above): H t, j a a j (1.1) where,j stands for nearest neghbors
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationNumerical Solution of Ordinary Differential Equations
Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples
More informationGeometry of Müntz Spaces
WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.
More informationThe Degrees of Nilpotency of Nilpotent Derivations on the Ring of Matrices
Internatonal Mathematcal Forum, Vol. 6, 2011, no. 15, 713-721 The Degrees of Nlpotency of Nlpotent Dervatons on the Rng of Matrces Homera Pajoohesh Department of of Mathematcs Medgar Evers College of CUNY
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More information), it produces a response (output function g (x)
Lnear Systems Revew Notes adapted from notes by Mchael Braun Typcally n electrcal engneerng, one s concerned wth functons of tme, such as a voltage waveform System descrpton s therefore defned n the domans
More informationErratum: A Generalized Path Integral Control Approach to Reinforcement Learning
Journal of Machne Learnng Research 00-9 Submtted /0; Publshed 7/ Erratum: A Generalzed Path Integral Control Approach to Renforcement Learnng Evangelos ATheodorou Jonas Buchl Stefan Schaal Department of
More information