A note on the realignment criterion
|
|
- Kellie McCoy
- 5 years ago
- Views:
Transcription
1 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, Aes, IA Departent of Applied Matheatics, The Hong Kong Polytechnic University, Hung Ho, Hong Kong E-ail: ckli@ath.w.edu, ytpoon@iastate.edu and rayond.sze@inet.polyu.edu.hk PACS nubers: a, Mn Abstract. For a quantu state in a bipartite syste represented as a density atrix, researchers used the realignent atrix and functions on its singular values to study the separability of the quantu state. We obtain bounds for eleentary syetric functions of singular values of realignent atrices. This answers soe open probles proposed by Lupo, Aniello, and Scardicchio. As a consequence, we show that the proposed schee by these authors for testing separability would not work if the two subsystes of the bipartite syste have the sae diension.
2 A note on the realignent criterion 1. Introduction Quantu entangleent was first proposed by Einstein, Podolsky, and Rosen [3] and Schrödinger [17] as a strange phenoenon of quantu echanics, criticizing the copleteness of the quantu theory. Nowadays, entangleent is not only regarded as a key for the interpretation of quantu echanics or as a ere scientific curiosity, but also as a resource for various applications, like quantu cryptography [4], quantu teleportation [1], and quantu coputation [14]. Suppose quantu states of two quantu systes are represented by density atrices (positive seidefinite atrices with trace 1) of sizes and n, respectively. States of their bipartite coposition syste are represented by n n density atrices. Such a state is separable if there are positive nubers p j suing up to 1, density atrices ρ 1 j, and n n density atrices ρ j such that ρ = k p j ρ 1 j ρ j. j=1 A state is entangled if it is not separable. In quantu inforation science, it is iportant to deterine the separability of a state. However, the proble of characterizing separable states is NP-hard [5]. Therefore, researchers focus on finding effective criterion to deterine whether a density atrix is separable or not. A siple and strong criterion for separability of density atrix is the coputable cross nor or realignent (CCNR) criterion. The nae CCNR coes fro the fact that this criterion has been discovered in two different fors, naely, by cross nors [15, 16] and by realignent of density atrices []. To describe the realignent criterion, let M N be the set of N N coplex atrices. D(, n) will denote the set of all n n density atrices and D s (, n) the set of separable density atrices in D(, n). For any X = [x ij ] M n, let vec (X) = (x 11, x 1,..., x 1n, x 1, x,..., x n,..., x n1, x n,..., x nn ). If ρ = [X rs ] 1 r,s D(, n) with X rs M n, then the realignent of ρ is the n atrix ρ R with rows vec (X 11 ), vec (X 1 ),..., vec (X 1 ), vec (X 1 ),..., vec (X ),..., vec (X 1 ),... vec (X ).
3 A note on the realignent criterion 3 [ ] X For exaple, if (, n) = (, 3) and ρ = 11 X 1 D(, 3) with X rs M 3, then X 1 X ρ R = vec (X 11 ) vec (X 1 ) vec (X 1 ) vec (X ) The realignent criterion asserts that if ρ D s (, n) then the su of the singular values of ρ R is at ost 1. Recall that the singular values of an M N atrix A are the nonnegative square roots of the k = in{m, N} largest eigenvalues of the atrix AA. For convenience of notation, we assue that n in the following discussion. For ρ D(, n), let s 1 s can be stated as. be the singular values of ρ R. The realignent criterion s s 1 for ρ D s (, n). In [10], Lupo, Aniello, and Scardicchio suggest further study of the syetric functions on the singular values of ρ R, in order to find conditions beyond the realignent criterion to identify entangleent. Let S(, n) = {(s 1,..., s ) : s 1 s are the singular values of ρ R, for soe ρ D(, n)} S s (, n) = {(s 1,..., s ) : s 1 s are the singular values of ρ R, for soe ρ D s (, n)}. For each 1 < l, define the l-th eleentary syetric function f l (s 1,..., s ) = Following [10], we define for each 1 < l, 1 i 1 < <i l Π l j=1s ij. B l (, n) = ax{f l (s) : s S(, n), s = (s 1,..., s ) with i=1 s i 1}, B l (, n) = ax{f l (s) : s S s (, n)}. The bounds B l (, n) and B l (, n) were introduced in [10] using different notations, naely, x l (d, D) and x l (d, D) with (d, D) = (, n ). It follows fro the definitions that if Bl (, n) > B l (, n), then there exists an entangled density atrix ρ such that the su of singular values of ρ R is at ost 1
4 A note on the realignent criterion 4 but f l (s 1,..., s ) > B l (, n). Therefore, the bound B l (, n) can be used to detect entangleent for which the realignent criterion fails. Nuerical estiations for these bounds were given for (, n) = (, ) and (, 3) in [10]. The nuerical results also suggest that B l (, ) = B l (, ) and B l (, 3) > B l (, 3). The authors of [10] raised the following two open probles in the search for criterion for entangleent beyond the realignent criterion: (P1) To deterine the actual values of the upper bounds B l (, n) and B l (, n). (P) To deterine if B l (, n) > B l (, n). In this paper, we study the singular values of ρ R for a density atrix ρ. We refine soe inequalities given in [10]. This leads to an explicit forula for B l (, n), for all n, except for 3 / < n < 3, that gives a partial solution to (P1). Furtherore, we show that B l (n, n) = B l (n, n) for all n and this iplies that the answer to (P) is negative if = n. We conclude this section with a reforulation of another siple and strong criterion for separability in ters of the singular values. Let X = [X rs ] 1 r,s D(, n) with X rs M n. The partial transpose of X with respect to the second subsyste is given by X T = [X t rs] 1 r,s, where X t rs is the transpose of X rs. The PPT criterion [1] states that if X D s (, n), then X T is positive sei-definite. For +n 5, PPT criterion is a necessary and sufficient condition for separability [7], i.e. X D s (, n) if and only if X T D(, n). For, n > 1 and +n > 5, the PPT criterion and the CCNR criterion are independent. Note that for X D(, n), X T is Heritian. So the singular values of X T are the absolute values of the eigenvalues of X T. Since the su of all eigenvalues of X T is equal to trace ( X T ) = trace (X) = 1, X T is positive sei-definite if and only if the su of the singular values of X T criterion shares a siilar for with the CCNR criterion.. Main results and their iplications is at ost 1, cf. [8, Corollary 1]. Thus the PPT In this section, we continue to use the notations introduced in Section 1 and assue that n. We will describe the results and their iplications. The proofs will be given in the next section. For any density atrix ρ, we obtain the following lower bound for the largest singular value for ρ R, the realigned atrix of ρ. Lea.1 Let s = (s 1,..., s ) S(, n). Then s 1 1 n.
5 A note on the realignent criterion 5 Recall that for two vectors x, y R N, x is ajorized by y, denotes by x y, if for all 1 k N, the su of the k largest entries of x is not larger than that of y, and the su of all entries of x is equal to that of y. A function f : R N R is Schur concave if f(y) f(x) whenever x y. Using Lea.1, we will show that if n 3, then the vector s in S(, n) always arojize a vector of the for (α, β,..., β). One can then apply the theory of ajorization and Schur concave functions (see [11]) to obtain the inequality f l (s) f l (α, β,..., β), as shown in Lea.. For 1 r N, ( ) N r will denote the binoial coefficient N!. r!(n r)! Lea. Suppose n 3 and s = (s 1,..., s ) S(, n) with i=1 s i 1. Let α = 1 n and β = 1 α 1 = n 1 n( 1). Then and for 1 < l, 1 {}}{ (α, β,..., β) 1 i=1 s (s 1,..., s ), i f l (s) f l (α, β,..., β) ( l ) ( ) l 1. Furtherore, (a) f l (s) = f l (α, β,..., β) if and only if s = (α, β,..., β); (b) f l (α, β,..., β) = ( ) ( 1 ) l if and only if n = 3. l It follows fro Lea. that B l (, n) ( ) ( 1 ) l for all n 3 and the equality holds if and only if n = 3, which has been shown in [10, Proposition 4]. The following result gives an explicit forula for B l (, n) for all n, except for 3 / < n < 3. This provides a partial solution to proble (P1). Theore.3 Suppose n 3 /. Then for 1 < l, l B l (, n) = f l (α, β,..., β), with α = 1 n and β = 1 α 1. If n 3, then B l (, n) = f l (1/,..., 1/ ) = ( ) ( 1 ) l. l
6 A note on the realignent criterion 6 Theore.3 gives the values of B l (, n) for all n, except for 3 / < n < 3. In particular, it holds for all n which is divisible by. In application, both n and are powers of. Therefore, n is always divisible by and B l (, n) is given by the above theore. When = n, following our proof of Theore.3 in the next section, one actually gives explicit forulas for B l (n, n) and B l (n, n). Theore.4 For any n and 1 l n, B l (n, n) = B l (n, n) = f l (α, β,..., β) with α = 1 n and β = n 1 n(n 1). Theore.4 provides partial solutions to both probles (P1) and (P). In particular, it gives a negative answer to proble (P) for the case when = n. As a result, if = n, the upper bounds of the eleentary syetric functions of realignent atrices cannot be used to derive new conditions for detecting separability beyond the realignent criterion. 3. Proofs Proof of Lea.1. Define x = (x 1,..., x ) t, y = (y 1,..., y n ) t by { 1 if i = k( + 1) + 1 for soe 0 k 1, x i = 0 otherwise, and { 1 if j = k(n + 1) + 1 for soe 0 k n 1, y j = 0 otherwise. Then 1 x and 1 n y are unit vectors and 1 x t ρ R 1 y = trace ρ = 1. n n n Because { } s 1 = ax u t ρ R v : u C and v C n are unit vectors, we conclude that s 1 1 n. Proof of Lea.. Note that n 3 n 4 n 1 1 β α.
7 A note on the realignent criterion 7 Suppose s = (s 1,..., s ) S(, n) with s = i=1 s i 1. Let s = (1/s) s. Then s 1 s 1 α. Therefore, (1/,..., 1/ ) (α, β,..., β) s. Since f l is strictly concave [11], we have f l (s) f l ( s) f l (α, β,..., β) f l (1/,..., 1/ ) = ( l ) ( ) l 1, and the equality f l (s) = f l (α, β,..., β) holds if and only if s = (α, β,..., β). proves (a). Assertion (b) follows readily fro (a). This Proof of Theore.3. We first consider the sipler case when n 3. It suffices to construct ρ D(, n) for which ρ R has singular values 1/,..., 1/. Suppose {E 1,1,..., E, } is the standard basis of atrices. For 1 k, l, let F k,l = (E k,l I ) O n 3. Then ρ = 1 E 3 k,l F k,l is an n n density atrix k, l=1 while ρ R has singular values 1/,..., 1/. Next, suppose n 3 /. By Lea., we have B l (, n) f l (α, β,..., β) for all 1 l. We will construct ρ D(, n) for which ρ R has singular values α, β,..., β. Suppose n = q + r with 0 r <. For 1 k, l, let F k,l = (E k,l I q ) O r. Define and ρ 1 = k, l=1 E k,l F k,l, ρ = I (I q O r ), and ρ 3 = I (O q I r ) ρ = s 1 ρ 1 + s ρ + s 3 ρ 3 with s 1 = β q, s = α β q, and s 3 = α. Denote J,n by the n atrix with all entries equal to one. Then the realigned atrix ρ R is (under perutation of rows and coluns) given by A = q ters {}}{ s 1 I + s J, s 1 I + s J, s 3 J,r O,( )q O O O s 1 I s 1 I }{{} q ters O. Note that AA = ( qs 1I + (qs 1 s + qs + rs 3)J, ) qs 1 I.
8 A note on the realignent criterion 8 Since J, has only one non-zero eigenvalue, a atrix of the for µi + νj, has eigenvalues µ + ν and µ with ultiplicity 1 and 1, respectively. As a result AA has one eigenvalue equal to qs 1 + (qs 1 s + qs + rs 3) = α 4 ( q + r) = α and 1 eigenvalues equal to qs 1 = β. Hence, taking square roots, we see that the atrix ρ R has the desired singular values α, β,..., β. It reains to show that ρ is a density atrix. Notice that trace (ρ) = s 1 (q) + s ( q) + s 3 (r) = α (q + r) = 1. Since ρ 1, ρ, and ρ 3 are all positive sei-definite and both s 1 and s 3 are nonnegative, ρ is a density atrix if s is nonnegative. Notice that s 0 1 n n 1 n q( 1) 1 n n q q. For a fixed, let f(q, r) = (q + r) q (q + r) q for q 1 and 0 r 1. Then f q = q r + q 3/ r q q(q + r) f > 0 and r = 1 1 q q q q + r > 0 for all q 1 and 0 r 1. Therefore, (a) f(q, r) f(, 1) for all 1 q and r 1; and (b) f( 1, r) f( 1, /) for all r /. So, it suffices to prove that (1) f(, 1) 1 and () f( 1, /) 1. To prove (1), since, we have 4 ( ) (( ) + 1) = > 0.
9 A note on the realignent criterion 9 (( ) + 1) It follows that < and hence f(, 1) = To prove (), since 1 (( 1) + /) 1 and (( 1) + /) ( 1) (( ) + 1) (( ) + 1) ( ) 1. ( 1 ), i.e., ( 1 1 ), we have = 1 + = ( 1 1 ) + 1, ( ) 1 1 = 1 ( 1 + ). 1 Consequently, f( 1, /) = (( 1) + /) 1 ( 1 ) + (( 1) + /) ( 1) 1 1 ( 1 + ) = 1. 1 Reark The sallest values of, n which do not satisfy the conditions in Theore.3 are = 3 and n = 6. For these values, the proof in Theore.3 does not work because s < 0. In this case, the question about the exact value of B l (, n) is still open. Proof of Theore.4. Suppose = n. Then the atrix ρ constructed in the proof of Theore.3 has the for ρ = 1 ( In + xx t) n(n + 1) where x i = { 1 if i = k(n + 1) + 1 for soe 0 k n 1, 0 otherwise. It follows fro [13] that ρ is separable.
10 A note on the realignent criterion Conclusion The ain goal of this paper is to investigate the open probles (P1) and (P) proposed in [10] in the search for a new criterion for separability. We study the singular values of the realignent of density atrices and obtain new bounds on the eleentary syetric functions. The results are applied to find explicit forulas for B l (, n), for all n, except 3 / < n < 3 and B l (n, n). This provides a partial answer to the open proble (P1). Furtherore, we show that B l (n, n) = B l (n, n) for all n so that one cannot use B l (, n) to differentiate separable atrices fro density atrices whose realignent atrix has trace nor at ost 1 when = n. This gives a negative answer to proble (P) when = n. For n, nuerical results in [10] suggested that B l (, n) > B l (, n). If this strict inequality holds, then we would have a new criterion for separability. Our explicit forula for B l (, n) will be useful in this study. Acknowledgents The research was done when Li was a 011 Fulbright Fellow at the Hong Kong University of Science and Technology. He is a Shanxi Hundred Talent Scholar of the Taiyuan University of Science and Technology, and is an honorary professor of the University of Hong Kong, and the Shanghai University. Research of the first two authors were supported in part by USA NSF. Research of the first and the third authors were supported in part by a HK RGC grant. References [1] C.H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres and W.K. Wootters 1993 Teleporting an unknown quantu state via dual classical and Einstein-Podolsky-Rosen channels Phys. Rev. Lett [] K. Chen and L.A. Wu 003 A atrix realignent ethod for recognizing entangleent, Quantu Inf. Coput [3] A. Einstein, B. Podolsky and N. Rosen 1935 Can quantu-echanical description of physical reality be considered coplete? Phys. Rev [4] A.K. Ekert 1991 Quantu cryptography based on Bell s theore, Phys. Rev. Lett [5] L. Gurvits 003 Classical deterinistic coplexity of Edonds proble and quantu entangleent, Proceedings of the 35th ACM Syposiu on Theory of Coputing (New York: ACM Press) p 10 [6] R. A. Horn and C. R. Johnson 1990 Matrix Analysis (Cabridge, UK: Cabridge University Press). [7] M. Horodecki, P. Horodecki and R. Horodecki 1996 Separability of ixed states: necessary and sufficient conditions, Phys. Lett. A 3 1
11 A note on the realignent criterion 11 [8] M. Horodecki, P. Horodecki and R. Horodecki 006 Separability of ixed states: Linear Contractions and Perutation Criteria, Open Systes & Inforation Dynaics [9] C. Lupo and P. Aniello 009 On the relation between Schidt coefficients and entangleent Open Systes & Inforation Dynaics [10] C. Lupo, P. Aniello and A. Scardicchio 008 Bipartite quantu systes: on the realignent criterion and beyond J. Phys. A: Math. Theor [11] A.W. Marshall and I. Olkin 1979 Inequalities: Theory of Majorization and its Applications, Matheatics in Science and Engineering (New York-London: Acadeic Press) [1] A. Peres 1996 Separability Criterion for Density Matrices, Phys. Rev. Lett [13] A.O. Pittenger and M. H. Rubin 000 Note on separability of the Werner states in arbitrary diensions Optics Counications 179 (000) 447 [14] R. Raussendorf and H.J. Briegel 001 A one-way quantu coputer Phys. Rev. Lett [15] O. Rudolph 000 A separability criterion for density operators J. Phys. A: Math. Gen [16] O. Rudolph 005 Further results on the cross nor criterion for separability Quantu Inf. Process [17] E. Schrödinger 1935 Die gegenwärtige Situation in der Quantenechanik, Die Naturwissenschaften 3 807, 83, 844
ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE
ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE CHRISTOPHER J. HILLAR Abstract. A long-standing conjecture asserts that the polynoial p(t = Tr(A + tb ] has nonnegative coefficients whenever is
More 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 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 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 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 informationThe Hilbert Schmidt version of the commutator theorem for zero trace matrices
The Hilbert Schidt version of the coutator theore for zero trace atrices Oer Angel Gideon Schechtan March 205 Abstract Let A be a coplex atrix with zero trace. Then there are atrices B and C such that
More informationA SIMPLE METHOD FOR FINDING THE INVERSE MATRIX OF VANDERMONDE MATRIX. E. A. Rawashdeh. 1. Introduction
MATEMATIČKI VESNIK MATEMATIQKI VESNIK Corrected proof Available online 40708 research paper originalni nauqni rad A SIMPLE METHOD FOR FINDING THE INVERSE MATRIX OF VANDERMONDE MATRIX E A Rawashdeh Abstract
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 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 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 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 informationThe Transactional Nature of Quantum Information
The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.
More informationNew Classes of Positive Semi-Definite Hankel Tensors
Miniax Theory and its Applications Volue 017, No., 1 xxx New Classes of Positive Sei-Definite Hankel Tensors Qun Wang Dept. of Applied Matheatics, The Hong Kong Polytechnic University, Hung Ho, Kowloon,
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 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 informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationOn the Bell- Kochen -Specker paradox
On the Bell- Kochen -Specker paradox Koji Nagata and Tadao Nakaura Departent of Physics, Korea Advanced Institute of Science and Technology, Daejeon, Korea E-ail: ko_i_na@yahoo.co.jp Departent of Inforation
More informationEntangling characterization of (SWAP) 1/m and Controlled unitary gates
Entangling characterization of (SWAP) / and Controlled unitary gates S.Balakrishnan and R.Sankaranarayanan Departent of Physics, National Institute of Technology, Tiruchirappalli 65, India. We study the
More 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 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 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 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 informationOn PPT States in C K C M C N Composite Quantum Systems
Commun. Theor. Phys. (Beijing, China) 42 (2004) pp. 25 222 c International Academic Publishers Vol. 42, No. 2, August 5, 2004 On PPT States in C K C M C N Composite Quantum Systems WANG Xiao-Hong, FEI
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 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 informationA new criterion and a special class of k-positive maps
A new criterion and a special class of k-positive maps Dedicated to Professor Leiba Rodman. Jinchuan Hou Department of Mathematics, Taiyuan University of Technology, Taiyuan, 030024, China. jinchuanhou@aliyun.com
More informationNumerically repeated support splitting and merging phenomena in a porous media equation with strong absorption. Kenji Tomoeda
Journal of Math-for-Industry, Vol. 3 (C-), pp. Nuerically repeated support splitting and erging phenoena in a porous edia equation with strong absorption To the eory of y friend Professor Nakaki. Kenji
More 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 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 informationThe Fundamental Basis Theorem of Geometry from an algebraic point of view
Journal of Physics: Conference Series PAPER OPEN ACCESS The Fundaental Basis Theore of Geoetry fro an algebraic point of view To cite this article: U Bekbaev 2017 J Phys: Conf Ser 819 012013 View the article
More 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 informationEXPLICIT CONGRUENCES FOR EULER POLYNOMIALS
EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit
More informationDivisibility of Polynomials over Finite Fields and Combinatorial Applications
Designs, Codes and Cryptography anuscript No. (will be inserted by the editor) Divisibility of Polynoials over Finite Fields and Cobinatorial Applications Daniel Panario Olga Sosnovski Brett Stevens Qiang
More informationNew upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.
New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More information}, (n 0) be a finite irreducible, discrete time MC. Let S = {1, 2,, m} be its state space. Let P = [p ij. ] be the transition matrix of the MC.
Abstract Questions are posed regarding the influence that the colun sus of the transition probabilities of a stochastic atrix (with row sus all one) have on the stationary distribution, the ean first passage
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS
Palestine Journal of Matheatics Vol 4) 05), 70 76 Palestine Polytechnic University-PPU 05 ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS Julius Fergy T Rabago Counicated by
More 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 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 informationarxiv: v1 [math.nt] 14 Sep 2014
ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row
More informationCHI-KWONG LI AND YIU-TUNG POON. Dedicated to Professor John Conway on the occasion of his retirement.
INTERPOLATION BY COMPLETELY POSITIVE MAPS CHI-KWONG LI AND YIU-TUNG POON Dedicated to Professor John Conway on the occasion of his retirement. Abstract. Given commuting families of Hermitian matrices {A
More informationGeneralized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.
Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,
More informationDistributed Subgradient Methods for Multi-agent Optimization
1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions
More 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 informationSpectral inequalities and equalities involving products of matrices
Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department
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 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 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 informationON REGULARITY, TRANSITIVITY, AND ERGODIC PRINCIPLE FOR QUADRATIC STOCHASTIC VOLTERRA OPERATORS MANSOOR SABUROV
ON REGULARITY TRANSITIVITY AND ERGODIC PRINCIPLE FOR QUADRATIC STOCHASTIC VOLTERRA OPERATORS MANSOOR SABUROV Departent of Coputational & Theoretical Sciences Faculty of Science International Islaic University
More 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 informationResearch Article Perturbations of Polynomials with Operator Coefficients
Coplex Analysis Volue 2013, Article ID 801382, 5 pages http://dx.doi.org/10.1155/2013/801382 Research Article Perturbations of Polynoials with Operator Coefficients Michael Gil Departent of Matheatics,
More informationRECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE
Proceedings of ICIPE rd International Conference on Inverse Probles in Engineering: Theory and Practice June -8, 999, Port Ludlow, Washington, USA : RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS
More 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 informationA Fast Algorithm for the Spread of HIV in a System of Prisons
A Fast Algorith for the Spread of HIV in a Syste of Prisons Wai-Ki Ching Yang Cong Tuen-Wai Ng Allen H Tai Abstract In this paper, we propose a continuous tie odel for odeling the spread of HIV in a network
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 informationRESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS
BIT Nuerical Matheatics 43: 459 466, 2003. 2003 Kluwer Acadeic Publishers. Printed in The Netherlands 459 RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS V. SIMONCINI Dipartiento di
More informationAn EGZ generalization for 5 colors
An EGZ generalization for 5 colors David Grynkiewicz and Andrew Schultz July 6, 00 Abstract Let g zs(, k) (g zs(, k + 1)) be the inial integer such that any coloring of the integers fro U U k 1,..., g
More informationComplex Quadratic Optimization and Semidefinite Programming
Coplex Quadratic Optiization and Seidefinite Prograing Shuzhong Zhang Yongwei Huang August 4 Abstract In this paper we study the approxiation algoriths for a class of discrete quadratic optiization probles
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 informationarxiv: v2 [math.co] 8 Mar 2018
Restricted lonesu atrices arxiv:1711.10178v2 [ath.co] 8 Mar 2018 Beáta Bényi Faculty of Water Sciences, National University of Public Service, Budapest beata.benyi@gail.co March 9, 2018 Keywords: enueration,
More 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 Johns Hopkins University Press is collaborating with JSTOR to digitize, preserve and extend access to American Journal of Mathematics.
A General Schwarz Lea for Kahler Manifolds Author(s): Shing-Tung Yau Reviewed work(s): Source: Aerican Journal of Matheatics, Vol. 100, No. 1 (Feb., 1978), pp. 197-203 Published by: The Johns Hopkins University
More informationWhat are primes in graphs and how many of them have a given length?
What are pries in graphs an how any of the have a given length? Aurey Terras Math. Club Oct. 30, 2008 A graph is a bunch of vertices connecte by eges. The siplest exaple for the talk is the tetraheron
More informationGeneralized Interlacing Inequalities
Generalized Interlacing Inequalities Chi-Kwong Li, Yiu-Tung Poon, and Nung-Sing Sze In memory of Professor Ky Fan Abstract We discuss some applications of generalized interlacing inequalities of Ky Fan
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More 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 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 informationarxiv: v1 [cs.ds] 29 Jan 2012
A parallel approxiation algorith for ixed packing covering seidefinite progras arxiv:1201.6090v1 [cs.ds] 29 Jan 2012 Rahul Jain National U. Singapore January 28, 2012 Abstract Penghui Yao National U. Singapore
More informationHybrid System Identification: An SDP Approach
49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The
More informationLinear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions
Linear recurrences and asyptotic behavior of exponential sus of syetric boolean functions Francis N. Castro Departent of Matheatics University of Puerto Rico, San Juan, PR 00931 francis.castro@upr.edu
More informationResearch Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials
Discrete Dynaics in Nature and Society Volue 202, Article ID 927953, pages doi:055/202/927953 Research Article Soe Forulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynoials Yuan He and
More informationGeneralized binomial expansion on Lorentz cones
J. Math. Anal. Appl. 79 003 66 75 www.elsevier.co/locate/jaa Generalized binoial expansion on Lorentz cones Honging Ding Departent of Matheatics and Matheatical Coputer Science, University of St. Louis,
More informationCompleteness of Bethe s states for generalized XXZ model, II.
Copleteness of Bethe s states for generalized XXZ odel, II Anatol N Kirillov and Nadejda A Liskova Steklov Matheatical Institute, Fontanka 27, StPetersburg, 90, Russia Abstract For any rational nuber 2
More informationCombinatorial Primality Test
Cobinatorial Priality Test Maheswara Rao Valluri School of Matheatical and Coputing Sciences Fiji National University, Derrick Capus, Suva, Fiji E-ail: aheswara.valluri@fnu.ac.fj Abstract This paper provides
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 informationOn the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation
journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation
More informationCharacter analysis on linear elementary algebra with max-plus operation
Available online at www.worldscientificnews.co WSN 100 (2018) 110-123 EISSN 2392-2192 Character analysis on linear eleentary algebra with ax-plus operation ABSTRACT Kalfin 1, Jufra 2, Nora Muhtar 2, Subiyanto
More informationAsynchronous Gossip Algorithms for Stochastic Optimization
Asynchronous Gossip Algoriths for Stochastic Optiization S. Sundhar Ra ECE Dept. University of Illinois Urbana, IL 680 ssrini@illinois.edu A. Nedić IESE Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu
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 informationPoly-Bernoulli Numbers and Eulerian Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441
More informationDescent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA,
Descent polynoials arxiv:1710.11033v2 [ath.co] 13 Nov 2017 Alexander Diaz-Lopez Departent of Matheatics and Statistics, Villanova University, 800 Lancaster Avenue, Villanova, PA 19085, USA, alexander.diaz-lopez@villanova.edu
More 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 informationTHE 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 informationMA304 Differential Geometry
MA304 Differential Geoetry Hoework 4 solutions Spring 018 6% of the final ark 1. The paraeterised curve αt = t cosh t for t R is called the catenary. Find the curvature of αt. Solution. Fro hoework question
More informationAn l 1 Regularized Method for Numerical Differentiation Using Empirical Eigenfunctions
Journal of Matheatical Research with Applications Jul., 207, Vol. 37, No. 4, pp. 496 504 DOI:0.3770/j.issn:2095-265.207.04.0 Http://jre.dlut.edu.cn An l Regularized Method for Nuerical Differentiation
More informationPolynomial Division By Convolution
Applied Matheatics E-Notes, (0), 9 c ISSN 0-0 Available free at irror sites of http://wwwathnthuedutw/aen/ Polynoial Division By Convolution Feng Cheng Chang y Received 9 March 0 Abstract The division
More informationSimple Stability Conditions of Linear Discrete Time Systems with Multiple Delay
SERBIA JOURAL OF ELECRICAL EGIEERIG Vol. 7, o., May, 69-79 UDK: 68.5..37:57.938 Siple Stability Conditions of Linear Discrete ie Systes with Multiple Delay Sreten B. Stoanovic, Dragutin LJ. Debelovic Abstract:
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 informationA Generalized Permanent Estimator and its Application in Computing Multi- Homogeneous Bézout Number
Research Journal of Applied Sciences, Engineering and Technology 4(23): 5206-52, 202 ISSN: 2040-7467 Maxwell Scientific Organization, 202 Subitted: April 25, 202 Accepted: May 3, 202 Published: Deceber
More informationConstrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008
LIDS Report 2779 1 Constrained Consensus and Optiization in Multi-Agent Networks arxiv:0802.3922v2 [ath.oc] 17 Dec 2008 Angelia Nedić, Asuan Ozdaglar, and Pablo A. Parrilo February 15, 2013 Abstract We
More informationOn the summations involving Wigner rotation matrix elements
Journal of Matheatical Cheistry 24 (1998 123 132 123 On the suations involving Wigner rotation atrix eleents Shan-Tao Lai a, Pancracio Palting b, Ying-Nan Chiu b and Harris J. Silverstone c a Vitreous
More informationLATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS.
i LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS. C. A. CHURCH, Jr. and H. W. GOULD, W. Virginia University, Morgantown, W. V a. In this paper we give
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More informationarxiv:math/ v1 [math.nt] 15 Jul 2003
arxiv:ath/0307203v [ath.nt] 5 Jul 2003 A quantitative version of the Roth-Ridout theore Toohiro Yaada, 606-8502, Faculty of Science, Kyoto University, Kitashirakawaoiwakecho, Sakyoku, Kyoto-City, Kyoto,
More informationJordan Journal of Physics
Volue 5, Nuber 3, 212. pp. 113-118 ARTILE Jordan Journal of Physics Networks of Identical apacitors with a Substitutional apacitor Departent of Physics, Al-Hussein Bin Talal University, Ma an, 2, 71111,
More information3.3 Variational Characterization of Singular Values
3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J MATRIX ANAL APPL Vol 31, No 4, pp 1848 1872 c 21 Society for Industrial and Applied Matheatics STOCHASTIC GALERKIN MATRICES OLIVER G ERNST AND ELISABETH ULLMANN Abstract We investigate the structural,
More information