Transmission Eigenvalues in One Dimension

Size: px
Start display at page:

Download "Transmission Eigenvalues in One Dimension"

Transcription

1 Transission Eigenvalues in One Diension John Sylvester Abstract We show how to locate all the transission eigenvalues for a one diensional constant index of refraction on an interval. 1 Introduction The scattering operator for the tie haronic Helholtz equation with copactly supported index of refraction n(x) aps the asyptotics of incident waves (Herglotzwave functions) v 0 totheasyptotics of(outgoing)scattered waves u +. Both u + and v 0 are defined in R n and satisfy ( +k 2 n 2 )u + = (1 n 2 )k 2 v 0 ( +k 2 )v 0 = 0 in all of R n. If the scattering operator has a zero eigenvalue, we say that k 2 is a transission eigenvalue [6], [4]. It follows fro Rellich s theore and unique continuation that the scattered wave u + is identically zero outside any doain D that contains the support of n, and therefore that u = u + and v = v 0 are a pair of nontrivial functions satisfying ( +k 2 n 2 )u = (1 n 2 )k 2 v in D (1.1) ( +k 2 )v = 0 in D (1.2) u u = 0 = 0 (1.3) D D ν Departent of Matheatics,University of Washington, Seattle, Washington 98195,USA. (sylvest@uw.edu). Research was supported in part by NSF grant DMS

2 Whenever such a nontrivial pair exists, we say that k 2 is an interior transission eigenvalue for the pair (D,n). Reark 1. If we scale v by introducing w = k 2 v, then the k 2 on the right hand side of equation (1.1) disappears, and we see that the interior transission eigenvalue proble is a true generalized eigenvalue proble which can be written as u (1 n 2 )w = k 2 n 2 u w = k 2 w with the sae boundary conditions as in (1.3) [9]. The analogous interior proble for obstacle scattering is the Dirichlet proble, ( +k 2 )v = 0 v = 0 D in D and the Dirichlet eigenvalues are fairly well understood. In particular, the Dirichlet eigenvalues of a one diensional interval of length L are exactly n 2 π 2 L 2. The one diensional interior transission eigenvalue proble, even for a constant index of refraction, is not as siple. In one diension, with the index of refraction n(x) equal to the positive constant σ, equations (1.1) (1.2) (1.3) becoe u +k 2 σ 2 u = k 2 (1 σ 2 )v (1.4) v +k 2 v = 0 (1.5) u(± L 2 ) = 0 u (± L 2 ) = 0 (1.6) so that k 2 is an interior transission eigenvalue if and only there exist a nontrivial pair of eigenfunctions (u, v) satisfying (1.4)(1.5)(1.6). Wewillshowinproposition4thatk 2 isaninteriortransissioneigenvalue if and only if k is a root of the equation (σ 1) 2 sin 2 ((σ +1) kl 2 ) (σ +1)2 sin 2 ((σ 1) kl 2 ) = 0 (1.7) See section 8 of [3], as well as [8], for ore details about the connection between transission eigenvalues and interior transission eigenvalues 2

3 and the two theores below describe the roots of (1.7), which we will call the interior transission wavenubers (positive square roots of interior transission eigenvalues). Theore 2. The interior transission wavenubers satisfy I(k) 2 3σ +1 log L σ 1 In theore 3 below, the notation j denotes the floor, the greatest integer less than or equal to j. The condition j = j+1 eans that there is no integer between j j+1 and, and Z denotes the integers. Theore 3. Let = σ+1, and let j Z j σ 1 j+1 1. If Z and Z, there are exactly two siple interior transission wavenubers in the strip 2jπ 2(j +1)π < Re(k) < (σ +1)L (σ +1)L (a) If j j+1, both are real (b) If j = j+1 they are coplex conjugates with nonzero iaginary parts j 2. If Z, there is a quadruple interior transission wavenuber at k = j and no others in the strip 2(j 1)π 2(j +1)π < Re(k) < (σ +1)L (σ +1)L Thetransissionwavenubers fortwoσ s, withl = 2, areplottedbelow. The vertical blue lines indicate the sets Re(k) = 2jπ. The roots that fall (σ+1)l on these lines are quadruple. 2 TEs for σ = TEs for σ = As these σ s are rational, the transission eigenvalues are periodic. Reark 5 below explains how we did the coputation. 3

4 2 Leas and Proofs Because we are dealing with constant coefficients, the transission wavenubers k are the zeros of the analytic function on the left hand side of equation (1.7). This analytic function has two factors, and our proofs siplify if we treat each factor separately. Proposition 4. k is a transission wavenuber if, and only if, k satisfies or (σ 1)sin((σ +1) kl ) = (σ +1)sin((σ 1)kl 2 2 ) (2.1) (σ 1)sin((σ +1) kl ) = (σ +1)sin((σ 1)kl 2 2 ) (2.2) The wavenuber k satisfies (2.1) if there exists an eigenfunction pair (u, v) of odd functions of x, and k satisfies (2.2) if there exists an eigenfunction pair (u,v) of even functions. Proof. If a pair u,v satisfies ( ), then so do their odd and even parts, and the calculation is a little sipler for each of these parts. The odd parts satisfy ( ) with (1.6) replaced by u(0) = v(0) = 0 u( L 2 ) = u ( L 2 ) = 0 and the even parts satisfy ( ) with (1.6) replaced by u (0) = v (0) = 0 u( L 2 ) = u ( L 2 ) = 0 In the odd case, the boundary conditions at zero iply that and v = sin(kx) u = sin(kx)+asin(kσx) (2.3) for soe constant A. The boundary conditions at x = L 2 iply that sin(σk L 2 )cos(kl 2 ) = σsin(kl 2 )cos(σkl 2 ) (2.4) 4

5 Noting that the left and right hand sides are the beats representation of the cobinationofthefrequencies (σ+1) L 2 and(σ 1))L 2 suggeststhatwerewrite (2.4) as (σ 1)sin((σ +1)) L 2 k) = (σ +1)sin((σ 1)L 2 k) which is (2.1). A siilar calculation shows the existence of even transission eigenfunction pairs if and only if k satisfies (2.2). and If we introduce the new variables = σ +1 σ 1 (2.5) z = (σ 1)k L 2π then equations (2.1) and (2.2) becoe equations for z which depend on the single real paraeter. They becoe p o (z) := sin(πz) sin(πz) = 0 (2.6) p e (z) := sin(πz)+sin(πz) = 0 (2.7) where the superscripts refer to even and odd, respectively. Because σ > 0, > 1. Because equations (2.6) and (2.7) reain the sae if we change the sign of, we ay also assue that > 1, and will do so throughout. Reark 5. If = p is rational and we set w = eiπz q q, then (2.6) becoes a polynoial equation in w. w 2p 1 = p q ( w p+q w p q) (2.8) We can use a polynoial root finding algorith to find the solutions and then take logariths and rescale to find the interior transission wavenubers k. This is how we produced figure 1. With the notation introduced in (2.5), theore 2 becoes Alternatively, we could start with the assuption that σ > 1, and then use the relationship between the transission wavenubers of σ and those of 1 σ, k j( 1 σ ) = σk j(σ) to show that our forulas and estiates apply to σ < 1 as well. 5

6 Theore 6. If z satisfies (2.6) or (2.7), then I(z) log(2+1) π( 1) (2.9) Proof. If z = x+iy satisfies (2.6) so that e π y e π y 2 sinπz = 2 sinπz e π y +e π y e π y e π y +e π y +e π y Dividing both sides by e π y gives e ( 1)π y e (+1)π y ++e 2π y 2+1 Now taking the logarith of both sides yields (2.9) Locating the real parts of the roots of p (z) = p o (z)pe (z) will take ore work. We will show (roughly) that there are always two roots in certain strips of the coplex plane. We define I j S j = = { x { z j < x < j +1 } j j +1 < Re(z) < } A restateent of theore 3, using the notation of equation (2.5), is theore 7 below. Theore 7. Let > If neither j strip S j. nor j+1 are integers, then p has two siple roots in the (a) If the interval I j contains an integer k, both roots are real, and one is bigger and the other saller than k. (b) If the interval I j does not contain an integer, the roots are coplex conjugates (with nonzero iaginary parts). j 2. If is an integer, j is a quadruple root of p, and p has no other roots in S j or Sj 1. 6

7 Theore 7 is an iediate consequence of the analogous theores for p o and p e. These theores are a little ore coplicated to state, but easier to prove. Theore 8. Let > Suppose that neither j nor j+1 are integers. (a) If the interval I j contains an integer k and j + j is even, then p o has a real root in the interval ( j,k) and no other roots in S j and p e j+1 a root in (k, ) and no other roots in S j. If the interval I j contains an integer k and j + j is odd, then po root in the interval (k, j+1 ) and no other roots in S j root in ( j,k) and no other roots in S. j has a real and p e a (b) If the interval I j does not contain an integer and j + j is odd, p o has 2 siple coplex conjugate roots in S j and p e has none. If j + j is even, pe has 2 siple coplex conjugate roots in and p o has none. S j 2. If j is an integer, neither po nor pe have any roots in S or j Sj 1. If j + j is even, j is a triple root of po and a siple root of pe. If j + j is odd, j is a triple root of pe and a siple root of p o. Wewillprovetheore8(wewillonlyprovetheresultsforp o )bystudying a one paraeter faily of equations with fixed and paraeter β. p β (z) = sin(πz) βsin(πz) (2.10) We will use the fact that that the roots of the entire function p β (z) depend continuously on the paraeter β. We will also use the fact that, as β, the roots of p β ust approach those of sin(πz). This last fact follows fro the first by ultiplying (2.10) by α = 1, and the fact that the β roots of α sin(πz) sin(πz) depend continuously on α as α approaches zero. The continuity of the roots of analytic functions follows fro the fact that roots are isolated, together with the arguent principle. 7

8 Before giving the rigorous details, we give a rough outline of the proof of Theore 8. To siplify this outline we ignore the case where j is an integer. Theore 8 akes two assertions 1. It tells us the nuber of roots p o in each strip S j. This nuber is the sae for p β for all β > It tells us the nuber of real roots in each strip when β =. The nuber of real roots of p β changes as β increases fro zero to, but is the sae for all β. We establish the nuber of roots in each strip by observing that: 1. at β = 0 all roots are real and on the boundary of the strips S j, and the derivatives are nonzero and pointing in the direction of the correct strip (lea 9), so that, for sall positive β, the correct nuber of roots have entered each strip(corollary 10). 2. Lea 11 tells us that no roots can cross the boundary of S j, so the correct nuber of roots reain in each strip for all β (corollary 12). We calculate the nuber of roots which are real at β = by observing that: 1. As β approaches infinity, a single root ust approach each integer (the roots of sinπz), and the other roots ust leave every copact subset of C. 2. A calculation(lea 13) shows that for β, all roots are siple. 3. This eans that any real roots of p β in S j at β = ust reain real for β and reain in S j, so they reain in the interval I j. But, as β approaches infinity, the roots of p β ust either approach the roots of sinπz or leave every copact subset of C. The roots in the S j s that don t contain an integer ust leave every copact set, so they cannot reain in the interval I j, so they cannot have been real when β =. 4. The S j s that contain an integer contain only one root for all β, so the root reains siple and therefore real at β =. That root approaches the integer as β approaches infinity. 8

9 The detailed proof follows: Lea 9. The roots of p 0 = sin(πz) are j. Each of these roots is siple, and thus continues to a unique root z j (β) of p β for sall β. Moreover, dz j dβ = ( 1) j+ j sin( jπ ) (2.11) β=0 Proof. At β = 0, the roots of sinπz are located at j and are all siple. The iplicit function theore iplies that, for sall β, they reain siple and depend analytically on β, so we can define z j (β) to be the continuation of that root. Differentiating (2.10) yields so that dz j dβ dz j dβ (πcos(πz j)+βπcos(πz j )) = sin(πz j ) = β=0 sin πj cosπj = ( 1) j sin jπ = ( 1) j+ j sin( jπ ) Knowledge of the derivatives tells us that the roots are in the correct strips for sall β. Corollary 10. For β > 0 and sufficiently sall, all roots of p β are real and: 1. Suppose that neither j nor j+1 are integers. contains an integer k, then p β has a real root in (a) If the interval I j the interval ( j,k) and no other roots in S j has a root in (k, j+1 ) and no other roots in S j (b) If the interval I j p β has no roots in S j if j+ j is even. p β if j + j is odd. does not contain an integer and j + j is odd,. If j+ j is even, p β has two roots in S j. 2. If j is an integer, j is a siple root of p β. If j+ j is even, there is a siple root in each of I j and Ij 1. If j + j is odd, there are no roots in I j or Ij 1. 9

10 Proof. Because sinz = sinz, the roots of (2.6) ust occur in conjugate pairs, and siple roots ust reain real for sall β. Lea 9 tells us that, z j starts at j and oves to the right if j is not an integer and j + j is even, or to the left if j is not an integer and j + j is odd. If I j does not contain an integer, then j+1 + j+1 is odd whenever j + j is even, and even whenever j + j is odd, so that both z j and z j+1 ove into I j when j + j is even, and away fro I j when j + j is odd, which establishes ite 1b. If I j fro I j contains an integer k, then z j oves into I j when j + j is even, and z j + 1 oves into I j when j+ j is odd. The root which oves into I j or (k, j+1 ) for sall β, which establishes ite 1a. and z j+1 oves away and z j oves away reains in either ( j,k) Finally, if j is an integer, both ters in (2.10) vanish, so that j reains j a root for all β, and reains siple at least for β sall. If is an integer, j 1 + j 1 = j + j j+1 2 and + j+1 = j + j + 1, so z j 1 oves into Ij 1 and z j+1 oves into Ij+1 if j + j is even, and both ove away fro those intervals if j + j is odd. This establishes ite 2 and finishes the proof. At a root of p β (z), the real parts of the sinπz ust equal the real part of βsinπz. The lea below identifies the sets on which the real parts of these ters vanish. Lea 11. Re(sin(z)) = 0 iff sin(re(z)) = 0 Proof. and cosh y never vanishes. sin(x+iy) = sinxcoshy +icosxsinhy A consequence of lea 11 is that p β has no roots on Re(z) = j or on Re(z) = k, when j or k are integers, unless j equals an integer. This is enough to show that the roots which entered each strip for sall β, ust reain there. 10

11 Corollary 12. For all 0 < β < 1. The conclusions in ites 1a and 1b of corollary 10, reain true. 2. If j is an integer and j + j is odd, j is a siple root of p β and p β j has no other roots in S j or Sj+1. If is an integer and j + j is even, p β has three roots in Sj 1 Sj, one of which is j. Proof. The hypothesis of ite 1, that j are not integers, cobine with lea 11 to guarantee that p β can have no roots on the boundary of S j. As the roots of the entire analytic function p β depend continuously on β, this iplies that no root can enter or leave S j. Thus, if S j contained no roots for sall β, it contains no roots for all β. If S j contained two roots for soe β, it contains two roots for all β. This establishes ite 1b for all β. To establish ite 1a, note that lea 11 forces the siple root to reain in k < Re(z) < j+1 or j < Re(z) < k. As the siple real root reains siple, it ust also reain real. and j+1 The two stateents in ite 2 follow siilarly fro the fact that no root can cross j+1 j 1 or, as these cannot be integers if j is an integer because > 1. Lea 13. For β >, all roots of p β are siple. For β =, all roots are siple except z = j in the case that j+ j is an even integer. In this case, j is a triple root of p β. Proof. All roots of p β that aren t real are siple, because there are no ore than three in any strip, and they ust occur in conjugate pairs. Suppose we have a double real root, then and sinπz = βsinπz (2.12) cosπz = βcosπz (2.13) Squaring both (2.12) and (2.13), and adding the results gives or sin 2 πz +cos 2 πz +( 2 1)cosπz = β 2 cos 2 πz = β (2.14) 11

12 which is ipossible for β > because the right hand side is bigger than one. If β =, then (2.14) and (2.13) are possible, but only if cosπz = cosπz = ±1 which iplies that z and z are either both even or both odd integers. This is equivalent to the stateent that z = j and j + j is an even integer. One can check directly that the root is indeed triple in this case. Proof of Theore 8. We only prove the theore for p o, as the proof for p e is analogous. Ite 1a follows iediately fro ite 1 of corollary 12. Ite 1 of corollary 12 also iplies all of ite 1b, except the fact that the two roots are not real. To see this, note that, as β, the roots of p β ust either approach the roots of sinπz, which are integers, or leave every copact subset of the coplex plane. Since I j contains no integers, the two roots in S j ust leave every copact subset of C. As Re(z) ust reain between j j+1 and, the iaginary parts of these two roots ust grow unbounded as β. If they were real at β =, lea 13 would iply that they were siple and reained siple and real for all β, contradicting the fact that their iaginary parts grow unbounded as β. Hence they ust not have been real at β =. Ite 2 follows for a siilar reason. We can check directly that j is either a siple or a triple root, depending on the parity of j + j. Ite 2 of corollary 12 tells us that these are all of the roots in the closure of Sj 1 S j, so there are no other roots of p o in these strips. 3 Soe Liiting Cases and Conclusions We have shown that there are two transission wavenubers in each closed 2jπ 2(j+1)π strip Re(k) of width 2π, and two real transission (σ+1)l (σ+1)l (σ+1)l wavenubers in each of those strips which contains an integer. We show below that, in the liiting cases of a weak scatterer (σ 1), there are no longer any real transission wavenubers, and in the liiting case of a strong scatterer (σ ), all the transission wavenubers becoe real. The Born, or linear approxiation, is the liit as σ 1. We return to equation (1.7), set πz = kl, and let σ 1 to obtain 12

13 πz = ±sinπz (3.1) Introducing the paraeter β in front of the πz on the right hand side, and repeating the steps we used to prove theore 7, gives: Theore 14. For every integer j except j = 1 and j = 0, equations (3.1) have exactly two non-real coplex conjugate roots in the strip j Re(j) j+1, and theylie in the interior of the strip. The onlyrootin 1 Re(z) 1 is the triple root at z = 0. The iaginary parts of these roots grow logarithically. The precise asyptotics, which can be verified by substituting (3.2) into (3.1), are ( ) z ± j = (j + 1)±ilog(2 j + 1 )+O log(2 j+ 1 2 ) (3.2) 2 2 (j+ 1 2 ) so that k j = πz j satisfy L ( k j ± π L (j + 1 )±ilog(2 j + 1 )) 2 2 where, for the odd integers j, z j solve equation (3.1) with the plus sign, and, for even integers j, the z j solve (3.1) with the inus sign. The liit as σ is a little ore work to calculate. This is the liit as 1, so that equation (2.7) becoes or sinπz = sinπz sinπz = 0 (3.3) with roots at the integers. Thus, as σ, the even transission wavenubers k j 2πj σl have the sae asyptotics as the square roots of the eigenvalues of the Dirichlet proble u +k 2 σ 2 u = 0 u(± L 2 ) = 0 (3.4) 13

14 with odd (u(x) = u( x)) eigenfunctions. The solutions of (2.6), which describe the transission wavenubers with odd eigenfunctions, have a different asyptotic behavior, that will atch the asyptotics of a different self-adjoint boundary value proble. To see the liiting equation, we subtract sin πz fro both sides of (2.6) and divide by 1 sin(πz) sinπz 1 which becoes, as 1 πzcosπz = sinπz or sin(πz) sinπz = sinπz sinπz πz = tanπz The transission wavenubers satisfy = sinπz k(σ 1) L 2 = tank(σ 1)L 2 (3.5) and thus have the sae asyptotics, as σ, as the square roots of the eigenvalues of the self-adjoint boundary value proble. with odd eigenfunctions. v +k 2 σ 2 v = 0 (3.6) ± L 2 v (± L 2 ) = v(±l 2 ) Because these liiting wavenubers are the square roots of the eigenvalues of a self-adjoint proble, we see that, as σ, all transission wavenubers becoe real. In our discussion of the one diensional transission eigenvalue proble, we have observed certain relationships between transission eigenvalues, The wavenubersof (3.6) with even eigenfunctions satisfy equation (3.5) with tangent replaced by cotangent 14

15 Dirichlet eigenvalues, and the eigenvalues of another self-adjoint boundary value proble. We expect (optiistically) that soe of these relationships will persist in higher diensions. We know that, in the Born approxiation, there are no real transission eigenvalues [8], that a generic radially syetric index of refraction has coplex transission eigenvalues [7], and that there are infinitely any transission eigenvalues [8] [1]. All of these results are consistent with our one diensional conclusions. A consequence of theore 3 is that the counting function for the nuber of interior transission wavenubers in a strip of width W is (σ +1)LW N C (W;σ,L) = ±2 π which has the sae asyptotics as the counting function for Dirichlet wavenubers for an interval of the sae length with index of refraction n = σ +1. The counting function for real interior transission wavenubers in an interval of width W is (σ 1)LW N R (W;σ,L) = ±2 π which atches the asyptotics of the counting function for Dirichlet wavenubers for an interval of the sae length with index of refraction n = σ 1. It sees reasonable to conjecture that the relationship between the counting functions for the Dirichlet wavenubers and the transission wavenubers reains true for non-constant σ, and in higher diensions as well. References [1] Fioralba Cakoni, Drossos Gintides, and Housse Haddar. The existence of an infinite discrete set of transission eigenvalues. SIAM J. Math. Anal., 42(1): , [2] David Colton, Andreas Kirsch, and Lassi Päivärinta. Far-field patterns for acoustic waves in an inhoogeneous ediu. SIAM J. Math. Anal., 20(6): , This is correct as is for irrational σ. For rational σ we need to adopt the convention that every quadruple root (there will always be soe) is counted as two real roots and two non-real roots. 15

16 [3] David Colton and Rainer Kress. Inverse acoustic and electroagnetic scattering theory, volue 93 of Applied Matheatical Sciences. Springer, New York, third edition, [4] David Colton and Peter Monk. The inverse scattering proble for tieharonic acoustic waves in an inhoogeneous ediu. Quart. J. Mech. Appl. Math., 41(1):97 125, [5] David Colton, Lassi Päivärinta, and John Sylvester. The interior transission proble. Inverse Probl. Iaging, 1(1):13 28, [6] Andreas Kirsch. The denseness of the far field patterns for the transission proble. IMA J. Appl. Math., 37(3): , [7] Yuk-J Leung and David Colton. Coplex transission eigenvalues for spherically stratified edia. Inverse Probles, 28(7):075005, 9, [8] Lassi Päivärinta and John Sylvester. Transission eigenvalues. SIAM J. Math. Anal., 40(2): , [9] John Sylvester. Discreteness of transission eigenvalues via upper triangular copact operators. SIAM J. Math. Anal., 44(1): ,

5.7 Chebyshev Multi-section Matching Transformer

5.7 Chebyshev Multi-section Matching Transformer /9/ 5_7 Chebyshev Multisection Matching Transforers / 5.7 Chebyshev Multi-section Matching Transforer Reading Assignent: pp. 5-55 We can also build a ultisection atching network such that Γ f is a Chebyshev

More information

MINIMUM VERTEX DEGREE THRESHOLD FOR LOOSE HAMILTON CYCLES IN 3-UNIFORM HYPERGRAPHS

MINIMUM VERTEX DEGREE THRESHOLD FOR LOOSE HAMILTON CYCLES IN 3-UNIFORM HYPERGRAPHS MINIMUM VERTEX DEGREE THRESHOLD FOR LOOSE HAMILTON CYCLES IN 3-UNIFORM HYPERGRAPHS JIE HAN AND YI ZHAO Abstract. We show that for sufficiently large n, every 3-unifor hypergraph on n vertices with iniu

More information

ON SELF-ROUTING IN CLOS CONNECTION NETWORKS. BARRY G. DOUGLASS Electrical Engineering Department Texas A&M University College Station, TX 77843-3128

ON SELF-ROUTING IN CLOS CONNECTION NETWORKS. BARRY G. DOUGLASS Electrical Engineering Department Texas A&M University College Station, TX 77843-3128 ON SELF-ROUTING IN CLOS CONNECTION NETWORKS BARRY G. DOUGLASS Electrical Engineering Departent Texas A&M University College Station, TX 778-8 A. YAVUZ ORUÇ Electrical Engineering Departent and Institute

More information

Reliability Constrained Packet-sizing for Linear Multi-hop Wireless Networks

Reliability Constrained Packet-sizing for Linear Multi-hop Wireless Networks Reliability Constrained acket-sizing for inear Multi-hop Wireless Networks Ning Wen, and Randall A. Berry Departent of Electrical Engineering and Coputer Science Northwestern University, Evanston, Illinois

More information

PYTHAGOREAN TRIPLES KEITH CONRAD

PYTHAGOREAN TRIPLES KEITH CONRAD PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

More information

Data Set Generation for Rectangular Placement Problems

Data Set Generation for Rectangular Placement Problems Data Set Generation for Rectangular Placeent Probles Christine L. Valenzuela (Muford) Pearl Y. Wang School of Coputer Science & Inforatics Departent of Coputer Science MS 4A5 Cardiff University George

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

Physics 211: Lab Oscillations. Simple Harmonic Motion.

Physics 211: Lab Oscillations. Simple Harmonic Motion. Physics 11: Lab Oscillations. Siple Haronic Motion. Reading Assignent: Chapter 15 Introduction: As we learned in class, physical systes will undergo an oscillatory otion, when displaced fro a stable equilibriu.

More information

A GENERALIZATION OF THE CONGRUENT NUMBER PROBLEM

A GENERALIZATION OF THE CONGRUENT NUMBER PROBLEM A GENERALIZATION OF THE CONGRUENT NUMBER PROBLEM LARRY ROLEN Abstract. We study a certain generalization of the classical Congruent Nuber Proble. Specifically, we study integer areas of rational triangles

More information

Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

More information

Problem Set 2: Solutions ECON 301: Intermediate Microeconomics Prof. Marek Weretka. Problem 1 (Marginal Rate of Substitution)

Problem Set 2: Solutions ECON 301: Intermediate Microeconomics Prof. Marek Weretka. Problem 1 (Marginal Rate of Substitution) Proble Set 2: Solutions ECON 30: Interediate Microeconoics Prof. Marek Weretka Proble (Marginal Rate of Substitution) (a) For the third colun, recall that by definition MRS(x, x 2 ) = ( ) U x ( U ). x

More information

Lecture L9 - Linear Impulse and Momentum. Collisions

Lecture L9 - Linear Impulse and Momentum. Collisions J. Peraire, S. Widnall 16.07 Dynaics Fall 009 Version.0 Lecture L9 - Linear Ipulse and Moentu. Collisions In this lecture, we will consider the equations that result fro integrating Newton s second law,

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

arxiv:0805.1434v1 [math.pr] 9 May 2008

arxiv:0805.1434v1 [math.pr] 9 May 2008 Degree-distribution stability of scale-free networs Zhenting Hou, Xiangxing Kong, Dinghua Shi,2, and Guanrong Chen 3 School of Matheatics, Central South University, Changsha 40083, China 2 Departent of

More information

Notes on Determinant

Notes on Determinant ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

More information

The Virtual Spring Mass System

The Virtual Spring Mass System The Virtual Spring Mass Syste J. S. Freudenberg EECS 6 Ebedded Control Systes Huan Coputer Interaction A force feedbac syste, such as the haptic heel used in the EECS 6 lab, is capable of exhibiting a

More information

Calculating the Return on Investment (ROI) for DMSMS Management. The Problem with Cost Avoidance

Calculating the Return on Investment (ROI) for DMSMS Management. The Problem with Cost Avoidance Calculating the Return on nvestent () for DMSMS Manageent Peter Sandborn CALCE, Departent of Mechanical Engineering (31) 45-3167 sandborn@calce.ud.edu www.ene.ud.edu/escml/obsolescence.ht October 28, 21

More information

1 if 1 x 0 1 if 0 x 1

1 if 1 x 0 1 if 0 x 1 Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

More information

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

More information

Online Appendix I: A Model of Household Bargaining with Violence. In this appendix I develop a simple model of household bargaining that

Online Appendix I: A Model of Household Bargaining with Violence. In this appendix I develop a simple model of household bargaining that Online Appendix I: A Model of Household Bargaining ith Violence In this appendix I develop a siple odel of household bargaining that incorporates violence and shos under hat assuptions an increase in oen

More information

Lecture L26-3D Rigid Body Dynamics: The Inertia Tensor

Lecture L26-3D Rigid Body Dynamics: The Inertia Tensor J. Peraire, S. Widnall 16.07 Dynaics Fall 008 Lecture L6-3D Rigid Body Dynaics: The Inertia Tensor Version.1 In this lecture, we will derive an expression for the angular oentu of a 3D rigid body. We shall

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

More information

Factor Model. Arbitrage Pricing Theory. Systematic Versus Non-Systematic Risk. Intuitive Argument

Factor Model. Arbitrage Pricing Theory. Systematic Versus Non-Systematic Risk. Intuitive Argument Ross [1],[]) presents the aritrage pricing theory. The idea is that the structure of asset returns leads naturally to a odel of risk preia, for otherwise there would exist an opportunity for aritrage profit.

More information

A quantum secret ballot. Abstract

A quantum secret ballot. Abstract A quantu secret ballot Shahar Dolev and Itaar Pitowsky The Edelstein Center, Levi Building, The Hebrerw University, Givat Ra, Jerusale, Israel Boaz Tair arxiv:quant-ph/060087v 8 Mar 006 Departent of Philosophy

More information

March 29, 2011. 171S4.4 Theorems about Zeros of Polynomial Functions

March 29, 2011. 171S4.4 Theorems about Zeros of Polynomial Functions MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions 4.3 Polynomial

More information

Second Order Linear Partial Differential Equations. Part I

Second Order Linear Partial Differential Equations. Part I Second Order Linear Partial Differential Equations Part I Second linear partial differential equations; Separation of Variables; - point boundary value problems; Eigenvalues and Eigenfunctions Introduction

More information

On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes

On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes On Coputing Nearest Neighbors with Applications to Decoding of Binary Linear Codes Alexander May and Ilya Ozerov Horst Görtz Institute for IT-Security Ruhr-University Bochu, Gerany Faculty of Matheatics

More information

Introduction to Unit Conversion: the SI

Introduction to Unit Conversion: the SI The Matheatics 11 Copetency Test Introduction to Unit Conversion: the SI In this the next docuent in this series is presented illustrated an effective reliable approach to carryin out unit conversions

More information

Similarity and Diagonalization. Similar Matrices

Similarity and Diagonalization. Similar Matrices MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

More information

2. FINDING A SOLUTION

2. FINDING A SOLUTION The 7 th Balan Conference on Operational Research BACOR 5 Constanta, May 5, Roania OPTIMAL TIME AND SPACE COMPLEXITY ALGORITHM FOR CONSTRUCTION OF ALL BINARY TREES FROM PRE-ORDER AND POST-ORDER TRAVERSALS

More information

Settling a Question about Pythagorean Triples

Settling a Question about Pythagorean Triples Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:

More information

The last three chapters introduced three major proof techniques: direct,

The last three chapters introduced three major proof techniques: direct, CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

More information

MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

More information

A Gas Law And Absolute Zero Lab 11

A Gas Law And Absolute Zero Lab 11 HB 04-06-05 A Gas Law And Absolute Zero Lab 11 1 A Gas Law And Absolute Zero Lab 11 Equipent safety goggles, SWS, gas bulb with pressure gauge, 10 C to +110 C theroeter, 100 C to +50 C theroeter. Caution

More information

Real Roots of Univariate Polynomials with Real Coefficients

Real Roots of Univariate Polynomials with Real Coefficients Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints

Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints Journal of Machine Learning Research 13 2012) 2503-2528 Subitted 8/11; Revised 3/12; Published 9/12 rading Regret for Efficiency: Online Convex Optiization with Long er Constraints Mehrdad Mahdavi Rong

More information

DIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents

DIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents DIFFERENTIABILITY OF COMPLEX FUNCTIONS Contents 1. Limit definition of a derivative 1 2. Holomorphic functions, the Cauchy-Riemann equations 3 3. Differentiability of real functions 5 4. A sufficient condition

More information

The Velocities of Gas Molecules

The Velocities of Gas Molecules he Velocities of Gas Molecules by Flick Colean Departent of Cheistry Wellesley College Wellesley MA 8 Copyright Flick Colean 996 All rights reserved You are welcoe to use this docuent in your own classes

More information

A Gas Law And Absolute Zero

A Gas Law And Absolute Zero A Gas Law And Absolute Zero Equipent safety goggles, DataStudio, gas bulb with pressure gauge, 10 C to +110 C theroeter, 100 C to +50 C theroeter. Caution This experient deals with aterials that are very

More information

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4) ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x

More information

Answer, Key Homework 7 David McIntyre 45123 Mar 25, 2004 1

Answer, Key Homework 7 David McIntyre 45123 Mar 25, 2004 1 Answer, Key Hoework 7 David McIntyre 453 Mar 5, 004 This print-out should have 4 questions. Multiple-choice questions ay continue on the next colun or page find all choices before aking your selection.

More information

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

More information

3. Reaction Diffusion Equations Consider the following ODE model for population growth

3. Reaction Diffusion Equations Consider the following ODE model for population growth 3. Reaction Diffusion Equations Consider the following ODE model for population growth u t a u t u t, u 0 u 0 where u t denotes the population size at time t, and a u plays the role of the population dependent

More information

The sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].

The sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1]. Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12 CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

More information

GREATEST COMMON DIVISOR

GREATEST COMMON DIVISOR DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

x 2 + y 2 = 1 y 1 = x 2 + 2x y = x 2 + 2x + 1

x 2 + y 2 = 1 y 1 = x 2 + 2x y = x 2 + 2x + 1 Implicit Functions Defining Implicit Functions Up until now in this course, we have only talked about functions, which assign to every real number x in their domain exactly one real number f(x). The graphs

More information

Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

More information

8 Square matrices continued: Determinants

8 Square matrices continued: Determinants 8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You

More information

88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a

88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a 88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small

More information

Zeros of a Polynomial Function

Zeros of a Polynomial Function Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we

More information

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. 1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

More information

Chapter 5. Principles of Unsteady - State Heat Transfer

Chapter 5. Principles of Unsteady - State Heat Transfer Suppleental Material for ransport Process and Separation Process Principles hapter 5 Principles of Unsteady - State Heat ransfer In this chapter, we will study cheical processes where heat transfer is

More information

Higher Order Equations

Higher Order Equations Higher Order Equations We briefly consider how what we have done with order two equations generalizes to higher order linear equations. Fortunately, the generalization is very straightforward: 1. Theory.

More information

4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

More information

Binary Embedding: Fundamental Limits and Fast Algorithm

Binary Embedding: Fundamental Limits and Fast Algorithm Binary Ebedding: Fundaental Liits and Fast Algorith Xinyang Yi The University of Texas at Austin yixy@utexas.edu Eric Price The University of Texas at Austin ecprice@cs.utexas.edu Constantine Caraanis

More information

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)! Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

More information

Machine Learning Applications in Grid Computing

Machine Learning Applications in Grid Computing Machine Learning Applications in Grid Coputing George Cybenko, Guofei Jiang and Daniel Bilar Thayer School of Engineering Dartouth College Hanover, NH 03755, USA gvc@dartouth.edu, guofei.jiang@dartouth.edu

More information

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

More information

Information Processing Letters

Information Processing Letters Inforation Processing Letters 111 2011) 178 183 Contents lists available at ScienceDirect Inforation Processing Letters www.elsevier.co/locate/ipl Offline file assignents for online load balancing Paul

More information

Math 181 Handout 16. Rich Schwartz. March 9, 2010

Math 181 Handout 16. Rich Schwartz. March 9, 2010 Math 8 Handout 6 Rich Schwartz March 9, 200 The purpose of this handout is to describe continued fractions and their connection to hyperbolic geometry. The Gauss Map Given any x (0, ) we define γ(x) =

More information

Review of Fundamental Mathematics

Review of Fundamental Mathematics Review of Fundamental Mathematics As explained in the Preface and in Chapter 1 of your textbook, managerial economics applies microeconomic theory to business decision making. The decision-making tools

More information

Inner Product Spaces

Inner Product Spaces Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

More information

Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

More information

STRONGLY CONSISTENT ESTIMATES FOR FINITES MIX'IURES OF DISTRIBUTION FUNCTIONS ABSTRACT. An estimator for the mixing measure

STRONGLY CONSISTENT ESTIMATES FOR FINITES MIX'IURES OF DISTRIBUTION FUNCTIONS ABSTRACT. An estimator for the mixing measure STRONGLY CONSISTENT ESTIMATES FOR FINITES MIX'IURES OF DISTRIBUTION FUNCTIONS Keewhan Choi Cornell University ABSTRACT The probles with which we are concerned in this note are those of identifiability

More information

Capacity of Multiple-Antenna Systems With Both Receiver and Transmitter Channel State Information

Capacity of Multiple-Antenna Systems With Both Receiver and Transmitter Channel State Information IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO., OCTOBER 23 2697 Capacity of Multiple-Antenna Systes With Both Receiver and Transitter Channel State Inforation Sudharan K. Jayaweera, Student Meber,

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

Factored Models for Probabilistic Modal Logic

Factored Models for Probabilistic Modal Logic Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008 Factored Models for Probabilistic Modal Logic Afsaneh Shirazi and Eyal Air Coputer Science Departent, University of Illinois

More information

Design of Model Reference Self Tuning Mechanism for PID like Fuzzy Controller

Design of Model Reference Self Tuning Mechanism for PID like Fuzzy Controller Research Article International Journal of Current Engineering and Technology EISSN 77 46, PISSN 347 56 4 INPRESSCO, All Rights Reserved Available at http://inpressco.co/category/ijcet Design of Model Reference

More information

How To Get A Loan From A Bank For Free

How To Get A Loan From A Bank For Free Finance 111 Finance We have to work with oney every day. While balancing your checkbook or calculating your onthly expenditures on espresso requires only arithetic, when we start saving, planning for retireent,

More information

This paper studies a rental firm that offers reusable products to price- and quality-of-service sensitive

This paper studies a rental firm that offers reusable products to price- and quality-of-service sensitive MANUFACTURING & SERVICE OPERATIONS MANAGEMENT Vol., No. 3, Suer 28, pp. 429 447 issn 523-464 eissn 526-5498 8 3 429 infors doi.287/so.7.8 28 INFORMS INFORMS holds copyright to this article and distributed

More information

2. Length and distance in hyperbolic geometry

2. Length and distance in hyperbolic geometry 2. Length and distance in hyperbolic geometry 2.1 The upper half-plane There are several different ways of constructing hyperbolic geometry. These different constructions are called models. In this lecture

More information

Lecture 1: Schur s Unitary Triangularization Theorem

Lecture 1: Schur s Unitary Triangularization Theorem Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections

More information

University of Lille I PC first year list of exercises n 7. Review

University of Lille I PC first year list of exercises n 7. Review University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients

More information

Experiment 2 Index of refraction of an unknown liquid --- Abbe Refractometer

Experiment 2 Index of refraction of an unknown liquid --- Abbe Refractometer Experient Index of refraction of an unknown liquid --- Abbe Refractoeter Principle: The value n ay be written in the for sin ( δ +θ ) n =. θ sin This relation provides us with one or the standard ethods

More information

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

More information

RESULTANT AND DISCRIMINANT OF POLYNOMIALS

RESULTANT AND DISCRIMINANT OF POLYNOMIALS RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results

More information

LIMITS AND CONTINUITY

LIMITS AND CONTINUITY LIMITS AND CONTINUITY 1 The concept of it Eample 11 Let f() = 2 4 Eamine the behavior of f() as approaches 2 2 Solution Let us compute some values of f() for close to 2, as in the tables below We see from

More information

Vector and Matrix Norms

Vector and Matrix Norms Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

More information

Solving Linear Systems, Continued and The Inverse of a Matrix

Solving Linear Systems, Continued and The Inverse of a Matrix , Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing

More information

Homework until Test #2

Homework until Test #2 MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

More information

Exercise 4 INVESTIGATION OF THE ONE-DEGREE-OF-FREEDOM SYSTEM

Exercise 4 INVESTIGATION OF THE ONE-DEGREE-OF-FREEDOM SYSTEM Eercise 4 IVESTIGATIO OF THE OE-DEGREE-OF-FREEDOM SYSTEM 1. Ai of the eercise Identification of paraeters of the euation describing a one-degree-of- freedo (1 DOF) atheatical odel of the real vibrating

More information

Some practice problems for midterm 2

Some practice problems for midterm 2 Some practice problems for midterm 2 Kiumars Kaveh November 15, 2011 Problem: What is the remainder of 6 2000 when divided by 11? Solution: This is a long-winded way of asking for the value of 6 2000 mod

More information

An Introduction to Partial Differential Equations

An Introduction to Partial Differential Equations An Introduction to Partial Differential Equations Andrew J. Bernoff LECTURE 2 Cooling of a Hot Bar: The Diffusion Equation 2.1. Outline of Lecture An Introduction to Heat Flow Derivation of the Diffusion

More information

Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

More information

Georg Cantor (1845-1918):

Georg Cantor (1845-1918): Georg Cantor (845-98): The man who tamed infinity lecture by Eric Schechter Associate Professor of Mathematics Vanderbilt University http://www.math.vanderbilt.edu/ schectex/ In papers of 873 and 874,

More information

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

More information

No Solution Equations Let s look at the following equation: 2 +3=2 +7

No Solution Equations Let s look at the following equation: 2 +3=2 +7 5.4 Solving Equations with Infinite or No Solutions So far we have looked at equations where there is exactly one solution. It is possible to have more than solution in other types of equations that are

More information

Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom. Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

More information

5.3 The Cross Product in R 3

5.3 The Cross Product in R 3 53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or

More information

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

More information

The Mathematics of Pumping Water

The Mathematics of Pumping Water The Matheatics of Puping Water AECOM Design Build Civil, Mechanical Engineering INTRODUCTION Please observe the conversion of units in calculations throughout this exeplar. In any puping syste, the role

More information

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Ameya Pitale, Ralf Schmidt 2 Abstract Let µ(n), n > 0, be the sequence of Hecke eigenvalues of a cuspidal Siegel eigenform F of degree

More information

3 Contour integrals and Cauchy s Theorem

3 Contour integrals and Cauchy s Theorem 3 ontour integrals and auchy s Theorem 3. Line integrals of complex functions Our goal here will be to discuss integration of complex functions = u + iv, with particular regard to analytic functions. Of

More information

Models and Algorithms for Stochastic Online Scheduling 1

Models and Algorithms for Stochastic Online Scheduling 1 Models and Algoriths for Stochastic Online Scheduling 1 Nicole Megow Technische Universität Berlin, Institut für Matheatik, Strasse des 17. Juni 136, 10623 Berlin, Gerany. eail: negow@ath.tu-berlin.de

More information

PRIME FACTORS OF CONSECUTIVE INTEGERS

PRIME FACTORS OF CONSECUTIVE INTEGERS PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in

More information