The Hilbert Schmidt version of the commutator theorem for zero trace matrices
|
|
- Stewart Hancock
- 6 years ago
- Views:
Transcription
1 The Hilbert Schidt version of the coutator theore for zero trace atrices Oer Angel Gideon Schechtan March 205 Abstract Let A be a coplex atrix with zero trace. Then there are atrices B and C such that A = [B, C] and B C 2 (log + O()) /2 A 2 where D is the nor of D as an operator on l 2 and D 2 is the Hilbert Schidt nor of D. Moreover, the atrix B can be taken to be noral. Conversely there is a zero trace atrix A such that whenever A = [B, C], B C 2 log O() /2 A 2 for soe absolute constant c > 0. Introduction As is well known (or see e.g. [Fi]) a coplex atrix A is a coutator (i.e., there are atrices B and C of the sae diensions as A such that A = [B, C] = BC CB) if and only if A has zero trace. Let E denote the operator nor of an atrix (as a ap E : l 2 l 2 ) and let be any other nor on the space of atrices satisfying EF E F and F E E F for all atrices. In such a situation clearly if A = [B, C] then A 2 B C. We are interested in the reverse inequality: If A has zero trace are there atrices B and C such that A = [B, C] and B C K A for AMS subject classification: 47B47, 5A60. Key words: coutators, zero trace, Hilbert Schidt nor of atrices Supprted in part by NSERC, the Isaac Newton Institute and Sions Foundation. Supported in part by the Israel Science Foundation.
2 soe absolute constant K? If not what is the behavior of the best K as a function on? In [JOS] this question was dealt with for being the operator nor. An upper bound on K which is saller than any power of was given. Here we deal with being the Hilbert Schidt nor which we denote 2. We give atching upper and lower bounds (up to a constant factor). Theore. Let A be an atrix with zero trace, then there are atrices B and C such that A = [B, C] and B C 2 (c + log ) /2 A 2. Moreover, the atrix B can be taken to be noral. Conversely, for each there is a zero trace atrix A such that for any atrices B, C with A = [B, C], B C 2 2 (c + log ) /2 A 2, where c, c are soe universal constants. The proof of the upper bound which is done by quite a siple rando choice is given in Section 2. The lower bound is a bit ore involved and is based on an idea fro [DFWW] and in particular on a variation on a lea of Brown [Br]. The proof is given in Section 3. 2 The upper bound Since both nors and 2 are unitarily invariant and since any zero trace atrix is unitarily equivalent to a atrix with zero diagonal, we ay and shall assue that A has zero diagonal. In that case we shall find a diagonal atrix B = (b, b 2,..., b ) with the desired property. Note that translating back and assuing A has erely zero trace, the resulting B is noral, being unitarily equivalent to a diagonal atrix. Let >. If A = [B, C] with A with zero diagonal and B = (b, b 2,..., b ) with all its diagonal entries distinct, then necessarily c i,j = a i,j b i b j for i j. Let G Z + Zı be the points with sallest absolute values, so that ax z G { z } + /π. Let {b i } be a uniforly rando perutation of these points, so that necessarily B + /π. We now evaluate the expectation of the resulting C 2 2. E C 2 2 = E i j a i,j 2 b i b j 2 = i j a i,j 2 E b i b j = 2 A 2 2E b b 2. () 2 2
3 To evaluate E b b 2 2 fix b G. The expectation conditioned on b is b 2 G b 2 b b b 2 2 [ a 0 + a + π log z b 2 /π ] dz 2 z b 2 for soe absolute constants a 0, a. Plugging this into () we get that E C 2 2 a +π log A 2 2 and thus there is a realization of the b i -s which gives B C 2 c + log A 2, for soe absolute constant c, as desired. Reark. One can clearly replace the points of G by another set of points in the sae disc about zero. Sets iniizing such an energy function are a well studied subject. However, no significant iproveent can be gained by replacing G with another set, and in particular our choice of G achieves the optial leading ter π log. See for exaple [HS] in which tight bounds are given for a related quantity on the two diensional sphere. 3 The lower bound We begin with a Lea which is a variation on a lea of Brown [Br] Lea. Assue S, T are atrices,, and M is a finite diensional subspace of l 2 (where l 2 = l 2 ) such that for soe λ C ([S, T ] + λi)(l 2 ) M. Then there are orthogonal subspaces H n l 2, n = 0,,..., with H 0 = M, dih n (n + )dim, n =, 2,..., and P i SP j = P i T P j = 0 for all i > j +, j = 0,,.... Here P l is the orthogonal projection onto H l. Moreover, n=0 H n is invariant under S and T. Proof. Let V 0 = H 0 = M and for n let V n be the linear span of {S k T l M; k + l n}. For n put H n = V n V n. Clearly, dih n (n + )dim and n=0 H n is invariant under S and T. To show that P i SP j = P i T P j = 0 for all i > j + it is enough to show that T V n V n+ and SV n V n+ for all n. 3
4 The second containent is obvious. To prove the first it is enough to show that for all k and k + l n, T S k T l M V n+. Now, T S k T l = S k T l+ + i<k S i [T, S]S k i T l = S k T l+ kλs k T l + i<k S i ([T, S] + λi)s k i T l. Now, the first ter here has range in V n+ and the second in V n V n+. Since [T, S] + λi has range in M the ith ter in the last su has range in S i M V i V n+, and the proof is coplete. Let P be the rank one orthogonal projection onto the first coordinate in l 2, <, given by the atrix P = and let A = P I. Obviously A has zero trace and Hilbert Schidt nor. We now show that this A gives the lower bound of Theore. Moreover, our arguent gives bounds on the leading singular values of C, based on the proof of Theore 7.3 in [DFWW], which also gives a lower bound on C 2. Specifically, we get the following: Theore 2. Assue A = [B, C] with A as above, and the operator nor of B equals. Denote the singular values of C as s, s 2,..., s, arranged in non-increasing order. Then for all l, l s i l/6. In particular the Hilbert Schidt nor of C is at least c log for soe absolute constant c > 0. Proof of the lower bound in Theore. Let M be the one diensional subspace of l 2 spanned by the first coordinate. Applying Lea to this 4
5 subspace with S = B, T = C and λ = / we get orthogonal subspaces M = H 0, H,... (which of course are eventually the zero subspace) with dih n n +, so that n=0 H n is invariant under B and C and P i BP j = P i CP j = 0 for all i > j + > 0, where P l is the orthogonal projection onto H l. Note that P 0 = P. Note also that n=0 H n is R. Indeed, a proper subspace of R containing H 0 which is invariant under B and C is also invariant under A, and the restriction of A to such a subspace has zero trace which clearly can t hold. Now, on H 0, A is just ( ), so ( ) P 0 = P 0 [B, C]P 0 Siilarly, for k > 0, since A Hk other i, j, = P 0 BP 0 P 0 CP 0 P 0 CP 0 P 0 BP 0 + P 0 BP P CP 0 P 0 CP P BP 0. = I H k, and using P i BP j = P i CP j = 0 for P k = P k [B, C]P k = P k BP k P k CP k P k CP k P k BP k + P k BP k P k CP k P k CP k P k BP k + P k BP k+ P k+ CP k P k CP k+ P k+ BP k. Using the trace property (e.g., Tr(P k BP k P k CP k ) = Tr(P k CP k P k BP k )), we get that for all n, n n rankp k = Tr(P k [B, C]P k ) So, since B =, = Tr(P n BP n+ CP n ) Tr(P n CP n+ BP n ). n rankp k P n+ CP n + P n CP n+. (2) Since rankp k k +, this gives a lower bound on the nors of P n CP n+ and P n+ CP n : P n+ CP n + P n CP n+ ( ) n + 2. (3) 2 5
6 The atrices P n+ CP n and P n CP n+ have rank at ost n +, so changing to other nors is not too costly, which allows us to bound fro below the Hilbert Schidt nor of C. To coplete the proof of the lower bound of Theore, note that for a atrix M of rank r we have M 2 2 r M 2, so C 2 2 n n n n P n CP n P n+ CP n 2 2 ( Pn CP n+ 2 + P n+ CP n 2 n + ) 2(n + ) ( P ncp n+ + P n+ CP n ) 2 ( ( )) 2 n (n + ) 2 We take the su over n with ( ) n+2 2 <. It is straightforward to see that the last su is log + O(), giving the claied lower bound. 4 Proof of Theore 2. Lea 7.9 in [DFWW] (whose proof is siple, based on polar decoposition) says that there are partial isoetries V, W on l 2 such that Consequently, and by (2), P n V CP n = P n+ CP n and P n W C P n = P n+ C P n. P n (V C + W C )P n = P n+ CP n + P n+ C P n Tr(P n (V C + W C )P n ) n rankp k. Fix a positive integer k and let E k = k i=0 P i and r k = ranke k (k + )(k + 2)/2. Denoting by s i (R) the singular values of the operator R, we get that as long as (k + )(k + 2), (k+)(k+2)/2 s i (V C + W C ) r k k n=0 6 s i (E k (V C + W C )E k ) Tr(P n (V C + W C )P n ) k + 2.
7 Where we have used Weyl s inequality to deduce the second inequality. It follows that for all k as above (k+)(k+2)/2 s i (C) k+. The ain assertion 4 of the theore follows easily fro that. As for the last assertion, it is well known that it follows fro the first. Indeed, the non-increasing sequence s, s 2,..., s ajorizes a sequence equivalent (with universal constants) to, 2/ 2, / 3,..., /. Consequently, ( s 2 i ) /2 c( /i) /2 c (log ) /2. Acknowledgeent. We benefitted a lot fro discussions with Bill Johnson concerning the aterial of this note. In particular, he is the one who pointed [DFWW] to us. References [Br] L. G. Brown, Traces of coutators of Schatten-von Neuann class operators. J. Reine Angew. Math. 45, 7 74 (994). [DFWW] K. Dykea, T. Figiel, G. Weiss, M. Wodzicki, Coutator structure of operator ideals. Adv. Math. 85, no., 79 (2004). [Fi] P. A. Fillore, On siilarity and the diagonal of a atrix. Aer. Math. Monthly 76: (969). [HS] D. P. Hardin, E. B. Saff, Discretizing anifolds via iniu energy points. Notices Aer. Math. Soc. 5 (2004), no. 0, [JOS] W. B. Johnson, N. Ozawa, G. Schechtan, A quantitative version of the coutator theore for zero trace atrices. Proc. Natl. Acad. Sci. USA 0 (203), no. 48, O. Angel G. Schechtan Departent of Matheatics Departent of Matheatics University of British Colubia Weizann Institute of Science Vancouver, BC, V6T Z2, Canada Rehovot 7600, Israel angel@ath.ubc.ca gideon@weizann.ac.il 7
THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT
THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and
More informationAlgebraic Montgomery-Yang problem: the log del Pezzo surface case
c 2014 The Matheatical Society of Japan J. Math. Soc. Japan Vol. 66, No. 4 (2014) pp. 1073 1089 doi: 10.2969/jsj/06641073 Algebraic Montgoery-Yang proble: the log del Pezzo surface case By DongSeon Hwang
More informationON SOME MATRIX INEQUALITIES. Hyun Deok Lee. 1. Introduction Matrix inequalities play an important role in statistical mechanics([1,3,6,7]).
Korean J. Math. 6 (2008), No. 4, pp. 565 57 ON SOME MATRIX INEQUALITIES Hyun Deok Lee Abstract. In this paper we present soe trace inequalities for positive definite atrices in statistical echanics. In
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationA Bernstein-Markov Theorem for Normed Spaces
A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationA note on the realignment criterion
A note on the realignent criterion Chi-Kwong Li 1, Yiu-Tung Poon and Nung-Sing Sze 3 1 Departent of Matheatics, College of Willia & Mary, Williasburg, VA 3185, USA Departent of Matheatics, Iowa State University,
More informationLecture 9 November 23, 2015
CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)
More informationG G G G G. Spec k G. G Spec k G G. G G m G. G Spec k. Spec k
12 VICTORIA HOSKINS 3. Algebraic group actions and quotients In this section we consider group actions on algebraic varieties and also describe what type of quotients we would like to have for such group
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationLecture 20 November 7, 2013
CS 229r: Algoriths for Big Data Fall 2013 Prof. Jelani Nelson Lecture 20 Noveber 7, 2013 Scribe: Yun Willia Yu 1 Introduction Today we re going to go through the analysis of atrix copletion. First though,
More informationElementary properties of 1-isometries on a Hilbert space
Eleentary properties of 1-isoetries on a Hilbert space Muneo Chō Departaent of Matheatics, Kanagawa University Hiratsua 259-1293, Japan Caixing Gu y Departent of Matheatics, California Polytechnic State
More informationADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE
ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE CHRISTOPHER J. HILLAR Abstract. A long-standing conjecture asserts that the polynoial p(t = Tr(A + tb ] has nonnegative coefficients whenever is
More informationSupplementary Material for Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion
Suppleentary Material for Fast and Provable Algoriths for Spectrally Sparse Signal Reconstruction via Low-Ran Hanel Matrix Copletion Jian-Feng Cai Tianing Wang Ke Wei March 1, 017 Abstract We establish
More informationA1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3
A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationGeneralized AOR Method for Solving System of Linear Equations. Davod Khojasteh Salkuyeh. Department of Mathematics, University of Mohaghegh Ardabili,
Australian Journal of Basic and Applied Sciences, 5(3): 35-358, 20 ISSN 99-878 Generalized AOR Method for Solving Syste of Linear Equations Davod Khojasteh Salkuyeh Departent of Matheatics, University
More informationLeast Squares Fitting of Data
Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a
More information1 Identical Parallel Machines
FB3: Matheatik/Inforatik Dr. Syaantak Das Winter 2017/18 Optiizing under Uncertainty Lecture Notes 3: Scheduling to Miniize Makespan In any standard scheduling proble, we are given a set of jobs J = {j
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a ournal published by Elsevier. The attached copy is furnished to the author for internal non-coercial research and education use, including for instruction at the authors institution
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationSome Classical Ergodic Theorems
Soe Classical Ergodic Theores Matt Rosenzweig Contents Classical Ergodic Theores. Mean Ergodic Theores........................................2 Maxial Ergodic Theore.....................................
More informationNote on generating all subsets of a finite set with disjoint unions
Note on generating all subsets of a finite set with disjoint unions David Ellis e-ail: dce27@ca.ac.uk Subitted: Dec 2, 2008; Accepted: May 12, 2009; Published: May 20, 2009 Matheatics Subject Classification:
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationFAST DYNAMO ON THE REAL LINE
FAST DYAMO O THE REAL LIE O. KOZLOVSKI & P. VYTOVA Abstract. In this paper we show that a piecewise expanding ap on the interval, extended to the real line by a non-expanding ap satisfying soe ild hypthesis
More informationBipartite subgraphs and the smallest eigenvalue
Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.
More informationPROPER HOLOMORPHIC MAPPINGS THAT MUST BE RATIONAL
transactions of the aerican atheatical society Volue 2X4. Nuber I, lulv 1984 PROPER HOLOMORPHIC MAPPINGS THAT MUST BE RATIONAL BY STEVEN BELL Abstract. Suppose/: Dx -» D2 is a proper holoorphic apping
More informationLower Bounds for Quantized Matrix Completion
Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &
More informationTail estimates for norms of sums of log-concave random vectors
Tail estiates for nors of sus of log-concave rando vectors Rados law Adaczak Rafa l Lata la Alexander E. Litvak Alain Pajor Nicole Toczak-Jaegerann Abstract We establish new tail estiates for order statistics
More informationNON-COMMUTATIVE GRÖBNER BASES FOR COMMUTATIVE ALGEBRAS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volue 126, Nuber 3, March 1998, Pages 687 691 S 0002-9939(98)04229-4 NON-COMMUTATIVE GRÖBNER BASES FOR COMMUTATIVE ALGEBRAS DAVID EISENBUD, IRENA PEEVA,
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More informationL p moments of random vectors via majorizing measures
L p oents of rando vectors via ajorizing easures Olivier Guédon, Mark Rudelson Abstract For a rando vector X in R n, we obtain bounds on the size of a saple, for which the epirical p-th oents of linear
More informationPartial traces and entropy inequalities
Linear Algebra and its Applications 370 (2003) 125 132 www.elsevier.co/locate/laa Partial traces and entropy inequalities Rajendra Bhatia Indian Statistical Institute, 7, S.J.S. Sansanwal Marg, New Delhi
More informationarxiv: v1 [math.co] 19 Apr 2017
PROOF OF CHAPOTON S CONJECTURE ON NEWTON POLYTOPES OF q-ehrhart POLYNOMIALS arxiv:1704.0561v1 [ath.co] 19 Apr 017 JANG SOO KIM AND U-KEUN SONG Abstract. Recently, Chapoton found a q-analog of Ehrhart polynoials,
More informationOptimal Jamming Over Additive Noise: Vector Source-Channel Case
Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationComputational and Statistical Learning Theory
Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher
More informationThe Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters
journal of ultivariate analysis 58, 96106 (1996) article no. 0041 The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Paraeters H. S. Steyn
More informationM ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS. Van H. Vu. 1.
M ath. Res. Lett. 15 (2008), no. 2, 375 388 c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS Van H. Vu Abstract. Let F q be a finite field of order q and P be a polynoial in F q[x
More informationCSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13
CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture
More informationSharp Time Data Tradeoffs for Linear Inverse Problems
Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationThe proofs of Theorem 1-3 are along the lines of Wied and Galeano (2013).
A Appendix: Proofs The proofs of Theore 1-3 are along the lines of Wied and Galeano (2013) Proof of Theore 1 Let D[d 1, d 2 ] be the space of càdlàg functions on the interval [d 1, d 2 ] equipped with
More informationNORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS
NORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS NIKOLAOS PAPATHANASIOU AND PANAYIOTIS PSARRAKOS Abstract. In this paper, we introduce the notions of weakly noral and noral atrix polynoials,
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationConvex Programming for Scheduling Unrelated Parallel Machines
Convex Prograing for Scheduling Unrelated Parallel Machines Yossi Azar Air Epstein Abstract We consider the classical proble of scheduling parallel unrelated achines. Each job is to be processed by exactly
More informationMulti-Dimensional Hegselmann-Krause Dynamics
Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory
More informationLean Walsh Transform
Lean Walsh Transfor Edo Liberty 5th March 007 inforal intro We show an orthogonal atrix A of size d log 4 3 d (α = log 4 3) which is applicable in tie O(d). By applying a rando sign change atrix S to the
More informationFixed-to-Variable Length Distribution Matching
Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de
More informationON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN
More information4 = (0.02) 3 13, = 0.25 because = 25. Simi-
Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =
More informationLecture 13 Eigenvalue Problems
Lecture 13 Eigenvalue Probles MIT 18.335J / 6.337J Introduction to Nuerical Methods Per-Olof Persson October 24, 2006 1 The Eigenvalue Decoposition Eigenvalue proble for atrix A: Ax = λx with eigenvalues
More informationA new type of lower bound for the largest eigenvalue of a symmetric matrix
Linear Algebra and its Applications 47 7 9 9 www.elsevier.co/locate/laa A new type of lower bound for the largest eigenvalue of a syetric atrix Piet Van Mieghe Delft University of Technology, P.O. Box
More informationMetric Entropy of Convex Hulls
Metric Entropy of Convex Hulls Fuchang Gao University of Idaho Abstract Let T be a precopact subset of a Hilbert space. The etric entropy of the convex hull of T is estiated in ters of the etric entropy
More information1 Generalization bounds based on Rademacher complexity
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges
More informationPolytopes and arrangements: Diameter and curvature
Operations Research Letters 36 2008 2 222 Operations Research Letters wwwelsevierco/locate/orl Polytopes and arrangeents: Diaeter and curvature Antoine Deza, Taás Terlaky, Yuriy Zinchenko McMaster University,
More informationORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS
#A34 INTEGERS 17 (017) ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS Jürgen Kritschgau Departent of Matheatics, Iowa State University, Aes, Iowa jkritsch@iastateedu Adriana Salerno
More informationTHE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n
THE POLYNOMIAL REPRESENTATION OF THE TYPE A n RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n SHEELA DEVADAS AND YI SUN Abstract. We study the polynoial representation of the rational Cherednik algebra
More informationA Note on Online Scheduling for Jobs with Arbitrary Release Times
A Note on Online Scheduling for Jobs with Arbitrary Release Ties Jihuan Ding, and Guochuan Zhang College of Operations Research and Manageent Science, Qufu Noral University, Rizhao 7686, China dingjihuan@hotail.co
More informationSupplement to: Subsampling Methods for Persistent Homology
Suppleent to: Subsapling Methods for Persistent Hoology A. Technical results In this section, we present soe technical results that will be used to prove the ain theores. First, we expand the notation
More informationThe Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationScaled Enflo type is equivalent to Rademacher type
Scaled Enflo tye is equivalent to Radeacher tye Manor Mendel California Institute of Technology Assaf Naor Microsoft Research Abstract We introduce the notion of scaled Enflo tye of a etric sace, and show
More informationApproximation in Stochastic Scheduling: The Power of LP-Based Priority Policies
Approxiation in Stochastic Scheduling: The Power of -Based Priority Policies Rolf Möhring, Andreas Schulz, Marc Uetz Setting (A P p stoch, r E( w and (B P p stoch E( w We will assue that the processing
More informationarxiv: v1 [math.cv] 31 Mar 2013
Proper holoorphic appings, Bell s forula and the Lu Qi-Keng proble on tetrablock Maria Trybuła Institute of Matheatics, Faculty of Matheatics and Coputer Science, Jagiellonian University, Łojasiewicza
More informationFundamental Limits of Database Alignment
Fundaental Liits of Database Alignent Daniel Cullina Dept of Electrical Engineering Princeton University dcullina@princetonedu Prateek Mittal Dept of Electrical Engineering Princeton University pittal@princetonedu
More informationLecture 21 Nov 18, 2015
CS 388R: Randoized Algoriths Fall 05 Prof. Eric Price Lecture Nov 8, 05 Scribe: Chad Voegele, Arun Sai Overview In the last class, we defined the ters cut sparsifier and spectral sparsifier and introduced
More informationPREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL
PREPRINT 2006:7 Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL Departent of Matheatical Sciences Division of Matheatics CHALMERS UNIVERSITY OF TECHNOLOGY GÖTEBORG UNIVERSITY
More informationExplicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
Explicit solution of the polynoial least-squares approxiation proble on Chebyshev extrea nodes Alfredo Eisinberg, Giuseppe Fedele Dipartiento di Elettronica Inforatica e Sisteistica, Università degli Studi
More informationarxiv: v1 [cs.ds] 17 Mar 2016
Tight Bounds for Single-Pass Streaing Coplexity of the Set Cover Proble Sepehr Assadi Sanjeev Khanna Yang Li Abstract arxiv:1603.05715v1 [cs.ds] 17 Mar 2016 We resolve the space coplexity of single-pass
More informationEXISTENCE OF ASYMPTOTICALLY PERIODIC SOLUTIONS OF SCALAR VOLTERRA DIFFERENCE EQUATIONS. 1. Introduction
Tatra Mt. Math. Publ. 43 2009, 5 6 DOI: 0.2478/v027-009-0024-7 t Matheatical Publications EXISTENCE OF ASYMPTOTICALLY PERIODIC SOLUTIONS OF SCALAR VOLTERRA DIFFERENCE EQUATIONS Josef Diblík Miroslava Růžičková
More informationLORENTZ SPACES AND REAL INTERPOLATION THE KEEL-TAO APPROACH
LORENTZ SPACES AND REAL INTERPOLATION THE KEEL-TAO APPROACH GUILLERMO REY. Introduction If an operator T is bounded on two Lebesgue spaces, the theory of coplex interpolation allows us to deduce the boundedness
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More informationClosed-form evaluations of Fibonacci Lucas reciprocal sums with three factors
Notes on Nuber Theory Discrete Matheatics Print ISSN 30-32 Online ISSN 2367-827 Vol. 23 207 No. 2 04 6 Closed-for evaluations of Fibonacci Lucas reciprocal sus with three factors Robert Frontczak Lesbank
More informationAN ESTIMATE FOR BOUNDED SOLUTIONS OF THE HERMITE HEAT EQUATION
Counications on Stochastic Analysis Vol. 6, No. 3 (1) 43-47 Serials Publications www.serialspublications.co AN ESTIMATE FOR BOUNDED SOLUTIONS OF THE HERMITE HEAT EQUATION BISHNU PRASAD DHUNGANA Abstract.
More informationTesting Properties of Collections of Distributions
Testing Properties of Collections of Distributions Reut Levi Dana Ron Ronitt Rubinfeld April 9, 0 Abstract We propose a fraework for studying property testing of collections of distributions, where the
More informationExact tensor completion with sum-of-squares
Proceedings of Machine Learning Research vol 65:1 54, 2017 30th Annual Conference on Learning Theory Exact tensor copletion with su-of-squares Aaron Potechin Institute for Advanced Study, Princeton David
More informationMODULAR HYPERBOLAS AND THE CONGRUENCE ax 1 x 2 x k + bx k+1 x k+2 x 2k c (mod m)
#A37 INTEGERS 8 (208) MODULAR HYPERBOLAS AND THE CONGRUENCE ax x 2 x k + bx k+ x k+2 x 2k c (od ) Anwar Ayyad Departent of Matheatics, Al Azhar University, Gaza Strip, Palestine anwarayyad@yahoo.co Todd
More informationA quantitative version of the commutator theorem for zero trace matrices
A quantitative version of the commutator theorem for zero trace matrices William B. Johnson, Narutaka Ozawa, Gideon Schechtman Abstract Let A be a m m complex matrix with zero trace and let ε > 0. Then
More informationMonochromatic images
CHAPTER 8 Monochroatic iages 1 The Central Sets Theore Lea 11 Let S,+) be a seigroup, e be an idepotent of βs and A e There is a set B A in e such that, for each v B, there is a set C A in e with v+c A
More informationInfinitely Many Trees Have Non-Sperner Subtree Poset
Order (2007 24:133 138 DOI 10.1007/s11083-007-9064-2 Infinitely Many Trees Have Non-Sperner Subtree Poset Andrew Vince Hua Wang Received: 3 April 2007 / Accepted: 25 August 2007 / Published online: 2 October
More informationA remark on a success rate model for DPA and CPA
A reark on a success rate odel for DPA and CPA A. Wieers, BSI Version 0.5 andreas.wieers@bsi.bund.de Septeber 5, 2018 Abstract The success rate is the ost coon evaluation etric for easuring the perforance
More informationApproximation by Piecewise Constants on Convex Partitions
Aroxiation by Piecewise Constants on Convex Partitions Oleg Davydov Noveber 4, 2011 Abstract We show that the saturation order of iecewise constant aroxiation in L nor on convex artitions with N cells
More informationPoornima University, For any query, contact us at: , 18
AIEEE//Math S. No Questions Solutions Q. Lets cos (α + β) = and let sin (α + β) = 5, where α, β π, then tan α = 5 (a) 56 (b) 9 (c) 7 (d) 5 6 Sol: (a) cos (α + β) = 5 tan (α + β) = tan α = than (α + β +
More informationE0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis
E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds
More informationOn Certain C-Test Words for Free Groups
Journal of Algebra 247, 509 540 2002 doi:10.1006 jabr.2001.9001, available online at http: www.idealibrary.co on On Certain C-Test Words for Free Groups Donghi Lee Departent of Matheatics, Uni ersity of
More informationCharacterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone
Characterization of the Line Coplexity of Cellular Autoata Generated by Polynoial Transition Rules Bertrand Stone Abstract Cellular autoata are discrete dynaical systes which consist of changing patterns
More informationSingularities of divisors on abelian varieties
Singularities of divisors on abelian varieties Olivier Debarre March 20, 2006 This is joint work with Christopher Hacon. We work over the coplex nubers. Let D be an effective divisor on an abelian variety
More informationOn the Inapproximability of Vertex Cover on k-partite k-uniform Hypergraphs
On the Inapproxiability of Vertex Cover on k-partite k-unifor Hypergraphs Venkatesan Guruswai and Rishi Saket Coputer Science Departent Carnegie Mellon University Pittsburgh, PA 1513. Abstract. Coputing
More informationReed-Muller Codes. m r inductive definition. Later, we shall explain how to construct Reed-Muller codes using the Kronecker product.
Coding Theory Massoud Malek Reed-Muller Codes An iportant class of linear block codes rich in algebraic and geoetric structure is the class of Reed-Muller codes, which includes the Extended Haing code.
More informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More informationNecessity of low effective dimension
Necessity of low effective diension Art B. Owen Stanford University October 2002, Orig: July 2002 Abstract Practitioners have long noticed that quasi-monte Carlo ethods work very well on functions that
More informationA PROOF OF A CONJECTURE OF MELHAM
A PROOF OF A CONJECTRE OF MELHAM EMRAH KILIC, ILKER AKKS, AND HELMT PRODINGER Abstract. In this paper, we consider Melha s conecture involving Fibonacci and Lucas nubers. After rewriting it in ters of
More informationTight Information-Theoretic Lower Bounds for Welfare Maximization in Combinatorial Auctions
Tight Inforation-Theoretic Lower Bounds for Welfare Maxiization in Cobinatorial Auctions Vahab Mirrokni Jan Vondrák Theory Group, Microsoft Dept of Matheatics Research Princeton University Redond, WA 9805
More informationPrinciples of Optimal Control Spring 2008
MIT OpenCourseWare http://ocw.it.edu 16.323 Principles of Optial Control Spring 2008 For inforation about citing these aterials or our Ters of Use, visit: http://ocw.it.edu/ters. 16.323 Lecture 10 Singular
More informationAsymptotics of weighted random sums
Asyptotics of weighted rando sus José Manuel Corcuera, David Nualart, Mark Podolskij arxiv:402.44v [ath.pr] 6 Feb 204 February 7, 204 Abstract In this paper we study the asyptotic behaviour of weighted
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationtime time δ jobs jobs
Approxiating Total Flow Tie on Parallel Machines Stefano Leonardi Danny Raz y Abstract We consider the proble of optiizing the total ow tie of a strea of jobs that are released over tie in a ultiprocessor
More information