Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.

Size: px
Start display at page:

Download "Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket."

Transcription

1 Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, Introduction There is a well developed theory (see [5, 9]) of analysis on certain types of fractal sets, of which the Sierpinski Gasket (SG) is the siplest non-trivial exaple. In this theory the fractals are viewed as liits of graphs, and notions analogous to the Dirichlet energy and the Laplacian are constructed as renoralized liits of the corresponding objects on the approxiating graphs. The nature of this construction has naturally led to extensive study of the eigenfunctions of this Laplacian, and to functional-analytic notions based on the eigenfunctions. However, ore recent work [7, 2] has exained other eleentary functions on SG, including analogues of polynoials, analytic functions and certain exponentials. A forthcoing paper [8] will extend this investigation to study sooth bup functions and a ethod for partitioning sooth functions subordinate to an open cover. In the present work we prove there are exponentially decaying generalized eigenfunctions on a blow-up of S G with boundary (which we denote S G ), proving: Theore 1.1. For each < 0 and j N there is a sooth function E j on S G such that for each j we have ( + )E j = je. Moreover E j decays exponentially away fro the boundary point of S G and satisfies E j j! j. There are sufficiently any of these generalized eigenfunctions that they can be used to prove a Borel-type theore on S G, thereby answering a question asked in [7, 2]. Using the ter jet for the sequence of values of the natural derivatives at a junction point of S G our result ay be suarized as: Theore 1.2. Given an arbitrary jet there is a sooth function on S G with that jet at the boundary point. Our otivation for studying generalized eigenfunctions and for proving Theore 1.1 was to prove Theore 1.2. The structure of the paper reflects this otivation: apart MSC Priary 28A80; Secondary 31C45 Research supported in part by the National Science Foundation, Grant DMS

2 fro soe background in Section 2 our first results (in Section 3) are those showing that Theore 1.2 follows fro Theore 1.1 and soe known results about localized eigenfunctions on S G. Section 4 is then devoted to the construction of the generalized eigenfunctions and the proof of Theore 1.1. Acknowledgents The authors would like to thank A. Teplyaev, who provided source code for the figures. 2 Setting We give a brief description of soe parts of the theory of analysis on the Sierpinski Gasket, ore details of which are in [9]. For the general theory of analysis on fractals the standard reference is [5]. SG and SG The Sierpinski gasket S G is the unique non-epty copact set in R 2 that is invariant under the iterated function syste f i = 1 2 (x + q i), i = 0, 1, 2 in the sense that S G = 2i=0 f i (S G), where the points q i are the vertices of an equilateral triangle. For N and (i 1, i 2,..., i ) {0, 1, 2} we call f i1 f i2 f i (S G) a cell of level. The points V 0 = {q i : j = 0, 1, 2} are the boundary of S G and we view S G as the liit of graphs Γ with vertices defined inductively by V = 2 i=0 f i (V 1 ) and edge relation x y if x and y are in the sae -cell. The set of all vertices is V = V and the junction points are V \ V 0. We let µ be the usual self-siilar probability easure on S G with µ( f w (S G)) = 3 w, and also use µ to denote the obvious extension to S G. The infinite blow-up of S G with boundary point q 0 is denoted S G and defined by S G = =0 f ( n) 0 (S G) (2.1) This is the siplest blow-up of S G; we could also consider arbitrary sequences of blow-ups =1 fi 1 1 fi 1 2 fi 1 (S G), but all that have a boundary point necessarily have {i } to be constant after soe 0 and are isoetric, so aong those with boundary it suffices to consider S G (see Lea 2.3 in [11]). The work in this paper will crucially use that we are on a blow-up with boundary. We refer to [10, 11] for ore inforation about blow-ups and the Laplacian on S G. Laplacian, derivatives and jets Each graph approxiation Γ of S G supports a graph Laplacian defined at nonboundary points x V \ V 0, and we define a Laplacian at junction points of S G as 2

3 a renoralized liit of the graph Laplacians u(x) = (u(y) u(x)) (2.2) y x u(x) = 3 2 li 5 u(x). (2.3) A continuous function u is in the doain of the Laplacian, u do( ), if there is a continuous f such that the right side of (2.3) converges uniforly to f on V \ V 0. Then we write u = f, extending u to all points of S G by continuity. The factor 3/2 in (2.3) is for consistency with an alternative definition of the Laplacian using a renoralized Dirichlet energy (see [5, 9]). We ake the obvious definition of k u and do( k ), and call a function sooth if it is in do( ) = k do( k ). One additional property of the Laplacian that we will use extensively is its scaling; it is iediate fro (2.3) that for u do( ) (u f0 1 1 ) = 5( u) f0 on f 0 (S G) (2.4) In addition to the Laplacian there are two derivatives at boundary points, the noral derivative n and tangential derivative T, defined by ( 5 ) (2u(qi n u(q i ) = li ) u( f j (q i+1 )) u( f j (q i+2 )) ) (2.5) 3 T u(q i ) = li 5 ( u( f j (q j+1 )) u( f j (q j+2 )) ) (2.6) (with q i+3 = q i ). The forer exists for any u do( ) and the latter exists under the additional assuption that u is Hölder continuous. Both ay be localized to boundary points of cells. The noral derivatives are uch better understood than the tangential derivatives, and have considerable application; for this paper their iportant feature is the atching condition for the noral derivatives: if u do( ) then at any junction point of two cells the noral derivatives corresponding to these cells su to zero. Conversely, if u is continuous and u = f on each -cell then u = f on S G if and only if f is continuous and the atching condition holds at each point of V \ V 0. At a boundary point q we will call the values of k u(q), n k u(q) and T k u(q) the Laplacian powers, noral derivatives and tangential derivatives, respectively. The j-jet of u at q is ( u(q), n u(q), T u(q),..., j u(q), n j u(q), T j u(q) ) and the infinite jet is the corresponding sequence of Laplacian powers and derivatives. Spectral deciation A useful feature of the Laplacian on S G and S G is that restricting a Laplcaian eigenfunction E to the graph approxiation Γ produces an eigenfunction of the graph Laplacian, with a shift in the eigenvalue. This phenoenon is known as spectral deciation [4, 3, 11]. Specifically, if ( + )E = 0 on S G or S G then ( + )E = 0 3

4 on Γ, where 1 = (5 ) (2.7) = 3 2 li 5 (2.8) E (y i ) = 2E (x i ) + (4 )(E (x i+1 ) + E (x i+2 )) (2 )(5 ) (2.9) in which the points x i are the vertices of an ( 1)-cell, and each y i is the point fro V opposite to x i as shown in Figure 1. For proofs we refer to [3] or [9]; an explanation of spectral deciation in a ore general context is in [6]. y 1 y 0 y 2 x 1 x 0 x 2 Figure 1: Points x i in V 1 and y i in V. We will need one technical result about spectral deciation on S G that is wellknown but for which there does not appear to be a proof in the literature. Lea 2.1. For < 0 there is an entire function Ψ such that = Ψ(5 ). Proof. Considering (2.7) we define functions by 2φ ± (ζ) = 5 ± 25 4ζ, so that is one of φ ± ( 1 ). Observe that if 1 0 then 0, so fro (2.8) and < 0 we ust have < 0 and = φ ( 1 ) for all. The renoralized liit Φ(ζ) = 3 2 li 5 φ (ζ) is analytic in a neighborhood of the origin and has Φ (0) = 3/2 by virtue of the fact that φ (ζ) = ζ/5 + O(ζ 2 ) for sufficiently sall ζ. It follows that Φ has an analytic inverse Ψ(ζ) = Φ 1 (ζ) = k=0 α k ζ k in a neighborhood of 0. Using (2.7) and (2.8) we find Ψ(5 ) = for all sufficiently sall 5. This gives a recursion for the coefficients α k, beginning with α 0 = 0, α 1 = 2/3 and continuing according to k 1 (5 k 5)α k = α l α k l (2.10) for k 2. An alost identical recursion appears for a different purpose in [7] (as Equation 2.9 and in Theore 2.7) and their arguent shows that α k C(k!) log 5/ log 2. It follows iediately that Ψ is entire, while = Ψ(5 ) is true by construction. l=1 4

5 3 The Borel Theore In this section we prove Theore 1.2 under the assuption of Theore 1.1. First we construct sooth functions with finitely any prescribed values of the Laplacian powers and tangential derivatives at q 0 using known results about the existence of localized eigenfunctions. Then we use Theore 1.1 and linear algebra to prove that there are sooth functions with finitely any prescribed noral derivatives. Finally we state a precise version of Theore 1.2 and show that its validity for finite jets gives the full result by a scaling and convergence arguent. Localized eigenfunctions A curious feature of any highly syetric fractals is that their Laplacians have localized eigenfunctions. We will not need the details of the theory, for which we refer to [1, 5], but only the existence of two specific eigenfunctions u 1 and u 2 on S G. The values of u 1 on V 1 and u 2 on V 2 are shown in Figure 2. Fro the values shown we can Figure 2: The functions u 1 and u 2. copute u 1 and u 2 at any scale by the ethod of spectral deciation given in (2.7)- (2.9) (with the caveat that for u 1 the positive root ust be taken at the first step of the recursion (2.7)). What is iportant here is that the noral derivatives of both u i vanish at the points q 1 and q 2, which we see fro (2.5) and the antisyetry of the u i on the cells f 1 (S G) and f 2 (S G). Since the u i are eigenfunctions we then find that all of the values k u i and n k u i vanish at q 1 and q 2, and (2.4) shows the sae is true for u i f0 at f0 (q 1) and f0 (q 2) for any. It follows fro the atching condition that u i f0 on f0 (S G) u i, = 0 otherwise are sooth functions, and therefore are Laplacian eigenfunctions with eigenvalues 5 i. For obvious reasons they are called localized eigenfunctions. The jets of the u i, at q 0 are easily coputed. The eigenfunction equations u i = i u i give the higher order ters fro the initial ones, so by siple algebra fro (2.9) 5

6 and soe syetry arguents k 2( 1 ) k 5 k i = 1 u i, (q 0 ) = 0 i = 2 T k 0 i = 1 u i, (q 0 ) = 2( 2 ) k 5 k i = 2 n k u i, (q 0 ) = 0 i = 1, 2. With these functions as building blocks we show that there is a sooth function with finitely prescribed values of the Laplacian powers and tangential derivatives at q 0, and whose noral derivatives are all zero. Lea 3.1. For n N and values ζ 0,..., ζ n and θ 0,..., θ n there is u do( ) such that k u(q 0 ) = ζ k, n k u(q 0 ) = 0, and T k u(q 0 ) = θ k for all 0 k n. Proof. We observe that the vectors ( u1, (q 0 ), u 1, (q 0 ),..., n u 1, (q 0 ) ) = 2 ( 1, ( 1 )5,..., ( 1 ) n 5 n) are linearly independent with respect to. A siilar result is true for the vector of tangential derivatives of u 2,. We ay then obtain the desired u as a linear cobination of the functions u i, for 0 n by linear algebra. We reark that this ethod cannot be applied to prescribe values of the noral derivatives at q 0 using localized eigenfunctions. The structure of the localized eigenfunctions is well understood (see [9]) and non-zero noral derivatives can occur only in closed loops circling the holes in the gasket. As each junction point corresponds to a hole of precisely one size, our scaling arguents are not applicable. Siilar arguents are needed in Lea 3.4 below, so any proof of Theore 1.2 using only localized eigenfunctions would need to be quite different fro ours. Generalized eigenfunctions and noral derivatives The generalized eigenfunctions produced in Theore 1.1 are a sufficiently rich class that we can use a finite linear cobination of the to atch finitely any prescribed noral derivatives at q 0. Lea 3.2. For n N, < 0 and values η 0,..., η n there is u do( ) which is a finite linear cobination of the E j, 0 j n, and has n k u(q 0 ) = η k for all 0 k n. Proof. Let a j,k = n k E j (q 0). It clearly suffices to show that the atrix [ ] a n j,k j,k=0 is invertible, so we exaine its deterinant. Writing the generalized eigenfunction equation ( + )E j = je in ters of a j,k we have a j,k + a j,k 1 = ja,k 1, which suggests a colun operation on [a j,k ]. For all coluns k 1 we replace a j,k with ja,k 1, which akes the first row zero except in the first place siply because 6

7 j = 0 on this row. For concreteness the result of this coputation for the deterinant in the case n = 2 is given below. a 0,0 a 0,1 a 0,2 a a 1,0 a 1,1 a 1,2 a 2,0 a 2,1 a 2,2 = 0,0 0 0 a 1,0 a 0,0 a 0,1 a 2,0 2a 1,0 2a 1,1 = a a 0,0 a 0,1 0,0 2a 1,0 2a 1,1 This operation can be repeated inductively, because it shows det [ a j,k ] n 0 = a 0,0 det [ ja,k 1 ] n 1 = a 0,0 det [ ( j + 1)a j,k ] n 1 and the only change to the atrix at each stage is to ultiply each row by a constant and reduce the degree, so the sae colun operations apply each tie. We conclude that det [ ] a n j,k 0 = ( 1)n n!a n+1 0,0, and is non-zero by (4.2) below. Corollary 3.3. Given values (ζ k, η k, θ k ) for 0 k n there is a finite linear cobination u of localized eigenfunctions and generalized eigenfunctions such that k u(q 0 ) = ζ k, n k u(q 0 ) = η k and T k u(q 0 ) = θ k for all 0 k n. Proof. Apply Lea 3.2 to atch the noral derivatives and then Lea 3.1 to correct the Laplacian powers and tangential derivatives without affecting the values of the noral derivatives. Proof of the Borel theore Corollary 3.3 supplies the natural building blocks for obtaining a sooth function with any given jet at q 0. Define for each j functions F j fro which we will deterine the Laplacian powers, G j for the noral derivatives and H j for the tangential derivatives by requiring that for all 0 k j k F j (q 0 ) = δ j,k n k F j (q 0 ) = 0 T k F j (q 0 ) = 0 k G j (q 0 ) = 0 n k G j (q 0 ) = δ j,k T k G j (q 0 ) = 0 k H j (q 0 ) = 0 n k H j (q 0 ) = 0 T k H j (q 0 ) = δ j,k where δ j,k is the Kronecker delta. The natural goal is to construct a sooth function with prescribed (infinite) jet by using the ters of the jet as coefficients in a series with functions like the F j, G j and H j. To ake the series converge to a sooth function we will need soe estiates on these functions and their Laplacian powers. What we know so far is that they are finite linear cobinations of the localized eigenfunctions u i, with 0 j and i = 1, 2, and the generalized eigenfunctions E k for a fixed and 0 k j. All of these functions and their Laplacian powers of order at ost j are bounded: for the localized eigenfunctions this is obvious, while for the generalized eigenfunctions it follows fro the bound in Theore 1.1 and the recursion (4.3). We conclude that for each j there is a constant C( j) such that for all 0 k j k F j C( j) k G j C( j) k H j C( j) and turn now to a scaling arguent that allows us to ake these as sall as desired. 0 7

8 Lea 3.4. If N then the functions F j, = 5 j F j f0 G j, = 5 j G j f0 H j, = 5 j H j f0 have the sae j-jets at q 0 as F j, G j and H j respectively, but for 0 k j they satisfy the following estiates on S G k F j, C( j)5 (k j) k G j, C( j)5 (k j) k H j, C( j)5 (k j). Proof. The result is an eleentary consequence of the scaling property of the Laplacian. By induction fro (2.4) we see that k (u f0 ) = 5 k ( k u) f0. Both stateents of the lea are iediate consequences of this and the definitions (2.5) and (2.6) of the noral and tangential derivatives. Proof of Theore 1.2. We are supplied with values (ζ k, η k, θ k ) for k N and seek a sooth function u such that k u(q 0 ) = ζ k, n k u(q 0 ) = η k and T k u(q 0 ) = θ k for all k. This will be certainly be the case for the function u = ( ) ζ j F j, j + η j G j, j + θ j H j, j j=0 (3.1) provided only that applying any power of the Laplacian yields a uniforly convergent series. However by Lea 3.4 we ay choose the sequence j such that ters after the j-th have only a sall effect on the Laplacian powers of order at ost j. Specifically, given any ɛ > 0 we ay ake j so large that for 0 k j 1 k( ζ j 5 j j F j, j + η j 5 j j G j, j + θ j 5 j j ) H j, j C( j)5 (k j) j ax { ζ k, η k, θ k : 0 k j 1 } ɛ2 k j providing a bound on the tail of the series obtained by applying k to (3.1). We conclude that u is sooth, that it has the desired jet at q 0, and oreover that ost of the contribution to the k-th jet is fro the first k ters in the su: k u k ( ɛ + C(k) ζ j + η j + θ j ). j=0 4 Generalized eigenfunctions with decay In this section we prove Theore 1.1, showing that there are exponentially decaying generalized eigenfunctions E j of the Laplacian on S G. Our results depend on work in [7], where the negative-eigenvalue eigenfunctions of were studied using spectral deciation. Using notation fro (2.7), the results we need ay be suarized as: 8

9 Proposition 4.1 ([7], Section 6). For each < 0 there is an eigenfunction E on S G which is syetrical under the reflection that fixes q 0 and exchanges q 1 with q 2, and which satisfies ( + )E = 0. There is an explicit forula for E at the points z = f 0 (q 1 ) E (z ) = ( 4 ) j j=0 (4.1) which is uniforly continuous on copacta in V, and E is the liit of this on S G. These functions have exponential decay E (z ) = O( 1 ) = O ( 2 2 ) as and the noral derivative at q 0 is given by n E (q 0 ) = ( 4 ) ( 6 n ) n =0 n=1 > 0. (4.2) Our construction is otivated as follows. Forally setting E j = ( d j d) E we find that the E j satisfy the generalized eigenfunction equation ( + )E j = je (4.3) and we hope that the decay of E will ensure exponential decay for E j. This arguent is ade rigorous by Lea 4.2, but it will initially be sipler to construct the E j fro (4.3) than by proving E can be differentiated with respect to. Observe that on S G we can inductively obtain solutions E j of (4.3) for j N starting with E 0 = E, erely because < 0 and the spectru of is positive. The resulting functions are clearly in do( ), and depend on the boundary data we assign. Guided by the foral idea that E j should be ( d j d) E we set E j (z) = ( d ) je (z) (4.4) d at each of the three boundary points z = q 0, q 1, q 2. The definition is legitiate because = Ψ(5 ) and Ψ is entire (Lea 2.1), so the rapid growth of ensures the expression (4.1) is analytic with respect to. Lea 4.2. Using the supreu nor, the functions E j are differentiable with respect to and d d E = E j. Proof. We require a standard estiate (like Lea of [5]). Let u be in do( ) and subtract the haronic function u 0 with the sae boundary values. It is well known that then u u 0 c u 2, and by the axiu principle we conclude u c u 2 + ax V0 u. Let < 0, and let κ 1 > 0 be the first Dirichlet eigenvalue of. The spectral representation of iediately shows u c ( 1 + κ 1 ) ( + )u 2 + ax V 0 u. (4.5) 9

10 Now suppose inductively that the lea is true up to j 1. For the difference between E j and the Newton quotient for the derivative of E we have ( + ) ( E j 1 ( E t +t E )) ( ( j 1)E j 2 +t te+t = je 1 t = ( E +t E ) 1 + ( j 1) t 0 in L 2 (S G) ( E j 2 +t E j 2 ) j 2 + ( j 1)E ) ( j 1)E by induction. Fro (4.5) and the fact that the boundary data varies analytically with we conclude E j 1 ( E +t t E ) 0. The sae reasoning reduces the base case of the induction to showing E +t E 2 0, which is a consequence of the fact (fro Proposition 4.1) that E is uniforly approxiated by the analytic function of in (4.1). With this in hand we can describe the natural scaling behavior of the E j. Fro (2.4) we know that E 5 = E f 1 0, whence on f 0(S G) E j f 0 1 = ( d ) je f0 1 = ( d je5 = 5 d d) j E j 5 on f 1 0 (S G) is to set E j = 5 j E j 5 f 0. Induc- and therefore the natural definition of E j tively we let E j = 5 jn E 5 n f0 n on f0 n (S G) (4.6) for each n N to extend E j to all of S G. We reark that this gives the sae result as solving (4.3) on f0 n(s G) with boundary data (4.4) at the points z = q 0, f0 n(q 1), f0 n(z 2). Cobining the above results we have proven the existence stateents of Theore 1.1. What reains to be proven is the content of the following lea, which is regrettably but perhaps unavoidably technical. Lea 4.3. The generalized eigenfunctions satisfy E j j! j and have decay E j (z ) = O ( 2 2 ) as. Proof. We first prove the decay. Recall that the recursion (2.7) guarantees C2 2 as. Set β j = (d/d) j. It is eleentary to verify that β j = O( ) as fro the definition of Ψ and the recursion (2.10). Using the explicit forula (4.1) we write E (z ) = 1 + (P )/4, where P = ( 4 ) n n=0 10

11 and define S j by (d/d) j P = P S j. Exaining S 1 we have S 1 = β1 + n=0 4β 1 n (2 n )(6 n ) = β1 + 4β1 + O( 2 2 ) + = β1 + 4β1 + O( 2 2 ) n=1 4β 1 n (2 n )(6 n ) where the penultiate estiate uses the series expansion for 1/(2 )(6 ), and the final one uses the structure of the series. This series consists of ters which are rational functions of n and β 1 n, and in which the degree of the denoinator strictly exceeds that of the nuerator. The rapid growth of ensures this is bounded by a ultiple of the first ter, which is O( 1 1 ) = O( 2 ). We will call a series in which the ters are rational functions that depend on n, β 1 n,..., β j for n 1, but ust always have the degree of the denoinator to be strictly greater than the nuerator, a good rational series or GRS. Notice that the derivative of a GRS is a GRS, and that the product of a GRS with a GRS or a rational function in which the nuerator has the sae or lesser degree than the denoinator is also a GRS. Our estiates on n and β 1 n guarantee that any GRS sus to a value which is O( 2 ). Using induction over j we see that the function S j β/ j 4β/ j 2 is always a GRS, so is O( 2 ). Indeed, this is true for j = 1, and if we assue it to be true for j 1 and apply the recursion S j = S 1 S and S 1 S, = ( β 1 + 4β1 + GRS 2 = β1 β 2 + 8β1 β 3 + (ds ) β + + GRS /d), then both 4β 2 + GRS ds, d = β j β 2 β 1 + 4β j 2 8β β 1 + GRS 3 so we ay su the to coplete the induction. In particular we conclude that 4E j (z ) = d j P d j β j = P S j β j = P S j β j 4β j + β j (P + 4) + 4β j (P ) 2 = O( 1 ) = O(2 2 ) 2 11

12 where in the last step we used that the first bracketed ter is O( 2 ), and that P = O( ), (P + 4) = O( 1 ) and (P ) = O(1), all of which are fro the fact that E (z ) = O( 1 ) (see Proposition 4.1) and the definition of P. Now that we know E j has exponential decay it ust be the case that its axiu occurs at an interior point of soe f0 (S G). It is well known (see [7] Proposition 2.11) that E j and E j ust have opposite signs at any local extree point of E j. Since E j = E j je and < 0 we find that sgn( E j ) = sgn(e j ) iplies E j je. The bound on E j follows by induction and the fact that E E (q 0 ) = 1. References [1] Martin T. Barlow and Jun Kigai, Localized eigenfunctions of the Laplacian on p.c.f. self-siilar sets, J. London Math. Soc. (2) 56 (1997), no. 2, MR MR (99b:35162) [2] Nitsan Ben-Gal, Abby Shaw-Krauss, Robert S. Strichartz, and Clint Young, Calculus on the sierpinski gasket II: Point singularities, eigenfunctions, and noral derivatives of the heat kernel, Trans. Aer. Math. Soc., posted on April 17, 2006, PII: S (06) (to appear in print). [3] Kyallee Dalryple, Robert S. Strichartz, and Jade P. Vinson, Fractal differential equations on the Sierpinski gasket, J. Fourier Anal. Appl. 5 (1999), no. 2-3, MR MR (2000k:31016) [4] M. Fukushia and T. Shia, On a spectral analysis for the Sierpiński gasket, Potential Anal. 1 (1992), no. 1, MR MR (95b:31009) [5] Jun Kigai, Analysis on fractals, Cabridge Tracts in Matheatics, vol. 143, Cabridge University Press, Cabridge, MR MR (2002c:28015) [6] Leonid Malozeov and Alexander Teplyaev, Self-siilarity, operators and dynaics, Math. Phys. Anal. Geo. 6 (2003), no. 3, MR MR (2004d:47012) [7] Jonathan Needlean, Robert S. Strichartz, Alexander Teplyaev, and Po-La Yung, Calculus on the Sierpinski gasket. I. Polynoials, exponentials and power series, J. Funct. Anal. 215 (2004), no. 2, MR MR [8] Luke Rogers, Robert S. Strichartz, and Alexander Teplyaev, Sooth bups, a Borel theore and partitions of unity on p.c.f. fractals, In preparation. [9] Robert S. Strichartz, Differential equations on fractals: A tutorial, Princeton University Press, to appear [10], Fractals in the large, Canad. J. Math. 50 (1998), no. 3, MR MR (99f:28015) [11] Alexander Teplyaev, Spectral analysis on infinite Sierpiński gaskets, J. Funct. Anal. 159 (1998), no. 2, MR MR (99j:35153) 12

GRADIENTS OF LAPLACIAN EIGENFUNCTIONS ON THE SIERPINSKI GASKET

GRADIENTS OF LAPLACIAN EIGENFUNCTIONS ON THE SIERPINSKI GASKET PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume, Number, Pages S 2-999XX- GRADIENTS OF LAPLACIAN EIGENFUNCTIONS ON THE SIERPINSKI GASKET JESSICA L. DEGRADO, LUKE G. ROGERS, AND ROBERT S. STRICHARTZ

More information

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

Chapter 6 1-D Continuous Groups

Chapter 6 1-D Continuous Groups Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:

More information

The Weierstrass Approximation Theorem

The Weierstrass Approximation Theorem 36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined

More information

arxiv: v1 [math.nt] 14 Sep 2014

arxiv: v1 [math.nt] 14 Sep 2014 ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row

More information

3.8 Three Types of Convergence

3.8 Three Types of Convergence 3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to

More information

THE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n

THE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n THE POLYNOMIAL REPRESENTATION OF THE TYPE A n RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n SHEELA DEVADAS AND YI SUN Abstract. We study the polynoial representation of the rational Cherednik algebra

More information

Solutions of some selected problems of Homework 4

Solutions of some selected problems of Homework 4 Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next

More information

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal

More information

M ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS. Van H. Vu. 1.

M ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS. Van H. Vu. 1. M ath. Res. Lett. 15 (2008), no. 2, 375 388 c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS Van H. Vu Abstract. Let F q be a finite field of order q and P be a polynoial in F q[x

More information

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany. New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing

More information

Feature Extraction Techniques

Feature Extraction Techniques Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that

More information

A NEW CHARACTERIZATION OF THE CR SPHERE AND THE SHARP EIGENVALUE ESTIMATE FOR THE KOHN LAPLACIAN. 1. Introduction

A NEW CHARACTERIZATION OF THE CR SPHERE AND THE SHARP EIGENVALUE ESTIMATE FOR THE KOHN LAPLACIAN. 1. Introduction A NEW CHARACTERIZATION OF THE CR SPHERE AND THE SHARP EIGENVALUE ESTIATE FOR THE KOHN LAPLACIAN SONG-YING LI, DUONG NGOC SON, AND XIAODONG WANG 1. Introduction Let, θ be a strictly pseudoconvex pseudo-heritian

More information

Curious Bounds for Floor Function Sums

Curious Bounds for Floor Function Sums 1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International

More information

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint. 59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far

More information

THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT

THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and

More information

a a a a a a a m a b a b

a a a a a a a m a b a b Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice

More information

Algebraic Montgomery-Yang problem: the log del Pezzo surface case

Algebraic Montgomery-Yang problem: the log del Pezzo surface case c 2014 The Matheatical Society of Japan J. Math. Soc. Japan Vol. 66, No. 4 (2014) pp. 1073 1089 doi: 10.2969/jsj/06641073 Algebraic Montgoery-Yang proble: the log del Pezzo surface case By DongSeon Hwang

More information

Chaotic Coupled Map Lattices

Chaotic Coupled Map Lattices Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each

More information

A GENERAL FORM FOR THE ELECTRIC FIELD LINES EQUATION CONCERNING AN AXIALLY SYMMETRIC CONTINUOUS CHARGE DISTRIBUTION

A GENERAL FORM FOR THE ELECTRIC FIELD LINES EQUATION CONCERNING AN AXIALLY SYMMETRIC CONTINUOUS CHARGE DISTRIBUTION A GENEAL FOM FO THE ELECTIC FIELD LINES EQUATION CONCENING AN AXIALLY SYMMETIC CONTINUOUS CHAGE DISTIBUTION BY MUGU B. ăuţ Abstract..By using an unexpected approach it results a general for for the electric

More information

Polygonal Designs: Existence and Construction

Polygonal Designs: Existence and Construction Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G

More information

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds

More information

arxiv: v1 [math.co] 19 Apr 2017

arxiv: v1 [math.co] 19 Apr 2017 PROOF OF CHAPOTON S CONJECTURE ON NEWTON POLYTOPES OF q-ehrhart POLYNOMIALS arxiv:1704.0561v1 [ath.co] 19 Apr 017 JANG SOO KIM AND U-KEUN SONG Abstract. Recently, Chapoton found a q-analog of Ehrhart polynoials,

More information

Lecture 21. Interior Point Methods Setup and Algorithm

Lecture 21. Interior Point Methods Setup and Algorithm Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and

More information

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either

More information

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More information

Distributed Subgradient Methods for Multi-agent Optimization

Distributed Subgradient Methods for Multi-agent Optimization 1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths

More information

In this chapter, we consider several graph-theoretic and probabilistic models

In this chapter, we consider several graph-theoretic and probabilistic models THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions

More information

#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES

#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES #A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,

More information

A note on the realignment criterion

A note on the realignment criterion A note on the realignent criterion Chi-Kwong Li 1, Yiu-Tung Poon and Nung-Sing Sze 3 1 Departent of Matheatics, College of Willia & Mary, Williasburg, VA 3185, USA Departent of Matheatics, Iowa State University,

More information

Physics 139B Solutions to Homework Set 3 Fall 2009

Physics 139B Solutions to Homework Set 3 Fall 2009 Physics 139B Solutions to Hoework Set 3 Fall 009 1. Consider a particle of ass attached to a rigid assless rod of fixed length R whose other end is fixed at the origin. The rod is free to rotate about

More information

Multi-Dimensional Hegselmann-Krause Dynamics

Multi-Dimensional Hegselmann-Krause Dynamics Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory

More information

ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS

ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS Palestine Journal of Matheatics Vol 4) 05), 70 76 Palestine Polytechnic University-PPU 05 ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS Julius Fergy T Rabago Counicated by

More information

A Bernstein-Markov Theorem for Normed Spaces

A Bernstein-Markov Theorem for Normed Spaces A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :

More information

LORENTZ SPACES AND REAL INTERPOLATION THE KEEL-TAO APPROACH

LORENTZ SPACES AND REAL INTERPOLATION THE KEEL-TAO APPROACH LORENTZ SPACES AND REAL INTERPOLATION THE KEEL-TAO APPROACH GUILLERMO REY. Introduction If an operator T is bounded on two Lebesgue spaces, the theory of coplex interpolation allows us to deduce the boundedness

More information

Example A1: Preparation of a Calibration Standard

Example A1: Preparation of a Calibration Standard Suary Goal A calibration standard is prepared fro a high purity etal (cadiu) with a concentration of ca.1000 g l -1. Measureent procedure The surface of the high purity etal is cleaned to reove any etal-oxide

More information

Physics 215 Winter The Density Matrix

Physics 215 Winter The Density Matrix Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it

More information

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN

More information

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone Characterization of the Line Coplexity of Cellular Autoata Generated by Polynoial Transition Rules Bertrand Stone Abstract Cellular autoata are discrete dynaical systes which consist of changing patterns

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October

More information

On the Navier Stokes equations

On the Navier Stokes equations On the Navier Stokes equations Daniel Thoas Hayes April 26, 2018 The proble on the existence and soothness of the Navier Stokes equations is resolved. 1. Proble description The Navier Stokes equations

More information

ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE

ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE CHRISTOPHER J. HILLAR Abstract. A long-standing conjecture asserts that the polynoial p(t = Tr(A + tb ] has nonnegative coefficients whenever is

More information

A new type of lower bound for the largest eigenvalue of a symmetric matrix

A new type of lower bound for the largest eigenvalue of a symmetric matrix Linear Algebra and its Applications 47 7 9 9 www.elsevier.co/locate/laa A new type of lower bound for the largest eigenvalue of a syetric atrix Piet Van Mieghe Delft University of Technology, P.O. Box

More information

lecture 37: Linear Multistep Methods: Absolute Stability, Part I lecture 38: Linear Multistep Methods: Absolute Stability, Part II

lecture 37: Linear Multistep Methods: Absolute Stability, Part I lecture 38: Linear Multistep Methods: Absolute Stability, Part II lecture 37: Linear Multistep Methods: Absolute Stability, Part I lecture 3: Linear Multistep Methods: Absolute Stability, Part II 5.7 Linear ultistep ethods: absolute stability At this point, it ay well

More information

Bipartite subgraphs and the smallest eigenvalue

Bipartite subgraphs and the smallest eigenvalue Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.

More information

Poly-Bernoulli Numbers and Eulerian Numbers

Poly-Bernoulli Numbers and Eulerian Numbers 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441

More information

A NEW CHARACTERIZATION OF THE CR SPHERE AND THE SHARP EIGENVALUE ESTIMATE FOR THE KOHN LAPLACIAN. 1. Introduction

A NEW CHARACTERIZATION OF THE CR SPHERE AND THE SHARP EIGENVALUE ESTIMATE FOR THE KOHN LAPLACIAN. 1. Introduction A NEW CHARACTERIZATION OF THE CR SPHERE AND THE SHARP EIGENVALUE ESTIATE FOR THE KOHN LAPLACIAN SONG-YING LI, DUONG NGOC SON, AND XIAODONG WANG 1. Introduction Let, θ be a pseudoheritian anifold of diension

More information

RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE

RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE Proceedings of ICIPE rd International Conference on Inverse Probles in Engineering: Theory and Practice June -8, 999, Port Ludlow, Washington, USA : RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,

More information

3.3 Variational Characterization of Singular Values

3.3 Variational Characterization of Singular Values 3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and

More information

FAST DYNAMO ON THE REAL LINE

FAST DYNAMO ON THE REAL LINE FAST DYAMO O THE REAL LIE O. KOZLOVSKI & P. VYTOVA Abstract. In this paper we show that a piecewise expanding ap on the interval, extended to the real line by a non-expanding ap satisfying soe ild hypthesis

More information

G G G G G. Spec k G. G Spec k G G. G G m G. G Spec k. Spec k

G G G G G. Spec k G. G Spec k G G. G G m G. G Spec k. Spec k 12 VICTORIA HOSKINS 3. Algebraic group actions and quotients In this section we consider group actions on algebraic varieties and also describe what type of quotients we would like to have for such group

More information

Math Real Analysis The Henstock-Kurzweil Integral

Math Real Analysis The Henstock-Kurzweil Integral Math 402 - Real Analysis The Henstock-Kurzweil Integral Steven Kao & Jocelyn Gonzales April 28, 2015 1 Introduction to the Henstock-Kurzweil Integral Although the Rieann integral is the priary integration

More information

On Conditions for Linearity of Optimal Estimation

On Conditions for Linearity of Optimal Estimation On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at

More information

A1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3

A1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3 A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)

More information

Reed-Muller Codes. m r inductive definition. Later, we shall explain how to construct Reed-Muller codes using the Kronecker product.

Reed-Muller Codes. m r inductive definition. Later, we shall explain how to construct Reed-Muller codes using the Kronecker product. Coding Theory Massoud Malek Reed-Muller Codes An iportant class of linear block codes rich in algebraic and geoetric structure is the class of Reed-Muller codes, which includes the Extended Haing code.

More information

OBJECTIVES INTRODUCTION

OBJECTIVES INTRODUCTION M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and

More information

APPROXIMATION BY GENERALIZED FABER SERIES IN BERGMAN SPACES ON INFINITE DOMAINS WITH A QUASICONFORMAL BOUNDARY

APPROXIMATION BY GENERALIZED FABER SERIES IN BERGMAN SPACES ON INFINITE DOMAINS WITH A QUASICONFORMAL BOUNDARY NEW ZEALAND JOURNAL OF MATHEMATICS Volue 36 007, 11 APPROXIMATION BY GENERALIZED FABER SERIES IN BERGMAN SPACES ON INFINITE DOMAINS WITH A QUASICONFORMAL BOUNDARY Daniyal M. Israfilov and Yunus E. Yildirir

More information

lecture 36: Linear Multistep Mehods: Zero Stability

lecture 36: Linear Multistep Mehods: Zero Stability 95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,

More information

RIEMANN-ROCH FOR PUNCTURED CURVES VIA ANALYTIC PERTURBATION THEORY [SKETCH]

RIEMANN-ROCH FOR PUNCTURED CURVES VIA ANALYTIC PERTURBATION THEORY [SKETCH] RIEMANN-ROCH FOR PUNCTURED CURVES VIA ANALYTIC PERTURBATION THEORY [SKETCH] CHRIS GERIG Abstract. In [Tau96], Taubes proved the Rieann-Roch theore for copact Rieann surfaces, as a by-product of taking

More information

Perturbation on Polynomials

Perturbation on Polynomials Perturbation on Polynoials Isaila Diouf 1, Babacar Diakhaté 1 & Abdoul O Watt 2 1 Départeent Maths-Infos, Université Cheikh Anta Diop, Dakar, Senegal Journal of Matheatics Research; Vol 5, No 3; 2013 ISSN

More information

List Scheduling and LPT Oliver Braun (09/05/2017)

List Scheduling and LPT Oliver Braun (09/05/2017) List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)

More information

arxiv: v1 [math.pr] 17 May 2009

arxiv: v1 [math.pr] 17 May 2009 A strong law of large nubers for artingale arrays Yves F. Atchadé arxiv:0905.2761v1 [ath.pr] 17 May 2009 March 2009 Abstract: We prove a artingale triangular array generalization of the Chow-Birnbau- Marshall

More information

arxiv:math/ v1 [math.nt] 15 Jul 2003

arxiv:math/ v1 [math.nt] 15 Jul 2003 arxiv:ath/0307203v [ath.nt] 5 Jul 2003 A quantitative version of the Roth-Ridout theore Toohiro Yaada, 606-8502, Faculty of Science, Kyoto University, Kitashirakawaoiwakecho, Sakyoku, Kyoto-City, Kyoto,

More information

The Möbius inversion formula for Fourier series applied to Bernoulli and Euler polynomials

The Möbius inversion formula for Fourier series applied to Bernoulli and Euler polynomials The Möbius inversion forula for Fourier series applied to Bernoulli and Euler polynoials Luis M Navas a, Francisco J Ruiz b,, Juan L Varona c,, a Departaento de Mateáticas, Universidad de Salaanca, Plaza

More information

Stability Ordinates of Adams Predictor-Corrector Methods

Stability Ordinates of Adams Predictor-Corrector Methods BIT anuscript No. will be inserted by the editor Stability Ordinates of Adas Predictor-Corrector Methods Michelle L. Ghrist Jonah A. Reeger Bengt Fornberg Received: date / Accepted: date Abstract How far

More information

The Transactional Nature of Quantum Information

The Transactional Nature of Quantum Information The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.

More information

arxiv: v3 [cs.sy] 29 Dec 2014

arxiv: v3 [cs.sy] 29 Dec 2014 A QUADRATIC LOWER BOUND FOR THE CONVERGENCE RATE IN THE ONE-DIMENSIONAL HEGSELMANN-KRAUSE BOUNDED CONFIDENCE DYNAMICS EDVIN WEDIN AND PETER HEGARTY Abstract. Let f k n) be the axiu nuber of tie steps taken

More information

A remark on a success rate model for DPA and CPA

A remark on a success rate model for DPA and CPA A reark on a success rate odel for DPA and CPA A. Wieers, BSI Version 0.5 andreas.wieers@bsi.bund.de Septeber 5, 2018 Abstract The success rate is the ost coon evaluation etric for easuring the perforance

More information

Lectures 8 & 9: The Z-transform.

Lectures 8 & 9: The Z-transform. Lectures 8 & 9: The Z-transfor. 1. Definitions. The Z-transfor is defined as a function series (a series in which each ter is a function of one or ore variables: Z[] where is a C valued function f : N

More information

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

THE SUPER CATALAN NUMBERS S(m, m + s) FOR s 3 AND SOME INTEGER FACTORIAL RATIOS. 1. Introduction. = (2n)!

THE SUPER CATALAN NUMBERS S(m, m + s) FOR s 3 AND SOME INTEGER FACTORIAL RATIOS. 1. Introduction. = (2n)! THE SUPER CATALAN NUMBERS S(, + s FOR s 3 AND SOME INTEGER FACTORIAL RATIOS XIN CHEN AND JANE WANG Abstract. We give a cobinatorial interpretation for the super Catalan nuber S(, + s for s 3 using lattice

More information

Computable Shell Decomposition Bounds

Computable Shell Decomposition Bounds Coputable Shell Decoposition Bounds John Langford TTI-Chicago jcl@cs.cu.edu David McAllester TTI-Chicago dac@autoreason.co Editor: Leslie Pack Kaelbling and David Cohn Abstract Haussler, Kearns, Seung

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

Constrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008

Constrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008 LIDS Report 2779 1 Constrained Consensus and Optiization in Multi-Agent Networks arxiv:0802.3922v2 [ath.oc] 17 Dec 2008 Angelia Nedić, Asuan Ozdaglar, and Pablo A. Parrilo February 15, 2013 Abstract We

More information

STOPPING SIMULATED PATHS EARLY

STOPPING SIMULATED PATHS EARLY Proceedings of the 2 Winter Siulation Conference B.A.Peters,J.S.Sith,D.J.Medeiros,andM.W.Rohrer,eds. STOPPING SIMULATED PATHS EARLY Paul Glasseran Graduate School of Business Colubia University New Yor,

More information

Tail estimates for norms of sums of log-concave random vectors

Tail estimates for norms of sums of log-concave random vectors Tail estiates for nors of sus of log-concave rando vectors Rados law Adaczak Rafa l Lata la Alexander E. Litvak Alain Pajor Nicole Toczak-Jaegerann Abstract We establish new tail estiates for order statistics

More information

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost

More information

The Fundamental Basis Theorem of Geometry from an algebraic point of view

The Fundamental Basis Theorem of Geometry from an algebraic point of view Journal of Physics: Conference Series PAPER OPEN ACCESS The Fundaental Basis Theore of Geoetry fro an algebraic point of view To cite this article: U Bekbaev 2017 J Phys: Conf Ser 819 012013 View the article

More information

Tail Estimation of the Spectral Density under Fixed-Domain Asymptotics

Tail Estimation of the Spectral Density under Fixed-Domain Asymptotics Tail Estiation of the Spectral Density under Fixed-Doain Asyptotics Wei-Ying Wu, Chae Young Li and Yiin Xiao Wei-Ying Wu, Departent of Statistics & Probability Michigan State University, East Lansing,

More information

4 = (0.02) 3 13, = 0.25 because = 25. Simi-

4 = (0.02) 3 13, = 0.25 because = 25. Simi- Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =

More information

Math Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65

Math Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65 The Monotone Lindelöf Property and Separability in Ordered Spaces by H. Bennett, Texas Tech University, Lubbock, TX 79409 D. Lutzer, College of Willia and Mary, Williasburg, VA 23187-8795 M. Matveev, Irvine,

More information

On Certain C-Test Words for Free Groups

On Certain C-Test Words for Free Groups Journal of Algebra 247, 509 540 2002 doi:10.1006 jabr.2001.9001, available online at http: www.idealibrary.co on On Certain C-Test Words for Free Groups Donghi Lee Departent of Matheatics, Uni ersity of

More information

INDEPENDENT SETS IN HYPERGRAPHS

INDEPENDENT SETS IN HYPERGRAPHS INDEPENDENT SETS IN HYPERGRAPHS Abstract. Many iportant theores and conjectures in cobinatorics, such as the theore of Szeerédi on arithetic progressions and the Erdős-Stone Theore in extreal graph theory,

More information

Gibbs Phenomenon for Wavelets

Gibbs Phenomenon for Wavelets APPLIED AND COMPUTATIONAL HAMONIC ANALYSIS 3, 72 81 (1996) ATICLE NO. 6 Gibbs Phenoenon for Wavelets Susan E. Kelly 1 Departent of Matheatics, University of Wisconsin La Crosse, La Crosse, Wisconsin 5461

More information

EE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng

EE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng EE59 Spring Parallel LSI AD Algoriths Lecture I interconnect odeling ethods Zhuo Feng. Z. Feng MTU EE59 So far we ve considered only tie doain analyses We ll soon see that it is soeties preferable to odel

More information

Numerically repeated support splitting and merging phenomena in a porous media equation with strong absorption. Kenji Tomoeda

Numerically repeated support splitting and merging phenomena in a porous media equation with strong absorption. Kenji Tomoeda Journal of Math-for-Industry, Vol. 3 (C-), pp. Nuerically repeated support splitting and erging phenoena in a porous edia equation with strong absorption To the eory of y friend Professor Nakaki. Kenji

More information

Descent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA,

Descent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA, Descent polynoials arxiv:1710.11033v2 [ath.co] 13 Nov 2017 Alexander Diaz-Lopez Departent of Matheatics and Statistics, Villanova University, 800 Lancaster Avenue, Villanova, PA 19085, USA, alexander.diaz-lopez@villanova.edu

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a

More information

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents

More information

Bernoulli numbers and generalized factorial sums

Bernoulli numbers and generalized factorial sums Bernoulli nubers and generalized factorial sus Paul Thoas Young Departent of Matheatics, College of Charleston Charleston, SC 29424 paul@ath.cofc.edu June 25, 2010 Abstract We prove a pair of identities

More information

DETECTION OF NONLINEARITY IN VIBRATIONAL SYSTEMS USING THE SECOND TIME DERIVATIVE OF ABSOLUTE ACCELERATION

DETECTION OF NONLINEARITY IN VIBRATIONAL SYSTEMS USING THE SECOND TIME DERIVATIVE OF ABSOLUTE ACCELERATION DETECTION OF NONLINEARITY IN VIBRATIONAL SYSTEMS USING THE SECOND TIME DERIVATIVE OF ABSOLUTE ACCELERATION Masaki WAKUI 1 and Jun IYAMA and Tsuyoshi KOYAMA 3 ABSTRACT This paper shows a criteria to detect

More information

Supplementary Material for Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion

Supplementary Material for Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion Suppleentary Material for Fast and Provable Algoriths for Spectrally Sparse Signal Reconstruction via Low-Ran Hanel Matrix Copletion Jian-Feng Cai Tianing Wang Ke Wei March 1, 017 Abstract We establish

More information

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period An Approxiate Model for the Theoretical Prediction of the Velocity... 77 Central European Journal of Energetic Materials, 205, 2(), 77-88 ISSN 2353-843 An Approxiate Model for the Theoretical Prediction

More information

About the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry

About the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry About the definition of paraeters and regies of active two-port networks with variable loads on the basis of projective geoetry PENN ALEXANDR nstitute of Electronic Engineering and Nanotechnologies "D

More information

arxiv: v2 [math.co] 8 Mar 2018

arxiv: v2 [math.co] 8 Mar 2018 Restricted lonesu atrices arxiv:1711.10178v2 [ath.co] 8 Mar 2018 Beáta Bényi Faculty of Water Sciences, National University of Public Service, Budapest beata.benyi@gail.co March 9, 2018 Keywords: enueration,

More information

Fourier Series Summary (From Salivahanan et al, 2002)

Fourier Series Summary (From Salivahanan et al, 2002) Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t

More information

arxiv: v2 [math.nt] 5 Sep 2012

arxiv: v2 [math.nt] 5 Sep 2012 ON STRONGER CONJECTURES THAT IMPLY THE ERDŐS-MOSER CONJECTURE BERND C. KELLNER arxiv:1003.1646v2 [ath.nt] 5 Sep 2012 Abstract. The Erdős-Moser conjecture states that the Diophantine equation S k () = k,

More information