ALGEBRA: From Linear to Non-Linear. Bernd Sturmfels University of California at Berkeley
|
|
- Egbert Thornton
- 5 years ago
- Views:
Transcription
1 ALGEBRA: From Linear to Non-Linear Bernd Sturmfels University of California at Berkeley John von Neumann Lecture, SIAM Annual Meeting, Pittsburgh, July 13, 2010
2 Undergraduate Linear Algebra All undergraduate students learn about Gaussian elimination, a general method for solving linear systems of algebraic equations: Input: x + 2y + 3z = 5 7x + 11y + 13z = 17 19x + 23y + 29z = 31
3 Undergraduate Linear Algebra All undergraduate students learn about Gaussian elimination, a general method for solving linear systems of algebraic equations: Input: Output: x + 2y + 3z = 5 7x + 11y + 13z = 17 19x + 23y + 29z = 31 x = 35/18 y = 2/9 z = 13/6 Solving very large linear systems is central to applied mathematics.
4 Undergraduate Non-Linear Algebra Lucky undergraduate students also learn about Gröbner bases, a general method for non-linear systems of algebraic equations: Input: x 2 + y 2 + z 2 = 2 x 3 + y 3 + z 3 = 3 x 4 + y 4 + z 4 = 4
5 Undergraduate Non-Linear Algebra Lucky undergraduate students also learn about Gröbner bases, a general method for non-linear systems of algebraic equations: Input: x 2 + y 2 + z 2 = 2 x 3 + y 3 + z 3 = 3 x 4 + y 4 + z 4 = 4 Output: 3z 12 12z 10 12z 9 +12z 8 +72z 7 66z 6 12z 4 +12z 3 1 = 0 4y 2 + (36z z 10 69z 9 252z 8 216z z 6 +72z 5 12z 4 99z 3 +10z+3) y + 36z z 10 72z 9 234z 8 192z z 6 48z 5 +96z 4 96z 3 +10z 2 +8 = 0 4x + 4y + 36z z 10 69z 9 252z 8 216z z 6 +72z 5 12z 4 99z 3 +10z+3 = 0 Non-linear equations can be intimidating, but they are important.
6 This Lecture What I shall speak about: Chemical Reaction Networks Convex Algebraic Geometry Tropical Mathematics What others will speak about: Numerical Algebraic Geometry Algebraic Methods in Discrete Optimization Multilinear Algebra and Tensors Algebraic Statistics
7 Topic 1: CHEMICAL REACTION NETWORKS Chemical species A, B, H, O,... can form complexes that react: A + B 2H + O We write complexes in multiplicative notation: AB H 2 O A chemical reaction network is a collection of such reactions. Associated with each reaction is a rate constant κ R >0. The concentrations c (t) of the species are functions of time t. Relevant authors include F. Horn, R. Jackson, M. Feinberg, E. Sontag, D. Anderson, G. Gnacadja, J. Gunawardena, C. Conradi, J. Stelling, G. Craciun, W. Helton, P. De Leenheer, A. Shiu,... My point: Reaction network theory is important for systems biology, and non-linear algebra can make useful contributions. R. Laubenbacher and BSt: Computer algebra in systems biology, Amer. Math. Monthly 116 (2009)
8 Networks and their Siphons Suppose there are s species that form n complexes. These correspond to monomials c y 1,c y 2,...,c yn in the unknown concentrations c 1,...,c s. Our chemical reaction network is a directed graph G whose nodes are labeled by these monomials. A siphon is a subset S of species such that all reactions in a component of G are shut off when c i = 0 for all i S. Example. If the network is G = { AB H 2 O, AC H 2 O } then S = {A} and S = {B,C} are the minimal siphons of G.
9 Networks and their Siphons Suppose there are s species that form n complexes. These correspond to monomials c y 1,c y 2,...,c yn in the unknown concentrations c 1,...,c s. Our chemical reaction network is a directed graph G whose nodes are labeled by these monomials. A siphon is a subset S of species such that all reactions in a component of G are shut off when c i = 0 for all i S. Example. If the network is G = { AB H 2 O, AC H 2 O } then S = {A} and S = {B,C} are the minimal siphons of G. Question: Which faces of the positive orthant R s 0 can contain steady states of the reaction network? Proposition. If the face {c R s 0 : c i = 0 for i S} contains a steady state, for some dynamics on G, then S is a siphon.
10 Primary Decomposition Fix the ring R = Q[c 1,...,c s ]/ c 1 c 2 c s. With a chemical reaction network G we associate three ideals M G = c y 1,c y 2,...,c yn J G = c y i c y j : c y i c y j is a reaction of G I G = c y i (c y i c y j ) : c y i c y j is a reaction of G
11 Primary Decomposition Fix the ring R = Q[c 1,...,c s ]/ c 1 c 2 c s. With a chemical reaction network G we associate three ideals M G = c y 1,c y 2,...,c yn J G = c y i c y j : c y i c y j is a reaction of G I G = c y i (c y i c y j ) : c y i c y j is a reaction of G Theorem. The minimal siphons of G are the inclusion-minimal sets {i [s] : c i P} where P runs over the minimal primes of I G. If each connected component of G is strongly connected, then we can replace I G by the simpler ideal J G. If G is strongly connected, then we can replace I G by M G. [Anne Shiu and BSt: Siphons in chemical reaction networks, Bulletin of Mathematical Biology (2010)] Monomial primary decomposition is fast: (Example: 50 species and over 1,000,000 minimal siphons. Macaulay2 computes them in 43 seconds. [B. Roune] )
12 Mass-Action Kinetics The node i of the network G is labeled by the monomial c y i = c y i1 1 cy i2 2 c y is s. Y = (y ij ) is an n s-matrix of non-negative integers. The monomial labels are the entries in the row vector Ψ(c) = ( c y 1, c y 2,..., c yn). Mass-action kinetics specified by the network G and the reaction rates κ ij defines the differential equations dc dt = Ψ(c) A κ Y
13 Mass-Action Kinetics The node i of the network G is labeled by the monomial c y i = c y i1 1 cy i2 2 c y is s. Y = (y ij ) is an n s-matrix of non-negative integers. The monomial labels are the entries in the row vector Ψ(c) = ( c y 1, c y 2,..., c yn). Mass-action kinetics specified by the network G and the reaction rates κ ij defines the differential equations dc dt = Ψ(c) A κ Y, where the n n-matrix A κ is the Laplacian of G. Example. The network G = c y 1 c y 2 c y 3 has the Laplacian κ 12 κ 12 0 A κ = κ 21 κ 21 κ 23 κ 23 0 κ 32 κ 32
14 Steady State Analysis The steady states are the solutions c R s 0 Ψ(c) A κ Y = 0 of the s equations These equations are linear in the parameters κ ij but they are non-linear in the variables c 1,...,c s. Mass action on a network G is a toric dynamical system if there exists a solution c R s >0 of the n equations Ψ(c ) A κ = 0.
15 Steady State Analysis The steady states are the solutions c R s 0 Ψ(c) A κ Y = 0 of the s equations These equations are linear in the parameters κ ij but they are non-linear in the variables c 1,...,c s. Mass action on a network G is a toric dynamical system if there exists a solution c R s >0 of the n equations Ψ(c ) A κ = 0. Theorem (Craciun-Dickenstein-Shiu-St, 2009) For fixed κ, the set of such solutions c is either empty or is a toric variety, i.e. an irreducible variety cut out by binomial equations c u 1 1 cu 2 2 cus s = c v 1 1 cv 2 2 cvs s. For a fixed network G, the set κ for which it is non-empty is also a toric variety, called the moduli space of toric dynamical systems.
16 Toric Varieties connect the linear world and the non-linear world. If we set γ i = log(c i ) then the binomial equation c u 1 1 cu 2 2 cus s = c v 1 1 cv 2 2 cvs s translates into the linear equation (u 1 v 1 )γ 1 + (u 2 v 2 )γ (u s v s )γ s = 0.
17 Toric Varieties connect the linear world and the non-linear world. If we set γ i = log(c i ) then the binomial equation c u 1 1 cu 2 2 cus s = c v 1 1 cv 2 2 cvs s translates into the linear equation (u 1 v 1 )γ 1 + (u 2 v 2 )γ (u s v s )γ s = 0. But binomials have a rich structure that is essential in applications: Test Sets in Integer Programming, Markov Bases in Statistics. In context of bio-chemical reaction networks, the previous theorem elucidates the geometry behind Feinberg s Deficiency Theory, led to recent progress on the Global Attractor Conjecture.
18 Topic 2: CONVEX ALGEBRAIC GEOMETRY A spectrahedron is the intersection of the cone of positive semidefinite matrices with an affine-linear space. Its algebraic representation is a linear combination of symmetric matrices A 0 + x 1 A 1 + x 2 A x m A m 0 ( )
19 Topic 2: CONVEX ALGEBRAIC GEOMETRY A spectrahedron is the intersection of the cone of positive semidefinite matrices with an affine-linear space. Its algebraic representation is a linear combination of symmetric matrices A 0 + x 1 A 1 + x 2 A x m A m 0 ( ) Semidefinite programming is the computational problem of maximizing a linear function over a spectrahedron: Maximize c 1 x 1 + c 2 x c m x m subject to ( ) Example: The smallest eigenvalue of a symmetric matrix A is the solution of the SDP: Maximize x subject to A x Id 0.
20 Multifocal Ellipses The 3-ellipse with foci (0,0),(1,0),(0,1) has the representation 2 3 d + 3x 1 y 1 y 0 y y 1 d + x 1 0 y 0 y 0 0 y 0 d + x + 1 y y 0 0 y y 1 d x y y d + x 1 y 1 y y 0 0 y 1 d x 1 0 y y 0 y 0 d x + 1 y y 0 y y 1 d 3x + 1 This is a convex curve of degree eight. Its interior consists of all points (x,y) where this symmetric 8 8-matrix is positive definite:
21 Ellipses are Spectrahedra Theorem: The polynomial equation defining the m-ellipse has degree 2 m if m is odd and degree 2 m ( m m/2) if m is even. It is the determinant of a symmetric matrix of linear polynomials. This representation extends to m-ellipsoids in arbitrary dimensions. [J. Nie, P. Parrilo, BSt.: Semidefinite representation of the k-ellipse, in Algorithms in Algebraic Geometry, I.M.A. Volumes in Mathematics and its Applications, 146, Springer, New York, 2008, pp ] CONVEX ALGEBRAIC GEOMETRY is the marriage of real algebraic geometry with optimization theory. It concerns convex figures such as ellipses, ellipsoids, and much more... including polyhedra
22 Convex Polyhedra Linear programming is semidefinite programming for diagonal matrices. If A 0,A 1,...,A m are diagonal n n-matrices then A 0 + x 1 A 1 + x 2 A x m A m 0 translates into a system of n linear inequalities in the m unknowns. A spectrahedron defined in this manner is a convex polyhedron:
23 Spectrahedra are Beautiful......and useful too: in rank minimization, compressed sensing etc...
24 Non-Linear Convex Hull Computation Input : { (t,t 2,t 3 ) R 3 : 1 t 1 } y y The convex hull of this curve is a spectrahedron. ( ) ( ) 1 x x y Output : ± 0 x y y z y
25 Global Optimization of Polynomials Let f (x 1,...,x m ) be a polynomial of even degree 2d. We wish to compute the global minimum x of f (x) on R m. This optimization problem is hard. It is equivalent to Maximize λ such that f (x) λ is non-negative on R m. The following relaxtion gives a lower bound: Maximize λ such that f (x) λ is a sum of squares of polynomials. This is much easier. It is a semidefinite program. In practice, the optimal value of the SDP often agrees with the global minimum, and an optimal point x can be recovered. [P.Parrilo, BSt: Minimizing polynomial functions, DIMACS Ser. 60, Amer.Math.Soc., Providence, 2003, pp ]
26 SOS Programming: A Univariate Example Let m = 1, d = 2 and f (x) = 3x 4 + 4x 3 12x 2. Then f (x) λ = ( x 2 x 1 ) 3 2 µ 6 x 2 2 2µ 0 x µ 6 0 λ 1 Our problem is to find (λ,µ) such that the 3 3-matrix is positive semidefinite and λ is maximal.
27 SOS Programming: A Univariate Example Let m = 1, d = 2 and f (x) = 3x 4 + 4x 3 12x 2. Then f (x) λ = ( x 2 x 1 ) 3 2 µ 6 x 2 2 2µ 0 x µ 6 0 λ 1 Our problem is to find (λ,µ) such that the 3 3-matrix is positive semidefinite and λ is maximal. The optimal solution of this SDP is (λ,µ ) = ( 32, 2). Cholesky factorization reveals the SOS representation f (x) λ = ( ( 3 x 4 ) (x + 2) ) 2 8( ) 2. + x We see that the global minimum is x = 2. This approach works for many polynomial optimization problems.
28 Characterization of Spectrahedra A convex hypersurface of degree d in R n is rigid convex if every line passing through its interior meets the corresponding complex hypersurface in d real points. Theorem (Helton Vinnikov (2006)) Every spectrahedron is rigid convex. The converse is true for n = 2. Open problem: Is every compact convex basic semialgebraic set S the projection of a spectrahedron in higher dimensions?
29 Topic 3: TROPICAL MATHEMATICS Let s simplify arithmetic: x y = minimum of x and y x y = x + y Example: 3 (4 5) = = 7 8 = 7
30 Topic 3: TROPICAL MATHEMATICS Let s simplify arithmetic: x y = minimum of x and y x y = x + y Example: 3 (4 5) = = 7 8 = 7 Neutral Elements: x = x 0 x = x
31 Topic 3: TROPICAL MATHEMATICS Let s simplify arithmetic: x y = minimum of x and y x y = x + y Example: 3 (4 5) = = 7 8 = 7 Neutral Elements: x = x 0 x = x Matrix Multiplication: [ ] [ ] = [ ]
32 Matrices and Metrics 1 2 D = 0 d 12 d 13 d 14 d 21 0 d 23 d 24 d 31 d 32 0 d 34 d 41 d 42 d
33 Matrices and Metrics 1 2 D = 0 d 12 d 13 d 14 d 21 0 d 23 d 24 d 31 d 32 0 d 34 d 41 d 42 d 43 0 The (i,j)-entry of the matrix D k = D D D is the length of a shortest path from i to j using k steps. To find shortest pairwise distances in a directed graph with n nodes, compute the tropical matrix power D n. 3 4
34 Matrices and Metrics 1 2 D = 0 d 12 d 13 d 14 d 21 0 d 23 d 24 d 31 d 32 0 d 34 d 41 d 42 d 43 0 The (i,j)-entry of the matrix D k = D D D is the length of a shortest path from i to j using k steps. To find shortest pairwise distances in a directed graph with n nodes, compute the tropical matrix power D n. A symmetric matrix D represents a metric if and only if D 2 = D (triangle inequalities) 3 4
35 Matrices and Metrics 1 2 D = 0 d 12 d 13 d 14 d 21 0 d 23 d 24 d 31 d 32 0 d 34 d 41 d 42 d 43 0 The (i,j)-entry of the matrix D k = D D D is the length of a shortest path from i to j using k steps. To find shortest pairwise distances in a directed graph with n nodes, compute the tropical matrix power D n. A symmetric matrix D represents a metric if and only if D 2 = D (triangle inequalities) D is a tree metric if it comes from a tree with edge lengths d 12 = = 13, etc.
36 Phylogenetics Q: Is every metric a tree metric? A: No, but biologists care about those that are.
37 Phylogenetics Q: Is every metric a tree metric? A: No, but biologists care about those that are. Theorem [4 Point Condition]: A metric D is a tree metric if and only if the max-plus polynomial d ij d kl d ik d jl d il d jk attains its maximum twice, for any four leaves i, j, k and l. Theorem 2.34 in [L.Pachter and BSt: Algebraic Statistics for Computational Biology, Cambridge Univ. Press, 2007] d 12 = 13, d 13 = 11, d 14 = 8, d 23 = 14, d 24 = 9, d 34 = 9. d 12 d 34 d 13 d 24 d 14 d 23 = = 22. Theorem: The space of trees is the tropical Grassmannian G(2, n).
38 Closing Thoughts Linear Algebra has been fantastically useful. Non-Linear Algebra is the natural next step. Quiz: How to draw the convex hull of the trigonometric curve (cos(θ),cos(2θ),sin(3θ) )?
39 Closing Thoughts Linear Algebra has been fantastically useful. Non-Linear Algebra is the natural next step. Quiz: How to draw the convex hull of the trigonometric curve (cos(θ),cos(2θ),sin(3θ) )? Quiz: How many real solutions do these equations have: x 2 + y 2 + z 2 = 2 x 3 + y 3 + z 3 = 3 x 4 + y 4 + z 4 = 4 To find out, please talk to one of the members of the SIAM Activity Group in Algebraic Geometry SI(AG) 2. THANK YOU for your attention!!
SPECTRAHEDRA. Bernd Sturmfels UC Berkeley
SPECTRAHEDRA Bernd Sturmfels UC Berkeley GAeL Lecture I on Convex Algebraic Geometry Coimbra, Portugal, Monday, June 7, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following
More informationSPECTRAHEDRA. Bernd Sturmfels UC Berkeley
SPECTRAHEDRA Bernd Sturmfels UC Berkeley Mathematics Colloquium, North Carolina State University February 5, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following are equivalent:
More informationThe Geometry of Semidefinite Programming. Bernd Sturmfels UC Berkeley
The Geometry of Semidefinite Programming Bernd Sturmfels UC Berkeley Positive Semidefinite Matrices For a real symmetric n n-matrix A the following are equivalent: All n eigenvalues of A are positive real
More informationCONVEX ALGEBRAIC GEOMETRY. Bernd Sturmfels UC Berkeley
CONVEX ALGEBRAIC GEOMETRY Bernd Sturmfels UC Berkeley Multifocal Ellipses Given m points (u 1, v 1 ),...,(u m, v m )intheplaner 2,and aradiusd > 0, their m-ellipse is the convex algebraic curve { (x, y)
More informationSemidefinite Programming
Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has
More informationd A 0 + m t k A k 0 whenever λ min (B k (x)) t k λ max (B k (x)) for k = 1, 2,..., m x n B n (k).
MATRIX CUBES PARAMETERIZED BY EIGENVALUES JIAWANG NIE AND BERND STURMFELS Abstract. An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix
More informationThe Algebraic Degree of Semidefinite Programming
The Algebraic Degree ofsemidefinite Programming p. The Algebraic Degree of Semidefinite Programming BERND STURMFELS UNIVERSITY OF CALIFORNIA, BERKELEY joint work with and Jiawang Nie (IMA Minneapolis)
More informationUnbounded Convex Semialgebraic Sets as Spectrahedral Shadows
Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows Shaowei Lin 9 Dec 2010 Abstract Recently, Helton and Nie [3] showed that a compact convex semialgebraic set S is a spectrahedral shadow if the
More informationPersistence and Stationary Distributions of Biochemical Reaction Networks
Persistence and Stationary Distributions of Biochemical Reaction Networks David F. Anderson Department of Mathematics University of Wisconsin - Madison Discrete Models in Systems Biology SAMSI December
More informationToric Dynamical Systems
Toric Dynamical Systems Gheorghe Craciun Dept. of Mathematics, University of Wisconsin, Madison, WI 53706-1388, USA Alicia Dickenstein Dep. de Matemática, FCEN, Universidad de Buenos Aires, (1428), Argentina
More informationJournal of Symbolic Computation
Journal of Symbolic Computation 44 (2009) 1551 1565 Contents lists available at ScienceDirect Journal of Symbolic Computation journal homepage: wwwelseviercom/locate/jsc Toric dynamical systems Gheorghe
More informationALGEBRAIC DEGREE OF POLYNOMIAL OPTIMIZATION. 1. Introduction. f 0 (x)
ALGEBRAIC DEGREE OF POLYNOMIAL OPTIMIZATION JIAWANG NIE AND KRISTIAN RANESTAD Abstract. Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials.
More informationTropical Islands. Jan Verschelde
Tropical Islands Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu Graduate Computational Algebraic
More informationTropical Algebra. Notes by Bernd Sturmfels for the lecture on May 22, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra
Tropical Algebra Notes by Bernd Sturmfels for the lecture on May 22, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The tropical semiring (R { },, ) consists of the real numbers R,
More informationAlgebraic methods for biochemical reaction network theory. Anne Joyce Shiu
Algebraic methods for biochemical reaction network theory by Anne Joyce Shiu A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics and
More informationx y = x + y. For example, the tropical sum 4 9 = 4, and the tropical product 4 9 = 13.
Comment: Version 0.1 1 Introduction Tropical geometry is a relatively new area in mathematics. Loosely described, it is a piece-wise linear version of algebraic geometry, over a particular structure known
More informationBinomial Ideals from Graphs
Binomial Ideals from Graphs Danielle Farrar University of Washington Yolanda Manzano St. Mary s University Juan Manuel Torres-Acevedo University of Puerto Rico Humacao August 10, 2000 Abstract This paper
More informationINITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY. the affine space of dimension k over F. By a variety in A k F
INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY BOYAN JONOV Abstract. We show in this paper that the principal component of the first order jet scheme over the classical determinantal
More informationd + x u1 y v p 1 (x, y) = det
SEMIDEFINITE REPRESENTATION OF THE K-ELLIPSE JIAWANG NIE, PABLO A. PARRILO, AND BERND STURMFELS Abstract. The k-ellipse is the plane algebraic curve consisting of all points whose sum of distances from
More informationConvex Optimization. (EE227A: UC Berkeley) Lecture 28. Suvrit Sra. (Algebra + Optimization) 02 May, 2013
Convex Optimization (EE227A: UC Berkeley) Lecture 28 (Algebra + Optimization) 02 May, 2013 Suvrit Sra Admin Poster presentation on 10th May mandatory HW, Midterm, Quiz to be reweighted Project final report
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
More informationGram Spectrahedra. Lynn Chua UC Berkeley. joint work with Daniel Plaumann, Rainer Sinn, and Cynthia Vinzant
Gram Spectrahedra Lynn Chua UC Berkeley joint work with Daniel Plaumann, Rainer Sinn, and Cynthia Vinzant SIAM Conference on Applied Algebraic Geometry 017 1/17 Gram Matrices and Sums of Squares Let P
More informationSemidefinite Representation of the k-ellipse
arxiv:math/0702005v1 [math.ag] 31 Jan 2007 Semidefinite Representation of the k-ellipse Jiawang Nie Pablo A. Parrilo Bernd Sturmfels February 2, 2008 Abstract The k-ellipse is the plane algebraic curve
More information6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC
6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC 2003 2003.09.02.10 6. The Positivstellensatz Basic semialgebraic sets Semialgebraic sets Tarski-Seidenberg and quantifier elimination Feasibility
More informationDissimilarity maps on trees and the representation theory of GL n (C)
Dissimilarity maps on trees and the representation theory of GL n (C) Christopher Manon Department of Mathematics University of California, Berkeley Berkeley, California, U.S.A. chris.manon@math.berkeley.edu
More informationQUARTIC SPECTRAHEDRA. Bernd Sturmfels UC Berkeley and MPI Bonn. Joint work with John Christian Ottem, Kristian Ranestad and Cynthia Vinzant
QUARTIC SPECTRAHEDRA Bernd Sturmfels UC Berkeley and MPI Bonn Joint work with John Christian Ottem, Kristian Ranestad and Cynthia Vinzant 1 / 20 Definition A spectrahedron of degree n in R 3 is a convex
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationRESEARCH 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 informationA new parametrization for binary hidden Markov modes
A new parametrization for binary hidden Markov models Andrew Critch, UC Berkeley at Pennsylvania State University June 11, 2012 See Binary hidden Markov models and varieties [, 2012], arxiv:1206.0500,
More informationCommuting birth-and-death processes
Commuting birth-and-death processes Caroline Uhler Department of Statistics UC Berkeley (joint work with Steven N. Evans and Bernd Sturmfels) MSRI Workshop on Algebraic Statistics December 18, 2008 Birth-and-death
More informationSPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic
SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic Didier Henrion Simone Naldi Mohab Safey El Din Version 1.0 of November 5, 2016 Abstract This document briefly describes
More informationDescribing convex semialgebraic sets by linear matrix inequalities. Markus Schweighofer. Universität Konstanz
Describing convex semialgebraic sets by linear matrix inequalities Markus Schweighofer Universität Konstanz Convex algebraic geometry, optimization and applications American Institute of Mathematics, Palo
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More information5. Grassmannians and the Space of Trees In this lecture we shall be interested in a very particular ideal. The ambient polynomial ring C[p] has ( n
5. Grassmannians and the Space of Trees In this lecture we shall be interested in a very particular ideal. The ambient polynomial ring C[p] has ( n d) variables, which are called Plücker coordinates: C[p]
More informationCombinatorial Aspects of Tropical Geometry and its interactions with phylogenetics
Combinatorial Aspects of Tropical Geometry and its interactions with phylogenetics María Angélica Cueto Department of Mathematics Columbia University Rabadan Lab Metting Columbia University College of
More informationJournal of Algebra 226, (2000) doi: /jabr , available online at on. Artin Level Modules.
Journal of Algebra 226, 361 374 (2000) doi:10.1006/jabr.1999.8185, available online at http://www.idealibrary.com on Artin Level Modules Mats Boij Department of Mathematics, KTH, S 100 44 Stockholm, Sweden
More informationPositive semidefinite rank
1/15 Positive semidefinite rank Hamza Fawzi (MIT, LIDS) Joint work with João Gouveia (Coimbra), Pablo Parrilo (MIT), Richard Robinson (Microsoft), James Saunderson (Monash), Rekha Thomas (UW) DIMACS Workshop
More informationCSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming Notes taken by Mike Jamieson March 28, 2005 Summary: In this lecture, we introduce semidefinite programming
More informationMic ael Flohr Representation theory of semi-simple Lie algebras: Example su(3) 6. and 20. June 2003
Handout V for the course GROUP THEORY IN PHYSICS Mic ael Flohr Representation theory of semi-simple Lie algebras: Example su(3) 6. and 20. June 2003 GENERALIZING THE HIGHEST WEIGHT PROCEDURE FROM su(2)
More informationarxiv: v2 [math.ds] 12 Jul 2011
1 CHEMICAL REACTION SYSTEMS WITH TORIC STEADY STATES MERCEDES PÉREZ MILLÁN, ALICIA DICKENSTEIN, ANNE SHIU, AND CARSTEN CONRADI arxiv:11021590v2 [mathds] 12 Jul 2011 Abstract Mass-action chemical reaction
More informationCHAPTER 7: Systems and Inequalities
(Exercises for Chapter 7: Systems and Inequalities) E.7.1 CHAPTER 7: Systems and Inequalities (A) means refer to Part A, (B) means refer to Part B, etc. (Calculator) means use a calculator. Otherwise,
More informationTensors: a geometric view Open lecture November 24, 2014 Simons Institute, Berkeley. Giorgio Ottaviani, Università di Firenze
Open lecture November 24, 2014 Simons Institute, Berkeley Plan of the talk Introduction to Tensors A few relevant applications Tensors as multidimensional matrices A (complex) a b c tensor is an element
More informationConvex Optimization of Graph Laplacian Eigenvalues
Convex Optimization of Graph Laplacian Eigenvalues Stephen Boyd Abstract. We consider the problem of choosing the edge weights of an undirected graph so as to maximize or minimize some function of the
More informationPolynomial Dynamical Systems as Reaction Networks and Toric Differential Inclusions
Polynomial Dynamical Systems as Reaction Networks and Toric Differential Inclusions Gheorghe Craciun Department of Mathematics and Department of Biomolecular Chemistry University of Wisconsin-Madison e-mail:
More informationGeometry of Phylogenetic Inference
Geometry of Phylogenetic Inference Matilde Marcolli CS101: Mathematical and Computational Linguistics Winter 2015 References N. Eriksson, K. Ranestad, B. Sturmfels, S. Sullivant, Phylogenetic algebraic
More informationAN INTRODUCTION TO AFFINE TORIC VARIETIES: EMBEDDINGS AND IDEALS
AN INTRODUCTION TO AFFINE TORIC VARIETIES: EMBEDDINGS AND IDEALS JESSICA SIDMAN. Affine toric varieties: from lattice points to monomial mappings In this chapter we introduce toric varieties embedded in
More informationVoronoi Cells of Varieties
Voronoi Cells of Varieties arxiv:1811.08395v1 [math.ag] 20 Nov 2018 Diego Cifuentes, Kristian Ranestad, Bernd Sturmfels and Madeleine Weinstein Abstract Every real algebraic variety determines a Voronoi
More informationON THE RANK OF A TROPICAL MATRIX
ON THE RANK OF A TROPICAL MATRIX MIKE DEVELIN, FRANCISCO SANTOS, AND BERND STURMFELS Abstract. This is a foundational paper in tropical linear algebra, which is linear algebra over the min-plus semiring.
More informationAn explicit construction of distinguished representations of polynomials nonnegative over finite sets
An explicit construction of distinguished representations of polynomials nonnegative over finite sets Pablo A. Parrilo Automatic Control Laboratory Swiss Federal Institute of Technology Physikstrasse 3
More informationOpen Problems in Algebraic Statistics
Open Problems inalgebraic Statistics p. Open Problems in Algebraic Statistics BERND STURMFELS UNIVERSITY OF CALIFORNIA, BERKELEY and TECHNISCHE UNIVERSITÄT BERLIN Advertisement Oberwolfach Seminar Algebraic
More informationMathematical and computational methods for understanding the dynamics of biochemical networks
Mathematical and computational methods for understanding the dynamics of biochemical networks Gheorghe Craciun Department of Mathematics and Department of Biomolecular Chemistry University of Wisconsin
More informationCOURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion
COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F
More informationCombinatorics and geometry of E 7
Combinatorics and geometry of E 7 Steven Sam University of California, Berkeley September 19, 2012 1/24 Outline Macdonald representations Vinberg representations Root system Weyl group 7 points in P 2
More informationSparsity of Matrix Canonical Forms. Xingzhi Zhan East China Normal University
Sparsity of Matrix Canonical Forms Xingzhi Zhan zhan@math.ecnu.edu.cn East China Normal University I. Extremal sparsity of the companion matrix of a polynomial Joint work with Chao Ma The companion matrix
More informationMIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:???
MIT 6.972 Algebraic techniques and semidefinite optimization May 9, 2006 Lecture 2 Lecturer: Pablo A. Parrilo Scribe:??? In this lecture we study techniques to exploit the symmetry that can be present
More informationA degree bound for codimension two lattice ideals
Journal of Pure and Applied Algebra 18 (003) 01 07 www.elsevier.com/locate/jpaa A degree bound for codimension two lattice ideals Leah H. Gold Department of Mathematics, Texas A& M University, College
More informationUCSD Mathematics Department Tel: (858) Gilman Drive, La Jolla, CA Fax: (858)
UCSD Mathematics Department Tel: (858)534-6015 9500 Gilman Drive, La Jolla, CA 92093 Fax: (858)534-5273 http://www.math.ucsd.edu/ njw njw@math.ucsd.edu Curriculum Vitae Jiawang Nie Research Area Education
More informationExact algorithms: from Semidefinite to Hyperbolic programming
Exact algorithms: from Semidefinite to Hyperbolic programming Simone Naldi and Daniel Plaumann PGMO Days 2017 Nov 14 2017 - EDF Lab Paris Saclay 1 Polyhedra P = {x R n : i, l i (x) 0} Finite # linear inequalities
More informationRational Sums of Squares and Applications
f ΣR[X] 2 " f ΣQ[X] 2 Rational Sums of Squares and Applications Christopher Hillar (MSRI & Berkeley) A 2008 study found that adding a picture of a brain scan to a scientific argument about human nature
More informationSpectral Graph Theory and You: Matrix Tree Theorem and Centrality Metrics
Spectral Graph Theory and You: and Centrality Metrics Jonathan Gootenberg March 11, 2013 1 / 19 Outline of Topics 1 Motivation Basics of Spectral Graph Theory Understanding the characteristic polynomial
More informationRecognizing Graph Theoretic Properties with Polynomial Ideals
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 1-1-2010 Recognizing Graph Theoretic Properties with Polynomial Ideals Jesus A. De Loera University
More informationBases for Cluster Algebras from Surfaces
Bases for Cluster Algebras from Surfaces Gregg Musiker (U. Minnesota), Ralf Schiffler (U. Conn.), and Lauren Williams (UC Berkeley) Bay Area Discrete Math Day Saint Mary s College of California November
More informationThe convex algebraic geometry of linear inverse problems
The convex algebraic geometry of linear inverse problems The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher
More informationACO Comprehensive Exam October 18 and 19, Analysis of Algorithms
Consider the following two graph problems: 1. Analysis of Algorithms Graph coloring: Given a graph G = (V,E) and an integer c 0, a c-coloring is a function f : V {1,,...,c} such that f(u) f(v) for all
More informationarxiv:math/ v1 [math.ac] 11 Nov 2005
A note on Rees algebras and the MFMC property arxiv:math/0511307v1 [math.ac] 11 Nov 2005 Isidoro Gitler, Carlos E. Valencia and Rafael H. Villarreal 1 Departamento de Matemáticas Centro de Investigación
More informationSEMIDEFINITE PROGRAM BASICS. Contents
SEMIDEFINITE PROGRAM BASICS BRIAN AXELROD Abstract. A introduction to the basics of Semidefinite programs. Contents 1. Definitions and Preliminaries 1 1.1. Linear Algebra 1 1.2. Convex Analysis (on R n
More informationPolytopes and Algebraic Geometry. Jesús A. De Loera University of California, Davis
Polytopes and Algebraic Geometry Jesús A. De Loera University of California, Davis Outline of the talk 1. Four classic results relating polytopes and algebraic geometry: (A) Toric Geometry (B) Viro s Theorem
More informationShortest paths with negative lengths
Chapter 8 Shortest paths with negative lengths In this chapter we give a linear-space, nearly linear-time algorithm that, given a directed planar graph G with real positive and negative lengths, but no
More informationSixty-Four Curves of Degree Six
Sixty-Four Curves of Degree Six Bernd Sturmfels MPI Leipzig and UC Berkeley with Nidhi Kaihnsa, Mario Kummer, Daniel Plaumann and Mahsa Sayyary 1 / 24 Poset 2 / 24 Hilbert s 16th Problem Classify all real
More informationMATH 8. Unit 1: Rational and Irrational Numbers (Term 1) Unit 2: Using Algebraic Properties to Simplify Expressions - Probability
MATH 8 Unit 1: Rational and Irrational Numbers (Term 1) 1. I CAN write an algebraic expression for a given phrase. 2. I CAN define a variable and write an equation given a relationship. 3. I CAN use order
More informationToric Ideals, an Introduction
The 20th National School on Algebra: DISCRETE INVARIANTS IN COMMUTATIVE ALGEBRA AND IN ALGEBRAIC GEOMETRY Mangalia, Romania, September 2-8, 2012 Hara Charalambous Department of Mathematics Aristotle University
More informationCollege Algebra To learn more about all our offerings Visit Knewton.com
College Algebra 978-1-63545-097-2 To learn more about all our offerings Visit Knewton.com Source Author(s) (Text or Video) Title(s) Link (where applicable) OpenStax Text Jay Abramson, Arizona State University
More informationIn English, this means that if we travel on a straight line between any two points in C, then we never leave C.
Convex sets In this section, we will be introduced to some of the mathematical fundamentals of convex sets. In order to motivate some of the definitions, we will look at the closest point problem from
More informationLecture 1. Toric Varieties: Basics
Lecture 1. Toric Varieties: Basics Taras Panov Lomonosov Moscow State University Summer School Current Developments in Geometry Novosibirsk, 27 August1 September 2018 Taras Panov (Moscow University) Lecture
More informationCollege Algebra with Corequisite Support: Targeted Review
College Algebra with Corequisite Support: Targeted Review 978-1-63545-056-9 To learn more about all our offerings Visit Knewtonalta.com Source Author(s) (Text or Video) Title(s) Link (where applicable)
More informationA tropical approach to secant dimensions
A tropical approach to secant dimensions Jan Draisma Madrid, 30 March 2007 1/16 Typical example: polynomial interpolation in two variables Set up: d N p 1,..., p k general points in C 2 codim{f C[x, y]
More informationAN INTRODUCTION TO TROPICAL GEOMETRY
AN INTRODUCTION TO TROPICAL GEOMETRY JAN DRAISMA Date: July 2011. 1 2 JAN DRAISMA Tropical numbers. 1. Tropical numbers and valuations R := R { } tropical numbers, equipped with two operations: tropical
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationGeometry of Gaussoids
Geometry of Gaussoids Bernd Sturmfels MPI Leipzig and UC Berkeley p 3 p 13 p 23 a 12 3 p 123 a 23 a 13 2 a 23 1 a 13 p 2 p 12 a 12 p p 1 Figure 1: With The vertices Tobias andboege, 2-faces ofalessio the
More informationLecture Note 5: Semidefinite Programming for Stability Analysis
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State
More informationchapter 12 MORE MATRIX ALGEBRA 12.1 Systems of Linear Equations GOALS
chapter MORE MATRIX ALGEBRA GOALS In Chapter we studied matrix operations and the algebra of sets and logic. We also made note of the strong resemblance of matrix algebra to elementary algebra. The reader
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationReal Algebraic Geometry in Convex Optimization. Cynthia Vinzant
Real Algebraic Geometry in Convex Optimization by Cynthia Vinzant A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate
More informationSemi-definite representibility. For fun and profit
Semi-definite representation For fun and profit March 9, 2010 Introduction Any convex quadratic constraint x T C T Cx a + b T x Can be recast as the linear matrix inequality (LMI): ( ) In Cx (Cx) T a +
More informationHYPERBOLIC POLYNOMIALS, INTERLACERS AND SUMS OF SQUARES
HYPERBOLIC POLYNOMIALS, INTERLACERS AND SUMS OF SQUARES DANIEL PLAUMANN Universität Konstanz joint work with Mario Kummer (U. Konstanz) Cynthia Vinzant (U. of Michigan) Out[121]= POLYNOMIAL OPTIMISATION
More information3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions
A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence
More informationTORIC REDUCTION AND TROPICAL GEOMETRY A.
Mathematisches Institut, Seminars, (Y. Tschinkel, ed.), p. 109 115 Universität Göttingen, 2004-05 TORIC REDUCTION AND TROPICAL GEOMETRY A. Szenes ME Institute of Mathematics, Geometry Department, Egry
More informationCollege Algebra with Corequisite Support: A Blended Approach
College Algebra with Corequisite Support: A Blended Approach 978-1-63545-058-3 To learn more about all our offerings Visit Knewtonalta.com Source Author(s) (Text or Video) Title(s) Link (where applicable)
More informationA SURVEY OF CLUSTER ALGEBRAS
A SURVEY OF CLUSTER ALGEBRAS MELODY CHAN Abstract. This is a concise expository survey of cluster algebras, introduced by S. Fomin and A. Zelevinsky in their four-part series of foundational papers [1],
More informationAn Algorithm for Solving the Convex Feasibility Problem With Linear Matrix Inequality Constraints and an Implementation for Second-Order Cones
An Algorithm for Solving the Convex Feasibility Problem With Linear Matrix Inequality Constraints and an Implementation for Second-Order Cones Bryan Karlovitz July 19, 2012 West Chester University of Pennsylvania
More informationHYPERBOLICITY CONES AND IMAGINARY PROJECTIONS
HYPERBOLICITY CONES AND IMAGINARY PROJECTIONS THORSTEN JÖRGENS AND THORSTEN THEOBALD Abstract. Recently, the authors and de Wolff introduced the imaginary projection of a polynomial f C[z] as the projection
More informationCombinatorics for algebraic geometers
Combinatorics for algebraic geometers Calculations in enumerative geometry Maria Monks March 17, 214 Motivation Enumerative geometry In the late 18 s, Hermann Schubert investigated problems in what is
More informationEllipsoidal Mixed-Integer Representability
Ellipsoidal Mixed-Integer Representability Alberto Del Pia Jeff Poskin September 15, 2017 Abstract Representability results for mixed-integer linear systems play a fundamental role in optimization since
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationTHE PYTHAGOREAN THEOREM
THE STORY SO FAR THE PYTHAGOREAN THEOREM USES OF THE PYTHAGOREAN THEOREM USES OF THE PYTHAGOREAN THEOREM SOLVE RIGHT TRIANGLE APPLICATIONS USES OF THE PYTHAGOREAN THEOREM SOLVE RIGHT TRIANGLE APPLICATIONS
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Monday 14 April. Binomial Ideals
Binomial Ideals Binomial ideals offer an interesting class of examples. Because they occur so frequently in various applications, the development methods for binomial ideals is justified. 1 Binomial Ideals
More informationCollege Algebra with Corequisite Support: A Compressed Approach
College Algebra with Corequisite Support: A Compressed Approach 978-1-63545-059-0 To learn more about all our offerings Visit Knewton.com Source Author(s) (Text or Video) Title(s) Link (where applicable)
More informationTest Codes : MIA (Objective Type) and MIB (Short Answer Type) 2007
Test Codes : MIA (Objective Type) and MIB (Short Answer Type) 007 Questions will be set on the following and related topics. Algebra: Sets, operations on sets. Prime numbers, factorisation of integers
More informationConvex algebraic geometry, optimization and applications
Convex algebraic geometry, optimization and applications organized by William Helton and Jiawang Nie Workshop Summary We start with a little bit of terminology. A linear pencil is a function L : R g d
More informationMATH 7 HONORS. Unit 1: Rational and Irrational Numbers (Term 1) Unit 2: Using Algebraic Properties to Simplify Expressions - Probability
MATH 7 HONORS Unit 1: Rational and Irrational Numbers (Term 1) 1. I CAN write an algebraic expression for a given phrase. 2. I CAN define a variable and write an equation given a relationship. 3. I CAN
More information