The Geometry of Polynomials and Applications
|
|
- Everett Cannon
- 5 years ago
- Views:
Transcription
1 The Geometry of Polynomials and Applications Julius Borcea (Stockholm) based on joint work with Petter Brändén (KTH) and Thomas M. Liggett (UCLA)
2 Rota s philosophy G.-C. Rota: The one contribution of mine that I hope will be remembered has consisted in just pointing out that all sorts of problems of combinatorics can be viewed as problems on location of the zeros of certain polynomials and in giving these zeros a combinatorial interpretation. Phase transitions, Lee-Yang type theorems (Random) Matrix theory, representation theory, total positivity, number theory Interacting particle systems, probability theory, negative dependence 2
3 Polynomials galore Stable Polynomial f C[z 1,..., z n ] is stable if Im(z j ) > 0 j = f(z 1,..., z n ) 0 Real stable if f R[z 1,..., z n ]. Related notions: Half-Plane Property (HPP) Y. Choe, J. Oxley, A. Sokal, D. Wagner (Gårding) Hyperbolic Polynomial (PDE theory, control theory, optimization) f R[z 1,..., z n ] of degree d is real stable iff its homogenization f H (z 1,..., z n, z n+1 ) = zn+1 d f(z 1zn+1 1,..., z nzn+1 1 ) is hyperbolic w.r.t. every v R n + {0}, i.e., t f H (u + tv) has all real zeros if u R n+1, v R n + {0}. 3
4 Rayleigh polynomial (h-nlc+) Multi-affine polynomial f(z 1,..., z n ) with (nonnegative) real coefficients satisfying f f z i z j f z i z j f 0 for 1 i, j n and z R n +. (Electrical networks: Kirchhoff-Rayleigh monotonicity for relative effective conductances; cf. D. Wagner) Strongly Rayleigh polynomial Multi-affine polynomial f(z 1,..., z n ) with (nonnegative) real coefficients satisfying f f z i z j f z i z j f 0 for 1 i, j n and z R n. Theorem [P. Brändén]. A multi-affine polynomial f(z 1,..., z n ) is strongly Rayleigh iff it is stable. 4
5 Examples. (i) f R[t] is stable iff all its zeros are real; (ii) Spanning tree polynomials are stable. Notation P n is the set of multi-affine polynomials f(z) = S [n] a Sz S with a S 0 S [n] = {1,..., n} and f(1,..., 1) = 1, where z = (z 1,..., z n ) and z S = i S z i. P n is the set of probability measures on 2 [n] = {S : S [n]} {0, 1} [n]. The i-th coordinate function on 2 [n] is the binary r.v. X i (S) = 1 if i S and 0 otherwise. 1-1 correspondence P n P n : if µ P n its generating polynomial g µ (z) = z S dµ = S [n] µ(s)zs P n. µ P n is (strongly) Rayleigh if g µ is (strongly) Rayleigh. 5
6 Positive dependence Positive Association (PA) µ P n is PA if F Gdµ F dµ Gdµ for all increasing F, G : 2 [n] R. Positive Lattice Condition (PLC) µ P n satisfies PLC if for all S, T [n] µ(s T ) µ(s T ) µ(s) µ(t ). Negative dependence FKG Theorem PLC = PA. Negative Association (NA) µ P n is NA if F Gdµ F dµ Gdµ for all increasing F, G : 2 [n] R depending on disjoint sets of variables. R. Pemantle & others: We need a theory of Negative Dependence. Under what conditions do we have NA? 6
7 Closure properties and CNA+ Strongly Rayleigh polynomials are closed under (1). taking limits (2). partial differentiation (conditioning on X j = 1) (3). scaling of variables with positive numbers (external fields) (4). setting variables equal to nonnegative numbers (projections and conditioning on X j = 0) CNA+ := NA + (2) + (3) + (4) Theorem [J.B., P. Brändén, T. Liggett]. Strongly Rayleigh measures are CNA+. The strongly Rayleigh class includes e.g. uniform random spanning tree measures, product meaures, ballsand-bins measures, determinantal measures. 7
8 Example: determinantal measures Let A be an n n matrix with A(S) 0, S [n], A(S) := principal minor of A indexed by S = [n]\s. Determinantal measure µ = µ A P n defined by µ(s) = A(S)/ det(i + A), S [n]. Occurences: Number theory: Montgomery, Conrey,... Rep. theory and random permutations: Johansson, Borodin-Okounkov-Olshanski-Reshetikhin,... Probability theory: Lyons-Steif, Peres,... Mathematical physics: Daley, Vere-Jones,... The generating polynomial of µ A is g µa (z) = det(i + A) 1 det(z + A), where Z = diag(z 1,..., z n ). 8
9 Hadamard-Fischer-Kotelyansky inequalities Let A = (a ij ) be positive semidefinite (A 0). Hadamard: det(a) a 11 a nn Fischer: det(a) A(S) A(S ) Kotelyansky: A(S T ) A(S T ) A(S) A(T ) Theorem [R. Lyons]. If A 0 then µ A is CNA+. Theorem [J.B., P. Brändén, T. Liggett]. Strongly Rayleigh measures are CNA+. + Theorem [J.B., P. Brändén]. If B is Hermitian and A 1,..., A n 0 (all of the same order) then f(z 1,..., z n ) = det(z 1 A z n A n +B) is stable. In particular, if A 0 then g µa (z) is stable (= strongly Rayleigh). 9
10 Example: graphs, Laplacians, spanning trees Let G = (V, E), V = [n], be a graph, and e an edge connecting i < j. Let A e be the n n matrix with nonzero entries (A e ) ii = (A e ) jj = 1, (A e ) ij = (A e ) ji = 1 ( A e 0). The Laplacian of G is L(G) = w e A e. e E Let f G (z, w) = det(l(g)+z), where w = (w e ) e E, z = (z 1,..., z n ) and Z = diag(z 1,..., z n ). Kirchhoff s Matrix-Tree Theorem: If G is connected then det(l(g) ii ) = f G (z, w) z i = z=0 T where the sum is over all spanning trees. All Minors Matrix-Tree Theorem: w T f G (z, w) = F z roots(f) w edges(f) where the sum is over all rooted spanning forests. 10
11 A positive answer to a conjecture of Wagner For each spanning forest F let ρ(f) = # of ways to root F and define µ P E by µ(s) = ρ(f)/r if S is a spanning forest, 0 otherwise, where R = F ρ(f). Conjecture [D. Wagner]. µ is Rayleigh. Proof. The generating polynomial of µ is g µ (w) = µ(s)w S = R 1 det(l(g) + I) S E = R 1 f G (z, w) z1 = =z n =1 so g µ is in fact stable/strongly Rayleigh. 11
12 Example: the symmetric exclusion process Let τ = (ij) be a transposition and for S [n] let τ(s) = {τ(s) : s S}. Given µ P n and p [0, 1] define µ τ,p (S) := pµ(s) + (1 p)µ(τ(s)). Theorem [J.B., P. Brändén, T. Liggett]. µ is strongly Rayleigh = µ τ,p is strongly Rayleigh. In particular, this proves the following Conjecture [R. Pemantle, T. Liggett]. If the initial configuration of a symmetric exclusion process is deterministic then the distribution at time t is NA t 0. 12
13 Strongly Rayleigh CNA+: main ideas 1. Symmetric homogenization: let µ P n and define µ H P 2n by ( ) µ S [n] µ H (S) = ( n S [n] ) if S = n, 0 otherwise, for S [2n]. The g.p. g µh = g µh (z 1,..., z 2n ) is g µh = S [n] µ(s) ) z S e n S (z n+1,..., z 2n ), ( n S where z = (z 1,..., z n ) and e j (w 1,..., w m ) = 1 i 1 < <i j m w i1 w ij is the j-th elementary symmetric polynomial. Theorem [J.B., P. Brändén, T. Liggett]. µ strongly Rayleigh µ H strongly Rayleigh. 13
14 Sketch of proof: S [n] µ(s)zs is stable = {Using Gårding s results on hyperbolicity cones} S [n] µ(s)zs y n S is stable = {Grace-Walsh-Szegö Coincidence Theorem} ) 1z S e n S (z n+1,..., z 2n ) S [n] µ(s)( n S is stable. 2. Feder-Mihail Theorem: Let S be a class of probability measures such that S is closed under conditioning, µ(x i X j ) µ(x i ) µ(x j ) for all i j, µ S, any µ S has a homogeneous gen. polynomial. Then every µ S is NA. 3. Facts: (I) (Strongly) Rayleigh measures with homogeneous gen. polynomials meet the requirements. (II) NA is closed under projections. 14
15 More (positive) results on negative dependence Proof of Pemantle s conjecture on stochastic domination for truncations of strongly Rayleigh measures and counterexamples for other classes of CNA+ measures (J.B., P. Brändén, T. Liggett). Extensions of Lyons results on NA, the Löwner order and stochastic domination for determinantal measures (J.B., P. Brändén, T. Liggett). Conjecture [Pemantle, Wagner]. Rayleigh = CNA+. True for e.g. exchangeable measures (Pemantle). Proof for the class of almost exchangeable measures (J.B., P. Brändén, T. Liggett). Distributional limits for the symmetric exclusion process (T. Liggett), the HPP for certain matroids studied by A. Sokal, D. Wagner (J.B.). 15
16 Negative results on negative dependence Let (a k ) n k=0 be a sequence of nonnegative numbers. Log-Concave (LC) a 2 k a k 1a k+1 Ultra-Log-Concave (ULC) ( n k a 2 k ( n ) ( a k+1 ) n k 1 k+1 ) 2 a k 1 i < j < k, a i a k 0 = a j 0 The rank sequence of µ P n is (a k ) n k=0 : a k = µ n i=1 X i = k, i.e., g µ (t,..., t) = n k=0 where g µ (z 1,..., z n ) = S [n] µ(s)zs is the generating polynomial of µ. µ is ULC if its rank sequence is ULC. a k t k, 16
17 Fact g(z 1,..., z n ) is stable g(t,..., t) is real-rooted. + Newton s Inequalities If m k=0 a k t k is real-rooted then (a k ) m k=0 is ULC. If µ P n is strongly Rayleigh then µ is ULC. Big Conjecture [R. Pemantle, Y. Peres, D. Wagner ]. If µ P n is Rayleigh then µ is ULC. (would Mason s conjecture for Rayleigh matroids) Conjecture [R. Pemantle, Y. Peres ]. If µ P n is CNA+ then µ is ULC. Counterexamples [J. B., P. Brändén, T. Liggett ]. For any n 20 almost exchangeable µ P n for which both the Big Conjecture and CNA+ ULC fail. 17
Lecture 3: Boolean variables and the strong Rayleigh property
Lecture 3: Boolean variables and the strong Rayleigh property Robin Pemantle University of Pennsylvania pemantle@math.upenn.edu Minerva Lectures at Columbia University 09 November, 2016 Negative dependence
More informationLecture 5: Hyperbolic polynomials
Lecture 5: Hyperbolic polynomials Robin Pemantle University of Pennsylvania pemantle@math.upenn.edu Minerva Lectures at Columbia University 16 November, 2016 Ubiquity of zeros of polynomials The one contribution
More informationarxiv:math/ v4 [math.co] 9 May 2007
arxiv:math/0605678v4 [math.co] 9 May 2007 POLYNOMIALS WITH THE HALF-PLANE PROPERTY AND MATROID THEORY PETTER BRÄNDÉN Abstract. A polynomial f is said to have the half-plane property if there is an open
More informationRepresenting matroids by polynomials with the half-plane property. Rafael S. González D León Advisor: Petter Brändén
Representing matroids by polynomials with the half-plane property Rafael S. González D León Advisor: Petter Brändén Dept. of Mathematics, Royal Institute of Technology, Sweden E-mail address: rsgd@kth.se
More informationNOTES ON HYPERBOLICITY CONES
NOTES ON HYPERBOLICITY CONES Petter Brändén (Stockholm) pbranden@math.su.se Berkeley, October 2010 1. Hyperbolic programming A hyperbolic program is an optimization problem of the form minimize c T x such
More informationLecture 4: Applications: random trees, determinantal measures and sampling
Lecture 4: Applications: random trees, determinantal measures and sampling Robin Pemantle University of Pennsylvania pemantle@math.upenn.edu Minerva Lectures at Columbia University 09 November, 2016 Sampling
More informationarxiv: v1 [math.co] 9 Sep 2007
A CRITERION FOR THE HALF-PLANE PROPERTY DAVID G. WAGNER AND YEHUA WEI arxiv:0709.1269v1 [math.co] 9 Sep 2007 Abstract. We establish a convenient necessary and sufficient condition for a multiaffine real
More informationLecture 2: Stable Polynomials
Math 270: Geometry of Polynomials Fall 2015 Lecture 2: Stable Polynomials Lecturer: Nikhil Srivastava September 8 Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal
More informationPolynomials with the half-plane property and matroid theory
Advances in Mathematics 216 (2007) 302 320 www.elsevier.com/locate/aim Polynomials with the half-plane property and matroid theory Petter Brändén Department of Mathematics, University of Michigan, Ann
More informationDeterminantal Probability Measures. by Russell Lyons (Indiana University)
Determinantal Probability Measures by Russell Lyons (Indiana University) 1 Determinantal Measures If E is finite and H l 2 (E) is a subspace, it defines the determinantal measure T E with T = dim H P H
More informationThe Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSP
The Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSP Nima Anari Shayan Oveis Gharan Abstract Marcus, Spielman, and Srivastava in their seminal work [MSS13b] resolved
More informationStability, hyperbolicity, and zero localization of functions
Stability, hyperbolicity, and zero localization of functions organized by Petter Branden, George Csordas, Olga Holtz, and Mikhail Tyaglov Workshop Summary 1 Overview This workshop, sponsored by AIM and
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 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 informationAn Efficient Algorithm for the Symmetric Principal Minor Assignment Problem
An Efficient Algorithm for the Symmetric Principal Minor Assignment Problem Justin Rising a,, Alex Kulesza b, Ben Taskar c a Department of Statistics University of Pennsylvania, Philadelphia, PA 904 USA
More informationAdvances in the Theory of Determinantal Point Processes
University of Pennsylvania ScholarlyCommons Publicly Accessible Penn Dissertations 1-1-2013 Advances in the Theory of Determinantal Point Processes Justin Kyle Rising University of Pennsylvania, jkrising@gmail.com
More informationM-convex Functions on Jump Systems A Survey
Discrete Convexity and Optimization, RIMS, October 16, 2012 M-convex Functions on Jump Systems A Survey Kazuo Murota (U. Tokyo) 121016rimsJUMP 1 Discrete Convex Analysis Convexity Paradigm in Discrete
More informationNegative Correlation Properties for Matroids
Negative Correlation Properties for Matroids by Alejandro Erickson A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in Combinatorics
More informationDeterminantal Processes And The IID Gaussian Power Series
Determinantal Processes And The IID Gaussian Power Series Yuval Peres U.C. Berkeley Talk based on work joint with: J. Ben Hough Manjunath Krishnapur Bálint Virág 1 Samples of translation invariant point
More informationQUANTITATIVE BOUNDS FOR HURWITZ STABLE POLYNOMIALS UNDER MULTIPLIER TRANSFORMATIONS SPUR FINAL PAPER, SUMMER 2014
QUANTITATIVE BOUNDS FOR HURWITZ STABLE POLYNOMIALS UNDER MULTIPLIER TRANSFORMATIONS SPUR FINAL PAPER, SUMMER 2014 COLE GRAHAM MENTOR XUWEN ZHU PROJECT SUGGESTED BY DANIEL SPIELMAN AND DAVID JERISON FEBRUARY
More informationPROBLEMS ON LINEAR ALGEBRA
1 Basic Linear Algebra PROBLEMS ON LINEAR ALGEBRA 1. Let M n be the (2n + 1) (2n + 1) for which 0, i = j (M n ) ij = 1, i j 1,..., n (mod 2n + 1) 1, i j n + 1,..., 2n (mod 2n + 1). Find the rank of M n.
More informationMULTIVARIATE STABLE POLYNOMIALS: THEORY AND APPLICATIONS
MULTIVARIATE STABLE POLYNOMIALS: THEORY AND APPLICATIONS DAVID G. WAGNER In memoriam Julius Borcea. Abstract. Univariate polynomials with only real roots while special do occur often enough that their
More informationHYPERBOLIC POLYNOMIALS AND THE MARCUS SPIELMAN SRIVASTAVA THEOREM arxiv: v1 [math.co] 30 Nov 2014
HYPERBOLIC POLYNOMIALS AND THE MARCUS SPIELMAN SRIVASTAVA THEOREM arxiv:1412.0245v1 [math.co] 30 Nov 2014 PETTER BRÄNDÉN Abstract. Recently Marcus, Spielman and Srivastava gave a spectacular proof of a
More informationSpanning Trees of Shifted Simplicial Complexes
Art Duval (University of Texas at El Paso) Caroline Klivans (Brown University) Jeremy Martin (University of Kansas) Special Session on Extremal and Probabilistic Combinatorics University of Nebraska, Lincoln
More informationThe reverse Hlawka inequality in a Minkowski space
The reverse Hlawka inequality in a Minkowski space Denis Serre UMPA, UMR CNRS ENS Lyon # 5669 École Normale Supérieure de Lyon 46, allée d Italie, F 69364 Lyon, cedex 07 October 9, 2014 1 Motivation and
More informationCSE 206A: Lattice Algorithms and Applications Spring Basis Reduction. Instructor: Daniele Micciancio
CSE 206A: Lattice Algorithms and Applications Spring 2014 Basis Reduction Instructor: Daniele Micciancio UCSD CSE No efficient algorithm is known to find the shortest vector in a lattice (in arbitrary
More information15.1 Matching, Components, and Edge cover (Collaborate with Xin Yu)
15.1 Matching, Components, and Edge cover (Collaborate with Xin Yu) First show l = c by proving l c and c l. For a maximum matching M in G, let V be the set of vertices covered by M. Since any vertex in
More information2.1 Laplacian Variants
-3 MS&E 337: Spectral Graph heory and Algorithmic Applications Spring 2015 Lecturer: Prof. Amin Saberi Lecture 2-3: 4/7/2015 Scribe: Simon Anastasiadis and Nolan Skochdopole Disclaimer: hese notes have
More informationarxiv: v4 [math.rt] 9 Jun 2017
ON TANGENT CONES OF SCHUBERT VARIETIES D FUCHS, A KIRILLOV, S MORIER-GENOUD, V OVSIENKO arxiv:1667846v4 [mathrt] 9 Jun 217 Abstract We consider tangent cones of Schubert varieties in the complete flag
More informationDOMINO TILINGS INVARIANT GIBBS MEASURES
DOMINO TILINGS and their INVARIANT GIBBS MEASURES Scott Sheffield 1 References on arxiv.org 1. Random Surfaces, to appear in Asterisque. 2. Dimers and amoebae, joint with Kenyon and Okounkov, to appear
More informationarxiv:math/ v3 [math.co] 5 Sep 2003
RAYLEIGH MATROIDS arxiv:math/0307096v3 [math.co] 5 Sep 2003 YOUNGBIN CHOE AND DAVID G. WAGNER Abstract. Motivated by a property of linear resistive electrical networks, we introduce the class of Rayleigh
More informationAn Introduction to Spectral Graph Theory
An Introduction to Spectral Graph Theory Mackenzie Wheeler Supervisor: Dr. Gary MacGillivray University of Victoria WheelerM@uvic.ca Outline Outline 1. How many walks are there from vertices v i to v j
More informationReal Stable Polynomials: Description and Application
Real Stable Polynomials: Description and Application Theo McKenzie theomckenzie@college.harvard.edu (347) 351-4092 Advisor: Peter Csikvari March 23, 2015 Abstract In this paper, we discuss the concept
More informationRow Space and Column Space of a Matrix
Row Space and Column Space of a Matrix 1/18 Summary: To a m n matrix A = (a ij ), we can naturally associate subspaces of K n and of K m, called the row space of A and the column space of A, respectively.
More informationORIE 6334 Spectral Graph Theory September 8, Lecture 6. In order to do the first proof, we need to use the following fact.
ORIE 6334 Spectral Graph Theory September 8, 2016 Lecture 6 Lecturer: David P. Williamson Scribe: Faisal Alkaabneh 1 The Matrix-Tree Theorem In this lecture, we continue to see the usefulness of the graph
More informationChapter 0 Preliminaries
Chapter 0 Preliminaries Objective of the course Introduce basic matrix results and techniques that are useful in theory and applications. It is important to know many results, but there is no way I can
More informationarxiv:math/ v2 [math.oc] 25 May 2004
arxiv:math/0304104v2 [math.oc] 25 May 2004 THE LAX CONJECTURE IS TRUE A.S. Lewis, P.A. Parrilo, and M.V. Ramana Key words: hyperbolic polynomial, Lax conjecture, hyperbolicity cone, semidefinite representable
More informationh-vectors OF SMALL MATROID COMPLEXES
h-vectors OF SMALL MATROID COMPLEXES JESÚS A. DE LOERA, YVONNE KEMPER, STEVEN KLEE Abstract. Stanley conjectured in 1977 that the h-vector of a matroid simplicial complex is a pure O-sequence. We give
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationCurrent; Forest Tree Theorem; Potential Functions and their Bounds
April 13, 2008 Franklin Kenter Current; Forest Tree Theorem; Potential Functions and their Bounds 1 Introduction In this section, we will continue our discussion on current and induced current. Review
More informationCourse Info. Instructor: Office hour: 804, Tuesday, 2pm-4pm course homepage:
Combinatorics Course Info Instructor: yinyt@nju.edu.cn, yitong.yin@gmail.com Office hour: 804, Tuesday, 2pm-4pm course homepage: http://tcs.nju.edu.cn/wiki/ Textbook van Lint and Wilson, A course in Combinatorics,
More informationSTABLE MULTIVARIATE GENERALIZATIONS OF MATCHING POLYNOMIALS
STABLE MULTIVARIATE GENERALIZATIONS OF MATCHING POLYNOMIALS NIMA AMINI Abstract. The first part of this note concerns stable averages of multivariate matching polynomials. In proving the existence of infinite
More informationHyperbolic Polynomials and Generalized Clifford Algebras
Discrete Comput Geom (2014) 51:802 814 DOI 10.1007/s00454-014-9598-1 Hyperbolic Polynomials and Generalized Clifford Algebras Tim Netzer Andreas Thom Received: 14 December 2012 / Revised: 8 January 2014
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 informationInequalities for Symmetric Polynomials
Inequalities for Symmetric Polynomials Curtis Greene October 24, 2009 Co-authors This talk is based on Inequalities for Symmetric Means, with Allison Cuttler, Mark Skandera (to appear in European Jour.
More informationDISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES
DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES PER ALEXANDERSSON AND BORIS SHAPIRO Abstract. Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed
More informationConvex optimization. Javier Peña Carnegie Mellon University. Universidad de los Andes Bogotá, Colombia September 2014
Convex optimization Javier Peña Carnegie Mellon University Universidad de los Andes Bogotá, Colombia September 2014 1 / 41 Convex optimization Problem of the form where Q R n convex set: min x f(x) x Q,
More informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
More informationA Proof of Aldous Spectral Gap Conjecture. Thomas M. Liggett, UCLA. Stirring Processes
A Proof of Aldous Spectral Gap Conjecture Thomas M. Liggett, UCLA Stirring Processes Given a graph G = (V, E), associate with each edge e E a Poisson process Π e with rate c e 0. Labels are put on the
More informationarxiv: v1 [math.co] 17 Oct 2015
arxiv:1510.05153v1 [math.co] 17 Oct 2015 On the Principal Permanent Rank Characteristic Sequences of Graphs and Digraphs Keivan Hassani Monfared Paul Horn Franklin H. J. Kenter Kathleen Nowak John Sinkovic
More informationSpanning Trees and a Conjecture of Kontsevich
Annals of Combinatorics 2 (1998) 351-363 Annals of Combinatorics Springer-Verlag 1998 Spanning Trees and a Conjecture of Kontsevich Richard P. Stanley Department of Mathematics, Massachusetts Institute
More informationRado Path Decomposition
Rado Path Decomposition Peter Cholak January, 2016 Singapore Joint with Greg Igusa, Ludovic Patey, and Mariya Soskova. Monochromatic paths Definition Let c : [ω] 2 r. A monochromatic path of color j is
More informationCourse Notes. Part IV. Probabilistic Combinatorics. Algorithms
Course Notes Part IV Probabilistic Combinatorics and Algorithms J. A. Verstraete Department of Mathematics University of California San Diego 9500 Gilman Drive La Jolla California 92037-0112 jacques@ucsd.edu
More informationMATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.
MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis.
More informationMatrix rigidity and elimination theory
Matrix rigidity and elimination theory Abhinav Kumar joint work with Satya Lokam, Vijay Patankar and Jalayal Sarma M.N. MIT April 25, 2012 Abhinav Kumar (MIT) Matrix rigidity and elimination theory April
More informationTopics in Graph Theory
Topics in Graph Theory September 4, 2018 1 Preliminaries A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End
More informationMATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.
MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. Elementary matrices Theorem 1 Any elementary row operation σ on matrices with n rows can be simulated as left multiplication
More informationh -polynomials of dilated lattice polytopes
h -polynomials of dilated lattice polytopes Katharina Jochemko KTH Stockholm Einstein Workshop Discrete Geometry and Topology, March 13, 2018 Lattice polytopes A set P R d is a lattice polytope if there
More informationLift-and-Project Techniques and SDP Hierarchies
MFO seminar on Semidefinite Programming May 30, 2010 Typical combinatorial optimization problem: max c T x s.t. Ax b, x {0, 1} n P := {x R n Ax b} P I := conv(k {0, 1} n ) LP relaxation Integral polytope
More informationHodge theory for combinatorial geometries
Hodge theory for combinatorial geometries June Huh with Karim Adiprasito and Eric Katz June Huh 1 / 48 Three fundamental ideas: June Huh 2 / 48 Three fundamental ideas: The idea of Bernd Sturmfels that
More informationCyclic Flats, Sticky Matroids, and Intertwines
Cyclic Flats, Sticky Matroids, and Intertwines Joseph E. Bonin The George Washington University Part I Essential Matroid Background and Cyclic Flats Matroids via Flats There are many equivalent formulations
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 informationUnless otherwise specified, V denotes an arbitrary finite-dimensional vector space.
MAT 90 // 0 points Exam Solutions Unless otherwise specified, V denotes an arbitrary finite-dimensional vector space..(0) Prove: a central arrangement A in V is essential if and only if the dual projective
More informationCompletely positive matrices of order 5 with ĈP -graph
Note di Matematica ISSN 1123-2536, e-issn 1590-0932 Note Mat. 36 (2016) no. 1, 123 132. doi:10.1285/i15900932v36n1p123 Completely positive matrices of order 5 with ĈP -graph Micol Cedolin Castello 2153,
More informationSymbolic computation in hyperbolic programming
Symbolic computation in hyperbolic programming Simone Naldi and Daniel Plaumann MEGA 2017 Nice, 14 June 2017 1 Polyhedra P = {x R n : i, l i (x) 0} Finite # linear inequalities : l i (x) 0, i = 1,...,
More informationOn the inverse matrix of the Laplacian and all ones matrix
On the inverse matrix of the Laplacian and all ones matrix Sho Suda (Joint work with Michio Seto and Tetsuji Taniguchi) International Christian University JSPS Research Fellow PD November 21, 2012 Sho
More informationRayleigh Property of Lattice Path Matroids
Rayleigh Property of Lattice Path Matroids by Yan Xu A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Master of Mathemeatics in Combinatorics and
More informationCounting bases of representable matroids
Counting bases of representable matroids Michael Snook School of Mathematics, Statistics and Operations Research Victoria University of Wellington Wellington, New Zealand michael.snook@msor.vuw.ac.nz Submitted:
More informationCombinatorial and physical content of Kirchhoff polynomials
Combinatorial and physical content of Kirchhoff polynomials Karen Yeats May 19, 2009 Spanning trees Let G be a connected graph, potentially with multiple edges and loops in the sense of a graph theorist.
More informationZaslavsky s Theorem. As presented by Eric Samansky May 11, 2002
Zaslavsky s Theorem As presented by Eric Samansky May, 2002 Abstract This paper is a retelling of the proof of Zaslavsky s Theorem. For any arrangement of hyperplanes, there is a corresponding semi-lattice
More informationCMPSCI611: The Matroid Theorem Lecture 5
CMPSCI611: The Matroid Theorem Lecture 5 We first review our definitions: A subset system is a set E together with a set of subsets of E, called I, such that I is closed under inclusion. This means that
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More information9. The determinant. Notation: Also: A matrix, det(a) = A IR determinant of A. Calculation in the special cases n = 2 and n = 3:
9. The determinant The determinant is a function (with real numbers as values) which is defined for square matrices. It allows to make conclusions about the rank and appears in diverse theorems and formulas.
More informationarxiv: v1 [cs.it] 3 Nov 2009
A proof of the log-concavity conjecture related to the computation of the ergodic capacity of MIMO channels arxiv:0911.0696v1 [cs.it] 3 Nov 2009 Leonid Gurvits August 6, 2018 Abstract An upper bound on
More informationTHE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS
THE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS JOSEPH E. BONIN AND JOSEPH P. S. KUNG ABSTRACT. We show that when n is greater than 3, the number of points in a combinatorial
More informationMath 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Math 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008 Exam 2 will be held on Tuesday, April 8, 7-8pm in 117 MacMillan What will be covered The exam will cover material from the lectures
More informationn! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2
Order statistics Ex. 4. (*. Let independent variables X,..., X n have U(0, distribution. Show that for every x (0,, we have P ( X ( < x and P ( X (n > x as n. Ex. 4.2 (**. By using induction or otherwise,
More informationTransversal and cotransversal matroids via their representations.
Transversal and cotransversal matroids via their representations. Federico Ardila Submitted: May, 006; Accepted: Feb. 7, 007 Mathematics Subject Classification: 05B5; 05C8; 05A99 Abstract. It is known
More informationELA
THE DISTANCE MATRIX OF A BIDIRECTED TREE R. B. BAPAT, A. K. LAL, AND SUKANTA PATI Abstract. A bidirected tree is a tree in which each edge is replaced by two arcs in either direction. Formulas are obtained
More informationAnalysis and synthesis: a complexity perspective
Analysis and synthesis: a complexity perspective Pablo A. Parrilo ETH ZürichZ control.ee.ethz.ch/~parrilo Outline System analysis/design Formal and informal methods SOS/SDP techniques and applications
More informationLecture 17: D-Stable Polynomials and Lee-Yang Theorems
Counting and Sampling Fall 2017 Lecture 17: D-Stable Polynomials and Lee-Yang Theorems Lecturer: Shayan Oveis Gharan November 29th Disclaimer: These notes have not been subjected to the usual scrutiny
More informationData Mining and Analysis: Fundamental Concepts and Algorithms
: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA 2 Department of Computer
More informationA property concerning the Hadamard powers of inverse M-matrices
Linear Algebra and its Applications 381 (2004 53 60 www.elsevier.com/locate/laa A property concerning the Hadamard powers of inverse M-matrices Shencan Chen Department of Mathematics, Fuzhou University,
More informationMatroids/1. I and I 2 ,I 2 > I 1
Matroids 1 Definition A matroid is an abstraction of the notion of linear independence in a vector space. See Oxley [6], Welsh [7] for further information about matroids. A matroid is a pair (E,I ), where
More information1 9/5 Matrices, vectors, and their applications
1 9/5 Matrices, vectors, and their applications Algebra: study of objects and operations on them. Linear algebra: object: matrices and vectors. operations: addition, multiplication etc. Algorithms/Geometric
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationMatroids in Tropical Geometry
Matroids in Tropical Geometry Eric Katz (University of Waterloo) joint with June Huh (University of Michigan) April 1, 2013 Eric Katz (Waterloo) Matroids April 1, 2013 1 / 40 Matroids What are matroids?
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Updated: April 14, 017 Total Positivity The final and historically the original motivation is from the study of total positive matrices, which
More informationThe Geometry of Matrix Rigidity
The Geometry of Matrix Rigidity Joseph M. Landsberg Jacob Taylor Nisheeth K. Vishnoi November 26, 2003 Abstract Consider the following problem: Given an n n matrix A and an input x, compute Ax. This problem
More informationThe Index of Nash Equilibria
Equilibria in Games, Santiago, Chile January 10, 2017 Finite Normal-Form Games We consider in these lectures, the set of finite games with fixed strategy sets and parametrized by the payoff functions.
More informationA Criterion for the Stochasticity of Matrices with Specified Order Relations
Rend. Istit. Mat. Univ. Trieste Vol. XL, 55 64 (2009) A Criterion for the Stochasticity of Matrices with Specified Order Relations Luca Bortolussi and Andrea Sgarro Abstract. We tackle the following problem:
More informationNon-Recursively Constructible Recursive Families of Graphs
Non-Recursively Constructible Recursive Families of Graphs Colleen Bouey Department of Mathematics Loyola Marymount College Los Angeles, CA 90045, USA cbouey@lion.lmu.edu Aaron Ostrander Dept of Math and
More informationA Randomized Rounding Approach to the Traveling Salesman Problem
A Randomized Rounding Approach to the Traveling Salesman Problem Shayan Oveis Gharan Management Science and Engineering Stanford University Stanford, CA 94305 shayan@stanford.edu Amin Saberi + Management
More informationGlobal Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition
Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition Guoyin Li Communicated by X.Q. Yang Abstract In this paper, we establish global optimality
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More information(Uniform) determinantal representations
1 (Uniform) determinantal representations Jan Draisma Universität Bern October 216, Kolloquium Bern Determinantal representations 2 R := C[x 1,..., x n ] and R d := {p R deg p d} Definition A determinantal
More informationComplex Hadamard matrices and 3-class association schemes
Complex Hadamard matrices and 3-class association schemes Akihiro Munemasa 1 (joint work with Takuya Ikuta) 1 Graduate School of Information Sciences Tohoku University June 27, 2014 Algebraic Combinatorics:
More informationTwo-boundary lattice paths and parking functions
Two-boundary lattice paths and parking functions Joseph PS Kung 1, Xinyu Sun 2, and Catherine Yan 3,4 1 Department of Mathematics, University of North Texas, Denton, TX 76203 2,3 Department of Mathematics
More informationIowa State University and American Institute of Mathematics
Matrix and Matrix and Iowa State University and American Institute of Mathematics ICART 2008 May 28, 2008 Inverse Eigenvalue Problem for a Graph () Problem for a Graph of minimum rank Specific matrices
More informationSign Patterns that Allow Diagonalizability
Georgia State University ScholarWorks @ Georgia State University Mathematics Dissertations Department of Mathematics and Statistics 12-10-2018 Sign Patterns that Allow Diagonalizability Christopher Michael
More information