OPTIMAL DESIGNS FOR COMPLETE INTERACTION. By Rainer Schwabe. Freie Universitat Berlin

Size: px
Start display at page:

Download "OPTIMAL DESIGNS FOR COMPLETE INTERACTION. By Rainer Schwabe. Freie Universitat Berlin"

Transcription

1 1 OPTIMAL DESIGNS FOR COMPLETE INTERACTION STRUCTURES By Rainer Schwabe Freie Universitat Berlin In linear models with complete interaction structures product type designs are shown to be q -optimal for the maximal interactions, 0 q 1, and D- optimal simultaneously for the whole parameter vector and for testing against any complete submodel. 1. Introduction. We consider a general multi-factor linear model E(X(t 1 ; : : : ; t K )) = H (t 1 ; : : : ; t K ) = P N H2H k2h f k (t k ) T H ; t k 2 T k, k = 1; : : : ; K, with interaction structure H P(f1; : : : ; Kg) := fh; H f1; : : : ; Kgg. Throughout this paper we assume that the interaction structure H is complete, i. e. each interaction H 2 H comes with all its lower order interactions: Definition 1.1. H is complete if P(H) H for every H 2 H. Models of these type include product models, H = P(f1; : : : ; Kg), considered by Hoel (1965), additive models, H = f;; f1g; : : : ; fkgg, (see e. g. Schwabe and Wierich, 1995) and complete M-factor interaction models, H = fh; H f1; : : : ; Kg; jhj Mg, (see e. g. Schwabe, 1995). Particular examples will be given in section 4. The aim of the present paper is to establish that, in the setting of approximate designs (see e. g. Kiefer, 1974), product type designs are simultaneously optimal for higher order interactions if their components are optimal in the corresponding marginal models k (t k ) = 0 + f k (t k ) T k, t k 2 T k. Definition 1.2. H 2 H is maximal in H if H 0 62 H for every H 0 H, H 0 6= H. We will show that the product type design = N K k is q-optimal for maximal interactions H, i. e. minimizes the q-\norm" of the eigenvalues of the covariance matrix of the least squares estimator ^ H of H, if its components k are q -optimal for k in the marginal models, 0 q 1. Note that the q -criteria include the common A-optimality, q = 1, and the D- and E-optimality as limiting cases, q! 0 and q! 1, respectively. Moreover, for the D-criterion, the product type The research was supported by grant Ku719/2-1 of the Deutsche Forschungsgemeinschaft. AMS 1991 subject classication. 62K05. Key words and phrases. Product type designs, multi-factor linear models, q -optimality, D- optimality, complete interactions, maximal interaction. Abbreviated title. Designs for interactions.

2 2 rainer schwabe design will be shown to be simultaneously optimal for the whole parameter vector = ( H ) H2H as well as for testing every complete model H against every complete submodel H, H H. 2. Notations and auxiliary results. We recall that a subset H = L H of parameters is identiable under a design in a linear model (t) = a(t) T if the rows of the selection matrix L H are contained in the space spanned by the regression function a evaluated at the support points t of or, equivalently, spanned by the columns of the information matrix I() = R aa T d. In the present setting the regression functions considered are a H (t 1 ; :::; t K ) = ( N k2h f k (t k )) H2H. If H is identiable the corresponding covariance matrix is given by C( H ; ) = L H I()? L T. For larger subsets H H = ( H) 0 H2H 0 we have L H 0 = diag(l H ) H2H 0 and C( H 0; ) = L H 0I()? L T if each H H, H 2 H 0, is identiable under. In case H 0 = H 0 we write C() = C(; ), for short. In the corresponding marginal models the parameters are (k) = ( 0 ; k T ) T and the information matrices I k ( k ) = R a k a T d k k where a k = (1; f T k )T. The marginal covariance matrices for (k) and k = L k (k) are denoted by C k ( k ) = I k ( k )?1 and C k ( k ; k ) = L k C( k )L T k respectively. Note that k is identiable under k i I k ( k ) is regular. As usual max and tr denote the largest eigenvalue and the trace of a matrix. For every pair of designs H on k2h T k and H on k62h T k the resulting product design on K T k is denoted by H ( H ; H ). Lemma 2.1. Let (t) = f 0 (t) T 0 + f 1 (t) T 1 + f 2 (t) T 2 and let 0 (t) = f 0 (t) T 0 + f 1 (t) T 1 be a submodel of. (i) If 1 is identiable under in, then C 0 ( 1 ; ) C( 1 ; ). (ii) If 1 and 2 are identiable under in, then det C( 1 ; 2 ; ) = det C 0 ( 1 ; ) det C( 2 ; ). Proof. (i) is a common renement statement (see e. g. Kunert, 1983). For (ii) we partition the information matrix! I() = I 0() I 12 I T 12 I 2 in according to the submodel, and the covariance matrix! C C( 1 ; 2 ; ) = 1 C 12 C12 T C 2 according to the components 1 and 2, C j = C( j ; ). Further let L be the selection matrix for 1 = L( T 0 ; T 1 ) T in 0. By the formula for generalized inverses of partitioned matrices C 1 = L(I 0 ()? + I 0 ()? I 12 C 2 I T 12I 0 ()? )L T C 12 = LI 0 ()? I 12 C 2

3 optimal designs for complete interaction structures 3 and hence C 1? C 12 C?1 2 C T 12 = LI 0 ()? L T = C 0 ( 1 ; ): The result now follows from det C( 1 ; 2 ; ) = det(c 1? C 12 C?1 2 C T 12) det C 2. 2 Remark 2.1. If f 0 1 (or f 0 0), then det C() = det C 0 () det C( 2 ; ) from Lemma Optimality of product type designs. The rst result deals with the optimality of product type designs for the highest interaction in total interactions models Theorem 3.1. Let H = P and let H = f1; : : : ; Kg. If k is q-optimal for k in the kth marginal model, k = 1; : : : ; K, then = N K k is q-optimal for H. Proof. Note that H = L where L = N K L k and k = L k (k). Hence the covariance matrix C( H ; ) = N K C k ( k ; k) factorizes. The q -optimality can now be obtained by means of the appropriate equivalence theorems. For q < 1 see Rafaj lowicz and Myszka (1988). For the E-citerion (q = 1) a more implicit equivalence theorem (Pukelsheim, 1993, p. 182) has to be used: k is E-optimal for k i there exists a non-negative denite, symmetric matrix M k, tr M k = 1, such that a k (t k ) T C k ( k )LT k C k ( k ; k )?1 M k C k ( k ; k )?1 L k C k ( k )a k(t k ) 1= max (C k (; k )) for all t k 2 T k. Let M = N K M k. Then M is non-negative denite, symmetric, tr M = 1, and a(t) T C( )L T C( H ; )?1 MC( H ; )?1 LC( )a(t) 1= max (C( H ; )): Thus the equivalence theorem proves the E-optimality of for H. 2 Note that H = f1; : : : ; Kg is the only maximal element in H = P. For general, complete interaction structures H a maximal interaction H will be a proper subset of f1; : : : ; Kg. Then, conditions are only required on those factors k belonging to H. Theorem 3.2. Let H be complete, and let H be maximal in H. If k is q- optimal for k in the kth marginal model, k 2 H, then = H ( N k2h k ; H) is q -optimal for H, for every design H on k62h T k. Proof. Consider the model P(H) of total interactions in the factors involved in H. Then P(H) can be regarded as a submodel of H. Moreover, as H is maximal, C P(H) ( H ; N k2h k ) = C( H; );

4 4 rainer schwabe and by Theorem 3.1 the design N k2h k is q-optimal for H in P(H). Hence, the result follows by a renement argument (cf Lemma 2.1 (i)). 2 The main result on q?optimality is the following extension to more than one maximal interaction: Theorem 3.3. Let H be complete, H 0 fh; H maximal in Hg. If k is q -optimal for k in the kth marginal model, k 2 H(H 0 ) := S 0 H2H H; then = H(H0 )( N k2h(h 0 ) ; k H(H )) is 0 q -optimal for H 0, for every design H(H0 ) on k62h(h0 )T k. Proof. The key observation is that the covariance matrix is block diagonal: C( H 0; ) = diag(c( H ; )) H2H 0 because each H 2 H 0 is maximal. By Fan's (1954) result on the eigenvalues of block matrices the q -optimality of can be deduced for H 0 from the q -optimality of k for every H, H 2 H 0, established in Theorem For additive models, H = f;; f1g; : : : ; fkgg all direct eects fkg are maximal, and we revover a special case of Theorem 3.2 by Schwabe (1994). As indicated there no general results can be expected for q -optimality, q > 0, of product type designs if larger parts of the parameter vector are of interest including interactions which are not maximal. However, for D-optimality (q = 0) a stronger result can be obtained. Theorem 3.4. Let H be complete, and let H 0 H, HnH 0 complete. If k is D- optimal in the kth marginal model, k 2 H(H 0 ); then = H(H0 )( N k2h(h 0 ) ; k H(H )) 0 is D-optimal for H 0, for every design H(H0 ) on k62h(h 0 )T k. Proof. First note that k is D-optimal i k is D-optimal for k (see e. g. Schwabe and Wierich, 1995, Lemma 6). Hence is D-optimal for any set of maximal interactions by Theorem 3.3. The proof will be completed by a nite induction: Therefore assume that the theorem is valid for H 00. Let H be maximal in H n H 00. Then it suces to show that the theorem is also valid for H 00 [ fhg, because every set H 0 can be generated successively by adding relatively maximal interactions. In fact, by Lemma 2.1 (ii), det C( H 00 [fhg; ) = det C( H 00; ) det C HnH 00( H ; ) det C( H 00; ) det C HnH 00( H ; ); where the inequality follows by Theorem 3.2 and the assumption. 2 In particular, for H 0 = H, the design N K k is D-optimal if each of its components k is D-optimal in the corresponding marginal model. Finally, note that

5 optimal designs for complete interaction structures 5 the full product type design N K k is D-optimal for H 0 simultaneously in H and H 0 H when H and H n H 0 are complete. 4. Examples Multilinear regression on [?1; 1] K. The full 2 K factorial design is simultaneously q -optimal for every set of maximal interactions in every complete interactions model H (t 1 ; : : : ; t K ) = P H2H H Qk2H t k : Moreover, the 2 K factorial is D-optimal for the whole parameter vector as well as for any set H 0 of higher interactions, such that the remaining interaction structure H n H 0 is complete. In particular, in the model of complete M-factor interactions the 2 K factorial is the unique D-optimal design (the unique D-optimal design for all interactions of m up to M factors, i. e. H 0 = fh; H f1; : : : ; Kg; m jhj Mg; the unique q -optimal design for all M-factor interactions) if 2M K. In case 2M < K also 2 d fractions may be optimal, 2M d < K. For example, in the additive model (M = 1) there exist optimal 2 d fractional factorials for d log 2 (K + 1), K 3, constructed from Hadamard matrices K-way layout. Every complete K-way layout H (i(1); : : : ; i(k)) = P H2H (H) H(i(1);:::;i(K)) ; i(k) = 1; : : : ; I k, k = 1; : : : ; K, where H(i(1); : : : ; i(k)) = (i(k 1 ); : : : ; i(k jhj )) is the projection of (i(1); : : : ; i(k)) onto the components k 1 ; : : : ; k jhj of H, can be reparametrized to the form considered above, if suitable identiability conditions P i(k1 );:::;i(k jhj) = 0, H 2 H, are imposed. (Here the summation is to be considered over every set of jhj? 1 components). Hence the equireplicated design is D-optimal for testing every model with complete interaction structure H against each submodel with complete interactions structure H n H Qualitative and quantitative factors. Following Kurotschka (1988) those models are of particular interest in applications which contain both kinds of factors: qualitative ones which may vary only over a nite number of levels (see e. g. 4.2) and quantitative ones which vary over a whole continuum of levels (see e. g. 4.1). To be more specic, in a two-way layout with additional straight line regression on [?1; 1] the model may be either additive or may have total interactions (i; j; t) = (1) i + (2) j + t (i; j; t) = ij + ij t or, as indermediate models, the additive model is supplemented by some or all of the two-factor interactions ij, (1) i t and (2) j t. For all those 9 dierent models the

6 6 rainer schwabe equireplicated design on f1; : : : ; Ig f1; : : : Jg f?1; 1g is D-optimal for the whole parameter vector (under suitable identiability conditions) as well as for estimating (testing) the higher interaction terms. REFERENCES Fan, K. (1954). Inequalities for eigenvalues of Hermitian matrices. Nat. Bur. Standards, Appl. Math. Ser {139. Hoel, P. G. (1965). Minimax designs in two dimensional regression. Ann. Math. Statist {1106. Kiefer, J. (1974). General equivalence theory for optimum designs (approximate theory). Ann. Statist {879. Kunert, J. (1983). Optimal design and renement of the linear model with applications to repeated measurement designs. Ann. Statist {257. Kurotschka, V. G. (1988). Characterizations and examples of optimal experiments with qualitative and quantitative factors. In Model-Oriented Data Analysis, Proceedings Eisenach (V. Fedorov and H. Lauter, eds.) 53{71. Springer, Berlin. Pukelsheim, F. (1993). Optimal Design of Experiments. Wiley, New York. Rafaj lowicz, E. and Myszka, W. (1988). Optimum experimental design for a regression on a hypercube - generalization of Hoel's result. Ann. Inst. Statist. Math {827. Schwabe, R. (1994). Optimal designs for additive linear models. Statistics (to appear). Schwabe, R. (1995). Experimental design for linear models with higher order interaction terms. In Symposia Gaussiana. Proceedings of the 2nd Gauss Symposium, Conference B: Statistical Sciences, Munchen (H. Schneewei and V. Mammitzsch, eds.) 281{288. DeGruyter, Berlin. Schwabe, R. and Wierich, W. (1995). D-optimal designs of experiments with noninteracting factors. J. Statist. Plann. Inference {384. Freie Universitat Berlin 1. Mathematisches Institut Arnimallee 2{ Berlin Germany

460 HOLGER DETTE AND WILLIAM J STUDDEN order to examine how a given design behaves in the model g` with respect to the D-optimality criterion one uses

460 HOLGER DETTE AND WILLIAM J STUDDEN order to examine how a given design behaves in the model g` with respect to the D-optimality criterion one uses Statistica Sinica 5(1995), 459-473 OPTIMAL DESIGNS FOR POLYNOMIAL REGRESSION WHEN THE DEGREE IS NOT KNOWN Holger Dette and William J Studden Technische Universitat Dresden and Purdue University Abstract:

More information

Stochastic Design Criteria in Linear Models

Stochastic Design Criteria in Linear Models AUSTRIAN JOURNAL OF STATISTICS Volume 34 (2005), Number 2, 211 223 Stochastic Design Criteria in Linear Models Alexander Zaigraev N. Copernicus University, Toruń, Poland Abstract: Within the framework

More information

The Equality of OLS and GLS Estimators in the

The Equality of OLS and GLS Estimators in the The Equality of OLS and GLS Estimators in the Linear Regression Model When the Disturbances are Spatially Correlated Butte Gotu 1 Department of Statistics, University of Dortmund Vogelpothsweg 87, 44221

More information

Minimax design criterion for fractional factorial designs

Minimax design criterion for fractional factorial designs Ann Inst Stat Math 205 67:673 685 DOI 0.007/s0463-04-0470-0 Minimax design criterion for fractional factorial designs Yue Yin Julie Zhou Received: 2 November 203 / Revised: 5 March 204 / Published online:

More information

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION

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

D-Optimal Designs for Second-Order Response Surface Models with Qualitative Factors

D-Optimal Designs for Second-Order Response Surface Models with Qualitative Factors Journal of Data Science 920), 39-53 D-Optimal Designs for Second-Order Response Surface Models with Qualitative Factors Chuan-Pin Lee and Mong-Na Lo Huang National Sun Yat-sen University Abstract: Central

More information

Some optimal criteria of model-robustness for two-level non-regular fractional factorial designs

Some optimal criteria of model-robustness for two-level non-regular fractional factorial designs Some optimal criteria of model-robustness for two-level non-regular fractional factorial designs arxiv:0907.052v stat.me 3 Jul 2009 Satoshi Aoki July, 2009 Abstract We present some optimal criteria to

More information

(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea

(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea Torsion of dierentials on toric varieties Klaus Altmann Institut fur reine Mathematik, Humboldt-Universitat zu Berlin Ziegelstr. 13a, D-10099 Berlin, Germany. E-mail: altmann@mathematik.hu-berlin.de Abstract

More information

ON THE COMPARISON OF BOUNDARY AND INTERIOR SUPPORT POINTS OF A RESPONSE SURFACE UNDER OPTIMALITY CRITERIA. Cross River State, Nigeria

ON THE COMPARISON OF BOUNDARY AND INTERIOR SUPPORT POINTS OF A RESPONSE SURFACE UNDER OPTIMALITY CRITERIA. Cross River State, Nigeria ON THE COMPARISON OF BOUNDARY AND INTERIOR SUPPORT POINTS OF A RESPONSE SURFACE UNDER OPTIMALITY CRITERIA Thomas Adidaume Uge and Stephen Seastian Akpan, Department Of Mathematics/Statistics And Computer

More information

= a. a = Let us now study what is a? c ( a A a )

= a. a = Let us now study what is a? c ( a A a ) 7636S ADVANCED QUANTUM MECHANICS Solutions 1 Spring 010 1 Warm up a Show that the eigenvalues of a Hermitian operator A are real and that the eigenkets of A corresponding to dierent eigenvalues are orthogonal

More information

New duality operator for complex circulant matrices and a conjecture of Ryser

New duality operator for complex circulant matrices and a conjecture of Ryser New duality operator for complex circulant matrices and a conjecture of Ryser Luis H. Gallardo Mathematics University of Brest Brest, France Luis.Gallardo@univ-brest.fr Submitted: May 6, 2015; Accepted:

More information

arxiv: v1 [math.st] 22 Dec 2018

arxiv: v1 [math.st] 22 Dec 2018 Optimal Designs for Prediction in Two Treatment Groups Rom Coefficient Regression Models Maryna Prus Otto-von-Guericke University Magdeburg, Institute for Mathematical Stochastics, PF 4, D-396 Magdeburg,

More information

Some Nonregular Designs From the Nordstrom and Robinson Code and Their Statistical Properties

Some Nonregular Designs From the Nordstrom and Robinson Code and Their Statistical Properties Some Nonregular Designs From the Nordstrom and Robinson Code and Their Statistical Properties HONGQUAN XU Department of Statistics, University of California, Los Angeles, CA 90095-1554, U.S.A. (hqxu@stat.ucla.edu)

More information

Matrix Inequalities by Means of Block Matrices 1

Matrix Inequalities by Means of Block Matrices 1 Mathematical Inequalities & Applications, Vol. 4, No. 4, 200, pp. 48-490. Matrix Inequalities by Means of Block Matrices Fuzhen Zhang 2 Department of Math, Science and Technology Nova Southeastern University,

More information

Projektpartner. Sonderforschungsbereich 386, Paper 163 (1999) Online unter:

Projektpartner. Sonderforschungsbereich 386, Paper 163 (1999) Online unter: Toutenburg, Shalabh: Estimation of Regression Coefficients Subject to Exact Linear Restrictions when some Observations are Missing and Balanced Loss Function is Used Sonderforschungsbereich 386, Paper

More information

Structural Grobner Basis. Bernd Sturmfels and Markus Wiegelmann TR May Department of Mathematics, UC Berkeley.

Structural Grobner Basis. Bernd Sturmfels and Markus Wiegelmann TR May Department of Mathematics, UC Berkeley. I 1947 Center St. Suite 600 Berkeley, California 94704-1198 (510) 643-9153 FAX (510) 643-7684 INTERNATIONAL COMPUTER SCIENCE INSTITUTE Structural Grobner Basis Detection Bernd Sturmfels and Markus Wiegelmann

More information

2 Viktor G. Kurotschka, Rainer Schwabe. 1) In the case of a small experimental region, mathematically described by

2 Viktor G. Kurotschka, Rainer Schwabe. 1) In the case of a small experimental region, mathematically described by HE REDUION OF DESIGN PROLEMS FOR MULIVARIAE EXPERIMENS O UNIVARIAE POSSIILIIES AND HEIR LIMIAIONS Viktor G Kurotschka, Rainer Schwabe Freie Universitat erlin, Mathematisches Institut, Arnimallee 2{6, D-4

More information

Some inequalities for sum and product of positive semide nite matrices

Some inequalities for sum and product of positive semide nite matrices Linear Algebra and its Applications 293 (1999) 39±49 www.elsevier.com/locate/laa Some inequalities for sum and product of positive semide nite matrices Bo-Ying Wang a,1,2, Bo-Yan Xi a, Fuzhen Zhang b,

More information

A DECOMPOSITION THEOREM FOR FRAMES AND THE FEICHTINGER CONJECTURE

A DECOMPOSITION THEOREM FOR FRAMES AND THE FEICHTINGER CONJECTURE PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 A DECOMPOSITION THEOREM FOR FRAMES AND THE FEICHTINGER CONJECTURE PETER G. CASAZZA, GITTA KUTYNIOK,

More information

ON D-OPTIMAL DESIGNS FOR ESTIMATING SLOPE

ON D-OPTIMAL DESIGNS FOR ESTIMATING SLOPE Sankhyā : The Indian Journal of Statistics 999, Volume 6, Series B, Pt. 3, pp. 488 495 ON D-OPTIMAL DESIGNS FOR ESTIMATING SLOPE By S. HUDA and A.A. AL-SHIHA King Saud University, Riyadh, Saudi Arabia

More information

On the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination

On the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination On the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination J.M. Peña 1 Introduction Gaussian elimination (GE) with a given pivoting strategy, for nonsingular matrices

More information

Solution Set 7, Fall '12

Solution Set 7, Fall '12 Solution Set 7, 18.06 Fall '12 1. Do Problem 26 from 5.1. (It might take a while but when you see it, it's easy) Solution. Let n 3, and let A be an n n matrix whose i, j entry is i + j. To show that det

More information

Counting and Constructing Minimal Spanning Trees. Perrin Wright. Department of Mathematics. Florida State University. Tallahassee, FL

Counting and Constructing Minimal Spanning Trees. Perrin Wright. Department of Mathematics. Florida State University. Tallahassee, FL Counting and Constructing Minimal Spanning Trees Perrin Wright Department of Mathematics Florida State University Tallahassee, FL 32306-3027 Abstract. We revisit the minimal spanning tree problem in order

More information

ISOLATED SEMIDEFINITE SOLUTIONS OF THE CONTINUOUS-TIME ALGEBRAIC RICCATI EQUATION

ISOLATED SEMIDEFINITE SOLUTIONS OF THE CONTINUOUS-TIME ALGEBRAIC RICCATI EQUATION ISOLATED SEMIDEFINITE SOLUTIONS OF THE CONTINUOUS-TIME ALGEBRAIC RICCATI EQUATION Harald K. Wimmer 1 The set of all negative-semidefinite solutions of the CARE A X + XA + XBB X C C = 0 is homeomorphic

More information

290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f

290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica

More information

Robust linear optimization under general norms

Robust linear optimization under general norms Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn

More information

On A Special Case Of A Conjecture Of Ryser About Hadamard Circulant Matrices

On A Special Case Of A Conjecture Of Ryser About Hadamard Circulant Matrices Applied Mathematics E-Notes, 1(01), 18-188 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/amen/ On A Special Case Of A Conjecture Of Ryser About Hadamard Circulant Matrices

More information

Part I: Preliminary Results. Pak K. Chan, Martine Schlag and Jason Zien. Computer Engineering Board of Studies. University of California, Santa Cruz

Part I: Preliminary Results. Pak K. Chan, Martine Schlag and Jason Zien. Computer Engineering Board of Studies. University of California, Santa Cruz Spectral K-Way Ratio-Cut Partitioning Part I: Preliminary Results Pak K. Chan, Martine Schlag and Jason Zien Computer Engineering Board of Studies University of California, Santa Cruz May, 99 Abstract

More information

EXACT OPTIMAL DESIGNS FOR WEIGHTED LEAST SQUARES ANALYSIS WITH CORRELATED ERRORS

EXACT OPTIMAL DESIGNS FOR WEIGHTED LEAST SQUARES ANALYSIS WITH CORRELATED ERRORS Statistica Sinica 18(2008), 135-154 EXACT OPTIMAL DESIGNS FOR WEIGHTED LEAST SQUARES ANALYSIS WITH CORRELATED ERRORS Holger Dette, Joachim Kunert and Andrey Pepelyshev Ruhr-Universität Bochum, Universität

More information

PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS

PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix

More information

The maximal determinant and subdeterminants of ±1 matrices

The maximal determinant and subdeterminants of ±1 matrices Linear Algebra and its Applications 373 (2003) 297 310 www.elsevier.com/locate/laa The maximal determinant and subdeterminants of ±1 matrices Jennifer Seberry a,, Tianbing Xia a, Christos Koukouvinos b,

More information

Knowledge Discovery and Data Mining 1 (VO) ( )

Knowledge Discovery and Data Mining 1 (VO) ( ) Knowledge Discovery and Data Mining 1 (VO) (707.003) Review of Linear Algebra Denis Helic KTI, TU Graz Oct 9, 2014 Denis Helic (KTI, TU Graz) KDDM1 Oct 9, 2014 1 / 74 Big picture: KDDM Probability Theory

More information

E-optimal approximate block designs for treatment-control comparisons

E-optimal approximate block designs for treatment-control comparisons E-optimal approximate block designs for treatment-control comparisons Samuel Rosa 1 1 Faculty of Mathematics, Physics and Informatics, Comenius University in Bratislava, Slovakia We study E-optimal block

More information

Trace Inequalities for a Block Hadamard Product

Trace Inequalities for a Block Hadamard Product Filomat 32:1 2018), 285 292 https://doiorg/102298/fil1801285p Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Trace Inequalities for

More information

Existence of minimizers for the pure displacement problem in nonlinear elasticity

Existence of minimizers for the pure displacement problem in nonlinear elasticity Existence of minimizers for the pure displacement problem in nonlinear elasticity Cristinel Mardare Université Pierre et Marie Curie - Paris 6, Laboratoire Jacques-Louis Lions, Paris, F-75005 France Abstract

More information

4.1 Eigenvalues, Eigenvectors, and The Characteristic Polynomial

4.1 Eigenvalues, Eigenvectors, and The Characteristic Polynomial Linear Algebra (part 4): Eigenvalues, Diagonalization, and the Jordan Form (by Evan Dummit, 27, v ) Contents 4 Eigenvalues, Diagonalization, and the Jordan Canonical Form 4 Eigenvalues, Eigenvectors, and

More information

Simple Lie subalgebras of locally nite associative algebras

Simple Lie subalgebras of locally nite associative algebras Simple Lie subalgebras of locally nite associative algebras Y.A. Bahturin Department of Mathematics and Statistics Memorial University of Newfoundland St. John's, NL, A1C5S7, Canada A.A. Baranov Department

More information

More Powerful Tests for Homogeneity of Multivariate Normal Mean Vectors under an Order Restriction

More Powerful Tests for Homogeneity of Multivariate Normal Mean Vectors under an Order Restriction Sankhyā : The Indian Journal of Statistics 2007, Volume 69, Part 4, pp. 700-716 c 2007, Indian Statistical Institute More Powerful Tests for Homogeneity of Multivariate Normal Mean Vectors under an Order

More information

The L p -dissipativity of first order partial differential operators

The L p -dissipativity of first order partial differential operators The L p -dissipativity of first order partial differential operators A. Cialdea V. Maz ya n Memory of Vladimir. Smirnov Abstract. We find necessary and sufficient conditions for the L p -dissipativity

More information

A general linear model OPTIMAL BIAS BOUNDS FOR ROBUST ESTIMATION IN LINEAR MODELS

A general linear model OPTIMAL BIAS BOUNDS FOR ROBUST ESTIMATION IN LINEAR MODELS OPTIMAL BIAS BOUNDS FOR ROBUST ESTIMATION IN LINEAR MODELS CHRISTINE H. MOLLER Freie Universitbt Berlin 1. Mathematisches Instilut Arnimallee 2-6 0-14195 Berlin Germany Abstract. A conditionally contaminated

More information

Abstract. In this article, several matrix norm inequalities are proved by making use of the Hiroshima 2003 result on majorization relations.

Abstract. In this article, several matrix norm inequalities are proved by making use of the Hiroshima 2003 result on majorization relations. HIROSHIMA S THEOREM AND MATRIX NORM INEQUALITIES MINGHUA LIN AND HENRY WOLKOWICZ Abstract. In this article, several matrix norm inequalities are proved by making use of the Hiroshima 2003 result on majorization

More information

1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5

1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5 J. Korean Math. Soc. 36 (1999), No. 6, pp. 1181{1190 LINEAR OPERATORS THAT PRESERVE ZERO-TERM RANK OF BOOLEAN MATRICES LeRoy. B. Beasley, Seok-Zun Song, and Sang-Gu Lee Abstract. Zero-term rank of a matrix

More information

QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS

QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS Statistica Sinica 12(2002), 905-916 QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS Kashinath Chatterjee, Ashish Das and Aloke Dey Asutosh College, Calcutta and Indian Statistical Institute,

More information

VICTORIA POWERS AND THORSTEN W ORMANN Suppose there exists a real, symmetric, psd matrix B such that f = x B x T and rank t. Since B is real symmetric

VICTORIA POWERS AND THORSTEN W ORMANN Suppose there exists a real, symmetric, psd matrix B such that f = x B x T and rank t. Since B is real symmetric AN ALGORITHM FOR SUMS OF SQUARES OF REAL POLYNOMIALS Victoria Powers and Thorsten Wormann Introduction We present an algorithm to determine if a real polynomial is a sum of squares (of polynomials), and

More information

ON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH

ON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH ON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH V. FABER, J. LIESEN, AND P. TICHÝ Abstract. Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix

More information

It is well-known (cf. [2,4,5,9]) that the generating function P w() summed over all tableaux of shape = where the parts in row i are at most a i and a

It is well-known (cf. [2,4,5,9]) that the generating function P w() summed over all tableaux of shape = where the parts in row i are at most a i and a Counting tableaux with row and column bounds C. Krattenthalery S. G. Mohantyz Abstract. It is well-known that the generating function for tableaux of a given skew shape with r rows where the parts in the

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications 436 01 874 887 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Maximal determinant

More information

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent. Lecture Notes: Orthogonal and Symmetric Matrices Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Orthogonal Matrix Definition. Let u = [u

More information

New insights into best linear unbiased estimation and the optimality of least-squares

New insights into best linear unbiased estimation and the optimality of least-squares Journal of Multivariate Analysis 97 (2006) 575 585 www.elsevier.com/locate/jmva New insights into best linear unbiased estimation and the optimality of least-squares Mario Faliva, Maria Grazia Zoia Istituto

More information

LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday

LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD JAN-HENDRIK EVERTSE AND UMBERTO ZANNIER To Professor Wolfgang Schmidt on his 75th birthday 1. Introduction Let K be a field

More information

Log-Convexity Properties of Schur Functions and Generalized Hypergeometric Functions of Matrix Argument. Donald St. P. Richards.

Log-Convexity Properties of Schur Functions and Generalized Hypergeometric Functions of Matrix Argument. Donald St. P. Richards. Log-Convexity Properties of Schur Functions and Generalized Hypergeometric Functions of Matrix Argument Donald St. P. Richards August 22, 2009 Abstract We establish a positivity property for the difference

More information

A concise proof of Kruskal s theorem on tensor decomposition

A concise proof of Kruskal s theorem on tensor decomposition A concise proof of Kruskal s theorem on tensor decomposition John A. Rhodes 1 Department of Mathematics and Statistics University of Alaska Fairbanks PO Box 756660 Fairbanks, AK 99775 Abstract A theorem

More information

Applied Mathematics &Optimization

Applied Mathematics &Optimization Appl Math Optim 29: 211-222 (1994) Applied Mathematics &Optimization c 1994 Springer-Verlag New Yor Inc. An Algorithm for Finding the Chebyshev Center of a Convex Polyhedron 1 N.D.Botin and V.L.Turova-Botina

More information

NP-hardness of the stable matrix in unit interval family problem in discrete time

NP-hardness of the stable matrix in unit interval family problem in discrete time Systems & Control Letters 42 21 261 265 www.elsevier.com/locate/sysconle NP-hardness of the stable matrix in unit interval family problem in discrete time Alejandra Mercado, K.J. Ray Liu Electrical and

More information

2 W. LAWTON, S. L. LEE AND ZUOWEI SHEN is called the fundamental condition, and a sequence which satises the fundamental condition will be called a fu

2 W. LAWTON, S. L. LEE AND ZUOWEI SHEN is called the fundamental condition, and a sequence which satises the fundamental condition will be called a fu CONVERGENCE OF MULTIDIMENSIONAL CASCADE ALGORITHM W. LAWTON, S. L. LEE AND ZUOWEI SHEN Abstract. Necessary and sucient conditions on the spectrum of the restricted transition operators are given for the

More information

Where is matrix multiplication locally open?

Where is matrix multiplication locally open? Linear Algebra and its Applications 517 (2017) 167 176 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Where is matrix multiplication locally open?

More information

Talagrand's Inequality

Talagrand's Inequality Talagrand's Inequality Aukosh Jagannath October 2, 2013 Abstract Notes on Talagrand's inequality. This material is a mixture from Talagrand's two famous papers and Ledoux. 1 Introduction The goal of this

More information

Consistent Bivariate Distribution

Consistent Bivariate Distribution A Characterization of the Normal Conditional Distributions MATSUNO 79 Therefore, the function ( ) = G( : a/(1 b2)) = N(0, a/(1 b2)) is a solu- tion for the integral equation (10). The constant times of

More information

RESEARCH ARTICLE. An extension of the polytope of doubly stochastic matrices

RESEARCH ARTICLE. An extension of the polytope of doubly stochastic matrices Linear and Multilinear Algebra Vol. 00, No. 00, Month 200x, 1 15 RESEARCH ARTICLE An extension of the polytope of doubly stochastic matrices Richard A. Brualdi a and Geir Dahl b a Department of Mathematics,

More information

An exploration of matrix equilibration

An exploration of matrix equilibration An exploration of matrix equilibration Paul Liu Abstract We review three algorithms that scale the innity-norm of each row and column in a matrix to. The rst algorithm applies to unsymmetric matrices,

More information

Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)

Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition) Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational

More information

NEW CONSTRUCTION OF THE EAGON-NORTHCOTT COMPLEX. Oh-Jin Kang and Joohyung Kim

NEW CONSTRUCTION OF THE EAGON-NORTHCOTT COMPLEX. Oh-Jin Kang and Joohyung Kim Korean J Math 20 (2012) No 2 pp 161 176 NEW CONSTRUCTION OF THE EAGON-NORTHCOTT COMPLEX Oh-Jin Kang and Joohyung Kim Abstract The authors [6 introduced the concept of a complete matrix of grade g > 3 to

More information

Norm inequalities related to the matrix geometric mean

Norm inequalities related to the matrix geometric mean isid/ms/2012/07 April 20, 2012 http://www.isid.ac.in/ statmath/eprints Norm inequalities related to the matrix geometric mean RAJENDRA BHATIA PRIYANKA GROVER Indian Statistical Institute, Delhi Centre

More information

Diagonalization by a unitary similarity transformation

Diagonalization by a unitary similarity transformation Physics 116A Winter 2011 Diagonalization by a unitary similarity transformation In these notes, we will always assume that the vector space V is a complex n-dimensional space 1 Introduction A semi-simple

More information

On the adjacency matrix of a block graph

On the adjacency matrix of a block graph On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit

More information

ON THE FOLIATION OF SPACE-TIME BY CONSTANT MEAN CURVATURE HYPERSURFACES

ON THE FOLIATION OF SPACE-TIME BY CONSTANT MEAN CURVATURE HYPERSURFACES ON THE FOLIATION OF SPACE-TIME BY CONSTANT MEAN CURVATURE HYPERSURFACES CLAUS GERHARDT Abstract. We prove that the mean curvature τ of the slices given by a constant mean curvature foliation can be used

More information

An O(n 2 ) algorithm for maximum cycle mean of Monge matrices in max-algebra

An O(n 2 ) algorithm for maximum cycle mean of Monge matrices in max-algebra Discrete Applied Mathematics 127 (2003) 651 656 Short Note www.elsevier.com/locate/dam An O(n 2 ) algorithm for maximum cycle mean of Monge matrices in max-algebra Martin Gavalec a;,jan Plavka b a Department

More information

Economics Noncooperative Game Theory Lectures 3. October 15, 1997 Lecture 3

Economics Noncooperative Game Theory Lectures 3. October 15, 1997 Lecture 3 Economics 8117-8 Noncooperative Game Theory October 15, 1997 Lecture 3 Professor Andrew McLennan Nash Equilibrium I. Introduction A. Philosophy 1. Repeated framework a. One plays against dierent opponents

More information

2 G. D. DASKALOPOULOS AND R. A. WENTWORTH general, is not true. Thus, unlike the case of divisors, there are situations where k?1 0 and W k?1 = ;. r;d

2 G. D. DASKALOPOULOS AND R. A. WENTWORTH general, is not true. Thus, unlike the case of divisors, there are situations where k?1 0 and W k?1 = ;. r;d ON THE BRILL-NOETHER PROBLEM FOR VECTOR BUNDLES GEORGIOS D. DASKALOPOULOS AND RICHARD A. WENTWORTH Abstract. On an arbitrary compact Riemann surface, necessary and sucient conditions are found for the

More information

Math 408 Advanced Linear Algebra

Math 408 Advanced Linear Algebra Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x

More information

1. The Polar Decomposition

1. The Polar Decomposition A PERSONAL INTERVIEW WITH THE SINGULAR VALUE DECOMPOSITION MATAN GAVISH Part. Theory. The Polar Decomposition In what follows, F denotes either R or C. The vector space F n is an inner product space with

More information

Clarkson Inequalities With Several Operators

Clarkson Inequalities With Several Operators isid/ms/2003/23 August 14, 2003 http://www.isid.ac.in/ statmath/eprints Clarkson Inequalities With Several Operators Rajendra Bhatia Fuad Kittaneh Indian Statistical Institute, Delhi Centre 7, SJSS Marg,

More information

A Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract

A Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract A Finite Element Method for an Ill-Posed Problem W. Lucht Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D-699 Halle, Germany Abstract For an ill-posed problem which has its origin

More information

Optimal Design for the Rasch Poisson-Gamma Model

Optimal Design for the Rasch Poisson-Gamma Model Optimal Design for the Rasch Poisson-Gamma Model Ulrike Graßhoff, Heinz Holling and Rainer Schwabe Abstract The Rasch Poisson counts model is an important model for analyzing mental speed, an fundamental

More information

Vector spaces. DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis.

Vector spaces. DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis. Vector spaces DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_fall17/index.html Carlos Fernandez-Granda Vector space Consists of: A set V A scalar

More information

Pathwise Construction of Stochastic Integrals

Pathwise Construction of Stochastic Integrals Pathwise Construction of Stochastic Integrals Marcel Nutz First version: August 14, 211. This version: June 12, 212. Abstract We propose a method to construct the stochastic integral simultaneously under

More information

J. Korean Math. Soc. 30 (1993), No. 2, pp. 267{274 INDICES OF IRREDUCIBLE BOOLEAN MATRICES Han Hyuk Cho 1.Introduction Let = f0 1g be the Boolean alge

J. Korean Math. Soc. 30 (1993), No. 2, pp. 267{274 INDICES OF IRREDUCIBLE BOOLEAN MATRICES Han Hyuk Cho 1.Introduction Let = f0 1g be the Boolean alge J. Korean Math. Soc. 30 (1993), No. 2, pp. 267{274 INDICES OF IRREDUCIBLE BOOLEAN MATRICES Han Hyuk Cho 1.Introduction Let = f0 1g be the Boolean algebra of order two with operations (+ ) : 1+0= 0+1= 1+1=

More information

ON THE COMPLETE PIVOTING CONJECTURE FOR A HADAMARD MATRIX OF ORDER 12 ALAN EDELMAN 1. Department of Mathematics. and Lawrence Berkeley Laboratory

ON THE COMPLETE PIVOTING CONJECTURE FOR A HADAMARD MATRIX OF ORDER 12 ALAN EDELMAN 1. Department of Mathematics. and Lawrence Berkeley Laboratory ON THE COMPLETE PIVOTING CONJECTURE FOR A HADAMARD MATRIX OF ORDER 12 ALAN EDELMAN 1 Department of Mathematics and Lawrence Berkeley Laboratory University of California Berkeley, California 94720 edelman@math.berkeley.edu

More information

Math Camp Notes: Linear Algebra I

Math Camp Notes: Linear Algebra I Math Camp Notes: Linear Algebra I Basic Matrix Operations and Properties Consider two n m matrices: a a m A = a n a nm Then the basic matrix operations are as follows: a + b a m + b m A + B = a n + b n

More information

Inferences on a Normal Covariance Matrix and Generalized Variance with Monotone Missing Data

Inferences on a Normal Covariance Matrix and Generalized Variance with Monotone Missing Data Journal of Multivariate Analysis 78, 6282 (2001) doi:10.1006jmva.2000.1939, available online at http:www.idealibrary.com on Inferences on a Normal Covariance Matrix and Generalized Variance with Monotone

More information

Restricted b-matchings in degree-bounded graphs

Restricted b-matchings in degree-bounded graphs Egerváry Research Group on Combinatorial Optimization Technical reports TR-009-1. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

More information

ON THE HÖLDER CONTINUITY OF MATRIX FUNCTIONS FOR NORMAL MATRICES

ON THE HÖLDER CONTINUITY OF MATRIX FUNCTIONS FOR NORMAL MATRICES Volume 10 (2009), Issue 4, Article 91, 5 pp. ON THE HÖLDER CONTINUITY O MATRIX UNCTIONS OR NORMAL MATRICES THOMAS P. WIHLER MATHEMATICS INSTITUTE UNIVERSITY O BERN SIDLERSTRASSE 5, CH-3012 BERN SWITZERLAND.

More information

SELF-ADJOINTNESS OF SCHRÖDINGER-TYPE OPERATORS WITH SINGULAR POTENTIALS ON MANIFOLDS OF BOUNDED GEOMETRY

SELF-ADJOINTNESS OF SCHRÖDINGER-TYPE OPERATORS WITH SINGULAR POTENTIALS ON MANIFOLDS OF BOUNDED GEOMETRY Electronic Journal of Differential Equations, Vol. 2003(2003), No.??, pp. 1 8. ISSN: 1072-6691. URL: http://ejde.math.swt.edu or http://ejde.math.unt.edu ftp ejde.math.swt.edu (login: ftp) SELF-ADJOINTNESS

More information

SPRING OF 2008 D. DETERMINANTS

SPRING OF 2008 D. DETERMINANTS 18024 SPRING OF 2008 D DETERMINANTS In many applications of linear algebra to calculus and geometry, the concept of a determinant plays an important role This chapter studies the basic properties of determinants

More information

2 BAISHENG YAN When L =,it is easily seen that the set K = coincides with the set of conformal matrices, that is, K = = fr j 0 R 2 SO(n)g: Weakly L-qu

2 BAISHENG YAN When L =,it is easily seen that the set K = coincides with the set of conformal matrices, that is, K = = fr j 0 R 2 SO(n)g: Weakly L-qu RELAXATION AND ATTAINMENT RESULTS FOR AN INTEGRAL FUNCTIONAL WITH UNBOUNDED ENERGY-WELL BAISHENG YAN Abstract. Consider functional I(u) = R jjdujn ; L det Duj dx whose energy-well consists of matrices

More information

CS 246 Review of Linear Algebra 01/17/19

CS 246 Review of Linear Algebra 01/17/19 1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector

More information

information matrix can be defined via an extremal representation. For rank

information matrix can be defined via an extremal representation. For rank Metrika manuscript No. (will be inserted by the editor) Information matrices for non full rank subsystems Pierre Druilhet 1, Augustyn Markiewicz 2 1 CREST-ENSAI, Campus de Ker Lann, Rue Blaise Pascal,

More information

Multivariate Gaussian Analysis

Multivariate Gaussian Analysis BS2 Statistical Inference, Lecture 7, Hilary Term 2009 February 13, 2009 Marginal and conditional distributions For a positive definite covariance matrix Σ, the multivariate Gaussian distribution has density

More information

INTRODUCTION TO LIE ALGEBRAS. LECTURE 2.

INTRODUCTION TO LIE ALGEBRAS. LECTURE 2. INTRODUCTION TO LIE ALGEBRAS. LECTURE 2. 2. More examples. Ideals. Direct products. 2.1. More examples. 2.1.1. Let k = R, L = R 3. Define [x, y] = x y the cross-product. Recall that the latter is defined

More information

Denition 2: o() is the height of the well-founded relation. Notice that we must have o() (2 ) +. Much is known about the possible behaviours of. For e

Denition 2: o() is the height of the well-founded relation. Notice that we must have o() (2 ) +. Much is known about the possible behaviours of. For e Possible behaviours for the Mitchell ordering James Cummings Math and CS Department Dartmouth College Hanover NH 03755 January 23, 1998 Abstract We use a mixture of forcing and inner models techniques

More information

A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo

A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d

More information

Atypical representations of the Lie superalgebra sl(1,n) for n greater than 1

Atypical representations of the Lie superalgebra sl(1,n) for n greater than 1 Seminar Sophus Lie 3 (1993) 15 24 Atypical representations of the Lie superalgebra sl(1,n) for n greater than 1 Hartmut Schlosser 1. Preliminaries The Lie superalgebra (LSA) sl(1, n) with n > 1 is a concrete

More information

HAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS Margaret H. Forbush, Elizabeth Hanson, Susan Kim, Andrew Mauer-Oats, Rhian Merris, Jennifer Oats-Sargent

HAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS Margaret H. Forbush, Elizabeth Hanson, Susan Kim, Andrew Mauer-Oats, Rhian Merris, Jennifer Oats-Sargent HAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS Margaret H. Forbush, Elizabeth Hanson, Susan Kim, Andrew Mauer-Oats, Rhian Merris, Jennifer Oats-Sargent, Seth Oldham, Kate Sharkey, and Dave Witte Abstract.

More information

Tree-width and planar minors

Tree-width and planar minors Tree-width and planar minors Alexander Leaf and Paul Seymour 1 Princeton University, Princeton, NJ 08544 May 22, 2012; revised March 18, 2014 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-0901075.

More information

16 Chapter 3. Separation Properties, Principal Pivot Transforms, Classes... for all j 2 J is said to be a subcomplementary vector of variables for (3.

16 Chapter 3. Separation Properties, Principal Pivot Transforms, Classes... for all j 2 J is said to be a subcomplementary vector of variables for (3. Chapter 3 SEPARATION PROPERTIES, PRINCIPAL PIVOT TRANSFORMS, CLASSES OF MATRICES In this chapter we present the basic mathematical results on the LCP. Many of these results are used in later chapters to

More information

ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES

ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most 64 are

More information

arxiv:math/ v5 [math.ac] 17 Sep 2009

arxiv:math/ v5 [math.ac] 17 Sep 2009 On the elementary symmetric functions of a sum of matrices R. S. Costas-Santos arxiv:math/0612464v5 [math.ac] 17 Sep 2009 September 17, 2009 Abstract Often in mathematics it is useful to summarize a multivariate

More information

response surface work. These alternative polynomials are contrasted with those of Schee, and ideas of

response surface work. These alternative polynomials are contrasted with those of Schee, and ideas of Reports 367{Augsburg, 320{Washington, 977{Wisconsin 10 pages 28 May 1997, 8:22h Mixture models based on homogeneous polynomials Norman R. Draper a,friedrich Pukelsheim b,* a Department of Statistics, University

More information

ANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS Mathematics Subject Classification: 11B05, 11B13, 11P99

ANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS Mathematics Subject Classification: 11B05, 11B13, 11P99 ANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS N. HEGYVÁRI, F. HENNECART AND A. PLAGNE Abstract. We study the gaps in the sequence of sums of h pairwise distinct elements

More information

Here each term has degree 2 (the sum of exponents is 2 for all summands). A quadratic form of three variables looks as

Here each term has degree 2 (the sum of exponents is 2 for all summands). A quadratic form of three variables looks as Reading [SB], Ch. 16.1-16.3, p. 375-393 1 Quadratic Forms A quadratic function f : R R has the form f(x) = a x. Generalization of this notion to two variables is the quadratic form Q(x 1, x ) = a 11 x

More information