TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH
|
|
- Lauren Green
- 6 years ago
- Views:
Transcription
1 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 present a sufficient an necessary conition for a so-calle Cn pattern to have positive semiefinite (PSD) completion Since the graph of the Cn pattern is compose by some simple cycles, our results exten those given in [1] for a simple cycle We also erive some results for a partial Toeplitz PSD matrix specifying the Cn pattern to have PSD completion an Toeplitz PSD completion Key wors Partial matrix, Toeplitz matrix, completion problem, Cn pattern AMS(2000)subject classifications 15A24, 65F10, 82C70 1 Introuction A partial matrix is a matrix in which some entries are specifie, while the remains entries are free to be chosen(from a certain set) A completion of a partial matrix is the conventional matrix resulting from a particular choice of values for the unspecifie entries For most of matrix completion problems there are some obvious conitions that must be satisfie for a completion of a certain class to exist For example, for real symmetric positive semiefinite (PSD) completions, all completely specifie submatrices must be symmetric PSD A partial matrix which satisfies such a conition is calle a partial PSD matrix In this paper another class of matrices which we concern is Toeplitz matrix It is nown that an n n matrix A =(a ij ) is calle a symmetric Toeplitz matrix if a i,j = r i j for all i, j =1, 2,,n So a partial symmetric Toeplitz matrix is a partial symmetric matrix an if an entry in position (i, j) is specifie then all entries in positions (i + l, j + l) (mo n) are also specifie an these (specifie) entries are equal Other Research supporte in part by National Natural Science Founation of China No Research supporte in part by RGC Grant Nos 7132/00P an 7130/02P, an HKU CRCG Grant Nos , an Receive: Sep 16, 2004
2 68 He Ming Michael K Ng types of partial matrices are efine similarly, see [4] A pattern for n n matrices is a list of positions of an n n matrix, that is, a subset of {1, 2,, n} {1, 2,, n} A partial matrix specifies the pattern if its specifie entries are exactly those liste in the pattern A pattern Q is calle symmetric if (i, j) Q implies (j, i) Q We assume throughout this paper that all the patterns we iscuss are symmetric an inclue all iagonal positions, an when we efine a pattern or calculate the number of the specifie entries of a pattern, we shall ignore iagonal an symmetric positions of the pattern (eg, Definition 1 below) an the entries in the positions For a certain class of matrices, one important area of research is to ecie for which patterns of specifie entries all partial matrices in the class are completable to the class of matrices Among the types of matrix completion problems that have been stuie are completion to positive efinite (semiefinite) matrices [2],[7], to M-matrices an inverse M-matrices [5], to P- matrices an P 0 matrices[6],[4] an to contractions [8], etc For the positive efinite completion problem, a solution was given by Grone, Johnson, Sa, an Wolowicz in [2] For the partial positive efinite Toeplitz completion problem, an interesting open problem was presente in [7] Now we give efinition of the Cn consier pattern an escribe the completion problems we shall Definition 1 Let n/2 > 1, the symmetric pattern Q = {(1,+1), (2,+2),,(n, n), (n +1, 1),,(n, )} (1) is calle a Cn pattern A Toeplitz C n pattern is a C n pattern with a restriction that the partial matrix specifying the pattern is a partial Toeplitz matrix Remar 1 In the efinition, replacing by n gives the same pattern So this is why we call it Cn pattern It is trivial to show that when n is even an = n, the pattern has PSD completion So in the following, we always assume that <n Remar 2 If we number the iagonals for an n n symmetric Toeplitz matrix in the following way: The main iagonal is given the number 0 an then the iagonals are numbere in increasing orer to the last, which becomes the (n 1)th, one Then the (Toeplitz) Cn pattern is, in fact, the th an (n )th iagonal In terms of the efinition, our problems are as follows Problem 1 Whether oes the C n pattern have a PSD completion? Without loss of generality, associate with a normalize of the ata (see [1]), we assume
3 Toeplitz an Positive Semiefinite Completion Problem For Cycle Graph 69 that the partial PSD matrix specifying the Cn pattern is of the form: 1 cosθ 1 cos θ n +1? 1 cosθ 2? cos θ 1 1? cos θn C = cos θ 2? 1 cos θ n +1? cos θn? cosθ n cos θ n 1, (2) where 0 θ i π, the?s inicate unspecifie entries Thus Problem 1 can be restate as: Problem 1 When oes the partial PSD matrix (2) amit a PSD completion? Next problem is about Toeplitz C n pattern an so more special than the previous one Problem 2 Whether oes a Toeplitz C n pattern have a Toeplitz PSD completion? Lie Problem 1, Problem 2 can be restate as: Problem 2 When oes the partial Toeplitz PSD matrix 1 cosθ cos φ? 1 cosθ? cos θ 1? cos φ T = cos θ? 1 cos φ? cos θ? cosφ cos θ 1 (3) amit a Toeplitz PSD completion? Here we assume that in the partial matrix T, 0 θ π, 0 φ π an cos θ, cosφ lies in the th, the (n )th iagonal, respectively In the case = 1, Problem 1 or Problem 1 has been resolve by W Barrett, C R Johnson an P Tarazaga in [1] (see Theorem 2) A partial answer to Problem 2 or 2 in the case =1 was also given by them (see Theorem 9 below) Our main contribution in this note is to exten their results to arbitary (n/2 > 1) for Problem 1 (see next section) an give some results for Problem 2 (see section 3) 2 Completion of Cn pattern Graphs an igraphs are very effective to stuy matrix completion problems [3] Since the Cn pattern is a symmetric pattern, we shall use unirecte graph to stuy its completion problem Let Q be a symmetric pattern for n n matrices, the graph G=(V,E) of Q is efine to have noes set V = N {1, 2,,n} an ege (i, j) E if an only if (i, j) Q
4 70 He Ming Michael K Ng A path in a graph G =(V,E) is a sequence of noes v 1,v 2,,v,v +1 in V such that for i =1, 2,,,(v i,v i+1 ) E an all noes are istinct except possibly v 1 = v +1 Ifv 1 = v +1 in the path v 1,v 2,,v,v +1, then the path forms a simple circle, which will be enote by {v 1,v 2,,v +1 (= v 1 )}, its length is Accoring to the efinition, the graph of the Cn 1 pattern is a simple circle of length n, for whose PSD completion problem the following result was given in [1] Theorem 2 Let n 4anN = {1, 2,, n}, 0 θ 1,θ 2,, θ n π, then the matrix 1 cosθ 1 cos θ n cos θ 1 1 cosθ 2? C = cos θ 2 1 (4)? cos θn 1 cos θ n cos θ n 1 1 has a PSD completion if an only if for each S N with S o, θ i ( S 1)π + θ i (5) i S i N\S A graph is choral if it has no minimal simple cycle of length four or more The following result is well-nown[2] Theorem 3 Every partial PSD matrix specifying a pattern Q has a PSD completion if an only if the graph of Q is choral A graph is connecte if there is a path from any noe to any other noe; otherwise it is isconnecte A subgraph of the graph G =(V G,E G ) is a graph H =(V H,E H ), where V H V G an E H E G an that (u, v) E H requires u, v V H since H is a graph A component of a graph is maximal connecte subgraph The graph G =(V G,E G ) is isomorphic to the graph H =(V H,E H ) by isomorphism φ if φ is a one-to-one map from V G onto V H an (u, v) E G if an only if (φ(u),φ(v)) E H Relabeling the noes of a graph iagram correspons to perform a graph isomorphism Since the class of PSD matrices is close uner permutation similarity, we are free to relabel graphs as esire an we have Lemma 4 Let Q be a pattern an G its graph If every component of G is isomorphic to a graph of a pattern an the pattern has PSD completion, then Q has PSD completion Proof The proof of the lemma is similar to that of Lemma 34 of [4] an is omitte here In the following, we let gc(n, ) enote the greatest common ivisor of the integers n an Let x = x (mo n), =gc(n, ) ant = n Now we escribe the graph of the C n pattern Lemam 5 Every component of the graph of Cn pattern is isomorphic to a simple circle
5 Toeplitz an Positive Semiefinite Completion Problem For Cycle Graph 71 of length t Proof Let Q be the Cn pattern efine in (1) an G =(N,E) its graph Using the notation of x, the ege set can be written as E = {(i +(j 1), i + j) 1 i ;1 j t} By noting that i + t = i, it is not ifficult to prove that the graph G is compose by the following inepenent simple cycles of length t: {1, 1+, 1+2, 1+(t 1), 1+t} {2, 2+, 2+2, 2+(t 1), 2+t} {3, 3+, 3+2, 3+(t 1), 3+t},,,, {, +, +2, +(t 1), + t} The proof is complete Remar 3 The lemma shows that the graph of the Cn pattern is a cycle graph[9], that is, it is compose by some simple cycles But only one simple cycle also is possible even for >1 if n an have no common ivisor larger than an equal to 2 In this case, t = n an (2) is permutation similar to (4) For example, let n =5, = 2, then it is easy to verify that the following two partial PSD matrices are permutation similar: 1? c 1 c 4?? 1? c 2 c 5 c 1? 1? c 3 c 4 c 2? 1?? c 5 c 3? 1 1 c 1?? c 4 c 1 1 c 3??? c 3 1 c 5??? c 5 1 c 2 c 4?? c 2 1, here we enote cosθ i by c i 1 By using Lemma 4 an 5, we easily erive the following results for Problem 1 an Problem Theorem 6 PSD completion Theorem 7 The C n pattern has a PSD completion if an only if the C 1 n pattern has a The partial PSD matrix (2) is permutation similiar to the partial PSD matrix:
6 72 He Ming Michael K Ng C = C 1 C 2 C,where C i = 1 cosθ i cos θ i+(t 1) cos θ i 1 cosθ i+? cos θ i+ 1? cos θi+(t 2) cos θ i+(t 1) cos θ i+(t 2) 1 (6) an all entries outsie the iagonal blocs of C are unspecifie Thus the partial PSD matrix C of (2) can be complete to a PSD matrix if an only if the partial PSD matrix C can It is easy to complete C ( then complete C of (2) to a PSD martrix: complete every C i to a PSD matrix by using the metho given in [1], an then set all (unspecifie) entries outsie the iagonal blocs of C to zero On the other han, if the partial PSD matrix C of (2) has PSD completion, then C an so every C i of(6)musthaveapsd completion too So for Problem 1, the following solution is given by applying Theorem 7 an Theorem 2 Theorem 8 Let n 4, 1 <n/2, = gc(n, ) ant = n/ Thenwehave a) If t = 3, then the partial PSD matrix (2) has a PSD completion b) If t 4, then the partial PSD matrix (2) has a PSD completion if an only if for each S i N i {i, i +, i +2,, i +(t 1)} with S i o, θ j ( S i 1)π + θ j, (7) j S i j N i\s i i =1, 2,, Proof to 3 From the assumption of < n/2, we now that t is an integer larger than or equal When t = 3, Lemma 5 shows that the graph of the Cn pattern is choral ( simple cycles of length 3) So C has a PSD completion by Theorem 3, a) is prove When t 4, applying Theorem 2 to each C i of (6), b) is obtaine 3 Completion of Toeplitz Cn Pattern Now we consier Problem 2 or 2 : Toeplitz PSD completion problem for the Toeplitz Cn pattern, which is more ifficult than non-toeplitz completion problem We shall see that Lemma 5 is not irectly applicable to the problem [1] has not solve Problem 2 for the case =1an only presente a result for non-toeplitz PSD completion as follows
7 Toeplitz an Positive Semiefinite Completion Problem For Cycle Graph 73 Theorem 9 [1] Let C be an n n matrix, if n 4anθ, φ [0,π], then C = 1 cosθ cos φ cos θ 1 cosθ? cos θ 1? cos θ cos φ cos θ 1 (8) has PSD completion if an only if φ (n 1)θ (n 2)π + φ, n is even; (9) φ (n 1)θ (n 1)π φ, n is o (10) The following result generalizes the theorem Theorem 10 Let n 4, 1 <n/2, = gc(n, ) ant = n/ Thenwehave a) If t = 3, then the partial Toeplitz PSD matrix (3) has a PSD completion b) If t 4, then the partial Toeplitz PSD matrix (3) has a PSD completion if an only if : 1) when n is o an is even, (n )θ (n )π + φ (2n 2)π (n )θ (11) 2) when n is even an is o, φ ( )π +(n )θ (n + 2)π φ (12) 3) when both n an are o, (n )θ (n )π + φ (n 2)π +(n )θ (13) Proof a) is obvious from the proof of Theorem 8 We prove b) by applications of Theorem 7anTheorem8 First, note that it is impossible that both n an are even, since =gc(n, ) Seconly, we now from Theorem 7 that T is permutation similar to T = C 1 C 2 C where C i is efine in (6), but θ j is θ or φ an each C i contains n cos θ an cos φ Thus C i is generally not a partial Toeplitz matrix, so it is Theorem 8 other than Theorem 9 that is applie in the following proof T has a PSD completion if an only if every C i has In fact, all C i (i =1, 2,,)havethe same form So we only nee to consier the PSD completion of one C i
8 74 He Ming Michael K Ng It is obvious that the inequality (7) hols automatically if θ or φ occurs on both sies of (7), since θ π ( φ π ) So we only nee to consier the following two cases: one case is that t is o an all θ an φ appear on the left sie of the inequality (7) The another case is that all n θ just appears on one sie of (7), all φ appears in the other sie of (7) Thus we have 1) When n is o, is even, we only nee to consier S i, in Theorem 8, such that S i = n an S i = t The require inequalities are (n ) (n ) θ ( 1)π + (n ) φ an θ + φ (n 1)π (14) 2) When n is even, is o, we only nee to consier S i such that S i = an S i = t The require inequalities are ( n )φ (n 1)π + n θ an (n ) θ + φ (n 1)π (15) 3) When both n S i = The require inequalities are an are o, we have to consier S i such that S i = n an (n ) (n ) θ ( 1)π + φ an (n )φ (n 1)π + n θ (16) We get (11), (12) an (13) from (14), (15) an (16), respectively The theorem is prove Corollary 11 When θ = φ, ift is three or even, then the partial Toeplitz PSD matrix (3) has a PSD completion; if t is o larger than three, then the partial Toeplitz PSD matrix (3) has a PSD completion if an only if θ n n π or cos θ cos π (17) n Proof We o not nee to prove the case t 3 When t is even, both n an are o n By applying 3) of Theorem 10 an noting that, the inequalities (13) hol automatically When t is o larger than three, applying 1) an 2) of Theorem 10, we fin the require inequality only is (17) By using a similar proof, we get another interesting result Corollary 12 If t 4, θ = π φ or cos θ = cos φ, then the partial Toeplitz PSD matrix (3) has a PSD completion if an only if 1) when n is o an is even, θ n n π or cos θ cos n π
9 Toeplitz an Positive Semiefinite Completion Problem For Cycle Graph 75 2) when n 3) when both n is even an is o, θ n π or cos θ cos n π an are o, n π θ n n π or cos n cos θ cos n π In terms of the two corollaries, the two partial Toeplitz PSD matrices 1? 1 1? 1? 1 1?? 1? 1 1? 1? 1 1 1? 1? 1 an 1? 1? 1 1 1? 1? 1 1? 1?? 1 1? 1? 1 1? 1 have PSD completions, but the two partial Toeplitz PSD matrices 1? 1 1?? 1? 1 1 1? 1? 1 an 1 1? 1?? 1 1? 1 have no PSD completions 1? 1 1?? 1? 1 1 1? 1? 1 1 1? 1?? 1 1? 1 Now we turn to Problem 2 an iscuss the case = 1 first For notation convenience an obvious reason, in the following by To(a 1,a 2,,a n ) we shall enote a symmetric Toeplitz matrix whose first row is (a 1,a 2,,a n ) The partial Toeplitz PSD matrix (8) can be written as To(1,cosθ,?,,?,cosφ) Theorem 13 The partial Toeplitz PSD matrix (8) has a Toeplitz PSD completion if 1 cos φ cos(n 1)θ cos θ an 0 1 (18) n 1 cos θ cos(n 1)θ or if or if cos θ 1 n 1 an 0 cos φ cos(n 1)θ ( 1) n 1 (19) cos θ cos(n 1)θ 1 n 1 cos θ 1 n 1 an { 0 cos θ cos φ 2cosθ 1, if n is o, cos φ =cosθ, if n is even (20) Proof Define three symmetric Toeplitz matrices: B = To(1, cos θ, cos 2θ,,cos(n 1)θ), (21) E = To(1, cos θ, cos θ,,cos θ), (22) an F = To(1, cos θ, cos θ,,( 1) n cos θ) (23) We first prove that B is a PSD matrix, E is positive semiefinite if cos θ 1 n 1,anF is positive semiefinite if cos θ 1 n 1
10 76 He Ming Michael K Ng In fact, B is positive semiefinite, since 1 0 ( cos θ sin θ 1 cosθ cos 2θ cos(n 1)θ B = cos 2θ sin 2θ 0 sinθ sin 2θ sin(n 1)θ cos(n 1)θ sin(n 1)θ E is positive semiefinite if cos θ 1 n 1, since it can be written as E =(1 cos θ)i n + (cos θ)ee T, where I n is n n ientity matrix an e =(1, 1,,1) T Thus it is easy to verify that E is symmetric an has n-1 eigenvalues 1 cosθ an one eigenvalue 1 + (n 1)cosθ all eigenvalues of E are nonnegative uner the assumption Similarly, F is positive semiefinite if cosθ 1, since it has n-1 eigenvalues 1 + cosθ an one eigenvalue 1 (n 1)cosθ n 1 Now we prove that (8) has a Toeplitz PSD completion if (18) hols Define T t =(1 t)b+te, then T t is a Toeplitz PSD matrix for any t [0, 1] if cos θ 1, since it is the sum of two n 1 Toeplitz PSD matrices: (1 t)b an te cos φ cos(n 1)θ Let t 0 = cos θ cos(n 1)θ,then0 t 0 1 by the assumption (18) an cos φ =(1 t 0 )cos(n 1)θ + t 0 cos θ Thus T t0 = To(1, cos θ, (1 t 0 )cos2θ + t 0 cos θ,,(1 t 0 )cos(n 2)θ + t 0 cos θ, cos φ) is a Toeplitz PSD completion of (8) ) Similarly, if we efine T t completion if (19) hols = (1 t)b + tf, we can prove that (8) has a Toeplitz PSD Finally, we prove that (8) has a Toeplitz PSD completion if (20) hols Now we efine T t =(1 t)e + tf,thent t is a Toeplitz PSD matrix for any t [0, 1] if 1 n 1 cos θ 1 n 1 Note now that T t = To(1, cos θ, (1 2t)cosθ,,[1 (1 ( 1) n )t]cosθ) When n is even, it is necessary that cos φ =cosθ in orer that T t is a Toeplitz PSD completion cos θ cos φ of (8) When n is o, let t 0 =,then0 t 0 1 by the assumption (20) an 2cosθ cos φ =(1 2t 0 )cosθ Therefore T t0 is a Toeplitz PSD completion of (8) Now we give a result for Problem 2 : Theorem 14 The partial Toeplitz PSD matrix (3) has a Toeplitz PSD completion if 1 n 1 n cos φ cos cos θ an 0 θ cos θ cos n 1 (24) θ or if when is o, cos θ 1 n 1 an 0 cos φ cos n θ ( 1) n +1 cos θ cos n 1 (25) θ
11 Toeplitz an Positive Semiefinite Completion Problem For Cycle Graph 77 when is even, or if when is o, 1 n 1 cos θ an 0 cos φ cos n θ ( 1) n cos θ cos n 1 (26) θ when is even, 1 n 1 cos θ 1 n 1 an { 0 cos θ cos φ 2cosθ 1, if n is even, cos φ = cosθ, if n is o (27) 1 n 1 cos θ an { 0 cos θ cos φ 2cosθ 1, if n is o, cos φ =cosθ, if n is even (28) Proof To prove the theorem, we nee to efine two more symmetric Toeplitz matrices except E, F in (22),(23) B = To(1, cos α, cos 2α,,cos(n 1)α), (29) here α = θ an F = To(1, cos θ, cos θ,,( 1) n 1 cos θ) (30) 1 B is clearly positive semiefinite F is positive semiefinite if cos θ, since it has n-1 n 1 eigenvalues 1 cos θ an one eigenvalue 1 + (n 1) cos θ Similar to the proof of Theorem 13, efine T t to be one of the following matrices: 1) (1 t) B + te, 2) (1 t) B + tf when is o, (1 t) B + t F when is even, 3) (1 t)e + tf when is o, (1 t)e + t F when is even We can complete the proof of the theorem From Theorem 14, we easily get Corollary 15 When θ = φ, the partial Toeplitz PSD matrix (3) has a Toeplitz PSD completion if cos θ 1 1 or if n is even, is o an cos θ n 1 n 1 When θ = π φ an n is o, the partial Toeplitz PSD matrix (3) has a Toeplitz PSD completion if is o an cosθ 1 1,orif is even an cos θ n 1 n 1 From the proof of Theorem 14, we can see that it is not necessary to connect (n )th iagonal to th iagonal, so the result of Theorem 14 can easily be extene to the following more general pattern: Q1 ={(1,+1), (2,+2),,(n, n), (l +1, 1),,(n, n l)},
12 78 He Ming Michael K Ng where 1 <l n 1 In fact, the pattern just is two ifferent iagonals: the th an the lth iagonal A final remar We have trie many numerical examples but faile to fin a partial Toeplitz PSD matrix specifying the C n pattern which has a PSD completion but no Toeplitz PSD completion This mae us to believe the following is true: Conjecture The partial Toeplitz PSD matrix (3) that has a PSD completion has a Toeplitz PSD completion References 1 Barrett W, Johnson C R, Tarazaga P The real positive efinite completion problem for a simple cycle Linear Algebra Appl, 1993,192: Grone R, Johnson C R, Sa E, Wolowicz H Positive efinite completions of partial Hermitian matrices Linear Algebra Appl, 1984,24: Hogben L Graph theoretic mathos for matrix completion problems Linear Algebra Appl, 2001,328: Hogben L Matrix completion problem for pairs of relate classes of matrices Linear Algebra Appl, 2003,373: Johnson C R, Smith R L The completion problem for M-matrices an inverse M-matrices Linear Algebra Appl, 1996, : Johnson C R, Kroschel B K The combinatorially symmetric P -matrix completion problem Electronic J Linear Algebra, 1996, 1: Johnson C R Matrix completions problem: A survey, in Matrix Theory an Applications Proceeing of Symposia of Applie Mathematics, Vol 40, C R Johnson, e, American Mathematical Society, Provience, RI, 1990, 40: Neval, G On the completion of partial given triangular Toeplitz matrices to contractions SIAM J Matrix Anal Appl, 1993,14: Yong X R, Acenjian T The numbers of spanning trees of cubic cycle CN 3 an quaruple cycle CN 4 Discrete Math, 1997, 169: He Ming Department of Information an Computational Mathematics, Xiamen University, Xiamen , PRC MichaelKNg Hongong Department of Mathematics, University of Hong Kong, Pofulam Roa,
u!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 informationTwo formulas for the Euler ϕ-function
Two formulas for the Euler ϕ-function Robert Frieman A multiplication formula for ϕ(n) The first formula we want to prove is the following: Theorem 1. If n 1 an n 2 are relatively prime positive integers,
More informationA Note on Modular Partitions and Necklaces
A Note on Moular Partitions an Neclaces N. J. A. Sloane, Rutgers University an The OEIS Founation Inc. South Aelaie Avenue, Highlan Par, NJ 08904, USA. Email: njasloane@gmail.com May 6, 204 Abstract Following
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 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 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 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 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 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 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 informationRelationships between the Completion Problems for Various Classes of Matrices
Relationships between the Completion Problems for Various Classes of Matrices Leslie Hogben* 1 Introduction A partial matrix is a matrix in which some entries are specified and others are not (all entries
More information7.1 Support Vector Machine
67577 Intro. to Machine Learning Fall semester, 006/7 Lecture 7: Support Vector Machines an Kernel Functions II Lecturer: Amnon Shashua Scribe: Amnon Shashua 7. Support Vector Machine We return now to
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 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 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 informationMatrix Completion Problems for Pairs of Related Classes of Matrices
Matrix Completion Problems for Pairs of Related Classes of Matrices Leslie Hogben Department of Mathematics Iowa State University Ames, IA 50011 lhogben@iastate.edu Abstract For a class X of real matrices,
More informationOn the enumeration of partitions with summands in arithmetic progression
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8 (003), Pages 149 159 On the enumeration of partitions with summans in arithmetic progression M. A. Nyblom C. Evans Department of Mathematics an Statistics
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 informationRamsey numbers of some bipartite graphs versus complete graphs
Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer
More informationOn the minimum distance of elliptic curve codes
On the minimum istance of elliptic curve coes Jiyou Li Department of Mathematics Shanghai Jiao Tong University Shanghai PRChina Email: lijiyou@sjtueucn Daqing Wan Department of Mathematics University of
More informationSpectral properties of a near-periodic row-stochastic Leslie matrix
Linear Algebra an its Applications 409 2005) 66 86 wwwelseviercom/locate/laa Spectral properties of a near-perioic row-stochastic Leslie matrix Mei-Qin Chen a Xiezhang Li b a Department of Mathematics
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 information11.7. Implicit Differentiation. Introduction. Prerequisites. Learning Outcomes
Implicit Differentiation 11.7 Introuction This Section introuces implicit ifferentiation which is use to ifferentiate functions expresse in implicit form (where the variables are foun together). Examples
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 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 information3.7 Implicit Differentiation -- A Brief Introduction -- Student Notes
Fin these erivatives of these functions: y.7 Implicit Differentiation -- A Brief Introuction -- Stuent Notes tan y sin tan = sin y e = e = Write the inverses of these functions: y tan y sin How woul we
More informationOn the Cauchy Problem for Von Neumann-Landau Wave Equation
Journal of Applie Mathematics an Physics 4 4-3 Publishe Online December 4 in SciRes http://wwwscirporg/journal/jamp http://xoiorg/436/jamp4343 On the Cauchy Problem for Von Neumann-anau Wave Equation Chuangye
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 informationarxiv: v1 [math.co] 29 May 2009
arxiv:0905.4913v1 [math.co] 29 May 2009 simple Havel-Hakimi type algorithm to realize graphical egree sequences of irecte graphs Péter L. Erős an István Miklós. Rényi Institute of Mathematics, Hungarian
More informationLie symmetry and Mei conservation law of continuum system
Chin. Phys. B Vol. 20, No. 2 20 020 Lie symmetry an Mei conservation law of continuum system Shi Shen-Yang an Fu Jing-Li Department of Physics, Zhejiang Sci-Tech University, Hangzhou 3008, China Receive
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
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 informationNEERAJ KUMAR AND K. SENTHIL KUMAR. 1. Introduction. Theorem 1 motivate us to ask the following:
NOTE ON VANISHING POWER SUMS OF ROOTS OF UNITY NEERAJ KUMAR AND K. SENTHIL KUMAR Abstract. For xe positive integers m an l, we give a complete list of integers n for which their exist mth complex roots
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 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 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 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 informationMath Implicit Differentiation. We have discovered (and proved) formulas for finding derivatives of functions like
Math 400 3.5 Implicit Differentiation Name We have iscovere (an prove) formulas for fining erivatives of functions like f x x 3x 4x. 3 This amounts to fining y for 3 y x 3x 4x. Notice that in this case,
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More informationGeneralized Tractability for Multivariate Problems
Generalize Tractability for Multivariate Problems Part II: Linear Tensor Prouct Problems, Linear Information, an Unrestricte Tractability Michael Gnewuch Department of Computer Science, University of Kiel,
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 informationDesigning Information Devices and Systems II Fall 2017 Note Theorem: Existence and Uniqueness of Solutions to Differential Equations
EECS 6B Designing Information Devices an Systems II Fall 07 Note 3 Secon Orer Differential Equations Secon orer ifferential equations appear everywhere in the real worl. In this note, we will walk through
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 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 informationExam 2 Answers Math , Fall log x dx = x log x x + C. log u du = 1 3
Exam Answers Math -, Fall 7. Show, using any metho you like, that log x = x log x x + C. Answer: (x log x x+c) = x x + log x + = log x. Thus log x = x log x x+c.. Compute these. Remember to put boxes aroun
More informationPure Further Mathematics 1. Revision Notes
Pure Further Mathematics Revision Notes June 20 2 FP JUNE 20 SDB Further Pure Complex Numbers... 3 Definitions an arithmetical operations... 3 Complex conjugate... 3 Properties... 3 Complex number plane,
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationThe doubly negative matrix completion problem
The doubly negative matrix completion problem C Mendes Araújo, Juan R Torregrosa and Ana M Urbano CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica
More informationAll s Well That Ends Well: Supplementary Proofs
All s Well That Ens Well: Guarantee Resolution of Simultaneous Rigi Boy Impact 1:1 All s Well That Ens Well: Supplementary Proofs This ocument complements the paper All s Well That Ens Well: Guarantee
More informationLEGENDRE TYPE FORMULA FOR PRIMES GENERATED BY QUADRATIC POLYNOMIALS
Ann. Sci. Math. Québec 33 (2009), no 2, 115 123 LEGENDRE TYPE FORMULA FOR PRIMES GENERATED BY QUADRATIC POLYNOMIALS TAKASHI AGOH Deicate to Paulo Ribenboim on the occasion of his 80th birthay. RÉSUMÉ.
More informationSchrödinger s equation.
Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of
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 informationA Weak First Digit Law for a Class of Sequences
International Mathematical Forum, Vol. 11, 2016, no. 15, 67-702 HIKARI Lt, www.m-hikari.com http://x.oi.org/10.1288/imf.2016.6562 A Weak First Digit Law for a Class of Sequences M. A. Nyblom School of
More information7. Localization. (d 1, m 1 ) (d 2, m 2 ) d 3 D : d 3 d 1 m 2 = d 3 d 2 m 1. (ii) If (d 1, m 1 ) (d 1, m 1 ) and (d 2, m 2 ) (d 2, m 2 ) then
7. Localization To prove Theorem 6.1 it becomes necessary to be able to a enominators to rings (an to moules), even when the rings have zero-ivisors. It is a tool use all the time in commutative algebra,
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 informationThe Wiener Index of Trees with Prescribed Diameter
011 1 15 4 ± Dec., 011 Operations Research Transactions Vol.15 No.4 The Wiener Inex of Trees with Prescribe Diameter XING Baohua 1 CAI Gaixiang 1 Abstract The Wiener inex W(G) of a graph G is efine as
More informationFinal Exam Study Guide and Practice Problems Solutions
Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making
More informationCharacterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
Characterizing Real-Value Multivariate Complex Polynomials an Their Symmetric Tensor Representations Bo JIANG Zhening LI Shuzhong ZHANG December 31, 2014 Abstract In this paper we stuy multivariate polynomial
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 informationA Path Planning Method Using Cubic Spiral with Curvature Constraint
A Path Planning Metho Using Cubic Spiral with Curvature Constraint Tzu-Chen Liang an Jing-Sin Liu Institute of Information Science 0, Acaemia Sinica, Nankang, Taipei 5, Taiwan, R.O.C., Email: hartree@iis.sinica.eu.tw
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 informationMath 115 Section 018 Course Note
Course Note 1 General Functions Definition 1.1. A function is a rule that takes certain numbers as inputs an assigns to each a efinite output number. The set of all input numbers is calle the omain of
More informationNATURAL BOUNDARY ELEMENT METHOD FOR THREE DIMENSIONAL EXTERIOR HARMONIC PROBLEM WITH AN INNER PROLATE SPHEROID BOUNDARY
NATURAL BOUNDARY ELEMENT METHOD FOR THREE DIMENSIONAL EXTERIOR HARMONIC PROBLEM WITH AN INNER PROLATE SPHEROID BOUNDARY Hong-ying Huang De-hao Yu State Key Laboratory of Scientific Engineering Computing,
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 information23 Implicit differentiation
23 Implicit ifferentiation 23.1 Statement The equation y = x 2 + 3x + 1 expresses a relationship between the quantities x an y. If a value of x is given, then a corresponing value of y is etermine. For
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 informationA Sketch of Menshikov s Theorem
A Sketch of Menshikov s Theorem Thomas Bao March 14, 2010 Abstract Let Λ be an infinite, locally finite oriente multi-graph with C Λ finite an strongly connecte, an let p
More informationOn colour-blind distinguishing colour pallets in regular graphs
J Comb Optim (2014 28:348 357 DOI 10.1007/s10878-012-9556-x On colour-blin istinguishing colour pallets in regular graphs Jakub Przybyło Publishe online: 25 October 2012 The Author(s 2012. This article
More informationStable Polynomials over Finite Fields
Rev. Mat. Iberoam., 1 14 c European Mathematical Society Stable Polynomials over Finite Fiels Domingo Gómez-Pérez, Alejanro P. Nicolás, Alina Ostafe an Daniel Saornil Abstract. We use the theory of resultants
More informationChaos, Solitons and Fractals Nonlinear Science, and Nonequilibrium and Complex Phenomena
Chaos, Solitons an Fractals (7 64 73 Contents lists available at ScienceDirect Chaos, Solitons an Fractals onlinear Science, an onequilibrium an Complex Phenomena journal homepage: www.elsevier.com/locate/chaos
More informationLECTURE NOTES ON DVORETZKY S THEOREM
LECTURE NOTES ON DVORETZKY S THEOREM STEVEN HEILMAN Abstract. We present the first half of the paper [S]. In particular, the results below, unless otherwise state, shoul be attribute to G. Schechtman.
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 informationOptimization of Geometries by Energy Minimization
Optimization of Geometries by Energy Minimization by Tracy P. Hamilton Department of Chemistry University of Alabama at Birmingham Birmingham, AL 3594-140 hamilton@uab.eu Copyright Tracy P. Hamilton, 1997.
More informationarxiv: v2 [math.co] 14 Jun 2017
A PROBLEM ON PARTIAL SUMS IN ABELIAN GROUPS arxiv:1706.00042v2 [math.co] 14 Jun 2017 S. COSTA, F. MORINI, A. PASOTTI, AND M.A. PELLEGRINI Abstract. In this paper we propose a conjecture concerning partial
More informationConstruction of the Electronic Radial Wave Functions and Probability Distributions of Hydrogen-like Systems
Construction of the Electronic Raial Wave Functions an Probability Distributions of Hyrogen-like Systems Thomas S. Kuntzleman, Department of Chemistry Spring Arbor University, Spring Arbor MI 498 tkuntzle@arbor.eu
More informationChapter 2 Derivatives
Chapter Derivatives Section. An Intuitive Introuction to Derivatives Consier a function: Slope function: Derivative, f ' For each, the slope of f is the height of f ' Where f has a horizontal tangent line,
More informationA. Incorrect! The letter t does not appear in the expression of the given integral
AP Physics C - Problem Drill 1: The Funamental Theorem of Calculus Question No. 1 of 1 Instruction: (1) Rea the problem statement an answer choices carefully () Work the problems on paper as neee (3) Question
More informationNOTES ON THE DIVISIBILITY OF GCD AND LCM MATRICES
NOTES ON THE DIVISIBILITY OF GCD AND LCM MATRICES PENTTI HAUKKANEN AND ISMO KORKEE Receive 10 November 2004 Let S {,,...,x n } be a set of positive integers, an let f be an arithmetical function. The matrices
More information18 EVEN MORE CALCULUS
8 EVEN MORE CALCULUS Chapter 8 Even More Calculus Objectives After stuing this chapter you shoul be able to ifferentiate an integrate basic trigonometric functions; unerstan how to calculate rates of change;
More informationMath Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors
Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+
More informationII. First variation of functionals
II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent
More information4. Important theorems in quantum mechanics
TFY4215 Kjemisk fysikk og kvantemekanikk - Tillegg 4 1 TILLEGG 4 4. Important theorems in quantum mechanics Before attacking three-imensional potentials in the next chapter, we shall in chapter 4 of this
More informationImplicit Differentiation
Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,
More informationSturm-Liouville Theory
LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory
More informationCommun Nonlinear Sci Numer Simulat
Commun Nonlinear Sci Numer Simulat 14 (2009) 3901 3913 Contents lists available at ScienceDirect Commun Nonlinear Sci Numer Simulat journal homepage: www.elsevier.com/locate/cnsns Dynamics of a ring network
More informationStability of solutions to linear differential equations of neutral type
Journal of Analysis an Applications Vol. 7 (2009), No.3, pp.119-130 c SAS International Publications URL : www.sasip.net Stability of solutions to linear ifferential equations of neutral type G.V. Demienko
More informationExponential asymptotic property of a parallel repairable system with warm standby under common-cause failure
J. Math. Anal. Appl. 341 (28) 457 466 www.elsevier.com/locate/jmaa Exponential asymptotic property of a parallel repairable system with warm stanby uner common-cause failure Zifei Shen, Xiaoxiao Hu, Weifeng
More informationHyperbolic Systems of Equations Posed on Erroneous Curved Domains
Hyperbolic Systems of Equations Pose on Erroneous Curve Domains Jan Norström a, Samira Nikkar b a Department of Mathematics, Computational Mathematics, Linköping University, SE-58 83 Linköping, Sween (
More informationDeterminant and Trace
Determinant an Trace Area an mappings from the plane to itself: Recall that in the last set of notes we foun a linear mapping to take the unit square S = {, y } to any parallelogram P with one corner at
More informationQubit channels that achieve capacity with two states
Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March
More informationA Unified Theorem on SDP Rank Reduction
A Unifie heorem on SDP Ran Reuction Anthony Man Cho So, Yinyu Ye, Jiawei Zhang November 9, 006 Abstract We consier the problem of fining a low ran approximate solution to a system of linear equations in
More informationIntegration by Parts
Integration by Parts 6-3-207 If u an v are functions of, the Prouct Rule says that (uv) = uv +vu Integrate both sies: (uv) = uv = uv + u v + uv = uv vu, vu v u, I ve written u an v as shorthan for u an
More informationarxiv: v1 [physics.flu-dyn] 8 May 2014
Energetics of a flui uner the Boussinesq approximation arxiv:1405.1921v1 [physics.flu-yn] 8 May 2014 Kiyoshi Maruyama Department of Earth an Ocean Sciences, National Defense Acaemy, Yokosuka, Kanagawa
More informationZachary Scherr Math 503 HW 3 Due Friday, Feb 12
Zachary Scherr Math 503 HW 3 Due Friay, Feb 1 1 Reaing 1. Rea sections 7.5, 7.6, 8.1 of Dummit an Foote Problems 1. DF 7.5. Solution: This problem is trivial knowing how to work with universal properties.
More informationTHE REAL POSITIVE DEFINITE COMPLETION PROBLEM. WAYNE BARRETT**, CHARLES R. JOHNSONy and PABLO TARAZAGAz
THE REAL POSITIVE DEFINITE COMPLETION PROBLEM FOR A SIMPLE CYCLE* WAYNE BARRETT**, CHARLES R JOHNSONy and PABLO TARAZAGAz Abstract We consider the question of whether a real partial positive denite matrix
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 informationLower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Lower Bouns for Local Monotonicity Reconstruction from Transitive-Closure Spanners Arnab Bhattacharyya Elena Grigorescu Mahav Jha Kyomin Jung Sofya Raskhonikova Davi P. Wooruff Abstract Given a irecte
More informationMEASURES WITH ZEROS IN THE INVERSE OF THEIR MOMENT MATRIX
MEASURES WITH ZEROS IN THE INVERSE OF THEIR MOMENT MATRIX J. WILLIAM HELTON, JEAN B. LASSERRE, AND MIHAI PUTINAR Abstract. We investigate an iscuss when the inverse of a multivariate truncate moment matrix
More informationCHARACTERIZATION OF PSL(3,Q) BY NSE
CHARACTERIZATION OF PSL(,Q) BY NSE S. ASGARY an N. AHANJIDEH Communicate by Alexanru Buium Let G be a group an π e(g) be the set of element orers of G. Suppose that k π e(g) an m k is the number of elements
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 information