Applications of semidefinite programming in Algebraic Combinatorics
|
|
- Everett Sherman
- 5 years ago
- Views:
Transcription
1 Applications of semidefinite programming in Algebraic Combinatorics Tohoku University The 23rd RAMP Symposium October 24, 2011
2 We often want to 1 Bound the value of a numerical parameter of certain combinatorial configurations. parameter = size, index, configurations = codes, designs, spreads, ovoids, 2 Show that optimal (or nearly optimal) configurations have certain additional regularity. 3 Classify the optimal (or nearly optimal) configurations.
3 A chart ( AS stands for association schemes ) Delsarte (1973) Used AS as framework Applied LP (duality) Lovász (1979) -number Terwilliger (1992) Representation theory of AS Lovász-Schrijver (1991) Matrix-cuts Schrijver (2005) SDP bound for codes
4 Codes Q = {0, 1,..., q 1} : an alphabet of size q 2 C Q n : an (unrestricted) code of length n H (, ) : the Hamming distance on Q n : H (x, y) := {i = 1,..., n : x i y i } for x = (x 1,..., x n ), y = (y 1,..., y n ) Q n. d(c) := min{ H (x, y) : x, y C, x y} : the minimum distance of C
5 A classical problem Remark Set e := d(c) 1 2. Then e x y (C x, y, z ) z In other words, C is e-error-correcting. A q (n, d) := max{ C : d(c) d} Problem Determine A q (n, d). (Hard in general)
6 More modest problem Problem* Find a good upper bound on A q (n, d). Example B e (x) := {y Q n : H (x, y) e} : the ball with radius e and center x, where e := d 1 2 : e x A q (n, d) B e (x) = A q (n, d) e ( n ) i=0 i (q 1) i q n A code attaining equality in this sphere-packing bound is called a perfect code.
7 Association schemes X : a finite set C X : the X -dimensional column vector space over C C X X : the set of X X matrices over C R = {R 0,..., R n } : a set of non-empty subsets of X X A 0,..., A n C X X : the adjacency matrices : { 1, if (x, y) R i, (A i ) xy := 0, if (x, y) R i.
8 R = {R 0,..., R n } : a set of non-empty subsets of X X Definition The pair (X, R) is a (symmetric) association scheme if (AS1) A 0 = I (the identity matrix), (AS2) A A n = J (the all 1 s matrix), (AS3) A T i = A i (i = 0,..., n), (AS4) A i A j A := span{a 0,..., A n } (i, j = 0,..., n).
9 (AS4) A i A j = n h=0 ph ij A h A := span{a 0,..., A n } x h y i j z h p ij Remark A is a commutative matrix -algebra, so has a basis of primitive idempotents, i.e., E i E j = δ ij E i, E E n = I. A : the Bose Mesner algebra of (X, R)
10 Things to keep in mind The Bose Mesner algebra A of (X, R) is commutative and has a basis of 0-1 (so nonnegative) matrices A 0,..., A n, a basis of idempotent (so positive semidefinite) matrices E 0,..., E n. Each of the bases is an orthogonal basis with respect to M, N = trace(m N) (M, N C X X ).
11 The Hamming schemes Remark Q = {0, 1,..., q 1} X = Q n def (x, y) R i H (x, y) = i (i = 0,..., n) R = {R 0,..., R n } H(n, q) = (X, R) : the Hamming scheme H(n, q) admits G := S q S n as the group of automorphisms. A coincides with the commutant of G in C X X
12 The LP bound (Delsarte, 1973) For x X, set ^x = (0,..., 0, 1, 0,..., 0) T C X (a 1 in position x) C X : a code with minimum distance d(c) d χ C = x C ^x : the characteristic vector of C M := 1 C χ Cχ T C CX X : nonnegative & positive semidefinite M, I = 1, M, J = C M, A i = 0 for i = 1,..., d 1
13 The LP bound (Delsarte, 1973), continued Consider the following SDP problem: l LP = l LP (n, q, d) = max M, J subject to 1 M, I = 1, 2 M, A i = 0 (i = 1,..., d 1), 3 M : nonnegative & positive semidefinite. Then A q (n, d) l LP. Remark l LP is the strengthening of Lovász s ϑ-number due to Schrijver (1979).
14 max M, J ; M, I = 1, M, A i = 0 (i = 1,..., d 1), Example By projecting M to A, l LP turns to an LP: subject to 1 M, I = 1, (A q (n, d) ) l LP = l LP (n, q, d) = max M, J 2 M, A i = 0 (i = 1,..., d 1), 3 n M, A i i=0 A i, A i A i = n M, E i i=0 E i, E i E i 0 & 0, i.e., M, A i 0 (i = d,..., n), M, E i 0 (i = 1,..., n). l LP (16, 2, 6) = 256. In fact: A 2 (16, 6) = 256 (attained by the Nordstrom Robinson code).
15 Delsarte exploited duality of LP Remark Many of the known universal bounds on A q (n, d), including the sphere packing bound, are obtained by constructing nice feasible solutions to the dual problem of l LP. e := d 1 2 Ψ e (z) := e i=0 ( 1)i( )( z 1 n z i e i) (q 1) e i : Lloyd polynomial Theorem (Lloyd) If a perfect e-error-correcting code exists, then Ψ e (z) has e distinct zeros among the integers 1, 2,..., n.
16 More generally, In fact, this reduction to LP works for any SDP problem max M, B 0 subject to 1 M, B i = b i (i = 1,..., m), 2 M is positive semidefinite, whenever B 0,..., B m A for an association scheme (X, R). This was worked out in detail by Goemans and Rendl (1999) for the MAX-CUT problem.
17 Yet one more application Wilson (1984) used Delsarte s method to show the following Erdős Ko Rado theorem: Theorem (Erdős Ko Rado, 1961) Let v > (t + 1)(n t + 1) and let C be a collection of n-element subsets of Ω := {1,..., v} with the property x y t for all x, y C. Then C ( v t n t), with equality if and only if C = {x Ω : x = n, w x} for some t-element subset w Ω. This theorem has been extended to many other association schemes; cf. T. (2006, 2010).
18 The SDP bound (Schrijver, 2005) Remark For simplicity, we only consider binary codes, i.e., codes in H(n, 2). Q = {0, 1}, X = Q n A 0, A 1,..., A n : the adjacency matrices The Bose Mesner algebra A = span{a 0,..., A n } coincides with the commutant of G := S 2 S n in C X X. Below we shall consider the commutant of S n in C X X.
19 The Terwilliger algebra of H(n, 2) 0 := (0,..., 0) X E 0,..., E n C X X : the dual idempotents : { 1, if x = y, (0, x) R (E i, i ) xy := 0, otherwise. T := C[A 0,..., A n, E 0,..., E n ] : the Terwilliger algebra T = span{e i A j E h : i, j, h = 0,..., n}
20 T = span{e i A j E h : i, j, h = 0,..., n} Remark (E i A j E h ) xy = { 1, if (0, x) R i, (x, y) R j, (0, y) R h, 0, otherwise. 0 i h x j y E i A j E h = 0 unless i, j, h satisfy the triangle inequality.
21 Two matrices from a code C X : an (unrestricted) code Lemma (Schrijver, 2005) The matrices with M 1 SDP = i,j,h λ ijh E i A j E h, M 2 SDP = i,j,h(λ 0jj λ ijh )E i A j E h λ ijh := X C {(x, y, z) C3 : (x, y, z) satisfies ( )} {(x, y, z) X 3 : (x, y, z) satisfies ( )} are nonnegative & positive semidefinite, where x i h ( ) y j z It follows that λ 000 = 1 and n i=0 ( n i) λ0ii = C.
22 λ 000 = 1, n i=0 ( n i) λ0ii = C Consider the following SDP problem: subject to 1 λ 000 = 1, l SDP = l SDP (n, 2, d) = max n i=0 ( n i) λ0ii 2 λ ijh = λ i j h if (i, j, h ) is a permutation of (i, j, h), 3 i,j,h λ ijhe i A j E h : nonnegative & positive semidefinite, 4 i,j,h (λ 0jj λ ijh )E i A j E h : nonnegative & positive semidefinite, 5 λ ijh = 0 if {i, j, h} {1, 2,..., d 1}. Then A 2 (n, d) l SDP.
23 Computational results (Schrijver, 2005) Bounds on A 2 (n, d) best best upper lower bound bound previously n d known l SDP known l LP
24 2 λ ijh = λ i j h if (i, j, h ) is a permutation of (i, j, h). Remark If we omit 2, then lsdp essentially coincides with the application of matrix cuts (Lovász Schrijver, 1991) to l LP, followed by projecting to T. Gijswijt (2005) observed that 2 in the resulting bound. makes a huge difference Currently, several hierarchies of SDP bounds on A 2 (n, d) of the form l LP l (1) SDP l(2) SDP l(k) SDP... ( A 2(n, d)) have been proposed, and some numerical computations have also been carried out (e.g., Lasserre (2001), Laurent 2007), Gvozdenović Laurent Vallentin (2009), Gijswijt Mittelmann Schrijver (2010)).
25 l SDP is huge E i A j E h T CX X, X = 2 n. We reduce the size of l SDP by describing the Wedderburn decomposition (or block-diagonalization) of the matrix -algebra T (in a form convenient for the computation). T is the commutant of S n in C X X, and its Wedderburn decomposition was also found by Dunkl (1976) in the study of Krawtchouk polynomials.
26 Structure of irreducible T-modules T = span{e i A j E h : i, j, h = 0,..., n} n i=0 E i = I, E i E j = δ ij E i W C X : an irreducible T-module r := min{i = 0,..., n : E i W 0} : the endpoint of W Theorem (Go, 2002) We have More precisely, W = E r W E r+1w E n rw. dim E i W = { 1, if i = r, r + 1,..., n r, 0, otherwise. The isomorphism class of W is determined by the endpoint r.
27 Structure of irreducible T-modules, continued With respect to the decomposition W = E r W E r+1w E n rw, the matrix representing E i E i W = on W is 1 r. i. n r Remark (E i A j E h ) W is a sparse matrix. (In fact, its (i, h)-entry is written by a dual Hahn polynomial.) l SDP (n, q, d) (q 3) was studied by Gijswijt Schrijver T. (2006).
28 The quadratic assignment problem (QAP) X : a finite set S(X) : the symmetric group on X π(g) R X X : the permutation matrix of g S(X): (π(g)) xy = δ x,gy (x, y X). W, A R X X : the distance and flow matrices Consider the following QAP (without linear term): 1 min 2 W, g S(X) π(g)t Aπ(g).
29 min g S(X) 1 2 W, π(g)t Aπ(g) Suppose A = A 1 A for some association scheme (X, R). Write E i = 1 X n j=0 Q jia j (i = 0,..., n). Then (A 0,..., A n ) (C X X ) n+1 satisfies 1 A 0 = I, and A 1,..., A n are nonnegative, 2 A A n = J, 3 n j=0 Q jia j is positive semidefinite (i = 0,..., n). Conditions 1, 2, 3 hold for (π(g) T A 0 π(g),..., π(g) T A n π(g)) for any g S(X), as well as their convex combinations.
30 SDP relaxation of QAP (de Klerk et al., to appear) Thus, the SDP problem min 1 2 W, M 1 subject to 1 M 0 = I, and M 1,..., M n are nonnegative, 2 M M n = J, 3 n j=0 Q jim j is positive semidefinite (i = 0,..., n), gives a lower bound on QAP.
31 Minimum bisection problem X = 2m W : nonnegative ( ) 0m J A = m J m 0 m ( ) Jm I A 1 := A, A 2 := m 0 m 0 m J m I m A = span{i, A 1, A 2 }
32 Traveling salesman problem (de Klerk et al., 2008) W : nonnegative A = A = span{i, A, A 2,..., A X /2 }
33 Recent progress Remark When A is the commutant of a finite group G in C X X, then this SDP relaxation of QAP can be strengthened further (de Klerk Sotirov, to appear). For H(n, 2) (so G = S 2 S n ), the Terwilliger algebra T plays a role again in this case.
34 Related topics 1 Spherical codes and spherical designs LP bound Kissing number problem (k(4) = 24 (Musin, 2008)) SDP bound for spherical codes (Bachoc Vallentin, 2008) 2 Designs Dual concept to codes LP bound
Relaxations of combinatorial problems via association schemes
1 Relaxations of combinatorial problems via association schemes Etienne de Klerk, Fernando M. de Oliveira Filho, and Dmitrii V. Pasechnik Tilburg University, The Netherlands; Nanyang Technological University,
More informationVertex subsets with minimal width and dual width
Vertex subsets with minimal width and dual width in Q-polynomial distance-regular graphs University of Wisconsin & Tohoku University February 2, 2011 Every face (or facet) of a hypercube is a hypercube...
More informationThe Terwilliger algebra of a Q-polynomial distance-regular graph with respect to a set of vertices
The Terwilliger algebra of a Q-polynomial distance-regular graph with respect to a set of vertices Hajime Tanaka (joint work with Rie Tanaka and Yuta Watanabe) Research Center for Pure and Applied Mathematics
More informationInvariant Semidefinite Programs
Invariant Semidefinite Programs Christine Bachoc Université Bordeaux I, IMB Modern trends in Optimization and its Application, IPAM Optimization Tutorials, september 14-17, 2010 Outline of Part I Invariant
More informationIntroduction to Association Schemes
Introduction to Association Schemes Akihiro Munemasa Tohoku University June 5 6, 24 Algebraic Combinatorics Summer School, Sendai Assumed results (i) Vandermonde determinant: a a m =. a m a m m i
More informationApplications of Semidefinite Programming to Coding Theory
Applications of Semidefinite Programming to Coding Theory Christine Bachoc Institut de Mathématiques de Bordeaux Université Bordeaux 1 351, cours de la Libération, 33405 Talence, France Email: {christine.bachoc}@math.u-bordeaux1.fr
More informationDimension reduction for semidefinite programming
1 / 22 Dimension reduction for semidefinite programming Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology
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 informationSemidefinite Programming and Harmonic Analysis
1 / 74 Semidefinite Programming and Harmonic Analysis Cristóbal Guzmán CS 8803 - Discrete Fourier Analysis and Applications March 7, 2012 2 / 74 Motivation SDP gives best relaxations known for some combinatorial
More informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the
More informationThe Hamming Codes and Delsarte s Linear Programming Bound
The Hamming Codes and Delsarte s Linear Programming Bound by Sky McKinley Under the Astute Tutelage of Professor John S. Caughman, IV A thesis submitted in partial fulfillment of the requirements for the
More informationThe Terwilliger Algebras of Group Association Schemes
The Terwilliger Algebras of Group Association Schemes Eiichi Bannai Akihiro Munemasa The Terwilliger algebra of an association scheme was introduced by Paul Terwilliger [7] in order to study P-and Q-polynomial
More informationSemidefinite programming and eigenvalue bounds for the graph partition problem
Semidefinite programming and eigenvalue bounds for the graph partition problem E.R. van Dam R. Sotirov Abstract The graph partition problem is the problem of partitioning the vertex set of a graph into
More informationPacking, coding, and ground states From information theory to physics. Lecture III. Packing and energy minimization bounds in compact spaces
Packing, coding, and ground states From information theory to physics Lecture III. Packing and energy minimization bounds in compact spaces Henry Cohn Microsoft Research New England Pair correlations For
More informationNotes on the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre by M. Laurent, December 13, 2012
Notes on the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre by M. Laurent, December 13, 2012 We present the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre
More informationA classification of sharp tridiagonal pairs. Tatsuro Ito, Kazumasa Nomura, Paul Terwilliger
Tatsuro Ito Kazumasa Nomura Paul Terwilliger Overview This talk concerns a linear algebraic object called a tridiagonal pair. We will describe its features such as the eigenvalues, dual eigenvalues, shape,
More informationComplex Hadamard matrices and 3-class association schemes
Complex Hadamard matrices and 3-class association schemes Akihiro Munemasa 1 1 Graduate School of Information Sciences Tohoku University (joint work with Takuya Ikuta) June 26, 2013 The 30th Algebraic
More informationDelsarte s linear programming bound
15-859 Coding Theory, Fall 14 December 5, 2014 Introduction For all n, q, and d, Delsarte s linear program establishes a series of linear constraints that every code in F n q with distance d must satisfy.
More informationTridiagonal pairs in algebraic graph theory
University of Wisconsin-Madison Contents Part I: The subconstituent algebra of a graph The adjacency algebra The dual adjacency algebra The subconstituent algebra The notion of a dual adjacency matrix
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 informationSemidefinite programming bounds for spherical codes
Semidefinite programming bounds for spherical codes Christine Bachoc IMB, Université Bordeaux I 351, cours de la Libération 33405 Talence France bachoc@mathu-bordeaux1fr Fran Vallentin Centrum voor Wisunde
More informationA notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations
A notion of for Convex, Semidefinite and Extended Formulations Marcel de Carli Silva Levent Tunçel April 26, 2018 A vector in R n is integral if each of its components is an integer, A vector in R n is
More informationCopositive Programming and Combinatorial Optimization
Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with M. Bomze (Wien) and F. Jarre (Düsseldorf) and
More informationThe Multiplicities of a Dual-thin Q-polynomial Association Scheme
The Multiplicities of a Dual-thin Q-polynomial Association Scheme Bruce E. Sagan Department of Mathematics Michigan State University East Lansing, MI 44824-1027 sagan@math.msu.edu and John S. Caughman,
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 informationCharacterizations of Strongly Regular Graphs: Part II: Bose-Mesner algebras of graphs. Sung Y. Song Iowa State University
Characterizations of Strongly Regular Graphs: Part II: Bose-Mesner algebras of graphs Sung Y. Song Iowa State University sysong@iastate.edu Notation K: one of the fields R or C X: a nonempty finite set
More informationapproximation algorithms I
SUM-OF-SQUARES method and approximation algorithms I David Steurer Cornell Cargese Workshop, 201 meta-task encoded as low-degree polynomial in R x example: f(x) = i,j n w ij x i x j 2 given: functions
More informationGroup theoretic aspects of the theory of association schemes
Group theoretic aspects of the theory of association schemes Akihiro Munemasa Graduate School of Information Sciences Tohoku University October 29, 2016 International Workshop on Algebraic Combinatorics
More informationNumerical block diagonalization of matrix -algebras with application to semidefinite programming
Math. Program., Ser. B (2011) 129:91 111 DOI 10.1007/s10107-011-0461-3 FULL LENGTH PAPER Numerical block diagonalization of matrix -algebras with application to semidefinite programming Etienne de Klerk
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 informationNew bounds for the max-k-cut and chromatic number of a graph
New bounds for the max-k-cut and chromatic number of a graph E.R. van Dam R. Sotirov Abstract We consider several semidefinite programming relaxations for the max-k-cut problem, with increasing complexity.
More informationMatrix Algebras and Semidefinite Programming Techniques for Codes. Dion Gijswijt
Matrix Algebras and Semidefinite Programming Techniques for Codes Dion Gijswijt Matrix Algebras and Semidefinite Programming Techniques for Codes Academisch Proefschrift ter verkrijging van de graad van
More informationLecture: Introduction to LP, SDP and SOCP
Lecture: Introduction to LP, SDP and SOCP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2015.html wenzw@pku.edu.cn Acknowledgement:
More informationThe maximal stable set problem : Copositive programming and Semidefinite Relaxations
The maximal stable set problem : Copositive programming and Semidefinite Relaxations Kartik Krishnan Department of Mathematical Sciences Rensselaer Polytechnic Institute Troy, NY 12180 USA kartis@rpi.edu
More informationLecture 3: Semidefinite Programming
Lecture 3: Semidefinite Programming Lecture Outline Part I: Semidefinite programming, examples, canonical form, and duality Part II: Strong Duality Failure Examples Part III: Conditions for strong duality
More informationAlmost Independent Binary Random Variables
Project Number: MA-WJM-6401 Almost Independent Binary Random Variables A Major Qualifying Project submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in partial fulfillment of the requirements
More informationTheorems of Erdős-Ko-Rado type in polar spaces
Theorems of Erdős-Ko-Rado type in polar spaces Valentina Pepe, Leo Storme, Frédéric Vanhove Department of Mathematics, Ghent University, Krijgslaan 28-S22, 9000 Ghent, Belgium Abstract We consider Erdős-Ko-Rado
More informationSDP and eigenvalue bounds for the graph partition problem
SDP and eigenvalue bounds for the graph partition problem Renata Sotirov and Edwin van Dam Tilburg University, The Netherlands Outline... the graph partition problem Outline... the graph partition problem
More informationCSC Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method Notes taken by Stefan Mathe April 28, 2007 Summary: Throughout the course, we have seen the importance
More informationOn bounding the bandwidth of graphs with symmetry
On bounding the bandwidth of graphs with symmetry E.R. van Dam R. Sotirov Abstract We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem.
More informationLeonard triples of q-racah type
University of Wisconsin-Madison Overview This talk concerns a Leonard triple A, B, C of q-racah type. We will describe this triple, using three invertible linear maps called W, W, W. As we will see, A
More informationSemidefinite Programming Basics and Applications
Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent
More informationCopositive Programming and Combinatorial Optimization
Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with I.M. Bomze (Wien) and F. Jarre (Düsseldorf) IMA
More informationTriply Regular Graphs
Triply Regular Graphs by Krystal J. Guo Simon Fraser University Burnaby, British Columbia, Canada, 2011 c Krystal J. Guo 2011 Abstract This project studies a regularity condition on graphs. A graph X
More informationMustapha Ç. Pinar 1. Communicated by Jean Abadie
RAIRO Operations Research RAIRO Oper. Res. 37 (2003) 17-27 DOI: 10.1051/ro:2003012 A DERIVATION OF LOVÁSZ THETA VIA AUGMENTED LAGRANGE DUALITY Mustapha Ç. Pinar 1 Communicated by Jean Abadie Abstract.
More informationIntroduction to Semidefinite Programming I: Basic properties a
Introduction to Semidefinite Programming I: Basic properties and variations on the Goemans-Williamson approximation algorithm for max-cut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite
More informationNur Hamid and Manabu Oura
Math. J. Okayama Univ. 61 (2019), 199 204 TERWILLIGER ALGEBRAS OF SOME GROUP ASSOCIATION SCHEMES Nur Hamid and Manabu Oura Abstract. The Terwilliger algebra plays an important role in the theory of association
More informationMIT Algebraic techniques and semidefinite optimization February 14, Lecture 3
MI 6.97 Algebraic techniques and semidefinite optimization February 4, 6 Lecture 3 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture, we will discuss one of the most important applications
More informationExploiting symmetry in copositive programs via semidefinite hierarchies
Exploiting symmetry in copositive programs via semidefinite hierarchies C. Dobre J. Vera January 30, 2015 Abstract Copositive programming is a relative young field which has evolved into a highly active
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 informationPermutation groups/1. 1 Automorphism groups, permutation groups, abstract
Permutation groups Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms... You can expect to gain a deep insight into the constitution of Σ in this way.
More informationModeling with semidefinite and copositive matrices
Modeling with semidefinite and copositive matrices Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria F. Rendl, Singapore workshop 2006 p.1/24 Overview Node and Edge relaxations
More informationSemidefinite Programming
Semidefinite Programming Basics and SOS Fernando Mário de Oliveira Filho Campos do Jordão, 2 November 23 Available at: www.ime.usp.br/~fmario under talks Conic programming V is a real vector space h, i
More information1 Solution of a Large-Scale Traveling-Salesman Problem... 7 George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson
Part I The Early Years 1 Solution of a Large-Scale Traveling-Salesman Problem............ 7 George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson 2 The Hungarian Method for the Assignment Problem..............
More informationCodes and Rings: Theory and Practice
Codes and Rings: Theory and Practice Patrick Solé CNRS/LAGA Paris, France, January 2017 Geometry of codes : the music of spheres R = a finite ring with identity. A linear code of length n over a ring R
More informationLeonard pairs and the q-tetrahedron algebra. Tatsuro Ito, Hjalmar Rosengren, Paul Terwilliger
Tatsuro Ito Hjalmar Rosengren Paul Terwilliger Overview Leonard pairs and the Askey-scheme of orthogonal polynomials Leonard pairs of q-racah type The LB-UB form and the compact form The q-tetrahedron
More information1 The independent set problem
ORF 523 Lecture 11 Spring 2016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Tuesday, March 29, 2016 When in doubt on the accuracy of these notes, please cross chec with the instructor
More informationSpherical Euclidean Distance Embedding of a Graph
Spherical Euclidean Distance Embedding of a Graph Hou-Duo Qi University of Southampton Presented at Isaac Newton Institute Polynomial Optimization August 9, 2013 Spherical Embedding Problem The Problem:
More informationInvariant semidefinite programs
Invariant semidefinite programs Christine Bachoc 1, Dion C. Gijswijt 2, Alexander Schrijver 3, and Frank Vallentin 4 1 Laboratoire A2X, Université Bordeaux I, 351, cours de la Libération, 33405 Talence,
More informationStrong duality in Lasserre s hierarchy for polynomial optimization
Strong duality in Lasserre s hierarchy for polynomial optimization arxiv:1405.7334v1 [math.oc] 28 May 2014 Cédric Josz 1,2, Didier Henrion 3,4,5 Draft of January 24, 2018 Abstract A polynomial optimization
More informationSymmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems Etienne de Klerk Marianna E.-Nagy Renata Sotirov Uwe Truetsch March 12, 214 Abstract The reformulation-linearization
More informationCutting Planes for First Level RLT Relaxations of Mixed 0-1 Programs
Cutting Planes for First Level RLT Relaxations of Mixed 0-1 Programs 1 Cambridge, July 2013 1 Joint work with Franklin Djeumou Fomeni and Adam N. Letchford Outline 1. Introduction 2. Literature Review
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 informationWe describe the generalization of Hazan s algorithm for symmetric programming
ON HAZAN S ALGORITHM FOR SYMMETRIC PROGRAMMING PROBLEMS L. FAYBUSOVICH Abstract. problems We describe the generalization of Hazan s algorithm for symmetric programming Key words. Symmetric programming,
More informationCOMMUTATIVE ASSOCIATION SCHEMES
COMMUTATIVE ASSOCIATION SCHEMES WILLIAM J. MARTIN AND HAJIME TANAKA Abstract. Association schemes were originally introduced by Bose and his co-workers in the design of statistical experiments. Since that
More informationSDP Relaxations for MAXCUT
SDP Relaxations for MAXCUT from Random Hyperplanes to Sum-of-Squares Certificates CATS @ UMD March 3, 2017 Ahmed Abdelkader MAXCUT SDP SOS March 3, 2017 1 / 27 Overview 1 MAXCUT, Hardness and UGC 2 LP
More informationc 2000 Society for Industrial and Applied Mathematics
SIAM J. OPIM. Vol. 10, No. 3, pp. 750 778 c 2000 Society for Industrial and Applied Mathematics CONES OF MARICES AND SUCCESSIVE CONVEX RELAXAIONS OF NONCONVEX SES MASAKAZU KOJIMA AND LEVEN UNÇEL Abstract.
More informationApplications of the Inverse Theta Number in Stable Set Problems
Acta Cybernetica 21 (2014) 481 494. Applications of the Inverse Theta Number in Stable Set Problems Miklós Ujvári Abstract In the paper we introduce a semidefinite upper bound on the square of the stability
More informationSemidefinite programming lifts and sparse sums-of-squares
1/15 Semidefinite programming lifts and sparse sums-of-squares Hamza Fawzi (MIT, LIDS) Joint work with James Saunderson (UW) and Pablo Parrilo (MIT) Cornell ORIE, October 2015 Linear optimization 2/15
More informationJOHNSON SCHEMES AND CERTAIN MATRICES WITH INTEGRAL EIGENVALUES
JOHNSON SCHEMES AND CERTAIN MATRICES WITH INTEGRAL EIGENVALUES AMANDA BURCROFF The University of Michigan Wednesday 6 th September, 2017 Abstract. We are interested in the spectrum of matrices in the adjacency
More information7. Lecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Michel X. Goemans 18.433: Combinatorial Optimization 7. Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm proposed for linear
More informationTHE LOVÁSZ THETA FUNCTION AND A SEMIDEFINITE PROGRAMMING RELAXATION OF VERTEX COVER
SIAM J. DISCRETE MATH. c 1998 Society for Industrial and Applied Mathematics Vol. 11, No., pp. 196 04, May 1998 00 THE LOVÁSZ THETA FUNCTION AND A SEMIDEFINITE PROGRAMMING RELAXATION OF VERTEX COVER JON
More informationReal Symmetric Matrices and Semidefinite Programming
Real Symmetric Matrices and Semidefinite Programming Tatsiana Maskalevich Abstract Symmetric real matrices attain an important property stating that all their eigenvalues are real. This gives rise to many
More informationLinear Algebra. Workbook
Linear Algebra Workbook Paul Yiu Department of Mathematics Florida Atlantic University Last Update: November 21 Student: Fall 2011 Checklist Name: A B C D E F F G H I J 1 2 3 4 5 6 7 8 9 10 xxx xxx xxx
More informationStrongly Regular Decompositions of the Complete Graph
Journal of Algebraic Combinatorics, 17, 181 201, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Strongly Regular Decompositions of the Complete Graph EDWIN R. VAN DAM Edwin.vanDam@uvt.nl
More informationSupport weight enumerators and coset weight distributions of isodual codes
Support weight enumerators and coset weight distributions of isodual codes Olgica Milenkovic Department of Electrical and Computer Engineering University of Colorado, Boulder March 31, 2003 Abstract In
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 informationAdvanced SDPs Lecture 6: March 16, 2017
Advanced SDPs Lecture 6: March 16, 2017 Lecturers: Nikhil Bansal and Daniel Dadush Scribe: Daniel Dadush 6.1 Notation Let N = {0, 1,... } denote the set of non-negative integers. For α N n, define the
More informationLecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Handout 1 18.433: Combinatorial Optimization May 14th, 007 Michel X. Goemans Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm
More informationThe Difference Between 5 5 Doubly Nonnegative and Completely Positive Matrices
The Difference Between 5 5 Doubly Nonnegative and Completely Positive Matrices Sam Burer and Kurt M. Anstreicher University of Iowa Mirjam Dür TU Darmstadt IMA Hot Topics Workshop, November 2008 Consider
More informationSome Bounds for the Distribution Numbers of an Association Scheme
Europ. J. Combinatorics (1988) 9, 1-5 Some Bounds for the Distribution Numbers of an Association Scheme THOMAS BIER AND PHILIPPE DELSARTE We generalize the definition of distribution numbers of an association
More informationLeonard pairs from the equitable basis of sl2
Electronic Journal of Linear Algebra Volume 20 Volume 20 (2010) Article 36 2010 Leonard pairs from the equitable basis of sl2 Hasan Alnajjar Brian Curtin bcurtin@math.usf.edu Follow this and additional
More informationA better approximation ratio for the Vertex Cover problem
A better approximation ratio for the Vertex Cover problem George Karakostas Dept. of Computing and Software McMaster University October 5, 004 Abstract We reduce the approximation factor for Vertex Cover
More informationOn some incidence structures constructed from groups and related codes
On some incidence structures constructed from groups and related codes Dean Crnković Department of Mathematics University of Rijeka Croatia Algebraic Combinatorics and Applications The first annual Kliakhandler
More informationLeonard Systems and their Friends
University of South Florida Scholar Commons Graduate Theses and Dissertations Graduate School March 016 Leonard Systems and their Friends Jonathan Spiewak Follow this and additional works at: http://scholarcommons.usf.edu/etd
More informationFour new upper bounds for the stability number of a graph
Four new upper bounds for the stability number of a graph Miklós Ujvári Abstract. In 1979, L. Lovász defined the theta number, a spectral/semidefinite upper bound on the stability number of a graph, which
More informationHierarchies. 1. Lovasz-Schrijver (LS), LS+ 2. Sherali Adams 3. Lasserre 4. Mixed Hierarchy (recently used) Idea: P = conv(subset S of 0,1 n )
Hierarchies Today 1. Some more familiarity with Hierarchies 2. Examples of some basic upper and lower bounds 3. Survey of recent results (possible material for future talks) Hierarchies 1. Lovasz-Schrijver
More informationScaffolds. A graph-based system for computations in Bose-Mesner algebras. William J. Martin
A graph-based system for computations in Bose-esner algebras Department of athematical Sciences and Department of Computer Science Worcester Polytechnic Institute Algebraic Combinatorics Seminar Shanghai
More informationQUADRATIC AND SYMMETRIC BILINEAR FORMS OVER FINITE FIELDS AND THEIR ASSOCIATION SCHEMES
QUADRATIC AND SYMMETRIC BILINEAR FORMS OVER FINITE FIELDS AND THEIR ASSOCIATION SCHEMES KAI-UWE SCHMIDT Abstract. Let Q(m, q) and S (m, q) be the sets of quadratic forms and symmetric bilinear forms on
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 informationDetailed Proof of The PerronFrobenius Theorem
Detailed Proof of The PerronFrobenius Theorem Arseny M Shur Ural Federal University October 30, 2016 1 Introduction This famous theorem has numerous applications, but to apply it you should understand
More informationA Geometric Approach to Graph Isomorphism
A Geometric Approach to Graph Isomorphism Pawan Aurora and Shashank K Mehta Indian Institute of Technology, Kanpur - 208016, India {paurora,skmehta}@cse.iitk.ac.in Abstract. We present an integer linear
More informationA NEW SEMIDEFINITE PROGRAMMING HIERARCHY FOR CYCLES IN BINARY MATROIDS AND CUTS IN GRAPHS
A NEW SEMIDEFINITE PROGRAMMING HIERARCHY FOR CYCLES IN BINARY MATROIDS AND CUTS IN GRAPHS JOÃO GOUVEIA, MONIQUE LAURENT, PABLO A. PARRILO, AND REKHA THOMAS Abstract. The theta bodies of a polynomial ideal
More informationLecture Semidefinite Programming and Graph Partitioning
Approximation Algorithms and Hardness of Approximation April 16, 013 Lecture 14 Lecturer: Alantha Newman Scribes: Marwa El Halabi 1 Semidefinite Programming and Graph Partitioning In previous lectures,
More informationRING ELEMENTS AS SUMS OF UNITS
1 RING ELEMENTS AS SUMS OF UNITS CHARLES LANSKI AND ATTILA MARÓTI Abstract. In an Artinian ring R every element of R can be expressed as the sum of two units if and only if R/J(R) does not contain a summand
More informationSome aspects of codes over rings
Some aspects of codes over rings Peter J. Cameron p.j.cameron@qmul.ac.uk Galway, July 2009 This is work by two of my students, Josephine Kusuma and Fatma Al-Kharoosi Summary Codes over rings and orthogonal
More informationCopositive and Semidefinite Relaxations of the Quadratic Assignment Problem (appeared in Discrete Optimization 6 (2009) )
Copositive and Semidefinite Relaxations of the Quadratic Assignment Problem (appeared in Discrete Optimization 6 (2009) 231 241) Janez Povh Franz Rendl July 22, 2009 Abstract Semidefinite relaxations of
More informationA Course in Combinatorics
A Course in Combinatorics J. H. van Lint Technical Universüy of Eindhoven and R. M. Wilson California Institute of Technology H CAMBRIDGE UNIVERSITY PRESS CONTENTS Preface xi 1. Graphs 1 Terminology of
More informationA Vector Space Analog of Lovasz s Version of the Kruskal-Katona Theorem
Claude Tardif Non-canonical Independent sets in Graph Powers Let s 4 be an integer. The truncated s-simplex T s is defined as follows: V (T s ) = {(i, j) {0, 1,..., s 1} 2 : i j}, E(T s ) = {[(i, j), (,
More information