A DISCRETE ZAK TRANSFORM. Christopher Heil. The MITRE Corporation McLean, Virginia Technical Report MTR-89W00128.

Size: px
Start display at page:

Download "A DISCRETE ZAK TRANSFORM. Christopher Heil. The MITRE Corporation McLean, Virginia Technical Report MTR-89W00128."

Transcription

1 A DISCRETE ZAK TRANSFORM Christopher Heil The MITRE Corporation McLean, Virginia Technical Report MTR-89W00128 August 1989 Abstract. A discrete version of the Zak transfor is defined and used to analyze discrete Weyl Heisenberg fraes, which are nonorthogonal systes in the space of square-suable sequences that, although not necessarily bases, provide representations of square-suable sequences as sus of the frae eleents. While the general theory is essentially siilar to the continuous case, ajor differences occur when specific Weyl Heisenberg fraes are evaluated. In particular, it is shown that while Weyl Heisenberg fraes in the continuous case are bases only if they are generated by functions that are not sooth or have poor decay, it is possible in the discrete case to construct Weyl Heisenberg fraes that are bases and are generated by sequences with good decay. The sapled Gaussian provides an exaple of such a signal. 1. Introduction The recent paper [HW1] surveyed the current literature on fraes in L 2 (R). Fraes are generalizations of orthonoral bases and L 2 (R) is the space of finite-energy signals on the real line. The intent of the frae constructions described in [HW1] is to provide a atheatical foundation for siultaneous tie and frequency analysis in signal processing. However, before these fraes can be ipleented as algoriths on a digital coputer, the theory ust be extended to the type of signals actually used in digital signal processing, naely, discrete or sapled signals. D. Walnut, in [W2], began this work by describing frae constructions for l 2 (Z), the space of square-suable sequences indexed by Z, the set of integers. Each such sequence can be thought of as a sapled finite-energy signal. This paper continues in the sae spirit by extending another aspect of the continuoussignal theory to discrete signals, naely, we define a discrete version of the so-called Zak transfor. We show that the definition of this transfor and the general theores obtained by applying it to Weyl Heisenberg fraes are essentially the sae as in the continuous case, but that very different results can occur when specific Weyl Heisenberg fraes are evaluated. In particular, discrete Weyl Heisenberg fraes appear to be ore tractable than their continuous counterparts, indicating that they have good potential for digital signal processing analysis. This work was supported by the MITRE Sponsored Research Progra. 1

2 2 CHRISTOPHER HEIL To give a ore precise eaning to the above rearks, let us first recall the definition of orthonoral basis. If H is a Hilbert space (e.g., L 2 (R) or l 2 (Z)) with inner product, and nor, then a set of vectors {e n } in H is an orthonoral basis if { 1, if = n; 1. e, e n = 0, if n; 2. x, e n 2 = x 2 for all x H. A fundaental property of orthonoral bases is that x = x, e n e n for every x H, so that inforation about x is stored in the set of scalars { x, e n }. Because the orthonorality condition (1) is a stringent and sensitive condition, we define fraes, which have no orthonorality condition and are therefore often easier to generate. A set of vectors {x n } in H is a frae if there exist constants A, B > 0 such that A x 2 n x, x n 2 B x 2 for all x H. As exposited in [HW1], the frae operator Sx = x, x n x n is then welldefined, though not necessarily the identity, as is the case for orthonoral bases. However, S is an isoorphis (i.e., is bijective, continuous, and has a continuous inverse), and every x H can be written x = x, S 1 x n x n, so x is again characterized by its frae transfor { x, S 1 x n }. The paper [HW1] discussed the proble of finding certain fraes for L 2 (R). In particular, the fraes of interest are those in which the frae eleents are easily generated fro a single fixed function through a cobination of the eleentary operations of translation, odulation, and dilation. For exaple, a Weyl Heisenberg syste for L 2 (R) is a set of the for {G n },n Z, where G n (t) = e 2πi(t na)/b G(t na) for soe fixed function G L 2 (R) and fixed a, b > 0. An affine syste is a set of the for {H n },n Z, where H n (t) = a n/2 H(a n t b) for soe fixed H L 2 (R) and fixed a > 1, b > 0. Because of the difficulty involved in tie-copressing sapled signals, discrete versions of affine fraes are fairly coplex (see [W2]). This akes discrete Weyl Heisenberg fraes correspondingly ore attractive, and so we will not ention affine fraes again in this paper. The discrete analogue of Weyl Heisenberg systes is a set of the for {g n } n Z,=0,...,a 1, where g n (k) = e 2πi(k na)/b g(k na) for soe fixed g l 2 (Z) and fixed integers a, b > 0. For quantu echanical reasons, J. Zak in the 1960s proved results about the properties of the Weyl Heisenberg syste {G n } when G was the Gaussian signal G(t) = e πt2 and when a = b = 1. In particular, he showed that the set {G n } was coplete (in fact, overcoplete by one eleent) in the sense that its linear span was dense in L 2 (R) (see [Z]). However, I. Daubechies, A. Grossann, and Y. Meyer later showed that the Gaussian does not generate a Weyl Heisenberg frae (see [DGM]). This is unfortunate since, by the

3 A DISCRETE ZAK TRANSFORM 3 uncertainty principle, the Gaussian is the function in L 2 (R) which is best localized both in tie and frequency, in the sense of iniizing the value tg(t) 2 γĝ(γ) 2 G 2. (UP) Thus it is the signal which should provide best results when attepting siultaneous tie and frequency signal analysis. Recently, it has been shown that no function G L 2 (R) for which (UP) is even finite can generate a Weyl Heisenberg frae with a = b (see [BHW] for history and review of proofs, also [Bal; Bat; D; DJ; L]). It can be shown that Weyl Heisenberg fraes are bases (i.e., the frae representations are unique) only when a = b. Thus the only Weyl Heisenberg fraes that will have this desirable feature are those for which (UP) is infinite, which iplies that G is either not sooth or does not decay quickly. This akes Weyl Heisenberg fraes in L 2 (R) soewhat unattractive. However, we show in this paper that the situation for discrete Weyl Heisenberg fraes is quite different. For exaple, we show that the discrete Weyl Heisenberg syste generated by the sapled Gaussian signal, g(k) = e πk2 for k Z, does generate a frae when a = b, and that this frae is a basis for l 2 (Z). 2. Notation R is the real line thought of as the tie axis, and ˆR is its dual group, the real line thought of as the frequency axis. Z is the set of integers, and C the coplex nubers. Z + is the set of positive integers, and R + = (0, ) the set of positive real nubers. Given a Z +, we set Z a = {0, 1,..., a 1}. We will attept to distinguish between sequences and functions by using lowercase letters for the forer and uppercase for the latter. A sequence is a apping f defined on the integers, while a function is a apping F defined on the real line. l 2 (Z) is the Hilbert space of all square-suable sequences, with nor and inner product ( ) 1/2 f 2 = f(k) 2 and f, g = f(k) g(k). k Z k Z The Banach spaces l p (Z) for 1 p < are defined analogously, and l (Z) is the space of all bounded sequences. L 2 (R) is the Hilbert space of all square-integrable functions, with nor and inner product F 2 = ( R F (t) 2 dt) 1/2 and F, G = R F (t) G(t) dt.

4 4 CHRISTOPHER HEIL The Banach spaces L p (R) for 1 p < are defined analogously, and L (R) is the space of all essentially bounded functions. Given a function F we define the translation of F by a R as Modulation is defined as T a F (t) = F (t a). E b F (t) = e 2πibt F (t) for b R. Translation and odulation are also defined on sequences, as long as a Z and b R. We also use the sybol E b by itself to refer to the exponential function E b (t) = e 2πibt. The two-diensional exponentials are E (a,b) (t, ω) = e 2πiat e 2πibω. Given a Hilbert space H and sets of vectors {x n } and {y n }, we define the following ters. 1. {x n } and {y n } are biorthonoral if x, y n = δ n = { 1, if = n; 0, if n. 2. {x n } is coplete if its linear span is dense in H, or equivalently, if the only x H with x, x n = 0 for all n is x = {x n } is inial if x / span{x n } n for any (where span stands for the closed linear span). 4. {x n } is a basis if for each x H there exist unique scalars {c n } such that x = cn x n. The basis is unconditional if every rearrangeent of these series converge. It is bounded if 0 < inf x n sup x n <. 3. Fraes We review soe of the properties of fraes. More details can be found in [H2; HW1; D; DS; Y]. Definition 3.1 [DS]. A set of vectors {x n } in a Hilbert space H is a frae if there exist nubers A, B > 0 such that for every x H we have A x 2 x, x n 2 B x 2. n The nubers A, B are the frae bounds. The frae is tight if A = B. The frae is exact if it ceases to be a frae whenever any single eleent is deleted fro the sequence. Given two operators S, T : H H we write S T if Sx, x T x, x for all x H. We denote by I the identity ap on H, i.e., Ix = x for all x H.

5 A DISCRETE ZAK TRANSFORM 5 Theore 3.2 [DS]. Given a sequence {x n } in a Hilbert space H, the following two stateents are equivalent: 1. {x n } is a frae with bounds A, B. 2. Sx = x, x n x n is a bounded linear operator with AI S BI, called the frae operator for {x n }. Corollary 3.3 [DS]. 1. S is invertible and B 1 I S 1 A 1 I. 2. {S 1 x n } is a frae with bounds B 1, A 1, called the dual frae. 3. Every x H can be written x = x, S 1 x n x n = x, x n S 1 x n. Theore 3.4 [DS]. The reoval of a vector fro a frae leaves either a frae or an incoplete set. In particular, given fixed, x, S 1 x 1 {x n } n is a frae; x, S 1 x = 1 {x n } n is incoplete. Theore 3.5 [Y]. 1. Inexact fraes are not bases, i.e., the representations in Corollary 2.3 part 3 are not unique. 2. A sequence {x n } in a Hilbert space H is an exact frae for H if and only if it is a bounded unconditional basis. This occurs if and only if there exists an orthonoral basis {e n } and an isoorphis U: H H such that x n = Ue n for all n. 4. The Zak Transfor Two good articles on the properties of the continuous version of the Zak transfor are [J1; J2]. Definition The (continuous) Zak transfor of a function F is (forally) ZF (t, ω) = j Z F (t + ja) e 2πijω for (t, ω) R ˆR, and where a R + is a fixed paraeter.

6 6 CHRISTOPHER HEIL 2. The (discrete) Zak transfor of a sequence f is (forally) zf(k, ω) = f(k + ja) e 2πijω j Z for (k, ω) Z ˆR, and where a Z + is a fixed paraeter. The series defining ZF or zf can converge in various senses. For exaple, if F is a continuous function with copact support, then ZF clearly converges pointwise since it reduces everywhere to a finite su. First note that ZF and zf are quasiperiodic in the following sense: 1. For all (t, ω) R ˆR we have ZF (t + a, ω) = e 2πiω ZF (t, ω); ZF (t, ω + 1) = ZF (t, ω). 2. For all (k, ω) Z ˆR we have zf(k + a, ω) = e 2πiω zf(k, ω); zf(k, ω + 1) = zf(k, ω). Therefore, ZF is copletely deterined by its values on the fundaental rectangle Q = [0, a) [0, 1), while zf is copletely deterined by its values on the set q = Z a [0, 1) = {0,..., a 1} [0, 1). Note that q is the subset of Q consisting of vertical lines with integer abscissa coordinates. Moreover, if F is a continuous function, and f is the integer sapled values of F, i.e., f(k) = F (k) for k Z, then ZF (k, ω) = zf(k, ω) for all (k, ω) q (in fact, for all (k, ω) Z ˆR). Definition 4.2. We let L 2 (Q) be the Hilbert space of all appings Φ: Q C for which Φ 2 = ( a Φ(t, ω) 2 dt dω) 1/2 <,

7 A DISCRETE ZAK TRANSFORM 7 with the usual inner product. Siilarly, l 2 (q) is the Hilbert space of appings ϕ: q C for which ( 1/2 1 ϕ 2 = ϕ(k, ω) dω) 2 <, k Z a again with the expected inner product. 0 The proof of the following theore for Z can be found in [HW1]. The proof for the discrete case is virtually identical, so will be oitted. Theore Z is a unitary ap of L 2 (R) onto L 2 (Q), with the series defining Zf converging in the nor of L 2 (Q). 2. z is a unitary ap of l 2 (Z) onto l 2 (q), with the series defining zf converging in the nor of l 2 (q). 5. Analysis of Weyl Heisenberg Fraes with the Zak Transfor Definition Given a fixed function G L 2 (R) and given a, b R +, the (continuous) Weyl Heisenberg syste generated by (G, a, b) is {G n },n Z, where G n (t) = T na E b G(t) = e2πi(t na)/b G(t na). We call G the other wavelet and a, b the syste paraeters. 2. Given a fixed sequence g l 2 (Z) and given a, b Z +, the (discrete) Weyl Heisenberg syste generated by (g, a, b) is {g n } Zb,n Z, where g n (k) = T na E b g(k) = e2πi(k na)/b g(k na). We call g the other sequence and a, b the syste paraeters. We are ost interested, of course, in Weyl Heisenberg fraes. We refer to [HW1] for exaples and conditions for the existence of continuous Weyl Heisenberg fraes, and to [W2] for discrete W H fraes. Since Z and z are unitary aps, we can use the to transfor probles fro the tie doain into a Zak transfor doain. More precisely, the unitarity iplies that a discrete W H syste {g n } in l 2 (Z) is coplete, a frae, an exact frae, an orthonoral basis, etc., if and only if the sae is true of the syste {zg n } in l 2 (q), with analogous rearks holding for continuous systes. This transforation turns out to be particularly useful in the case a = b, for zg n then has the following siple for.

8 8 CHRISTOPHER HEIL Theore 5.2. Given g l 2 (Z) and a Z +. If b = a then zg n = E ( a,n) zg. Proof. We copute: zg n (k, ω) = j = j g n (k + ja) e 2πijω e 2πi(k+ja na)/a g(k + ja na) e 2πijω = e 2πik/a j = e 2πik/a j g(k + ja na) e 2πijω g(k + ja) e 2πi(j+n)ω = e 2πik/a e 2πinω j g(k + ja) e 2πijω = E ( a,n) (k, ω) zg(k, ω). An analogous result holds for the continuous case. The iportance of Theore 5.2 is that the set of functions {a 1/2 E ( a,n) } Za,n Z fors an orthonoral basis for l 2 (q). Thus the question of when {g n } can for a frae for l 2 (Z) when a = b is transfored by z into the question of when is possible to take an orthonoral basis for l 2 (q), ultiply each eleent of the basis by the single function zg, and still obtain a frae for l 2 (q). This iposes severe restrictions on the function zg, which are given precisely in the following theore. Theore 5.3. Given a fixed g L 2 (R) and a Z +. If we define b = a then the following stateents hold. 1. {g n } is coplete in l 2 (Z) if and only if zg 0 a.e. 2. {g n } is inial and coplete in l 2 (Z) if and only if 1 zg l2 (q). 3. {g n } is a frae for l 2 (Z) with frae bounds A, B if and only if In this case the frae is exact. 0 < a 1 A zg 2 a 1 B < a.e. 4. {g n } is an orthonoral basis for l 2 (Z) if and only if zg 2 = a 1 a.e.

9 A DISCRETE ZAK TRANSFORM 9 Proof. 1. Assue {g n } was coplete in l 2 (Z). Then {zg n } is coplete in l 2 (q) by the unitarity of z. Define ϕ on q by ϕ(k, ω) = { 1, if zg(k, ω) = 0; 0, if zg(k, ω) 0. Then zg n, ϕ = E ( a,n) zg, ϕ = E ( a,n), zg ϕ = E ( a,n), 0 = 0 for all, n. But {zg n } is coplete, so this iplies ϕ = 0 a.e., which iplies zg = 0 a.e. Now assue zg 0 a.e., and suppose ϕ l 2 (q) is such that zg n, ϕ = 0 for all, n. Then 0 = zg n, ϕ = E ( a,n) zg, ϕ = E ( a,n), zg ϕ. Since zg ϕ l 1 (q) and {E ( a,n) } is coplete in l 1 (q), it follows that ϕ = 0 a.e., so {zg n } is coplete is l 2 (q). Since z is unitary, this iplies that {g n } is coplete in l 2 (Z). 2. Assue {g n } is inial and coplete in l 2 (Z), so the sae is true of {zg n } in l 2 (q). By part 1, we also know that zg 0 a.e. Now, the iniality iplies (see [S]) that there is a set of functions {ϕ n } in l 2 (q) which are biorthonoral to {zg n }, i.e., zg n, ϕ n = δ δ nn = { 1, if = and n = n ; 0, otherwise. Now zg n, ϕ n = E ( a,n), zg ϕ n, and zg ϕ n l 1 (q) while E ( a,n) l (q). Thus the set {zg ϕ n } l 1 (q) is biorthonoral to the set {E ( a,n) } l (q). But there is a unique sequence in l 1 (q) which is biorthonoral to {E ( a,n) } l (q), naely {a 1 E ( a,n) }. Therefore, zg ϕ n = a 1 E ( a,n), so E ( a,n) /zg = a 1 ϕ n for all, n. In particular, 1/zg l 2 (q). Conversely, assue 1/zg l 2 (q). Then zg 0 a.e., so {g n } is coplete by part 1. Let g = a 1 Z 1 (1/zg) l 2 (Z). Then g n, g n = zg n, z g n = E ( a,n) zg, E ( a,n ) z g = a 1 E ( a,n), E ( a,n ) = δ δ nn.

10 10 CHRISTOPHER HEIL Thus {g n } and { g n } are biorthonoral in l 2 (Z). The existence of a biorthonoral set iplies iediately that {g n } is inial (see [S]). 3. Siilar to the continuous Zak arguent presented in [HW1]. 4. Follows easily fro 3. An analogous continuous version of Theore 5.3 can be found in [H2] and [HW1]. We are especially interested in parts 3 and 4 of Theore 5.3. Part 3 iplies that, in the a = b case, any W H frae will be exact, hence a basis for l 2 (Z). This is desirable, since in this case we have unique decopositions of l 2 (Z), i.e., the frae representations in Corollary 2.3 part 3 are unique. In both the continuous and discrete cases, it can be shown that if the ratio a/b is greater than 1 then it is ipossible to for W H fraes, while if it is less than 1, any W H frae will be inexact, i.e., the frae representations will not be unique. This is why we have concentrated our attention on the a = b case. Our goal now is to deterine what sorts of functions will or will not satisfy the conditions of Theore 5.3. To do this, we ust deterine when the Zak transfor of a sequence or function will have zeroes. In the continuous case, it can be shown that if G L 2 (R) is such that ZG is continuous on the plane R ˆR, then ZG has a zero, and so G cannot generate a W H frae for the case a = b. It is shown in [H2] that if G is continuous and satisfies the ild decay condition sup k Z t [k,k+1] g(t) <, then ZG will be continuous. Thus only unpleasant functions will generate W H fraes for L 2 (R). In particular, the Gaussian function G(t) = e πt2 will not generate a W H frae when a = b. The situation is ore coplicated in the discrete case, for here zg is defined only on disconnected vertical lines. Therefore, there is no concept of continuity in the k variable, a fact which will allow us to construct discrete W H fraes fro sequences which do have good decay. In the sequel, when we speak of the continuity of zg, we will ean only that zg is continuous in the ω variable on each vertical line. Theore 5.4. If g l 1 (Z) then zg is well-defined; in fact, the series defining zg(k, ) converges uniforly for each k Z to a continuous function. Proof. Given any fixed k Z, we have the following for each ω ˆR: zg(k, ω) = g(k + ja) e 2πijω k Z

11 A DISCRETE ZAK TRANSFORM 11 k Z g(k + ja) g(k) k Z <. Therefore zg(k, ) converges uniforly, and so the liit ust be continuous since each ter g(k + ja) e 2πijω is continuous. Although not needed, we ention the following additional facts about the Zak transfor of l 1 -sequences. The proof is siilar to the continuous version in [H2]. Theore 5.5. Given 1 p < 2, the Zak transfor is a linear, continuous, injective apping of l p (Z) into l p (q) with z = 1. Moreover, Range(z) is dense in l p (q), but z is not surjective, and z 1 : Range(z) l p (Z) is not continuous. Theore 5.6. The Zak transfor cannot be defined as a ap of l q (Z) into any l r (q) when q > 2. We now exaine the properties of sequences whose Zak transfor is continuous. Theore 5.7. Assue g l 2 (Z) is such that zg is continuous. 1. If g is odd (i.e., g( k) = g(k) for k Z), then zg(0, 0) = zg(0, 1/2) = 0. If in addition a is even, then zg(a/2, 0) = If g is even (i.e., g( k) = g(k) for k Z), then zg(a/2, 1/2) = 0. Proof. We prove only 2 since 1 is siilar. Since g is even we can copute: zg( k, ω) = k Z = k Z g( k + ja) e 2πijω g( k ja) e 2πijω = g(k + ja) e 2πijω k Z = zg(k, ω). Since a is even, a/2 is an integer. The quasiperiodicity of zg therefore iplies that zg(a/2, 1/2) = zg( a/2, 1/2) = e 2πi( 1/2) zg(a/2, 1/2) = e πi zg(a/2, 1/2)

12 12 CHRISTOPHER HEIL = zg(a/2, 1/2). Therefore zg(a/2, 1/2) = 0. As a result of this theore, no sequence g l 1 (Z) which is odd can generate a W H frae for any integer a Z + if we take b = a. Also, no even sequence g l 1 (Z) can generate a W H frae for any even values of a Z + (with b = a). In particular, the sapled Gaussian sequence g(k) = e πk2 will not generate a frae for any even a Z +. This still leaves the question of odd values of a, which we address in the next section. The Guassian function and sequence are: 6. The Gaussian G(t) = e rt2, t R; g(k) = e rk2, k Z; where r > 0 is fixed. Since G is well-behaved, we know that ZG will be continuous and ust therefore have at least one zero in the fundaental rectangle Q. Direct calculation gives ZG(t, ω) = j G(t + ja) e 2πijω where θ 3 is the third Jacobi theta function = e rt2 e 2rtja e rj2 a 2 e 2πijω j ( ) ( ) = e rt2 e ra 2 j 2 ω e 4πij 2 rta 2πi j = e rt2 θ 3 ( ω 2 + irta 2π, e ra2 ), θ 3 (w, q) = q j2 cos(4πjw) = j=1 j= q j2 e 4πijw. (see [R] for an exposition of the properties of the four theta functions). Now, the zeroes of θ 3 (, e ra2 ) occur precisely at the points ra2 i 4π nra2 i 2π, for, n Z. These correspond to the values t = a 2 + na and ω = 1 2 a single zero in Q. +. Hence ZG has

13 A DISCRETE ZAK TRANSFORM 13 Now, zg is given by zg(k, ω) = ZG(k, ω) for (k, ω) q. If a is even then the point (a/2, 1/2) lies in q, so zg has a zero. Since ZG is continuous and zg is its restriction, this iplies that zg is not bounded below, hence cannot generate a frae for the case a = b. However, if a is odd then the point (a/2, 1/2) does not lie in q, so zg has no zeroes in q. As zg is continuous on q, this iplies that it is bounded above and below on q, and therefore does generate a W H frae for l 2 (Z) if b = a. Moreover, by Theore 5.3, this frae is exact, so is a bounded unconditional basis for l 2 (Z) by Theore 2.5. References [Bal] R. Balian, Un principe d incertitude fort en théorie du signal ou en écanique quantique, C. R. Acad. Sci. Paris 292 (1981), [Bat] G. Battle, Heisenberg proof of the Balian-Low theore, Lett. Math. Phys. 15 (1988), [B1] J. Benedetto, Gabor representations and wavelets, Coutative Haronic Analysis, 1987 (D. Colella, eds.), Contep. Math. 91, Aerican Matheatical Society, Providence, RI, 1989, pp [B2] J. Benedetto, 1990, Uncertainty principle inequalities and spectru estiation, Proceedings of the NATO Advanced Study Institute on Fourier Analysis and its Applications, 1989 (J. Byrnes, eds.), Kluwer Acadeic Publishers, The Netherlands, [BHW] J. Benedetto, C. Heil, and D. Walnut, Rearks on the proof of the Balian Low theore, preprint. [D] I. Daubechies, The wavelet transfor, tie-frequency localization and signal analysis, IEEE Trans. Infor. Theory (to appear). [DGM] I. Daubechies, A. Grossann, and Y. Meyer, 1986, Painless nonorthogonal expansions, J. Math. Phys. 27 (1986), [DJ] I. Daubechies and A.J.E.M. Janssen, to appear, Two theores on lattice expansionsn, IEEE Trans. Infor. Theory 39 (1993), 3 6. [G] D. Gabor, Theory of counications, J. Inst. Elec. Eng. (London) 93 (1946), [H1] C. Heil, Wavelets and fraes, Proceedings of the Suer Signal Processing Conference, 1988, The Institute for Matheatics and Its Applications, Springer-Verlag, New York, [H2], Wiener aalga spaces in generalized haronic analysis and wavelet theory, Ph.D. thesis, University of Maryland, College Park, MD, [HW1] C. Heil and D. Walnut, Continuous and discrete wavelet transfors, SIAM Review 31 (1989), [HW2], Gabor and wavelet expansions, Proceedings of the NATO Advanced Study Institute on Fourier Analysis and its Applications, 1989 (J. Byrnes, eds.), Kluwer Acadeic Publishers, The Netherlands, [J1] A.J.E.M. Janssen, Bargann transfor, Zak transfor, and coherent states, J. Math. Phys. 23 (1982), [J2], The Zak transfor: a signal transfor for sapled tie-continuous signals, Philips J. Res. 43 (1988), [L] F. Low, 1985, Coplete sets of wave packets, A Passion for Physics Essays in Honor of Geoffrey Chew (C. DeTar, et al., eds.), World Scientific, Singapore, 1985, pp [R] E. Rainville, Special Functions, MacMillan, New York, [S] I. Singer, Bases in Banach Spaces, I, Springer-Verlag, New York, [W1] D. Walnut, Weyl Heisenberg wavelet expansions: existence and stability in weighted spaces (1989), University of Maryland, College Park, MD. [W2], Wavelets in Discrete Doains, The MITRE Corporation, Technical Report MP-89W00040 (1989). [Y] R. Young, An Introduction to Nonharonic Fourier Series, Acadeic Press, New York, [Z] J. Zak, Finite translations in solid state physics, Phys. Rev. Lett. 19 (1967),

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

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

Multi-Scale/Multi-Resolution: Wavelet Transform

Multi-Scale/Multi-Resolution: Wavelet Transform Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the

More information

Rational Filter Wavelets*

Rational Filter Wavelets* Ž Journal of Matheatical Analysis and Applications 39, 744 1999 Article ID jaa19996550, available online at http:wwwidealibraryco on Rational Filter Wavelets* Kuang Zheng and Cui Minggen Departent of Matheatics,

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

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

Finite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields

Finite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for

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

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

. 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

Four-vector, Dirac spinor representation and Lorentz Transformations

Four-vector, Dirac spinor representation and Lorentz Transformations Available online at www.pelagiaresearchlibrary.co Advances in Applied Science Research, 2012, 3 (2):749-756 Four-vector, Dirac spinor representation and Lorentz Transforations S. B. Khasare 1, J. N. Rateke

More information

A Quantum Observable for the Graph Isomorphism Problem

A Quantum Observable for the Graph Isomorphism Problem A Quantu Observable for the Graph Isoorphis Proble Mark Ettinger Los Alaos National Laboratory Peter Høyer BRICS Abstract Suppose we are given two graphs on n vertices. We define an observable in the Hilbert

More information

A Simple Regression Problem

A Simple Regression Problem A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where

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

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

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

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

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

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

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

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

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I Contents 1. Preliinaries 2. The ain result 3. The Rieann integral 4. The integral of a nonnegative

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

Computational and Statistical Learning Theory

Computational and Statistical Learning Theory Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher

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

APPROXIMATION BY MODIFIED SZÁSZ-MIRAKYAN OPERATORS

APPROXIMATION BY MODIFIED SZÁSZ-MIRAKYAN OPERATORS APPROXIMATION BY MODIFIED SZÁSZ-MIRAKYAN OPERATORS Received: 23 Deceber, 2008 Accepted: 28 May, 2009 Counicated by: L. REMPULSKA AND S. GRACZYK Institute of Matheatics Poznan University of Technology ul.

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

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

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

Optimal Jamming Over Additive Noise: Vector Source-Channel Case

Optimal Jamming Over Additive Noise: Vector Source-Channel Case Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper

More information

MA304 Differential Geometry

MA304 Differential Geometry MA304 Differential Geoetry Hoework 4 solutions Spring 018 6% of the final ark 1. The paraeterised curve αt = t cosh t for t R is called the catenary. Find the curvature of αt. Solution. Fro hoework question

More information

A Study on B-Spline Wavelets and Wavelet Packets

A Study on B-Spline Wavelets and Wavelet Packets Applied Matheatics 4 5 3-3 Published Online Noveber 4 in SciRes. http://www.scirp.org/ournal/a http://dx.doi.org/.436/a.4.5987 A Study on B-Spline Wavelets and Wavelet Pacets Sana Khan Mohaad Kaliuddin

More information

IN modern society that various systems have become more

IN modern society that various systems have become more Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto

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

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

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

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

PREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL

PREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL PREPRINT 2006:7 Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL Departent of Matheatical Sciences Division of Matheatics CHALMERS UNIVERSITY OF TECHNOLOGY GÖTEBORG UNIVERSITY

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

Representations of Gabor frame operators

Representations of Gabor frame operators 73 Representations of Gabor frae operators A.J.E.M. Janssen Philips Research Laboratories WY-81 5656 AA Eindhoven The Netherlands A.J.E.M.Janssen@philips.co ABSTRACT. Gabor theory is concerned with expanding

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 Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,

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

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation

More information

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket. Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,

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

Max-Product Shepard Approximation Operators

Max-Product Shepard Approximation Operators Max-Product Shepard Approxiation Operators Barnabás Bede 1, Hajie Nobuhara 2, János Fodor 3, Kaoru Hirota 2 1 Departent of Mechanical and Syste Engineering, Bánki Donát Faculty of Mechanical Engineering,

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

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

A Note on Online Scheduling for Jobs with Arbitrary Release Times

A Note on Online Scheduling for Jobs with Arbitrary Release Times A Note on Online Scheduling for Jobs with Arbitrary Release Ties Jihuan Ding, and Guochuan Zhang College of Operations Research and Manageent Science, Qufu Noral University, Rizhao 7686, China dingjihuan@hotail.co

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

The degree of a typical vertex in generalized random intersection graph models

The degree of a typical vertex in generalized random intersection graph models Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent

More information

STRONG LAW OF LARGE NUMBERS FOR SCALAR-NORMED SUMS OF ELEMENTS OF REGRESSIVE SEQUENCES OF RANDOM VARIABLES

STRONG LAW OF LARGE NUMBERS FOR SCALAR-NORMED SUMS OF ELEMENTS OF REGRESSIVE SEQUENCES OF RANDOM VARIABLES Annales Univ Sci Budapest, Sect Cop 39 (2013) 365 379 STRONG LAW OF LARGE NUMBERS FOR SCALAR-NORMED SUMS OF ELEMENTS OF REGRESSIVE SEQUENCES OF RANDOM VARIABLES MK Runovska (Kiev, Ukraine) Dedicated to

More information

Lecture 20 November 7, 2013

Lecture 20 November 7, 2013 CS 229r: Algoriths for Big Data Fall 2013 Prof. Jelani Nelson Lecture 20 Noveber 7, 2013 Scribe: Yun Willia Yu 1 Introduction Today we re going to go through the analysis of atrix copletion. First though,

More information

Entangling characterization of (SWAP) 1/m and Controlled unitary gates

Entangling characterization of (SWAP) 1/m and Controlled unitary gates Entangling characterization of (SWAP) / and Controlled unitary gates S.Balakrishnan and R.Sankaranarayanan Departent of Physics, National Institute of Technology, Tiruchirappalli 65, India. We study the

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

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes

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

ON REGULARITY, TRANSITIVITY, AND ERGODIC PRINCIPLE FOR QUADRATIC STOCHASTIC VOLTERRA OPERATORS MANSOOR SABUROV

ON REGULARITY, TRANSITIVITY, AND ERGODIC PRINCIPLE FOR QUADRATIC STOCHASTIC VOLTERRA OPERATORS MANSOOR SABUROV ON REGULARITY TRANSITIVITY AND ERGODIC PRINCIPLE FOR QUADRATIC STOCHASTIC VOLTERRA OPERATORS MANSOOR SABUROV Departent of Coputational & Theoretical Sciences Faculty of Science International Islaic University

More information

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40 On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering

More information

The Hilbert Schmidt version of the commutator theorem for zero trace matrices

The Hilbert Schmidt version of the commutator theorem for zero trace matrices The Hilbert Schidt version of the coutator theore for zero trace atrices Oer Angel Gideon Schechtan March 205 Abstract Let A be a coplex atrix with zero trace. Then there are atrices B and C such that

More information

1 Bounding the Margin

1 Bounding the Margin COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost

More information

Hermite s Rule Surpasses Simpson s: in Mathematics Curricula Simpson s Rule. Should be Replaced by Hermite s

Hermite s Rule Surpasses Simpson s: in Mathematics Curricula Simpson s Rule. Should be Replaced by Hermite s International Matheatical Foru, 4, 9, no. 34, 663-686 Herite s Rule Surpasses Sipson s: in Matheatics Curricula Sipson s Rule Should be Replaced by Herite s Vito Lapret University of Lublana Faculty of

More information

ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS

ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS #A34 INTEGERS 17 (017) ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS Jürgen Kritschgau Departent of Matheatics, Iowa State University, Aes, Iowa jkritsch@iastateedu Adriana Salerno

More information

Metric Entropy of Convex Hulls

Metric Entropy of Convex Hulls Metric Entropy of Convex Hulls Fuchang Gao University of Idaho Abstract Let T be a precopact subset of a Hilbert space. The etric entropy of the convex hull of T is estiated in ters of the etric entropy

More information

Partitions of finite frames

Partitions of finite frames Rowan University Rowan Digital Works Theses and Dissertations 5--06 Partitions of finite fraes Jaes Michael Rosado Rowan University, jarosado09@gail.co Follow this and additional works at: http://rdw.rowan.edu/etd

More information

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter

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

Lower Bounds for Quantized Matrix Completion

Lower Bounds for Quantized Matrix Completion Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &

More information

PERMANENT WEAK AMENABILITY OF GROUP ALGEBRAS OF FREE GROUPS

PERMANENT WEAK AMENABILITY OF GROUP ALGEBRAS OF FREE GROUPS PERMANENT WEAK AMENABILITY OF GROUP ALGEBRAS OF FREE GROUPS B. E. JOHNSON ABSTRACT We show that all derivations fro the group algebra (G) of a free group into its nth dual, where n is a positive even integer,

More information

1. INTRODUCTION AND RESULTS

1. INTRODUCTION AND RESULTS SOME IDENTITIES INVOLVING THE FIBONACCI NUMBERS AND LUCAS NUMBERS Wenpeng Zhang Research Center for Basic Science, Xi an Jiaotong University Xi an Shaanxi, People s Republic of China (Subitted August 00

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

On Process Complexity

On Process Complexity On Process Coplexity Ada R. Day School of Matheatics, Statistics and Coputer Science, Victoria University of Wellington, PO Box 600, Wellington 6140, New Zealand, Eail: ada.day@cs.vuw.ac.nz Abstract Process

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 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

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

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

Fixed-to-Variable Length Distribution Matching

Fixed-to-Variable Length Distribution Matching Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de

More information

Shannon Sampling II. Connections to Learning Theory

Shannon Sampling II. Connections to Learning Theory Shannon Sapling II Connections to Learning heory Steve Sale oyota echnological Institute at Chicago 147 East 60th Street, Chicago, IL 60637, USA E-ail: sale@athberkeleyedu Ding-Xuan Zhou Departent of Matheatics,

More information

Singularities of divisors on abelian varieties

Singularities of divisors on abelian varieties Singularities of divisors on abelian varieties Olivier Debarre March 20, 2006 This is joint work with Christopher Hacon. We work over the coplex nubers. Let D be an effective divisor on an abelian variety

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

The accelerated expansion of the universe is explained by quantum field theory.

The accelerated expansion of the universe is explained by quantum field theory. The accelerated expansion of the universe is explained by quantu field theory. Abstract. Forulas describing interactions, in fact, use the liiting speed of inforation transfer, and not the speed of light.

More information

Kernel Methods and Support Vector Machines

Kernel Methods and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic

More information

Bootstrapping Dependent Data

Bootstrapping Dependent Data Bootstrapping Dependent Data One of the key issues confronting bootstrap resapling approxiations is how to deal with dependent data. Consider a sequence fx t g n t= of dependent rando variables. Clearly

More information

The isomorphism problem of Hausdorff measures and Hölder restrictions of functions

The isomorphism problem of Hausdorff measures and Hölder restrictions of functions The isoorphis proble of Hausdorff easures and Hölder restrictions of functions Doctoral thesis András Máthé PhD School of Matheatics Pure Matheatics Progra School Leader: Prof. Miklós Laczkovich Progra

More information

A New Algorithm for Reactive Electric Power Measurement

A New Algorithm for Reactive Electric Power Measurement A. Abiyev, GAU J. Soc. & Appl. Sci., 2(4), 7-25, 27 A ew Algorith for Reactive Electric Power Measureent Adalet Abiyev Girne Aerican University, Departernt of Electrical Electronics Engineering, Mersin,

More information

Computable Shell Decomposition Bounds

Computable Shell Decomposition Bounds Journal of Machine Learning Research 5 (2004) 529-547 Subitted 1/03; Revised 8/03; Published 5/04 Coputable Shell Decoposition Bounds John Langford David McAllester Toyota Technology Institute at Chicago

More information

The Methods of Solution for Constrained Nonlinear Programming

The Methods of Solution for Constrained Nonlinear Programming Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained

More information

The linear sampling method and the MUSIC algorithm

The linear sampling method and the MUSIC algorithm INSTITUTE OF PHYSICS PUBLISHING INVERSE PROBLEMS Inverse Probles 17 (2001) 591 595 www.iop.org/journals/ip PII: S0266-5611(01)16989-3 The linear sapling ethod and the MUSIC algorith Margaret Cheney Departent

More information

COS 424: Interacting with Data. Written Exercises

COS 424: Interacting with Data. Written Exercises COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well

More information

Supplement to: Subsampling Methods for Persistent Homology

Supplement to: Subsampling Methods for Persistent Homology Suppleent to: Subsapling Methods for Persistent Hoology A. Technical results In this section, we present soe technical results that will be used to prove the ain theores. First, we expand the notation

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

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

Prerequisites. We recall: Theorem 2 A subset of a countably innite set is countable.

Prerequisites. We recall: Theorem 2 A subset of a countably innite set is countable. Prerequisites 1 Set Theory We recall the basic facts about countable and uncountable sets, union and intersection of sets and iages and preiages of functions. 1.1 Countable and uncountable sets We can

More information

Some Classical Ergodic Theorems

Some Classical Ergodic Theorems Soe Classical Ergodic Theores Matt Rosenzweig Contents Classical Ergodic Theores. Mean Ergodic Theores........................................2 Maxial Ergodic Theore.....................................

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

The path integral approach in the frame work of causal interpretation

The path integral approach in the frame work of causal interpretation Annales de la Fondation Louis de Broglie, Volue 28 no 1, 2003 1 The path integral approach in the frae work of causal interpretation M. Abolhasani 1,2 and M. Golshani 1,2 1 Institute for Studies in Theoretical

More information

13 Harmonic oscillator revisited: Dirac s approach and introduction to Second Quantization

13 Harmonic oscillator revisited: Dirac s approach and introduction to Second Quantization 3 Haronic oscillator revisited: Dirac s approach and introduction to Second Quantization. Dirac cae up with a ore elegant way to solve the haronic oscillator proble. We will now study this approach. The

More information