DOCSLIB.ORG

Hyperdeterminants As Integrable 3D Difference Equations (Joint Project with Sergey Tsarev, Krasnoyarsk State Pedagogical University)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Hyperdeterminants As Integrable 3D Difference Equations (Joint Project with Sergey Tsarev, Krasnoyarsk State Pedagogical University) Hyperdeterminants as integrable 3D difference equations (joint project with Sergey Tsarev, Krasnoyarsk State Pedagogical University) Thomas Wolf Brock University, Ontario Ste-Adèle, June 26, 2008 Thomas Wolf Hyperdeterminants: a CA challenge I Modern applications of hyperdeterminants I The classical heritage: A.Cayley et al. I The definition of hyperdeterminants and its variations I The next step: the (a?) 2 × 2 × 2 × 2 hyperdeterminant (B.Sturmfels et al., 2006) I FORM computations: how far can we reach now? I Principal Minor Assignment Problem (O.Holtz, B.Sturmfels, 2006) I Hyperdeterminants as discrete integrable systems: 2 × 2 and 2 × 2 × 2. I Is 2 × 2 × 2 × 2 hyperdeterminant integrable?? Plan: I The simplest (hyper)determinants: 2 × 2 and 2 × 2 × 2. Thomas Wolf Hyperdeterminants: a CA challenge I The classical heritage: A.Cayley et al. I The definition of hyperdeterminants and its variations I The next step: the (a?) 2 × 2 × 2 × 2 hyperdeterminant (B.Sturmfels et al., 2006) I FORM computations: how far can we reach now? I Principal Minor Assignment Problem (O.Holtz, B.Sturmfels, 2006) I Hyperdeterminants as discrete integrable systems: 2 × 2 and 2 × 2 × 2. I Is 2 × 2 × 2 × 2 hyperdeterminant integrable?? Plan: I The simplest (hyper)determinants: 2 × 2 and 2 × 2 × 2. I Modern applications of hyperdeterminants Thomas Wolf Hyperdeterminants: a CA challenge I The definition of hyperdeterminants and its variations I The next step: the (a?) 2 × 2 × 2 × 2 hyperdeterminant (B.Sturmfels et al., 2006) I FORM computations: how far can we reach now? I Principal Minor Assignment Problem (O.Holtz, B.Sturmfels, 2006) I Hyperdeterminants as discrete integrable systems: 2 × 2 and 2 × 2 × 2. I Is 2 × 2 × 2 × 2 hyperdeterminant integrable?? Plan: I The simplest (hyper)determinants: 2 × 2 and 2 × 2 × 2. I Modern applications of hyperdeterminants I The classical heritage: A.Cayley et al. Thomas Wolf Hyperdeterminants: a CA challenge I The next step: the (a?) 2 × 2 × 2 × 2 hyperdeterminant (B.Sturmfels et al., 2006) I FORM computations: how far can we reach now? I Principal Minor Assignment Problem (O.Holtz, B.Sturmfels, 2006) I Hyperdeterminants as discrete integrable systems: 2 × 2 and 2 × 2 × 2. I Is 2 × 2 × 2 × 2 hyperdeterminant integrable?? Plan: I The simplest (hyper)determinants: 2 × 2 and 2 × 2 × 2. I Modern applications of hyperdeterminants I The classical heritage: A.Cayley et al. I The definition of hyperdeterminants and its variations Thomas Wolf Hyperdeterminants: a CA challenge I FORM computations: how far can we reach now? I Principal Minor Assignment Problem (O.Holtz, B.Sturmfels, 2006) I Hyperdeterminants as discrete integrable systems: 2 × 2 and 2 × 2 × 2. I Is 2 × 2 × 2 × 2 hyperdeterminant integrable?? Plan: I The simplest (hyper)determinants: 2 × 2 and 2 × 2 × 2. I Modern applications of hyperdeterminants I The classical heritage: A.Cayley et al. I The definition of hyperdeterminants and its variations I The next step: the (a?) 2 × 2 × 2 × 2 hyperdeterminant (B.Sturmfels et al., 2006) Thomas Wolf Hyperdeterminants: a CA challenge I Principal Minor Assignment Problem (O.Holtz, B.Sturmfels, 2006) I Hyperdeterminants as discrete integrable systems: 2 × 2 and 2 × 2 × 2. I Is 2 × 2 × 2 × 2 hyperdeterminant integrable?? Plan: I The simplest (hyper)determinants: 2 × 2 and 2 × 2 × 2. I Modern applications of hyperdeterminants I The classical heritage: A.Cayley et al. I The definition of hyperdeterminants and its variations I The next step: the (a?) 2 × 2 × 2 × 2 hyperdeterminant (B.Sturmfels et al., 2006) I FORM computations: how far can we reach now? Thomas Wolf Hyperdeterminants: a CA challenge I Hyperdeterminants as discrete integrable systems: 2 × 2 and 2 × 2 × 2. I Is 2 × 2 × 2 × 2 hyperdeterminant integrable?? Plan: I The simplest (hyper)determinants: 2 × 2 and 2 × 2 × 2. I Modern applications of hyperdeterminants I The classical heritage: A.Cayley et al. I The definition of hyperdeterminants and its variations I The next step: the (a?) 2 × 2 × 2 × 2 hyperdeterminant (B.Sturmfels et al., 2006) I FORM computations: how far can we reach now? I Principal Minor Assignment Problem (O.Holtz, B.Sturmfels, 2006) Thomas Wolf Hyperdeterminants: a CA challenge I Is 2 × 2 × 2 × 2 hyperdeterminant integrable?? Plan: I The simplest (hyper)determinants: 2 × 2 and 2 × 2 × 2. I Modern applications of hyperdeterminants I The classical heritage: A.Cayley et al. I The definition of hyperdeterminants and its variations I The next step: the (a?) 2 × 2 × 2 × 2 hyperdeterminant (B.Sturmfels et al., 2006) I FORM computations: how far can we reach now? I Principal Minor Assignment Problem (O.Holtz, B.Sturmfels, 2006) I Hyperdeterminants as discrete integrable systems: 2 × 2 and 2 × 2 × 2. Thomas Wolf Hyperdeterminants: a CA challenge Plan: I The simplest (hyper)determinants: 2 × 2 and 2 × 2 × 2. I Modern applications of hyperdeterminants I The classical heritage: A.Cayley et al. I The definition of hyperdeterminants and its variations I The next step: the (a?) 2 × 2 × 2 × 2 hyperdeterminant (B.Sturmfels et al., 2006) I FORM computations: how far can we reach now? I Principal Minor Assignment Problem (O.Holtz, B.Sturmfels, 2006) I Hyperdeterminants as discrete integrable systems: 2 × 2 and 2 × 2 × 2. I Is 2 × 2 × 2 × 2 hyperdeterminant integrable?? Thomas Wolf Hyperdeterminants: a CA challenge I 2 × 2 × 2 a011 a111 a010 a110 a001 a101 a000 a100 hyperdet = 2 2 2 2 2 2 2 2 a111a000 +a100a011 +a101a010 +a110a001 − 2a111a110a001a000 − 2a111a101a010a000 − 2a111a100a011a000 − 2a110a101a010a001 − 2a110a100a011a001 − 2a101a100a011a010 + 4a111a100a010a001 + 4a110a101a011a000 2 × 2 and 2 × 2 × 2 (hyper)determinants I 2 × 2 a01 a11 a00 a10 det = a00a11 − a01a10 Thomas Wolf Hyperdeterminants: a CA challenge 2 × 2 and 2 × 2 × 2 (hyper)determinants I 2 × 2 × 2 a011 a111 I 2 × 2 a010 a110 a01 a11 a001 a101 a000 a100 a00 a10 hyperdet = det = a00a11 − a01a10 2 2 2 2 2 2 2 2 a111a000 +a100a011 +a101a010 +a110a001 − 2a111a110a001a000 − 2a111a101a010a000 − 2a111a100a011a000 − 2a110a101a010a001 − 2a110a100a011a001 − 2a101a100a011a010 + 4a111a100a010a001 + 4a110a101a011a000 Thomas Wolf Hyperdeterminants: a CA challenge Modern applications of hyperdeterminants I quantum information ("Multipartite Entanglement and Hyperdeterminants", A. Miyake, M. Wadati, Quant. Info. Comp. 2 (Special), 540-555 (2002), I biomathematics ("Estimating vaccine coverage by using computer algebra", R.Altmann, K. Altmann, Mathematical Medicine and Biology 2000 17(2):137-146, I numerical analysis ("Tensor rank and the ill-posedness of the best low-rank approximation problem", V. de Silva and L.-H. Lim, http://arxiv.org/abs/math/0607647) I data analysis ("Kruskal’s condition for uniqueness in Candecomp/Parafac..." A. Stegeman, J. M. F. Ten Berge Computational Statistics & Data Analysis 50(1): 210-220 (2006)), I a few other fields, in particular discrete integrable systems. Thomas Wolf Hyperdeterminants: a CA challenge The polynomial invariants of four qubits Jean-Gabriel Luque∗ and Jean-Yves Thibon† Institut Gaspard Monge, Universit´ede Marne-la-Vall´ee 77454 Marne-la-Vall´ee cedex, France (Dated: December 14, 2002) We describe explicitly the algebra of polynomial functions on the Hilbert space of four qubit states 4 which are invariant under the SLOCC group SL(2, C ) . From this description, we obtain a closed formula for the hyperdeterminant in terms of low degree invariants. PACS numbers: O3.67.Hk, 03.65.Ud, 03.65.Fd I. INTRODUCTION under the SLOCC group SL(2, C )4. This amounts to the construction of a moduli space for four qubit states. Our Various classifications of states with up to four qubits strategy is to find first the Hilbert series of the algebra have been recently proposed, with the aim of understand- of invariants J . Next, we construct by classical methods ing the different ways in which multipartite systems can four invariants of the required degrees. The knowledge be entangled [1, 2, 3, 4, 5]. However, one cannot ex- of the Hilbert series reduces then the proof of algebraic pect that such classifications will be worked out for an independence and completeness to simple verifications. arbitrary number k of qubits, and there is a need for a The values of the invariants on the orbits of [4] are tab- coarser classification scheme which would be computable ulated in the Appendix. for general k. In [6], Klyachko proposed to assimilate en- tanglement with the notion of semi-stability of geometric invariant theory. In this context, a semi-stable state is II. THE HILBERT SERIES one which can be separated from 0 by a polynomial in- C k variant of SL(2, ) , the point in the geometric approach Let Jd be the space of G-invariant homogeneous poly- being that explicit knowledge of the invariants is in prin- nomial functions of degree d in the variables Aijkl. Using ciple not necessary to check this property. some elementary representation theory, it is not difficult In this paper, we construct a complete set of algebraic to show that Jd is zero for d odd, and that for d = 2m invariants of 4-qubit states. This allows us to identify even, the dimension of Jd is equal to the multiplicity of arXiv:quant-ph/0212069v6 7 Jul 2005 PHYSICAL REVIEW D 73, 104033 (2006) Strings, black holes, and quantum information Renata Kallosh and Andrei Linde Department of Physics, Stanford University, Stanford, California 94305, USA (Received 22 February 2006; published 25 May 2006) We find multiple relations between extremal black holes in string theory and 2- and 3-qubit systems in quantum information theory. We show that the entropy of the axion-dilaton extremal black hole is related to the concurrence of a 2-qubit state, whereas the entropy of the STU black holes, Bogomol’nyi-Prasad- Sommerfield (BPS) as well as non-BPS, is related to the 3-tangle of a 3-qubit state.
Load more

Recommended publications
  • The Invariant Theory of Matrices
    UNIVERSITY LECTURE SERIES VOLUME 69 The Invariant Theory of Matrices Corrado De Concini Claudio Procesi American Mathematical Society The Invariant Theory of Matrices 10.1090/ulect/069 UNIVERSITY LECTURE SERIES VOLUME 69 The Invariant Theory of Matrices Corrado De Concini Claudio Procesi American Mathematical Society Providence, Rhode Island EDITORIAL COMMITTEE Jordan S. Ellenberg Robert Guralnick William P. Minicozzi II (Chair) Tatiana Toro 2010 Mathematics Subject Classification. Primary 15A72, 14L99, 20G20, 20G05. For additional information and updates on this book, visit www.ams.org/bookpages/ulect-69 Library of Congress Cataloging-in-Publication Data Names: De Concini, Corrado, author. | Procesi, Claudio, author. Title: The invariant theory of matrices / Corrado De Concini, Claudio Procesi. Description: Providence, Rhode Island : American Mathematical Society, [2017] | Series: Univer- sity lecture series ; volume 69 | Includes bibliographical references and index. Identifiers: LCCN 2017041943 | ISBN 9781470441876 (alk. paper) Subjects: LCSH: Matrices. | Invariants. | AMS: Linear and multilinear algebra; matrix theory – Basic linear algebra – Vector and tensor algebra, theory of invariants. msc | Algebraic geometry – Algebraic groups – None of the above, but in this section. msc | Group theory and generalizations – Linear algebraic groups and related topics – Linear algebraic groups over the reals, the complexes, the quaternions. msc | Group theory and generalizations – Linear algebraic groups and related topics – Representation theory. msc Classification: LCC QA188 .D425 2017 | DDC 512.9/434–dc23 LC record available at https://lccn. loc.gov/2017041943 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy select pages for use in teaching or research.
    [Show full text]
  • An Elementary Proof of the First Fundamental Theorem of Vector Invariant Theory
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF ALGEBRA 102, 556-563 (1986) An Elementary Proof of the First Fundamental Theorem of Vector Invariant Theory MARILENA BARNABEI AND ANDREA BRINI Dipariimento di Matematica, Universitri di Bologna, Piazza di Porta S. Donato, 5, 40127 Bologna, Italy Communicated by D. A. Buchsbaum Received March 11, 1985 1. INTRODUCTION For a long time, the problem of extending to arbitrary characteristic the Fundamental Theorems of classical invariant theory remained untouched. The technique of Young bitableaux, introduced by Doubilet, Rota, and Stein, succeeded in providing a simple combinatorial proof of the First Fundamental Theorem valid over every infinite field. Since then, it was generally thought that the use of bitableaux, or some equivalent device-as the cancellation lemma proved by Hodge after a suggestion of D. E. LittlewoodPwould be indispensable in any such proof, and that single tableaux would not suffice. In this note, we provide a simple combinatorial proof of the First Fun- damental Theorem of invariant theory, valid in any characteristic, which uses only single tableaux or “brackets,” as they were named by Cayley. We believe the main combinatorial lemma (Theorem 2.2) used in our proof can be fruitfully put to use in other invariant-theoretic settings, as we hope to show elsewhere. 2. A COMBINATORIAL LEMMA Let K be a commutative integral domain, with unity. Given an alphabet of d symbols x1, x2,..., xd and a positive integer n, consider the d. n variables (xi\ j), i= 1, 2 ,..., d, j = 1, 2 ,..., n, which are supposed to be algebraically independent.
    [Show full text]
  • Arxiv:1810.05857V3 [Math.AG] 11 Jun 2020
    HYPERDETERMINANTS FROM THE E8 DISCRIMINANT FRED´ ERIC´ HOLWECK AND LUKE OEDING Abstract. We find expressions of the polynomials defining the dual varieties of Grass- mannians Gr(3, 9) and Gr(4, 8) both in terms of the fundamental invariants and in terms of a generic semi-simple element. We restrict the polynomial defining the dual of the ad- joint orbit of E8 and obtain the polynomials of interest as factors. To find an expression of the Gr(4, 8) discriminant in terms of fundamental invariants, which has 15, 942 terms, we perform interpolation with mod-p reductions and rational reconstruction. From these expressions for the discriminants of Gr(3, 9) and Gr(4, 8) we also obtain expressions for well-known hyperdeterminants of formats 3 × 3 × 3 and 2 × 2 × 2 × 2. 1. Introduction Cayley’s 2 × 2 × 2 hyperdeterminant is the well-known polynomial 2 2 2 2 2 2 2 2 ∆222 = x000x111 + x001x110 + x010x101 + x100x011 + 4(x000x011x101x110 + x001x010x100x111) − 2(x000x001x110x111 + x000x010x101x111 + x000x100x011x111+ x001x010x101x110 + x001x100x011x110 + x010x100x011x101). ×3 It generates the ring of invariants for the group SL(2) ⋉S3 acting on the tensor space C2×2×2. It is well-studied in Algebraic Geometry. Its vanishing defines the projective dual of the Segre embedding of three copies of the projective line (a toric variety) [13], and also coincides with the tangential variety of the same Segre product [24, 28, 33]. On real tensors it separates real ranks 2 and 3 [9]. It is the unique relation among the principal minors of a general 3 × 3 symmetric matrix [18].
    [Show full text]
  • Singularities of Hyperdeterminants Annales De L’Institut Fourier, Tome 46, No 3 (1996), P
    ANNALES DE L’INSTITUT FOURIER JERZY WEYMAN ANDREI ZELEVINSKY Singularities of hyperdeterminants Annales de l’institut Fourier, tome 46, no 3 (1996), p. 591-644 <http://www.numdam.org/item?id=AIF_1996__46_3_591_0> © Annales de l’institut Fourier, 1996, tous droits réservés. L’accès aux archives de la revue « Annales de l’institut Fourier » (http://annalif.ujf-grenoble.fr/) implique l’accord avec les conditions gé- nérales d’utilisation (http://www.numdam.org/conditions). Toute utilisa- tion commerciale ou impression systématique est constitutive d’une in- fraction pénale. Toute copie ou impression de ce fichier doit conte- nir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ Ann. Inst. Fourier, Grenoble 46, 3 (1996), 591-644 SINGULARITIES OF HYPERDETERMINANTS by J. WEYMAN (1) and A. ZELEVINSKY (2) Contents. 0. Introduction 1. Symmetric matrices with diagonal lacunae 2. Cusp type singularities 3. Eliminating special node components 4. The generic node component 5. Exceptional cases: the zoo of three- and four-dimensional matrices 6. Decomposition of the singular locus into cusp and node parts 7. Multi-dimensional "diagonal" matrices and the Vandermonde matrix 0. Introduction. In this paper we continue the study of hyperdeterminants recently undertaken in [4], [5], [12]. The hyperdeterminants are analogs of deter- minants for multi-dimensional "matrices". Their study was initiated by (1) Partially supported by the NSF (DMS-9102432). (2) Partially supported by the NSF (DMS- 930424 7). Key words: Hyperdeterminant - Singular locus - Cusp type singularities - Node type singularities - Projectively dual variety - Segre embedding. Math. classification: 14B05.
    [Show full text]
  • Emmy Noether, Greatest Woman Mathematician Clark Kimberling
    Emmy Noether, Greatest Woman Mathematician Clark Kimberling Mathematics Teacher, March 1982, Volume 84, Number 3, pp. 246–249. Mathematics Teacher is a publication of the National Council of Teachers of Mathematics (NCTM). With more than 100,000 members, NCTM is the largest organization dedicated to the improvement of mathematics education and to the needs of teachers of mathematics. Founded in 1920 as a not-for-profit professional and educational association, NCTM has opened doors to vast sources of publications, products, and services to help teachers do a better job in the classroom. For more information on membership in the NCTM, call or write: NCTM Headquarters Office 1906 Association Drive Reston, Virginia 20191-9988 Phone: (703) 620-9840 Fax: (703) 476-2970 Internet: http://www.nctm.org E-mail: [email protected] Article reprinted with permission from Mathematics Teacher, copyright March 1982 by the National Council of Teachers of Mathematics. All rights reserved. mmy Noether was born over one hundred years ago in the German university town of Erlangen, where her father, Max Noether, was a professor of Emathematics. At that time it was very unusual for a woman to seek a university education. In fact, a leading historian of the day wrote that talk of “surrendering our universities to the invasion of women . is a shameful display of moral weakness.”1 At the University of Erlangen, the Academic Senate in 1898 declared that the admission of women students would “overthrow all academic order.”2 In spite of all this, Emmy Noether was able to attend lectures at Erlangen in 1900 and to matriculate there officially in 1904.
    [Show full text]
  • Arxiv:1404.6852V1 [Quant-Ph] 28 Apr 2014 Asnmes 36.A 22.J 03.65.-W 02.20.Hj, 03.67.-A, Numbers: PACS Given
    SLOCC Invariants for Multipartite Mixed States Naihuan Jing1,5,∗ Ming Li2,3, Xianqing Li-Jost2, Tinggui Zhang2, and Shao-Ming Fei2,4 1School of Sciences, South China University of Technology, Guangzhou 510640, China 2Max-Planck-Institute for Mathematics in the Sciences, 04103 Leipzig, Germany 3Department of Mathematics, China University of Petroleum , Qingdao 266555, China 4School of Mathematical Sciences, Capital Normal University, Beijing 100048, China 5Department of Mathematics, North Carolina State University, Raleigh, NC 27695, USA Abstract We construct a nontrivial set of invariants for any multipartite mixed states under the SLOCC symmetry. These invariants are given by hyperdeterminants and independent from basis change. In particular, a family of d2 invariants for arbitrary d-dimensional even partite mixed states are explicitly given. PACS numbers: 03.67.-a, 02.20.Hj, 03.65.-w arXiv:1404.6852v1 [quant-ph] 28 Apr 2014 ∗Electronic address: [email protected] 1 I. INTRODUCTION Classification of multipartite states under stochastic local operations and classical commu- nication (SLOCC) has been a central problem in quantum communication and computation. Recently advances have been made for the classification of pure multipartite states under SLOCC [1, 2] and the dimension of the space of homogeneous SLOCC-invariants in a fixed degree is given as a function of the number of qudits. In this work we present a general method to construct polynomial invariants for mixed states under SLOCC. In particular we also derive general invariants under local unitary (LU) symmetry for mixed states. Polynomial invariants have been investigated in [3–6], which allow in principle to deter- mine all the invariants of local unitary transformations.
    [Show full text]
  • Hyperdeterminants As Integrable Discrete Systems
    Takustraße 7 Konrad-Zuse-Zentrum D-14195 Berlin-Dahlem f¨ur Informationstechnik Berlin Germany SERGEY P. TSAREV 1, THOMAS WOLF 2 Hyperdeterminants as integrable discrete systems 1Siberian Federal University, Krasnoyarsk, Russia 2Department of Mathematics, Brock University, St.Catharines, Canada and ZIB Fellow ZIB-Report 09-17 (May 2009) Hyperdeterminants as integrable discrete systems S.P. Tsarev‡ and T. Wolf Siberian Federal University, Svobodnyi avenue, 79, 660041, Krasnoyarsk, Russia and Department of Mathematics, Brock University 500 Glenridge Avenue, St.Catharines, Ontario, Canada L2S 3A1 e-mails: [email protected] [email protected] Abstract We give the basic definitions and some theoretical results about hyperdeter- minants, introduced by A. Cayley in 1845. We prove integrability (understood as 4d-consistency) of a nonlinear difference equation defined by the 2×2×2 - hy- perdeterminant. This result gives rise to the following hypothesis: the difference equations defined by hyperdeterminants of any size are integrable. We show that this hypothesis already fails in the case of the 2 × 2 × 2 × 2 - hyperdeterminant. 1 Introduction Discrete integrable equations have become a very vivid topic in the last decade. A number of important results on the classification of different classes of such equations, based on the notion of consistency [3], were obtained in [1, 2, 17] (cf. also references to earlier publications given there). As a rule, discrete equations describe relations on the C Zn scalar field variables fi1...in ∈ associated with the points of a lattice with vertices n at integer points in the n-dimensional space R = {(x1,...,xn)|xs ∈ R}. If we take the elementary cubic cell Kn = {(i1,...,in) | is ∈{0, 1}} of this lattice and the field n variables fi1...in associated to its 2 vertices, an n-dimensional discrete system of the type considered here is given by an equation of the form Qn(f)=0.
    [Show full text]
  • Lectures on Algebraic Statistics
    Lectures on Algebraic Statistics Mathias Drton, Bernd Sturmfels, Seth Sullivant September 27, 2008 2 Contents 1 Markov Bases 7 1.1 Hypothesis Tests for Contingency Tables . 7 1.2 Markov Bases of Hierarchical Models . 17 1.3 The Many Bases of an Integer Lattice . 26 2 Likelihood Inference 35 2.1 Discrete and Gaussian Models . 35 2.2 Likelihood Equations for Implicit Models . 46 2.3 Likelihood Ratio Tests . 54 3 Conditional Independence 67 3.1 Conditional Independence Models . 67 3.2 Graphical Models . 75 3.3 Parametrizations of Graphical Models . 85 4 Hidden Variables 95 4.1 Secant Varieties in Statistics . 95 4.2 Factor Analysis . 105 5 Bayesian Integrals 113 5.1 Information Criteria and Asymptotics . 113 5.2 Exact Integration for Discrete Models . 122 6 Exercises 131 6.1 Markov Bases Fixing Subtable Sums . 131 6.2 Quasi-symmetry and Cycles . 136 6.3 A Colored Gaussian Graphical Model . 139 6.4 Instrumental Variables and Tangent Cones . 143 6.5 Fisher Information for Multivariate Normals . 150 6.6 The Intersection Axiom and Its Failure . 152 6.7 Primary Decomposition for CI Inference . 155 6.8 An Independence Model and Its Mixture . 158 7 Open Problems 165 4 Contents Preface Algebraic statistics is concerned with the development of techniques in algebraic geometry, commutative algebra, and combinatorics, to address problems in statis- tics and its applications. On the one hand, algebra provides a powerful tool set for addressing statistical problems. On the other hand, it is rarely the case that algebraic techniques are ready-made to address statistical challenges, and usually new algebraic results need to be developed.
    [Show full text]
  • Hyperdeterminants of Polynomials
    Hyperdeterminants of Polynomials Luke Oeding University of California, Berkeley June 5, 2012 Support: NSF IRFP (#0853000) while at the University of Florence. Luke Oeding (UC Berkeley) Hyperdets of Polys June 5, 2012 1 / 23 Quadratic polynomials, matrices, and discriminants Square matrix Quadratic polynomial a a f = ax 2 + bx + c A = 1;1 1;2 a2;1 a2;2 discriminant ∆(f ) = ac − b2=4: determinant a1;1a2;2 − a1;2a2;1: vanishes when A is singular- vanishes when f is singular e.g. columns linearly dependent. ∆(f ) = 0 () f has a repeated root. Notice can associate to f a symmetric matrix a b=2 A = f b=2 c and det(Af ) = ∆(f ). Luke Oeding (UC Berkeley) Hyperdets of Polys June 5, 2012 2 / 23 Quadratic polynomials, matrices, and discriminants Square matrix Quadratic polynomial f = 0a a a ::: a 1 X 2 X 1;1 1;2 1;3 1;n ai;i xi + ai;j 2xi xj Ba2;1 a2;2 a2;3 ::: a2;nC 1≤i≤n 1≤i<j≤n A = B C B . .. C @ . ::: . A l Symmetric matrix Af = an;1 an;2 an;3 ::: an;n 0 1 a1;1 a1;2 a1;3 ::: a1;n determinant det(A): Ba1;2 a2;2 a2;3 ::: a2;nC vanishes when A is singular- B C B . .. C e.g. columns linearly dependent. @ . ::: . A a1;n a2;n a3;n ::: an;n discriminant ∆(f ): vanishes when f is singular i.e. has a repeated root. If f is quadratic, then det(Af ) = ∆(f ). The symmetrization of the determinant of a matrix = the determinant of a symmetrized matrix.
    [Show full text]
  • Hyperdeterminants and Symmetric Functions
    Hyperdeterminants and symmetric functions Jean-Gabriel Luque in collaboration with Christophe Carr´e 24 novembre 2012 Jean-Gabriel Luque in collaboration with Christophe Carr´e Hyperdeterminants and symmetric functions The notion is due to Cayley (1846). For k = 2 we recover the classical determinant. Hyperdeterminants A little history Simplest generalization of the determinant to higher tensor (arrays M = (Mi1;:::;ik )1≤i1;:::;ik ) 1 X Det(M) = (σ ) : : : (σ )M ::: M ; n! 1 2 σ1(1),...,σk (1) σ1(n),...,σk (n) σ1,...,σk 2Sn (σ) is the sign of the permutation σ. Jean-Gabriel Luque in collaboration with Christophe Carr´e Hyperdeterminants and symmetric functions For k = 2 we recover the classical determinant. Hyperdeterminants A little history Simplest generalization of the determinant to higher tensor (arrays M = (Mi1;:::;ik )1≤i1;:::;ik ) 1 X Det(M) = (σ ) : : : (σ )M ::: M ; n! 1 2 σ1(1),...,σk (1) σ1(n),...,σk (n) σ1,...,σk 2Sn (σ) is the sign of the permutation σ. The notion is due to Cayley (1846). Jean-Gabriel Luque in collaboration with Christophe Carr´e Hyperdeterminants and symmetric functions Hyperdeterminants A little history Simplest generalization of the determinant to higher tensor (arrays M = (Mi1;:::;ik )1≤i1;:::;ik ) 1 X Det(M) = (σ ) : : : (σ )M ::: M ; n! 1 2 σ1(1),...,σk (1) σ1(n),...,σk (n) σ1,...,σk 2Sn (σ) is the sign of the permutation σ. The notion is due to Cayley (1846). For k = 2 we recover the classical determinant. Jean-Gabriel Luque in collaboration with Christophe Carr´e Hyperdeterminants and symmetric functions
    [Show full text]
  • The Invariant Theory of Binary Forms
    BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 10, Number 1, January 1984 THE INVARIANT THEORY OF BINARY FORMS BY JOSEPH P. S. KUNG1 AND GIAN-CARLO ROTA2 Dedicated to Mark Kac on his seventieth birthday Table of Contents 1. Introduction 2. Umbral Notation 2.1 Binary forms and their covariants 2.2 Umbral notation 2.3 Changes of variables 3. The Fundamental Theorems 3.1 Bracket polynomials 3.2 The straightening algorithm 3.3 The second fundamental theorem 3.4 The first fundamental theorem 4. Covariants in Terms of the Roots 4.1 Homogenized roots 4.2 Tableaux in terms of roots 4.3 Covariants and differences 4.4 Hermite's reciprocity law 5. Apolarity 5.1 The apolar covariant 5.2 Forms apolar to a given form 5.3 Sylvester's theorem 5.4 The Hessian and the cubic 6. The Finiteness Theorem 6.1 Generating sets of covariants 6.2 Circular straightening 6.3 Elemental bracket monomials 6.4 Reduction of degree 6.5 Gordan's lemma 6.6 The binary cubic 7. Further Work References 1. Introduction. Like the Arabian phoenix rising out of its ashes, the theory of invariants, pronounced dead at the turn of the century, is once again at the forefront of mathematics. During its long eclipse, the language of modern algebra was developed, a sharp tool now at long last being applied to the very Received by the editors May 26, 1983. 1980 Mathematics Subject Classification. Primary 05-02, 13-02, 14-02, 15-02. 1 Supported by a North Texas State University Faculty Research Grant.
    [Show full text]
  • Discriminants, Resultants, and Their Tropicalization
    Discriminants, resultants, and their tropicalization Course by Bernd Sturmfels - Notes by Silvia Adduci 2006 Contents 1 Introduction 3 2 Newton polytopes and tropical varieties 3 2.1 Polytopes . 3 2.2 Newton polytope . 6 2.3 Term orders and initial monomials . 8 2.4 Tropical hypersurfaces and tropical varieties . 9 2.5 Computing tropical varieties . 12 2.5.1 Implementation in GFan ..................... 12 2.6 Valuations and Connectivity . 12 2.7 Tropicalization of linear spaces . 13 3 Discriminants & Resultants 14 3.1 Introduction . 14 3.2 The A-Discriminant . 16 3.3 Computing the A-discriminant . 17 3.4 Determinantal Varieties . 18 3.5 Elliptic Curves . 19 3.6 2 × 2 × 2-Hyperdeterminant . 20 3.7 2 × 2 × 2 × 2-Hyperdeterminant . 21 3.8 Ge’lfand, Kapranov, Zelevinsky . 21 1 4 Tropical Discriminants 22 4.1 Elliptic curves revisited . 23 4.2 Tropical Horn uniformization . 24 4.3 Recovering the Newton polytope . 25 4.4 Horn uniformization . 29 5 Tropical Implicitization 30 5.1 The problem of implicitization . 30 5.2 Tropical implicitization . 31 5.3 A simple test case: tropical implicitization of curves . 32 5.4 How about for d ≥ 2 unknowns? . 33 5.5 Tropical implicitization of plane curves . 34 6 References 35 2 1 Introduction The aim of this course is to introduce discriminants and resultants, in the sense of Gel’fand, Kapranov and Zelevinsky [6], with emphasis on the tropical approach which was developed by Dickenstein, Feichtner, and the lecturer [3]. This tropical approach in mathematics has gotten a lot of attention recently in combinatorics, algebraic geometry and related fields.
    [Show full text]