A Constructive Inversion Framework for Twisted Convolution
|
|
- Madlyn Spencer
- 5 years ago
- Views:
Transcription
1 A Constructive Inversion Framework for Twiste Convolution Yonina C. Elar, Ewa Matusiak, Tobias Werther June 30, 2006 Subject Classification: 44A35, 15A30, 42C15 Key Wors: Twiste convolution, Wiener s Lemma, Gabor frame, Invertibility of operators Abstract In this paper we evelop constructive invertibility conitions for the twiste convolution. Our approach is base on splitting the twiste convolution with rational parameters into a finite number of weighte convolutions, which can be interprete as another twiste convolution on a finite cyclic group. In analogy with the twiste convolution of finite iscrete signals, we erive an antihomomorphism between the sequence space an a suitable matrix Dept. of Electrical Engineering, Technion Israel Institute of Technology, Haifa, Israel. Tel.: , Fax.: , yonina@ee.technion.ac.il Faculty of Math., University of Vienna, 1090 Vienna, Austria. Tel.: , Fax.: , ewa.matusiak@univie.ac.at, tobias.werther@univie.ac.at. 1
2 algebra which preserves the algebraic structure. In this way, the problem reuces to the analysis of finite matrices whose entries are sequences supporte on corresponing cosets. The invertibility conition then follows from Cramer s rule an Wiener s lemma for this special class of matrices. The problem results from a well known approach of stuying the invertibility properties of the Gabor frame operator in the rational case. The presente approach gives further insights into Gabor frames. In particular, it can be applie for both the continuous (on R ) an the finite iscrete setting. In the latter case, we obtain algorithmic schemes for irectly computing the inverse of Gabor frame-type matrices equivalent to those known in the literature. 1 Introuction Twiste convolution arises naturally in the context of time frequency operators, more specifically in the treatment of Gabor frames [1, 8]. The stuy of inversion schemes of twiste convolution has, therefore, a major impact on the analysis of Gabor frames. Our metho is originate by the Janssen representation of Gabor frame operators [11] an simplifies the approach given in [12]. A ifferent, however, equivalent metho for stuying Gabor frame operators is the well known Zibulski-Zeevi representation [14] base on a generalize Zak-transform. In contrast to the stanar convolution, the twiste convolution is not commutative. This is oppose to the possibility of applying powerful tools from harmonic analysis, such as Wiener s Lemma, in orer to stuy twiste convolution operators. Recently, in [12], the authors escribe 2
3 an new approach to classify the invertibility of l 1 -sequences with respect to the twiste convolution for rational parameters. In this manuscript we exten the iea of [12] in the sense that we take a ifferent approach which allows far better insights into the problem. Specifically, we only eal with sequences an show explicitly how efficient inversion schemes can be erive by rather simple (though sophisticate) manipulations of the twiste convolution. The essential iea is to split up the twiste convolution into a finite number of sums that can be incorporate into a special matrix algebra. In this matrix algebra we then prove a special type of Wiener Lemma which is the most challenging part from a mathematical perspective. The paper is organize as follows. The first section briefly outlines the basic efinition of the twiste convolution. In this section we further iscuss the example of twiste convolution on the finite group Z p Z p. This example serves the purpose to motivate the introuction of the matrix algebra that appears in Section 3 where we prove Wiener s Lemma for a special subalgebra. Section 4 links the twiste convolution to timefrequency operators. More specifically, it shows how the results shown in Section 3 can be use in the context of Gabor frames. In the last section, we give a short outline of the application of the presente approach for inverting frame-like Gabor operators. 3
4 2 Twiste Convolution Let p an q be integers an relatively prime. We efine the twiste convolution for sequences a, b l 1 (Z 2 ) by (a b) m,n = k,l Z a k,l b m k,n l ω (m k) l (1) where ω = e 2πiq/p an enotes the inner prouct in R. Although the twiste convolution epens on p, q we o not specify this epenence because p, q will always be given an fixe beforehan. In Section 4 we show how the twiste convolution is relate to a class of operators with a special time-frequency representation. In contrast to the conventional convolution with symbol, in which ω = 1, the twiste convolution is not commutative, an turns l 1 (Z 2 ) into a non-commutative algebra with the elta-sequence δ as its unit element. We tackle the problem to stuy the invertibility of twiste convolution operators. Non-commutativity is the main subtle point in this problem. In fact, the question when the mapping C b : a l 1 a b l 1 for some b l 1 is invertible an how we can compute the inverse is more ifficult than for a commutative setting. In particular, Wiener s Lemma which eals with the problem that if, for some b l 1, C b is invertible on l 2 then the inverse is generate from an element again in l 1, has to be proven separately. An abstract an more general proof of Wiener s Lemma for twiste convolution is given in [10]. Herein, we focus on a constructive 4
5 metho for stuying the invertibility of the twiste convolution with the rational parameter q/p. In the following subsections we stuy the twiste convolution in a finite setting an raw analogies for approaching the problem of invertibility of C b in the general case. 2.1 Twiste convolution on Z p Z p In what follows we escribe the twiste convolution on the finite group F = Z p Z p. The stanar (commutative) convolution of two elements f, g C p p is efine by (f g) m,n = p 1 k,l=0 f k,l g m k,n l, where operations on inices is performe moulo p. In analogy to the infinite case, we efine the twiste convolution f g of two elements f, g C p p by (f g) m,n = p 1 k,l=0 f k,l g m k,n l ω (m k)l with ω = e 2πiq/p. For a fixe g, the twiste convolution can be seen as a linear mapping C g : f f g whose matrix G is block circulant with p blocks, i.e., G = C(G 0, G p 1,..., G 1 ) = Each block has entries of the form G 0 G p 1 G 1 G 1 G 0 G 2... G p 1 G p 2 G 0. (G j ) kl = ω jl g j,k l. 5
6 Note that for the regular convolution each block is itself circulant. For the invertibility of block circulant matrices we apply a well known result from Fourier analysis. Lemma 2.1. [3] The matrix G = C(G 0, G p 1,..., G 1 ) is invertible if an only if every Ĝs = p 1 r=0 e 2πisr/p G r, s = 0,..., p 1, is invertible. In this case where H r = 1 p G 1 = C(H 0, H p 1,..., H 1 ) p 1 s=0 e2πisr/p (Ĝs) 1. By analyzing Ĝs, we see that all blocks are unitary equivalent, in the sense that T r Ĝ s T r = Ĝs qr, where T r enotes the unitary matrix with entries 1 if p r = l k, (T r ) kl = 0 else. Since p an q are relatively prime, we obtain all blocks by such a unitary transformation. This implies that showing that if Ĝ0 is invertible, then all Ĝs are invertible for s = 1,..., p 1. In other wors, the p p matrix Ĝ 0 contains all the information about the invertibility of C g. An easy computation shows that the entries of Ĝ0 are given by p 1 (Ĝ0) n,l = ω nl g k,n l. (2) k=0 We will later see that this observation motivates the matrix algebra that we introuce to stuy the invertibility of the twiste convolution. 6
7 Now, also all Ĝ 1 s satisfy the same unitary equivalence. It follows that we can rea from Ĝ 1 0 the element g 1 which inverts the twiste convolution f f g, i.e., g 1 g = g g 1 = δ. The twiste convolution on Z p Z p serves as analogy for moelling the twiste convolution for the continuous an the finite imensional case. 3 Main results Our aim is to fin a way to escribe those sequences that have an inverse in (l 1 (Z 2 ), ). To this en we ivie the twiste convolution into a finite sum of weighte normal convolutions of sequences that have isjoint support. We efine such a sequence a r,s by a k,l if (k, l) p (r, s), (a r,s ) k,l = 0 else, (3) where r, s Zp. Obviously, a r,s is supporte on the coset (r +pz ) (s+ pz ) an a = r,s Zp ar,s. For a sequence a having a coset support only for one inex, e.g., on Z (s + pz ), we simply write a,s. We write p for enoting the equivalence of integers moulo p. The iea of splitting a sequence into a sum of sequences supporte on cosets has first been introuce by K. Gröchenig an W. Kozek in [9]. Lemma 3.1. Let a, b, c be in l 1 (Z 2 ). (a) For r, s, u, v Z p, a r,s b u,v is a sequence supporte on the coset (u + r + pz ) (v + s + pz ). 7
8 (b) If c = c,0 is invertible in (l 1, ), then c 1 is also supporte on Z pz. Proof. Let a r,s, b u,v be sequences in l 1 (Z 2 ) an k, l Zp. Then (a r,s b u,v ) k+pz,l+pz = (a r,s ) m,n (b u,v ) k+pz m,l+pz n m,n Z = (a r,s ) t,w (b u,v ) k+pz t,l+pz w. m,n Zp (t,w) p (m,n) Since a r,s is nonzero only for (t, w) p (r, s), an b u,v for (k t, l w) p (u, v), we obtain that (k, l) has to be equivalent to (u + r, v + s) moulo p for a r,s b u,v to be nonzero. To show (b), let c = c,0 be invertible an e be its inverse. Then δ = c e = c,0 ( s Z p e,s) = s Z p c,0 e,s, where, by previous calculations, c,0 e,s is a sequence supporte on Z (s + pz ) for each s Z p. Since δ = s Z p δ,s, an elements of the sum have isjoint supports, c,0 e,s = δ,s. But since δ,s = 0 for s 0 an δ,0 = δ, we conclue that δ s = 0 c,0 e,s = 0 s 0 an therefore e = e,0. 8
9 With Definition (3), we obtain for u, v Zp (a b) u+pz,v+pz = a k,l b u+pz k,v+pz lω (u k) l k,l Z = a k,l b u+pz k,v+pz lω (u r) s r,s Zp (k,l) p(r,s) = r,s Z p k,l Z (a r,s ) k,l (b u r,v s ) u+pz k,v+pz lω (u r) s = (a r,s b u r,v s ) u+pz,v+pz ω(u r) s. r,s Z p In a more compact notation we have (a b) u,v = a r,s b u r,v s ω (u r) s. (4) r,s Z p We observe now that the upper inices in (4) behave like a twiste convolution in Zp Zp. What changes is that we have sequences as elements an stanar convolution instea of multiplication. Motivate by the block circulant structure of the twiste convolution on Z p Z p as escribe in the previous section, we introuce a new matrix algebra which is isomorphic to (l 1 (Z 2 ), ). Before we o so, we fix an orering of the elements from Zp. Let N = p an I = {1,..., N}. Then, to each i I we assign an element k i from Zp an set k 1 = (0,..., 0). We will often write 0 instea of k 1. Let (M, ) be an algebra of p p -matrices whose entries are l 1 - sequences an multiplication of two elements A, B M is given by (A B) i,j = l I A i,l B l,j i, j I. The ientity element I is a matrix with δ sequences on the iagonal. 9
10 Theorem 3.2. Let { M 0 = A M A i,j = ω m k j a m,k i k j, a l 1 an i, j I m Zp Then M 0 is a subalgebra of M. Proof. Define a mapping φ: (l 1, ) (M, ) by (φ(a)) i,j = m Z p }. ω m k j a m,k i k j. (5) Then φ is linear, (φ(δ)) i,j = m Z p ωm k j δ m,k i k j = δ if i = j an zero otherwise. So φ(δ) = I. We emphasize that the mapping φ has been motivate by the matrix Ĝ0 escribe in the previous section. For i, j I, ( φ(a b) ) i,j = m Z p = m Zp = ω m k j (a b) m,k i k j ω m k j l,s Z p ω (m l) s a l,s b m l,k i k j s ω m k j+s) ω l s a l,s b m l,k i k j s = = m,l,s Z p m,l,s Z p ω m s ω l (s k j) a l,s k j ω l k j ω s (m l) a l,s k j b m l,k i s b m l,k i s m,l,s Z p = ( ω l k j a ) l,s k j ( ω s (m l) b ) m l,k i s s Zp l Zp m Zp = ( ω k n m b m,k i k n ) ( ω l k j a l,k n k j ) n I m Z p l Z p = n I φ(b) i,n φ(a) n,j = ( φ(b) φ(a) ) i,j. Therefore φ is an anti-homomorphism, that is, φ(a b) = φ(b) φ(a). 10
11 Hence M 0 is an algebra, being an image of an anti-homomorphism. Before stating the main theorem, we explore properties of elements of M 0. For i, j I an a matrix A M 0 we efine a new matrix A(j, i) obtaine from A by substituting the jth row of A with a vector of zeros having δ on the ith position, an the ith column with a column of zeros having δ on the jth position. Lemma 3.3. Let A M 0. Then (a) et(a) is a sequence supporte on Z pz. (b) et(a(1, i)) is a sequence supporte on Z (k i + pz ) for i I. Proof. Let S N be the group of permutations of the set I. Then et(a) = σ S N ( 1) σ = σ S N ( 1) σ N A σ(i),i = i=1 m 1,...,m N Z p Since σ is a permutation of I, σ S N ( 1) σ N ( i=1 m i Z p ω k i m i a m i,k σ(i) k i ) ω N i=1 m i k i a m 1,k σ(1) k 1 a m N,k σ(n) k N }{{}. G m1,...,m N (k σ(1) k 1 ) + (k σ(2) k 2 ) + + (k σ(n) k N ) = 0. Therefore, by Lemma 3.1, G m1,...,m N is a sequence supporte on the coset ( i I m i + pz ) pz. Since i I m i runs over all Zp, we see that et(a) is supporte on the coset Z pz, i.e., et(a) = et(a),0. In orer to compute the support of et(a(1, i)) for i I, let S N 1 enote the group of permutations of {2,..., N}. Then for i = 1,..., N, et(a(1, i)) = 11
12 = ( 1) i+1 ( 1) σ A σ(2),1 A σ(i),i 1 A σ(i+1),i+1 A σ(n),n σ S N 1 = ( 1) i+1 ω m 2 k 1 + +m i k i 1 +m i+1 k i+1 + +m N k N σ S N 1 ( 1) σ m 2,...,m N Z p a m 2,k σ(2) k 1 a m i,k σ(i) k i 1 a m i+1,k σ(i+1) k i+1 a m N,k σ(n) k N }{{}. G m2,...,m N Since σ is a permutation of {2,..., N}, (k σ(2) k 1 ) + + (k σ(i) k i 1 ) + (k σ(i+1) k i+1 ) + + (k σ(n) k N ) = (k σ(2) + + k σ(n) ) (k 1 + k k N ) + k i = (k σ(2) + + k σ(n) ) (k k N ) + k i = k i. Therefore, by Lemma 3.1, G m2,...,m N is supporte on ( N i=2 m i + pz ) (k i + pz ), an since each m i runs over all Z p, et(a(1, i)) is supporte on Z (k i + pz ). That is, et(a(1, i)) = et(a(1, i)),k i. Now we are in the position to state an prove the main result Theorem 3.4. [Wiener s Lemma for M 0 ] Let A M 0. If A is invertible in M, then B = A 1 M 0. Proof. Since A M 0 is invertible, et(a) is an invertible sequence in (l 1, ), an there exists a matrix B M such that A B = I. By Lemma 3.3, et(a) = et(a),0 an by Lemma 3.1 its inverse, e = et(a) 1, is also supporte on the same coset, hence e = e,0. By Cramer s rule the inverse of A is given by B i,j = et(a(j, i)) e. We see that by Lemma 3.3 (b), B i,1 is a sequence supporte on Z (k i + pz ). Let b be a sequence efine by b = B 1,1 + B 2, B N,1. 12
13 Then B i,1 = j I bk j,k i. Define a new matrix, enote by B, as B i,j = m Z p ω m k j b m,k i k j. Then B M 0 an we will show that B = B, that is, B is the inverse of A. Since B is the inverse of A, I i,1 = ( A B ) i,1 = j I A i,j B j,1 = j I ω m k j a m,k i k j B j,1 = j I m Z p ω m k j a m,k i k j ( b n,k j ) = j I m Z p ω m k j a m,k i k j n Z p b n,k j = m Z p = m Z p where G(m, k i ) = j I m Z p j I n Zp n Z p ω (m n) k j a m n,k i k j b n,k j G(m, k i ), supporte on (m + pz) (k i + pz). n Z p ω(m n) k j a m n,k i k j b n,k j is a sequence Therefore, G(k 1, k 1 ) = δ an G(m, k i ) = 0 for m k 1 an i 1. Using the above ientity we will show that A B = I, an by the uniqueness of the inverse we will 13
14 conclue that B = B: ( ) A B = A i,j i,s B s,j = s I = ( ) ( ω m k s a m,k i k s s I ω n k j b n,k s k j ) = m Z p = m Z p = m Z p = m Z p = m Z p m Z p n Z p ω m k s ω n k j a m,k i k s b n,k s k j s I n Zp ω (ks+k j) m ω n k j a m,k i k j k s b n,ks s I n Zp ω (k s+k j ) (m n) ω n k j a m n,(k i k j ) k s b n,k s s I n Zp ω m k j Hence, A B = I. ω (m n) k s a m n,(k i k j ) k s b n,k s s I n Zp ω m k j G(m, k i k j ) = δ k i k j = k 1 i = j; 0 k i k j k 1 i j; Theorem 3.4 provies the key result to stuy invertibility of twiste convolution. Inee, for a given sequence a in l 1 we look at the corresponing matrix A = φ(a) as efine in (5). If A is invertible in (M, ), which can be checke showing that the eterminant is invertible in (l 1, ), then its inverse A 1 is of the form φ(b) for another element b in l 1. This element b, in turn, provies the inverse of a in (l 1, ). The approach is constructive in the sense that algebraic methos such as Cramer s Rule can be applie to fin the inverse of A. Then, the sequence b can simply be rea from the entries of A 1 accoring to the mapping φ. In particular for small p an this metho leas to fast inversion schemes for the twiste convolution operator. In the last section we will show explicitly how this works in the case of = 1. 14
15 4 Twiste convolution an Gabor analysis Central objects in time frequency analysis are moulation an translation operators. Although most of the upcoming notation can be given in the more general setting of locally compact Abelian groups we restrict ourselves to R in orer to simplify the reaability of this article. For x, ω R we efine the translation operator an the moulation operator on L 2 (R ) by T x f( ) = f( x), M ω f( ) = e 2πiω f( ), respectively. Many technical etails in time-frequency analysis are linke to the commutation law of the translation an moulation operator, namely, M ω T x = e 2πix ω T x M ω. (6) The time-frequency shift for x, ω R is enote by π(x, ω) = T x M ω. It follows from (6) that π(x 1, ω 1 )π(x 2, ω 2 ) = e 2πix 2 ω 1 π(x 1 + x 2, ω 1 + ω 2 ). (7) This shows that time-frequency shifts almost allow a group structure. Incorporating the aitional phase factor into a more extene group law leas to the so-calle Heissenberg group. For more etails about this topic, the reaer is referre to [7]. Gabor analysis eals with the problem of ecomposing an reconstructing signals accoring to a special basis system which consists of 15
16 regular time-frequency shifts of a single so-calle winow function [5, 6]. Let Λ be a time-frequency lattice, i.e., a iscrete subgroup of the timefrequency plane R 2, an let g be in L 2 (R ). Then we efine a Gabor system G(g, Λ) by G(g, Λ) = { } π(λ)g λ Λ. We associate with this Gabor system the positive operator S : f L 2 Sf = λ Λ f, π(λ)g π(λ)g. If the operator S is boune an invertible on L 2 (R ), then G(g, Λ) is calle a frame an S the associate frame operator, cf. [1]. Many stuies in Gabor analysis are evote to the frame operator [8]. In what follows we will escribe the so-calle Janssen representation of such operators. To this en we nee the notion of the ajoint lattice, i.e., Λ = { } λ R 2 π(λ)π(λ ) = π(λ )π(λ), λ Λ. In [2, 4, 11] it is shown that the frame operator S satisfies Janssen representation, S = g, π(λ )g π(λ ). (8) λ Λ At this point, the question arises if we can euce the invertibility of the operator S from the Janssen coefficients ( g, π(λ )g ). It is known from frame theory that if S is invertible, then its inverse is of the same type, that is, it also has a Janssen representation. In orer to better unerstan the main ingreients of this problem we transfer the moel to an operator algebra. To this en we restrict our 16
17 iscussion to so-calle separable lattices of the form Λ = αz βz for some fixe positive numbers α an β. An easy computation base on (7) shows that Λ = β 1 Z α 1 Z. We efine the operator algebra A as in [10] by A = { S = } a k,l π(β 1 k, α 1 l) a = (a k,l ) l 1 (Z 2 ). k,l Z The restriction to l 1 -sequences guarantees absolute convergence of the sum of time-frequency shifts. Let κ be the mapping κ : a l 1 κ(a) = Then, as alreay observe in [11], we have k,l Z a k,l π(β 1 k, α 1 l) A. κ(a)κ(b) = κ(a b) an κ(δ) = I where δ an I enote the Dirac sequence an the ientity operator, respectively. Both represent the unit element of the corresponing algebra. It follows that κ is an algebra homomorphism from (l 1 (Z 2 ), ) to A, an invertibility of an element in A can be transferre to the invertibility of the associate l 1 -sequence with respect to the twiste convolution. It is important to observe, that all the results go through also for weighte l 1 -spaces. These facts are use to esign ual Gabor winows of a special type, cf. [10]. 17
18 In the following section we give an example of how this approach can be explicitly use in Gabor analysis of one-imensional signals. Remark. The above results, with the help of metaplectic operators, carry over to the more general class of lattices, calle symplectic lattices. A lattice Λ s R 2 is calle symplectic, if one can write Λ s = DΛ where Λ is a separable lattice an D GL 2 (R). To every D GL 2 (R), there correspons a unitary operator µ(d), calle metaplectic, acting on L 2 (R ). One can show that a Gabor system on a symplectic lattice is unitary equivalent to a Gabor system on a separable lattice uner µ(d), an S Λ s g = µ(d) 1 S Λ µ(d)gµ(d). Hence, to analyze the invertibility of a frame operator S associate to the winow function g L 2 (R ) an symplectic lattice Λ s, it suffices to analyze a frame operator associate to µ(d)g an a separable lattice Λ. For more etails see [8]. 5 Application to one-imensional signals In this section, we briefly escribe how the presente inversion scheme applies to Gabor frame operators in a one-imensional setting. A more etaile iscussion also for finite imensional signals is escribe in [13]. Assume = 1. Let a be in l 1 (Z 2 ) an α, β be constants such that αβ = p/q with p, q relative prime. Set κ(a) = k,l Z a k,l π(β 1 k, α 1 l). In orer to verify if κ(a) is invertible on L 2 (R) we simply look at the 18
19 coefficient sequence a an check whether a is invertible in (l 1 (Z 2 ), ). To this en, we apply the above results an switch to the matrix A whose entries are efine by A i,j = p 1 m=0 ω mj a m,i j, with ω = e 2πiq/p. Next, we nee to show that the matrix A is invertible in (M, ). For example, we can calculate the eterminate which is a sequence in l 1 an show that it is invertible in (l 1, ). Assume that the eterminant of A is invertible. We enote its inverse by e. By Cramer s Rule, we compute the first column of the inverse matrix B of A as B k,0 = et A(0, k) e, for k = 0,..., p 1. Then p 1 b = k=0 B k,0 provies the inverse sequence of a which, in turns, gives κ(a) 1 = κ(b). Note that for p = 1, the twiste convolution turn into normal convolution an we can simply apply the stanar Fourier inversion scheme of sequences in (l 1 (Z 2 ), ) since in this case the matrix A reuces to the sequence a. Acknowlegements The authors gratefully acknowlege support from the Ollenorff Minerva Center an from the European Union s Human Potential Programme, uner the contract HPRN-CT (HASSIP). We woul also like 19
20 to thank Karlheinz Gröchenig an Yehoshua Y. Zeevi for many fruitful iscussions. References [1] O. Christensen. An Introuction to Frames an Riesz Bases. Birkhäuser, [2] I. Daubechies, H. J. Lanau, an Z. Lanau. Gabor time-frequency lattices an the Wexler-Raz Ientity. J. Four. Anal. an Appl., 1(4): , [3] P. J. Davis. Circulant Matrices. New York, AMS Chelsea Publishing, 2n eition, [4] H. G. Feichtinger an W. Kozek. Quantization of TF lattice invariant operators on elementary LCA groups. In H.G. Feichtinger an T. Strohmer, eitors, Gabor Analysis an Algorithms: Theory an Applications, pages Birkhäuser, Boston, [5] Hans G. Feichtinger an Thomas Strohmer. Gabor analysis an algorithms. Theory an applications. Boston MA: Birkhäuser, [6] Hans G. Feichtinger an Thomas Strohmer. Avances in Gabor analysis. Boston MA: Birkhäuser, [7] G. B. Follan. Harmonic analysis in phase space. Annals of Mathematics Stuies, 122. Princeton, NJ: Princeton University Press,
21 [8] K. Gröchenig. Founations of Time-Frequency Analysis. Birkhäuser, [9] K. Gröchenig an W. Kozek. Weyl-Heisenberg systems an Wiener s lemma. Unpublishe notes, [10] K. Gröchenig an M. Leinert. Wiener s Lemma for twiste convolution an Gabor frames. J. Amer. Math. Soc., 17(1):1 18, [11] A. J. E. M. Janssen. Duality an biorthogonality for Weyl- Heisenberg frames. J. Four. Anal. an Appl., 1(4): , [12] T. Werther, Y. C. Elar, an N. Subbanna. Dual Gabor frames: Theory an computational aspects. IEEE Transactions on Signal Processing, 53(11): , [13] T. Werther, E. Matusiak, Nagesh Subbanna, an Y. C. Elar. A unifie approach to ual Gabor winows. Accepte for publication in IEEE Transactions on Signal Processing, [14] M. Zibulski an Y. Y. Zeevi. Analysis of multiwinow Gabor-type schemes by frame methos. Appl. Comp. Harm. Anal., 4(2): ,
Gabor Frames. Karlheinz Gröchenig. Faculty of Mathematics, University of Vienna.
Gabor Frames Karlheinz Gröchenig Faculty of Mathematics, University of Vienna http://homepage.univie.ac.at/karlheinz.groechenig/ HIM Bonn, January 2016 Karlheinz Gröchenig (Vienna) Gabor Frames and their
More informationLinear Algebra- Review And Beyond. Lecture 3
Linear Algebra- Review An Beyon Lecture 3 This lecture gives a wie range of materials relate to matrix. Matrix is the core of linear algebra, an it s useful in many other fiels. 1 Matrix Matrix is the
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationA Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential
Avances in Applie Mathematics an Mechanics Av. Appl. Math. Mech. Vol. 1 No. 4 pp. 573-580 DOI: 10.4208/aamm.09-m0946 August 2009 A Note on Exact Solutions to Linear Differential Equations by the Matrix
More informationTHE GENUINE OMEGA-REGULAR UNITARY DUAL OF THE METAPLECTIC GROUP
THE GENUINE OMEGA-REGULAR UNITARY DUAL OF THE METAPLECTIC GROUP ALESSANDRA PANTANO, ANNEGRET PAUL, AND SUSANA A. SALAMANCA-RIBA Abstract. We classify all genuine unitary representations of the metaplectic
More informationSYMMETRIC KRONECKER PRODUCTS AND SEMICLASSICAL WAVE PACKETS
SYMMETRIC KRONECKER PRODUCTS AND SEMICLASSICAL WAVE PACKETS GEORGE A HAGEDORN AND CAROLINE LASSER Abstract We investigate the iterate Kronecker prouct of a square matrix with itself an prove an invariance
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationWitt#5: Around the integrality criterion 9.93 [version 1.1 (21 April 2013), not completed, not proofread]
Witt vectors. Part 1 Michiel Hazewinkel Sienotes by Darij Grinberg Witt#5: Aroun the integrality criterion 9.93 [version 1.1 21 April 2013, not complete, not proofrea In [1, section 9.93, Hazewinkel states
More informationCHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold
CHAPTER 1 : DIFFERENTIABLE MANIFOLDS 1.1 The efinition of a ifferentiable manifol Let M be a topological space. This means that we have a family Ω of open sets efine on M. These satisfy (1), M Ω (2) the
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationRobustness and Perturbations of Minimal Bases
Robustness an Perturbations of Minimal Bases Paul Van Dooren an Froilán M Dopico December 9, 2016 Abstract Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important
More informationSwitching Time Optimization in Discretized Hybrid Dynamical Systems
Switching Time Optimization in Discretize Hybri Dynamical Systems Kathrin Flaßkamp, To Murphey, an Sina Ober-Blöbaum Abstract Switching time optimization (STO) arises in systems that have a finite set
More informationELEC3114 Control Systems 1
ELEC34 Control Systems Linear Systems - Moelling - Some Issues Session 2, 2007 Introuction Linear systems may be represente in a number of ifferent ways. Figure shows the relationship between various representations.
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationApproximately dual frames in Hilbert spaces and applications to Gabor frames
Approximately dual frames in Hilbert spaces and applications to Gabor frames Ole Christensen and Richard S. Laugesen October 22, 200 Abstract Approximately dual frames are studied in the Hilbert space
More informationInternational Journal of Pure and Applied Mathematics Volume 35 No , ON PYTHAGOREAN QUADRUPLES Edray Goins 1, Alain Togbé 2
International Journal of Pure an Applie Mathematics Volume 35 No. 3 007, 365-374 ON PYTHAGOREAN QUADRUPLES Eray Goins 1, Alain Togbé 1 Department of Mathematics Purue University 150 North University Street,
More informationInterconnected Systems of Fliess Operators
Interconnecte Systems of Fliess Operators W. Steven Gray Yaqin Li Department of Electrical an Computer Engineering Ol Dominion University Norfolk, Virginia 23529 USA Abstract Given two analytic nonlinear
More informationDIFFERENTIAL GEOMETRY, LECTURE 15, JULY 10
DIFFERENTIAL GEOMETRY, LECTURE 15, JULY 10 5. Levi-Civita connection From now on we are intereste in connections on the tangent bunle T X of a Riemanninam manifol (X, g). Out main result will be a construction
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationSharp Thresholds. Zachary Hamaker. March 15, 2010
Sharp Threshols Zachary Hamaker March 15, 2010 Abstract The Kolmogorov Zero-One law states that for tail events on infinite-imensional probability spaces, the probability must be either zero or one. Behavior
More informationarxiv: v1 [math.co] 15 Sep 2015
Circular coloring of signe graphs Yingli Kang, Eckhar Steffen arxiv:1509.04488v1 [math.co] 15 Sep 015 Abstract Let k, ( k) be two positive integers. We generalize the well stuie notions of (k, )-colorings
More informationTHE EXPLICIT EXPRESSION OF THE DRAZIN INVERSE OF SUMS OF TWO MATRICES AND ITS APPLICATION
italian journal of pure an applie mathematics n 33 04 (45 6) 45 THE EXPLICIT EXPRESSION OF THE DRAZIN INVERSE OF SUMS OF TWO MATRICES AND ITS APPLICATION Xiaoji Liu Liang Xu College of Science Guangxi
More informationThe Generalized Incompressible Navier-Stokes Equations in Besov Spaces
Dynamics of PDE, Vol1, No4, 381-400, 2004 The Generalize Incompressible Navier-Stokes Equations in Besov Spaces Jiahong Wu Communicate by Charles Li, receive July 21, 2004 Abstract This paper is concerne
More informationMAT 545: Complex Geometry Fall 2008
MAT 545: Complex Geometry Fall 2008 Notes on Lefschetz Decomposition 1 Statement Let (M, J, ω) be a Kahler manifol. Since ω is a close 2-form, it inuces a well-efine homomorphism L: H k (M) H k+2 (M),
More informationEuler equations for multiple integrals
Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................
More informationNOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,
NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which
More information19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control
19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior
More informationA simple model for the small-strain behaviour of soils
A simple moel for the small-strain behaviour of soils José Jorge Naer Department of Structural an Geotechnical ngineering, Polytechnic School, University of São Paulo 05508-900, São Paulo, Brazil, e-mail:
More informationOn lower bounds for integration of multivariate permutation-invariant functions
arxiv:1310.3959v1 [math.na] 15 Oct 2013 On lower bouns for integration of multivariate permutation-invariant functions Markus Weimar October 16, 2013 Abstract In this note we stuy multivariate integration
More informationMultiplicative properties of sets of residues
Multiplicative properties of sets of resiues C. Pomerance Hanover an A. Schinzel Warszawa Abstract: We conjecture that for each natural number n, every set of resiues mo n of carinality at least n/2 contains
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationSimilar Operators and a Functional Calculus for the First-Order Linear Differential Operator
Avances in Applie Mathematics, 9 47 999 Article ID aama.998.067, available online at http: www.iealibrary.com on Similar Operators an a Functional Calculus for the First-Orer Linear Differential Operator
More informationEntanglement is not very useful for estimating multiple phases
PHYSICAL REVIEW A 70, 032310 (2004) Entanglement is not very useful for estimating multiple phases Manuel A. Ballester* Department of Mathematics, University of Utrecht, Box 80010, 3508 TA Utrecht, The
More information6 General properties of an autonomous system of two first order ODE
6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x
More informationON BEAUVILLE STRUCTURES FOR PSL(2, q)
ON BEAUVILLE STRUCTURES FOR PSL(, q) SHELLY GARION Abstract. We characterize Beauville surfaces of unmixe type with group either PSL(, p e ) or PGL(, p e ), thus extening previous results of Bauer, Catanese
More informationTEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE
TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS Yannick DEVILLE Université Paul Sabatier Laboratoire Acoustique, Métrologie, Instrumentation Bât. 3RB2, 8 Route e Narbonne,
More informationTOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH
English NUMERICAL MATHEMATICS Vol14, No1 Series A Journal of Chinese Universities Feb 2005 TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH He Ming( Λ) Michael K Ng(Ξ ) Abstract We
More informationGeneralized shift-invariant systems and frames for subspaces
The Journal of Fourier Analysis and Applications Generalized shift-invariant systems and frames for subspaces Ole Christensen and Yonina C. Eldar ABSTRACT. Let T k denote translation by k Z d. Given countable
More informationGABOR FRAMES AND OPERATOR ALGEBRAS
GABOR FRAMES AND OPERATOR ALGEBRAS J-P Gabardo a, Deguang Han a, David R Larson b a Dept of Math & Statistics, McMaster University, Hamilton, Canada b Dept of Mathematics, Texas A&M University, College
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationDiscrete Mathematics
Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner
More informationPseudo-Free Families of Finite Computational Elementary Abelian p-groups
Pseuo-Free Families of Finite Computational Elementary Abelian p-groups Mikhail Anokhin Information Security Institute, Lomonosov University, Moscow, Russia anokhin@mccme.ru Abstract We initiate the stuy
More informationDiagonalization of Matrices Dr. E. Jacobs
Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationCombinatorica 9(1)(1989) A New Lower Bound for Snake-in-the-Box Codes. Jerzy Wojciechowski. AMS subject classification 1980: 05 C 35, 94 B 25
Combinatorica 9(1)(1989)91 99 A New Lower Boun for Snake-in-the-Box Coes Jerzy Wojciechowski Department of Pure Mathematics an Mathematical Statistics, University of Cambrige, 16 Mill Lane, Cambrige, CB2
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationLOCAL WELL-POSEDNESS OF NONLINEAR DISPERSIVE EQUATIONS ON MODULATION SPACES
LOCAL WELL-POSEDNESS OF NONLINEAR DISPERSIVE EQUATIONS ON MODULATION SPACES ÁRPÁD BÉNYI AND KASSO A. OKOUDJOU Abstract. By using tools of time-frequency analysis, we obtain some improve local well-poseness
More informationMultiple Rank-1 Lattices as Sampling Schemes for Multivariate Trigonometric Polynomials
Multiple Rank-1 Lattices as Sampling Schemes for Multivariate Trigonometric Polynomials Lutz Kämmerer June 23, 2015 We present a new sampling metho that allows the unique reconstruction of (sparse) multivariate
More informationON TAUBERIAN CONDITIONS FOR (C, 1) SUMMABILITY OF INTEGRALS
REVISTA DE LA UNIÓN MATEMÁTICA ARGENTINA Vol. 54, No. 2, 213, Pages 59 65 Publishe online: December 8, 213 ON TAUBERIAN CONDITIONS FOR C, 1 SUMMABILITY OF INTEGRALS Abstract. We investigate some Tauberian
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More information2Algebraic ONLINE PAGE PROOFS. foundations
Algebraic founations. Kick off with CAS. Algebraic skills.3 Pascal s triangle an binomial expansions.4 The binomial theorem.5 Sets of real numbers.6 Surs.7 Review . Kick off with CAS Playing lotto Using
More informationBalancing Expected and Worst-Case Utility in Contracting Models with Asymmetric Information and Pooling
Balancing Expecte an Worst-Case Utility in Contracting Moels with Asymmetric Information an Pooling R.B.O. erkkamp & W. van en Heuvel & A.P.M. Wagelmans Econometric Institute Report EI2018-01 9th January
More informationTRAJECTORY TRACKING FOR FULLY ACTUATED MECHANICAL SYSTEMS
TRAJECTORY TRACKING FOR FULLY ACTUATED MECHANICAL SYSTEMS Francesco Bullo Richar M. Murray Control an Dynamical Systems California Institute of Technology Pasaena, CA 91125 Fax : + 1-818-796-8914 email
More informationInterpolated Rigid-Body Motions and Robotics
Interpolate Rigi-Boy Motions an Robotics J.M. Selig Faculty of Business, Computing an Info. Management. Lonon South Bank University, Lonon SE AA, U.K. seligjm@lsbu.ac.uk Yaunquing Wu Dept. Mechanical Engineering.
More informationSystems & Control Letters
Systems & ontrol Letters ( ) ontents lists available at ScienceDirect Systems & ontrol Letters journal homepage: www.elsevier.com/locate/sysconle A converse to the eterministic separation principle Jochen
More information'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21
Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting
More informationQuantum mechanical approaches to the virial
Quantum mechanical approaches to the virial S.LeBohec Department of Physics an Astronomy, University of Utah, Salt Lae City, UT 84112, USA Date: June 30 th 2015 In this note, we approach the virial from
More informationarxiv: v1 [math.co] 31 Mar 2008
On the maximum size of a (k,l)-sum-free subset of an abelian group arxiv:080386v1 [mathco] 31 Mar 2008 Béla Bajnok Department of Mathematics, Gettysburg College Gettysburg, PA 17325-186 USA E-mail: bbajnok@gettysburgeu
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationPermanent vs. Determinant
Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an
More informationSome properties of random staircase tableaux
Some properties of ranom staircase tableaux Sanrine Dasse Hartaut Pawe l Hitczenko Downloae /4/7 to 744940 Reistribution subject to SIAM license or copyright; see http://wwwsiamorg/journals/ojsaphp Abstract
More informationOn the number of isolated eigenvalues of a pair of particles in a quantum wire
On the number of isolate eigenvalues of a pair of particles in a quantum wire arxiv:1812.11804v1 [math-ph] 31 Dec 2018 Joachim Kerner 1 Department of Mathematics an Computer Science FernUniversität in
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationNotes on Lie Groups, Lie algebras, and the Exponentiation Map Mitchell Faulk
Notes on Lie Groups, Lie algebras, an the Exponentiation Map Mitchell Faulk 1. Preliminaries. In these notes, we concern ourselves with special objects calle matrix Lie groups an their corresponing Lie
More informationFrame Diagonalization of Matrices
Frame Diagonalization of Matrices Fumiko Futamura Mathematics and Computer Science Department Southwestern University 00 E University Ave Georgetown, Texas 78626 U.S.A. Phone: + (52) 863-98 Fax: + (52)
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationLaplacian Cooperative Attitude Control of Multiple Rigid Bodies
Laplacian Cooperative Attitue Control of Multiple Rigi Boies Dimos V. Dimarogonas, Panagiotis Tsiotras an Kostas J. Kyriakopoulos Abstract Motivate by the fact that linear controllers can stabilize the
More informationWe G Model Reduction Approaches for Solution of Wave Equations for Multiple Frequencies
We G15 5 Moel Reuction Approaches for Solution of Wave Equations for Multiple Frequencies M.Y. Zaslavsky (Schlumberger-Doll Research Center), R.F. Remis* (Delft University) & V.L. Druskin (Schlumberger-Doll
More informationWiener amalgam spaces for the fundamental identity of Gabor analysis
Collect. Math. (2006), 233 253 Proceedings of the 7th International Conference on Harmonic Analysis and Partial Differential Equations El Escorial, Madrid (Spain), June 21-25, 2004 c 2006 Universitat de
More informationTractability results for weighted Banach spaces of smooth functions
Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March
More informationMultiplicative properties of sets of residues
Multiplicative properties of sets of resiues C. Pomerance Hanover an A. Schinzel Warszawa Abstract: Given a natural number n, we ask whether every set of resiues mo n of carinality at least n/2 contains
More informationu!i = a T u = 0. Then S satisfies
Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace
More informationResistant Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
Resistant Polynomials an Stronger Lower Bouns for Depth-Three Arithmetical Formulas Maurice J. Jansen University at Buffalo Kenneth W.Regan University at Buffalo Abstract We erive quaratic lower bouns
More informationFree rotation of a rigid body 1 D. E. Soper 2 University of Oregon Physics 611, Theoretical Mechanics 5 November 2012
Free rotation of a rigi boy 1 D. E. Soper 2 University of Oregon Physics 611, Theoretical Mechanics 5 November 2012 1 Introuction In this section, we escribe the motion of a rigi boy that is free to rotate
More informationMultiplicative properties of sets of residues
Multiplicative properties of sets of resiues C. Pomerance Hanover an A. Schinzel Warszawa Abstract: We conjecture that for each natural number n, every set of resiues mo n of carinality at least n/2 contains
More informationRank, Trace, Determinant, Transpose an Inverse of a Matrix Let A be an n n square matrix: A = a11 a1 a1n a1 a an a n1 a n a nn nn where is the jth col
Review of Linear Algebra { E18 Hanout Vectors an Their Inner Proucts Let X an Y be two vectors: an Their inner prouct is ene as X =[x1; ;x n ] T Y =[y1; ;y n ] T (X; Y ) = X T Y = x k y k k=1 where T an
More informationDiscrete Operators in Canonical Domains
Discrete Operators in Canonical Domains VLADIMIR VASILYEV Belgoro National Research University Chair of Differential Equations Stuencheskaya 14/1, 308007 Belgoro RUSSIA vlaimir.b.vasilyev@gmail.com Abstract:
More informationarxiv: v1 [physics.class-ph] 20 Dec 2017
arxiv:1712.07328v1 [physics.class-ph] 20 Dec 2017 Demystifying the constancy of the Ermakov-Lewis invariant for a time epenent oscillator T. Pamanabhan IUCAA, Post Bag 4, Ganeshkhin, Pune - 411 007, Inia.
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More informationCounting Lattice Points in Polytopes: The Ehrhart Theory
3 Counting Lattice Points in Polytopes: The Ehrhart Theory Ubi materia, ibi geometria. Johannes Kepler (1571 1630) Given the profusion of examples that gave rise to the polynomial behavior of the integer-point
More informationLecture 6: Calculus. In Song Kim. September 7, 2011
Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear
More informationApproximate reduction of dynamic systems
Systems & Control Letters 57 2008 538 545 www.elsevier.com/locate/sysconle Approximate reuction of ynamic systems Paulo Tabuaa a,, Aaron D. Ames b, Agung Julius c, George J. Pappas c a Department of Electrical
More informationThe canonical controllers and regular interconnection
Systems & Control Letters ( www.elsevier.com/locate/sysconle The canonical controllers an regular interconnection A.A. Julius a,, J.C. Willems b, M.N. Belur c, H.L. Trentelman a Department of Applie Mathematics,
More informationOptimal CDMA Signatures: A Finite-Step Approach
Optimal CDMA Signatures: A Finite-Step Approach Joel A. Tropp Inst. for Comp. Engr. an Sci. (ICES) 1 University Station C000 Austin, TX 7871 jtropp@ices.utexas.eu Inerjit. S. Dhillon Dept. of Comp. Sci.
More informationHomotopy colimits in model categories. Marc Stephan
Homotopy colimits in moel categories Marc Stephan July 13, 2009 1 Introuction In [1], Dwyer an Spalinski construct the so-calle homotopy pushout functor, motivate by the following observation. In the category
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationarxiv: v4 [cs.ds] 7 Mar 2014
Analysis of Agglomerative Clustering Marcel R. Ackermann Johannes Blömer Daniel Kuntze Christian Sohler arxiv:101.697v [cs.ds] 7 Mar 01 Abstract The iameter k-clustering problem is the problem of partitioning
More information1 Heisenberg Representation
1 Heisenberg Representation What we have been ealing with so far is calle the Schröinger representation. In this representation, operators are constants an all the time epenence is carrie by the states.
More informationOn Characterizing the Delay-Performance of Wireless Scheduling Algorithms
On Characterizing the Delay-Performance of Wireless Scheuling Algorithms Xiaojun Lin Center for Wireless Systems an Applications School of Electrical an Computer Engineering, Purue University West Lafayette,
More informationResistant Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
Resistant Polynomials an Stronger Lower Bouns for Depth-Three Arithmetical Formulas Maurice J. Jansen an Kenneth W.Regan University at Buffalo (SUNY) Abstract. We erive quaratic lower bouns on the -complexity
More informationProblem Sheet 2: Eigenvalues and eigenvectors and their use in solving linear ODEs
Problem Sheet 2: Eigenvalues an eigenvectors an their use in solving linear ODEs If you fin any typos/errors in this problem sheet please email jk28@icacuk The material in this problem sheet is not examinable
More informationPerfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs
Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite
More informationAtomic decompositions of square-integrable functions
Atomic decompositions of square-integrable functions Jordy van Velthoven Abstract This report serves as a survey for the discrete expansion of square-integrable functions of one real variable on an interval
More informationPhysics 5153 Classical Mechanics. The Virial Theorem and The Poisson Bracket-1
Physics 5153 Classical Mechanics The Virial Theorem an The Poisson Bracket 1 Introuction In this lecture we will consier two applications of the Hamiltonian. The first, the Virial Theorem, applies to systems
More informationACTIONS IN MODIFIED CATEGORIES OF INTEREST WITH APPLICATION TO CROSSED MODULES Dedicated to Teimuraz Pirashvili on his 60th birthday
Theory an Applications of Categories, Vol. 30, No. 25, 2015, pp. 882 908. ACTIONS IN MODIFIED CATEGORIES OF INTEREST WITH APPLICATION TO CROSSED MODULES Deicate to Teimuraz Pirashvili on his 60th birthay
More informationarxiv: v1 [math.st] 20 Jun 2017
On the joint asymptotic istribution of the restricte arxiv:1706.06632v1 [math.st] 20 Jun 2017 estimators in multivariate regression moel Sévérien Nkurunziza an Youzhi Yu Abstract The main Theorem of Jain
More informationOptimal Control of Spatially Distributed Systems
Optimal Control of Spatially Distribute Systems Naer Motee an Ali Jababaie Abstract In this paper, we stuy the structural properties of optimal control of spatially istribute systems. Such systems consist
More informationJointly continuous distributions and the multivariate Normal
Jointly continuous istributions an the multivariate Normal Márton alázs an álint Tóth October 3, 04 This little write-up is part of important founations of probability that were left out of the unit Probability
More information