DOCSLIB.ORG

Lectures on Algebraic Statistics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read 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. This way the dialogue between algebra and statistics benefits both disciplines. Algebraic statistics is a relatively new field that has developed and changed rather rapidly over the last fifteen years. One of the first pieces of work in this area was the paper of Diaconis and the second author [33], which introduced the notion of a Markov basis for log-linear statistical models and showed its connection to commutative algebra. From there, the algebra/statistics connection spread to a number of different areas including the design of experiments (highlighted in the monograph [74]), graphical models, phylogenetic invariants, parametric inference, algebraic tools for maximum likelihood estimation, and disclosure limitation, to name just a few. References to this literature are surveyed in the editorial [47] and the two review articles [4, 41] in a special issue of the journal Statistica Sinica. An area where there has been particularly strong activity is in applications to computational biology, which is highlighted in the book Algebraic Statistics for Computational Biology of Lior Pachter and the second author [73]. We will some- times refer to that book as the “ASCB book.” These lecture notes arose out of a five-day Oberwolfach Seminar, given at the Mathematisches Forschunginstitut Oberwolfach (MFO), in Germany’s Black For- est, over the days May 12–16, 2008. The seminar lectures provided an introduction to some of the fundamental notions in algebraic statistics, as well as a snapshot of some of the current research directions. Given such a short timeframe, we were forced to pick and choose topics to present, and many areas of active research in algebraic statistics have been left out. Still, we hope that these notes give an overview of some of the main ideas in the area and directions for future research. The lecture notes are an expanded version of the thirteen lectures we gave throughout the week, with many more examples and background material than we could fit into our hour-long lectures. The first five chapters cover the material in those thirteen lectures and roughly correspond to the five days of the workshop. 6 Contents Chapter 1 reviews statistical tests for contingency table analysis and explains the notion of a Markov basis for a log-linear model. We connect this notion to com- mutative algebra, and give some of the most important structural theorems about Markov bases. Chapter 2 is concerned with likelihood inference in algebraic statis- tical models. We introduce these models for discrete and normal random variables, explain how to solve the likelihood equations parametrically and implicitly, and show how model geometry connects to asymptotics of likelihood ratio statistics. Chapter 3 is an algebraic study of conditional independence structures. We intro- duce these generally, and then focus in on the special class of graphical models. Chapter 4 is an introduction to hidden variable models. From the algebraic point of view, these models often give rise to secant varieties. Finally, Chapter 5 con- cerns Bayesian integrals, both from an asymptotic large-sample perspective and from the standpoint of exact evaluation for small samples. During our week in Oberwolfach, we held several student problem sessions to complement our lectures. We created eight problems highlighting material from the different lectures and assigned the students into groups to work on these problems. The exercises presented a range of computational and theoretical challenges. After daily and sometimes late-night problem solving sessions, the students wrote up solutions, which appear in Chapter 6. On the closing day of the workshop, we held an open problem session, where we and the participants presented open research problems related to algebraic statistics. These appear in Chapter 7. There are many people to thank for their help in the preparation of this book. First, we would like to thank the MFO and its staff for hosting our Oberwolfach Seminar, which provided a wonderful environment for our research lectures. In par- ticular, we thank MFO director Gert-Martin Greuel for suggesting that we prepare these lecture notes. Second, we thank Birkh¨auser editor Thomas Hempfling for his help with our manuscript. Third, we acknowledge support by grants from the U.S. National Science Foundation (Drton DMS-0746265; Sturmfels DMS-0456960; Sullivant DMS-0700078 and 0840795). Bernd Sturmfels was also supported by an Alexander von Humboldt research prize at TU Berlin. Finally, and most im- portantly, we would like to thank the participants of the seminar. Their great enthusiasm and energy created a very stimulating environment for teaching this material. The participants were Florian Block, Dustin Cartwright, Filip Cools, J¨ornDannemann, Alex Engstr¨om, Thomas Friedrich, Hajo Holzmann, Thomas Kahle, Anna Kedzierska, Martina Kubitzke, Krzysztof Latuszynski, Shaowei Lin, Hugo Maruri-Aguilar, Sofia Massa, Helene Neufeld, Mounir Nisse, Johannes Rauh, Christof S¨oger,Carlos Trenado, Oliver Wienand, Zhiqiang Xu, Or Zuk, and Piotr Zwiernik. Chapter 1 Markov Bases This chapter introduces the fundamental notion of a Markov basis, which repre- sents one of the first connections between commutative algebra and statistics. This connection was made in the work of Diaconis and Sturmfels [33] on contingency table analysis. Statistical hypotheses about contingency tables can be tested in an exact approach by performing random walks on a constrained set of tables with non-negative integer entries. Markov bases are of key importance to this statis- tical methodology because they comprise moves between tables that ensure that the random walk connects every pair of tables in the considered set. Section 1.1 reviews the basics of contingency tables and exact tests; for more background see also the books by Agresti [1], Bishop, Holland, Fienberg [18], or Christensen [21]. Section 1.2 discusses Markov bases in the context of hierarchical log-linear models and undirected graphical models. The problem of computing Markov bases is addressed in Section 1.3, where the problem is placed in the general context of integer lattices and tied to the algebraic notion of a lattice ideal. 1.1 Hypothesis Tests for Contingency Tables A contingency table contains counts obtained by cross-classifying observed cases according to two or more discrete criteria. Here the word ‘discrete’ refers to cri- teria with a finite number of possible levels. As an example consider the 2 × 2- contingency table shown in Table 1.1.1. This table, which is taken from [1, §5.2.2], presents a classification of 326 homicide indictments in Florida in the 1970s. The two binary classification criteria are the defendant’s race and whether or not the defendant received the death penalty. A basic question of interest for this table is whether at the time death penalty decisions were made independently of the de- fendant’s race. In this section we will discuss statistical tests of such independence hypotheses as well as generalizations for larger tables. 8 Chapter 1. Markov Bases Death Penalty Defendant’s Race Yes No Total White 19 141 160 Black 17 149 166 Total 36 290 326 Table 1.1.1: Data on death penalty verdicts. Classifying a randomly selected case according to two criteria with r and c levels, respectively, yields two random variables X and Y . We code their possible outcomes as [r] and [c], where [r] := {1, 2, . , r} and [c] := {1, 2, . , c}. All probabilistic information about X and Y is contained in the joint probabilities pij = P (X = i, Y = j), i ∈ [r], j ∈ [c], which determine in particular the marginal probabilities c X pi+ := pij = P (X = i), i ∈ [r], j=1 r X p+j := pij = P (Y = j), j ∈ [c]. i=1 Definition 1.1.1. The two random variables X and Y are independent if the joint probabilities factor as pij = pi+p+j for all i ∈ [r] and j ∈ [c]. We use the symbol X⊥⊥Y to denote independence of X and Y . Proposition 1.1.2. The two random variables X and Y are independent if and only if the r × c-matrix p = (pij) has rank 1. Proof. (=⇒): The factorization in Definition 1.1.1 writes the matrix p as the prod- uct of the column vector filled with the marginal probabilities pi+ and the row vector filled with the probabilities p+j.
Load more

Recommended publications
  • A Computer Algebra System for R: Macaulay2 and the M2r Package
    A computer algebra system for R: Macaulay2 and the m2r package David Kahle∗1, Christopher O'Neilly2, and Jeff Sommarsz3 1Department of Statistical Science, Baylor University 2Department of Mathematics, University of California, Davis 3Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago Abstract Algebraic methods have a long history in statistics. The most prominent manifestation of modern algebra in statistics can be seen in the field of algebraic statistics, which brings tools from commutative algebra and algebraic geometry to bear on statistical problems. Now over two decades old, algebraic statistics has applications in a wide range of theoretical and applied statistical domains. Nevertheless, algebraic statistical methods are still not mainstream, mostly due to a lack of easy off-the-shelf imple- mentations. In this article we debut m2r, an R package that connects R to Macaulay2 through a persistent back-end socket connection running locally or on a cloud server. Topics range from basic use of m2r to applications and design philosophy. 1 Introduction Algebra, a branch of mathematics concerned with abstraction, structure, and symmetry, has a long history of applications in statistics. For example, Pearson's early work on method of moments estimation in mixture models ultimately involved systems of polynomial equations that he painstakingly and remarkably solved by hand (Pearson, 1894; Am´endolaet al., 2016). Fisher's work in design was strongly algebraic and combinato- rial, focusing on topics such as Latin squares (Fisher, 1934). Invariance and equivariance continue to form a major pillar of mathematical statistics through the lens of location-scale families (Pitman, 1939; Bondesson, 1983; Lehmann and Romano, 2005).
    [Show full text]
  • Algebraic Statistics Tutorial I Alleles Are in Hardy-Weinberg Equilibrium, the Genotype Frequencies Are
    Example: Hardy-Weinberg Equilibrium Suppose a gene has two alleles, a and A. If allele a occurs in the population with frequency θ (and A with frequency 1 − θ) and these Algebraic Statistics Tutorial I alleles are in Hardy-Weinberg equilibrium, the genotype frequencies are P(X = aa)=θ2, P(X = aA)=2θ(1 − θ), P(X = AA)=(1 − θ)2 Seth Sullivant The model of Hardy-Weinberg equilibrium is the set North Carolina State University July 22, 2012 2 2 M = θ , 2θ(1 − θ), (1 − θ) | θ ∈ [0, 1] ⊂ ∆3 2 I(M)=paa+paA+pAA−1, paA−4paapAA Seth Sullivant (NCSU) Algebraic Statistics July 22, 2012 1 / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, 2012 2 / 32 Main Point of This Tutorial Phylogenetics Problem Given a collection of species, find the tree that explains their history. Many statistical models are described by (semi)-algebraic constraints on a natural parameter space. Generators of the vanishing ideal can be useful for constructing algorithms or analyzing properties of statistical model. Two Examples Phylogenetic Algebraic Geometry Sampling Contingency Tables Data consists of aligned DNA sequences from homologous genes Human: ...ACCGTGCAACGTGAACGA... Chimp: ...ACCTTGGAAGGTAAACGA... Gorilla: ...ACCGTGCAACGTAAACTA... Seth Sullivant (NCSU) Algebraic Statistics July 22, 2012 3 / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, 2012 4 / 32 Model-Based Phylogenetics Phylogenetic Models Use a probabilistic model of mutations Assuming site independence: Parameters for the model are the combinatorial tree T , and rate Phylogenetic Model is a latent class graphical model parameters for mutations on each edge Vertex v ∈ T gives a random variable Xv ∈ {A, C, G, T} Models give a probability for observing a particular aligned All random variables corresponding to internal nodes are latent collection of DNA sequences ACCGTGCAACGTGAACGA Human: X1 X2 X3 Chimp: ACGTTGCAAGGTAAACGA Gorilla: ACCGTGCAACGTAAACTA Y 2 Assuming site independence, data is summarized by empirical Y 1 distribution of columns in the alignment.
    [Show full text]
  • Elect Your Council
    Volume 41 • Issue 3 IMS Bulletin April/May 2012 Elect your Council Each year IMS holds elections so that its members can choose the next President-Elect CONTENTS of the Institute and people to represent them on IMS Council. The candidate for 1 IMS Elections President-Elect is Bin Yu, who is Chancellor’s Professor in the Department of Statistics and the Department of Electrical Engineering and Computer Science, at the University 2 Members’ News: Huixia of California at Berkeley. Wang, Ming Yuan, Allan Sly, The 12 candidates standing for election to the IMS Council are (in alphabetical Sebastien Roch, CR Rao order) Rosemary Bailey, Erwin Bolthausen, Alison Etheridge, Pablo Ferrari, Nancy 4 Author Identity and Open L. Garcia, Ed George, Haya Kaspi, Yves Le Jan, Xiao-Li Meng, Nancy Reid, Laurent Bibliography Saloff-Coste, and Richard Samworth. 6 Obituary: Franklin Graybill The elected Council members will join Arnoldo Frigessi, Steve Lalley, Ingrid Van Keilegom and Wing Wong, whose terms end in 2013; and Sandrine Dudoit, Steve 7 Statistical Issues in Assessing Hospital Evans, Sonia Petrone, Christian Robert and Qiwei Yao, whose terms end in 2014. Performance Read all about the candidates on pages 12–17, and cast your vote at http://imstat.org/elections/. Voting is open until May 29. 8 Anirban’s Angle: Learning from a Student Left: Bin Yu, candidate for IMS President-Elect. 9 Parzen Prize; Recent Below are the 12 Council candidates. papers: Probability Surveys Top row, l–r: R.A. Bailey, Erwin Bolthausen, Alison Etheridge, Pablo Ferrari Middle, l–r: Nancy L. Garcia, Ed George, Haya Kaspi, Yves Le Jan 11 COPSS Fisher Lecturer Bottom, l–r: Xiao-Li Meng, Nancy Reid, Laurent Saloff-Coste, Richard Samworth 12 Council Candidates 18 Awards nominations 19 Terence’s Stuff: Oscars for Statistics? 20 IMS meetings 24 Other meetings 27 Employment Opportunities 28 International Calendar of Statistical Events 31 Information for Advertisers IMS Bulletin 2 .
    [Show full text]
  • Algebraic Statistics of Design of Experiments
    Thammasat University, Bangkok Algebraic Statistics of Design of Experiments Giovanni Pistone Bangkok, March 14 2012 The talk 1. A short history of AS from a personal perspective. See a longer account by E. Riccomagno in • E. Riccomagno, Metrika 69(2-3), 397 (2009), ISSN 0026-1335, http://dx.doi.org/10.1007/s00184-008-0222-3. 2. The algebraic description of a designed experiment. I use the tutorial by M.P. Rogantin: • http://www.dima.unige.it/~rogantin/AS-DOE.pdf 3. Topics from the theory, cfr. the course teached by E. Riccomagno, H. Wynn and Hugo Maruri-Aguilar in 2009 at the Second de Brun Workshop in Galway: • http://hamilton.nuigalway.ie/DeBrunCentre/ SecondWorkshop/online.html. CIMPA Ecole \Statistique", 1980 `aNice (France) Sumate Sompakdee, GP, and Chantaluck Na Pombejra First paper People • Roberto Fontana, DISMA Politecnico di Torino. • Fabio Rapallo, Universit`adel Piemonte Orientale. • Eva Riccomagno DIMA Universit`adi Genova. • Maria Piera Rogantin, DIMA, Universit`adi Genova. • Henry P. Wynn, LSE London. AS and DoE: old biblio and state of the art Beginning of AS in DoE • G. Pistone, H.P. Wynn, Biometrika 83(3), 653 (1996), ISSN 0006-3444 • L. Robbiano, Gr¨obnerBases and Statistics, in Gr¨obnerBases and Applications (Proc. of the Conf. 33 Years of Gr¨obnerBases), edited by B. Buchberger, F. Winkler (Cambridge University Press, 1998), Vol. 251 of London Mathematical Society Lecture Notes, pp. 179{204 • R. Fontana, G. Pistone, M. Rogantin, Journal of Statistical Planning and Inference 87(1), 149 (2000), ISSN 0378-3758 • G. Pistone, E. Riccomagno, H.P. Wynn, Algebraic statistics: Computational commutative algebra in statistics, Vol.
    [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]
  • Computations in Algebraic Geometry with Macaulay 2
    Computations in algebraic geometry with Macaulay 2 Editors: D. Eisenbud, D. Grayson, M. Stillman, and B. Sturmfels Preface Systems of polynomial equations arise throughout mathematics, science, and engineering. Algebraic geometry provides powerful theoretical techniques for studying the qualitative and quantitative features of their solution sets. Re- cently developed algorithms have made theoretical aspects of the subject accessible to a broad range of mathematicians and scientists. The algorith- mic approach to the subject has two principal aims: developing new tools for research within mathematics, and providing new tools for modeling and solv- ing problems that arise in the sciences and engineering. A healthy synergy emerges, as new theorems yield new algorithms and emerging applications lead to new theoretical questions. This book presents algorithmic tools for algebraic geometry and experi- mental applications of them. It also introduces a software system in which the tools have been implemented and with which the experiments can be carried out. Macaulay 2 is a computer algebra system devoted to supporting research in algebraic geometry, commutative algebra, and their applications. The reader of this book will encounter Macaulay 2 in the context of concrete applications and practical computations in algebraic geometry. The expositions of the algorithmic tools presented here are designed to serve as a useful guide for those wishing to bring such tools to bear on their own problems. A wide range of mathematical scientists should find these expositions valuable. This includes both the users of other programs similar to Macaulay 2 (for example, Singular and CoCoA) and those who are not interested in explicit machine computations at all.
    [Show full text]
  • Prizes and Awards Session
    PRIZES AND AWARDS SESSION Wednesday, July 12, 2021 9:00 AM EDT 2021 SIAM Annual Meeting July 19 – 23, 2021 Held in Virtual Format 1 Table of Contents AWM-SIAM Sonia Kovalevsky Lecture ................................................................................................... 3 George B. Dantzig Prize ............................................................................................................................. 5 George Pólya Prize for Mathematical Exposition .................................................................................... 7 George Pólya Prize in Applied Combinatorics ......................................................................................... 8 I.E. Block Community Lecture .................................................................................................................. 9 John von Neumann Prize ......................................................................................................................... 11 Lagrange Prize in Continuous Optimization .......................................................................................... 13 Ralph E. Kleinman Prize .......................................................................................................................... 15 SIAM Prize for Distinguished Service to the Profession ....................................................................... 17 SIAM Student Paper Prizes ....................................................................................................................
    [Show full text]
  • Arxiv:2010.06953V2 [Math.RA] 23 Apr 2021
    IDENTITIES AND BASES IN THE HYPOPLACTIC MONOID ALAN J. CAIN, ANTÓNIO MALHEIRO, AND DUARTE RIBEIRO Abstract. This paper presents new results on the identities satisfied by the hypoplactic monoid. We show how to embed the hypoplactic monoid of any rank strictly greater than 2 (including infinite rank) into a direct product of copies of the hypoplactic monoid of rank 2. This confirms that all hypoplactic monoids of rank greater than or equal to 2 satisfy exactly the same identities. We then give a complete characterization of those identities, and prove that the variety generated by the hypoplactic monoid has finite axiomatic rank, by giving a finite basis for it. 1. Introduction A (non-trivial) identity is a formal equality u ≈ v, where u and v are words over some alphabet of variables, which is not of the form u ≈ u. If a monoid is known to satisfy an identity, an important question is whether the set of identities it satisfies is finitely based, that is, if all these identities are consequences of those in some finite subset (see [37, 42]). The plactic monoid plac, also known as the monoid of Young tableaux, is an important algebraic structure, first studied by Schensted [38] and Knuth [23], and later studied in depth by Lascoux and Schützenberger [27]. It is connected to many different areas of Mathematics, such as algebraic combinatorics, symmetric functions [29], crystal bases [4] and representation theory [14]. In particular, the question of identities in the plactic monoid has received a lot of attention recently [26, 20]. Finitely-generated polynomial-growth groups are virtually nilpotent and so sat- isfy identities [16].
    [Show full text]
  • A Widely Applicable Bayesian Information Criterion
    JournalofMachineLearningResearch14(2013)867-897 Submitted 8/12; Revised 2/13; Published 3/13 A Widely Applicable Bayesian Information Criterion Sumio Watanabe [email protected] Department of Computational Intelligence and Systems Science Tokyo Institute of Technology Mailbox G5-19, 4259 Nagatsuta, Midori-ku Yokohama, Japan 226-8502 Editor: Manfred Opper Abstract A statistical model or a learning machine is called regular if the map taking a parameter to a prob- ability distribution is one-to-one and if its Fisher information matrix is always positive definite. If otherwise, it is called singular. In regular statistical models, the Bayes free energy, which is defined by the minus logarithm of Bayes marginal likelihood, can be asymptotically approximated by the Schwarz Bayes information criterion (BIC), whereas in singular models such approximation does not hold. Recently, it was proved that the Bayes free energy of a singular model is asymptotically given by a generalized formula using a birational invariant, the real log canonical threshold (RLCT), instead of half the number of parameters in BIC. Theoretical values of RLCTs in several statistical models are now being discovered based on algebraic geometrical methodology. However, it has been difficult to estimate the Bayes free energy using only training samples, because an RLCT depends on an unknown true distribution. In the present paper, we define a widely applicable Bayesian information criterion (WBIC) by the average log likelihood function over the posterior distribution with the inverse temperature 1/logn, where n is the number of training samples. We mathematically prove that WBIC has the same asymptotic expansion as the Bayes free energy, even if a statistical model is singular for or unrealizable by a statistical model.
    [Show full text]
  • Vita BERND STURMFELS Department of Mathematics, University of California, Berkeley, CA 94720 Phone
    Vita BERND STURMFELS Department of Mathematics, University of California, Berkeley, CA 94720 Phone: (510) 642 4687, Fax: (510) 642 8204, [email protected] M.A. [Diplom] TH Darmstadt, Germany, Mathematics and Computer Science, 1985 Ph.D. [Dr. rer. nat.] TH Darmstadt, Germany, Mathematics, 1987 Ph.D. University of Washington, Seattle, Mathematics, 1987 Professional Experience: 1987–1988 Postdoctoral Fellow, I.M.A., University of Minnesota, Minneapolis 1988–1989 Assistant Professor, Research Institute for Symbolic Computation, (RISC-Linz), Linz, Austria 1989–1991 Assistant Professor, Department of Mathematics, Cornell University 1992–1996 Associate Professor, Department of Mathematics, Cornell University 1994–2001 Professor, Department of Mathematics, University of California, Berkeley 2001– Professor, Department of Mathematics and Computer Science, UC Berkeley Academic Honors: 1986 - 1987 Alfred P. Sloan Doctoral Dissertation Fellowship 1991 - 1993 Alfred P. Sloan Research Fellow 1992 - 1997 National Young Investigator (NSF) 1992 - 1997 David and Lucile Packard Fellowship 1999 Lester R. Ford Prize for Expository Writing (MAA) 2000-2001 Miller Research Professorship, UC Berkeley Spring 2003 John von Neumann Professor, Technical University M¨unchen 2003-2004 Hewlett-Packard Research Professor at MSRI Berkeley July 2004 Clay Mathematics Institute Senior Scholar Research Interests: Computational Algebra, Combinatorics, Algebraic Geometry Selected Professional Activities: Visiting Positions: D´epartment de Math´ematiques, Universit´ede Nice, France, Spring 1989 Mathematical Sciences Research Institute, Berkeley, Fall 1992 Courant Institute, New York University, 1994–95 RIMS, Kyoto University, Japan, 1997–98 Current Editorial Board Membership: Journal of the American Mathematical Society, Duke Mathematical Journal, Collecteana Mathematica, Beitr¨agezur Geometrie und Algebra, Order, Discrete and Computational Geometry, Applicable Algebra (AAECC) Journal of Combinatorial Theory (Ser.
    [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]
  • 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]