# 1 Total Dual Integrality

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 CS 598CSC: Combinatorial Optimization Lecture date: February 25, 2010 Instructor: Chandra Chekuri Scribe: Bill Kinnersley 1 Total Dual Integrality Recall that if A is TUM and b, c are integral vectors, then max{cx : Ax b} and min{yb : y 0, ya = c} are attained by integral vectors x and y whenever the optima exist and are finite. This gives rise to a variety of min-max results, for example we derived König s theorem on bipartite graphs. There are many examples where we have integral polyhedra defined by a system Ax b but A is not TUM; the polyhedron is integral only for some specific b. We may still ask for the following. Given any c, consider the maximization problem max{cx : Ax b}; is it the case that the dual minimization problem min{yb : y 0, ya = c} has an integral optimal solution (whenever a finite optimum exists)? This motivates the following definition: Definition 1 A rational system of inequalities Ax b is totally dual integral (TDI) if, for all integral c, min{yb : y 0, ya = c} is attained by an integral vector y whenever the optimum exists and is finite. Remark 2 If A is TUM, Ax b is TDI for all b. This definition was introduced by Edmonds and Giles[2] to set up the following theorem: Theorem 3 If Ax b is TDI and b is integral, then {x : Ax b} is an integral polyhedron. This is useful because Ax b may be TDI even if A is not TUM; in other words, this is a weaker sufficient condition for integrality of {x : Ax b} and moreover guarantees that the dual is integral whenever the primal objective vector is integral. Proof Sketch. Let P = {x : Ax b}. Recall that we had previously shown that the following are equivalent: (i) P is integral. (ii) Every face of P contains an integer vector. (iii) Every minimal face of P contains an integer vector. (iv) max{cx : x P } is achieved by an integral vector whenever the optimum is finite. Edmonds and Giles proved two more equivalent conditions: (v) Every rational supporting hyperplane of P contains an integer vector. (vi) If c is integral, then max{cx : x P } is an integer whenever the optimum exists and is finite.

2 Condition (vi) implies the theorem as follows. If Ax b is TDI and b is integral, max{cx : x P } is an integer for all integral c whenever it is finite; this is because the dual optimum is achieved by an integral vector y (TDI property) and the objective function by is integral because b is integral. This implies that P is integral. There s an important subtlety to the definition of total dual integrality: being TDI is a property of a system of inequalities, not a property of the corresponding polyhedron. y (1, 2) y (1, 2) (1, 1) (2, 1) (1, 1) (2, 1) (2, 2) (2, 2), y 0 x + 2y 6 2x + y 6 x, y 0 x + 2y 6 2x + y 6 x + y 4 x 3, y 3 x We will illustrate this with an example from [3]. Consider the system Ax b drawn above on the left. If we take the cost vector c to be (1, 1), then the primal has an optimum at (2, 2) with value 4. The tight constraints at this vertex have normal vectors (2, 1) and (1, 2) (these are rows of A). Therefore, in order for the dual ya = c to have an integer solution, we must be able to express (1, 1) as an integer combination of (2, 1) and (1, 2). Since this is impossible, Ax b is not TDI. However, suppose we add more constraints to obtain the system A x b drawn above on the right. Note that this system corresponds to the same polyhedron as Ax b. However, now we have an additional normal vector at (2, 2) namely, (1, 1). Thus (1, 1) is now an integer combination of the normal vectors at (2, 2). The system A x b is in fact TDI, even though it corresponds to the same polytope as the (non-tdi) system Ax b. The example demonstrates a necessary for a system to be TDI. We explain this in the general context. Consider the problem max{cx : Ax b} with c integral, and assume it has a finite optimum β. Then it is achieved by some vector x in the face F defined by the intersection of {x : Ax b} with the hyperplane cx = β. For simplicity assume that the face F is an extreme point/vertex of the polyhedron and let A x = b be the set of all inequalities in Ax b that are tight at x. The dual is min{yb : y 0, ya = c}. By LP duality theory, any dual optimum solution y corresponds to c being expressed a non-negative combination of the row vectors of A, in other words c is in the cone of the row vectors of A. If Ax b is TDI then we ask for an integral dual optimum solution; this requires that there is an integer solution to ya = c, y 0. This motivates

3 the following definition. Definition 4 A set {a 1,..., a k } of vectors in R n is a Hilbert basis if every integral vector x Cone({a 1,..., a k }) can be written as x = k i=1 µ ia i, µ i 0, µ i Z (that is, x is a non-negative integer combination of a 1,..., a k ). If the a i are themselves integral, we call {a 1,..., a k } an integral Hilbert basis. The following theorem is not difficult to prove with the background that we have developed. Theorem 5 The rational system Ax b is TDI if and only if the following property is true for each face F of P ; let A x = b be the set of all inequalities in Ax b that are tight/active at F, then the rows vectors of A form a Hilbert basis. Corollary 6 If the system Ax b, αx β is TDI then Ax b, αx = β is also TDI. The example above raises the question of whether one can take any rational system Ax b and make it TDI by adding sufficiently many redundant inequalities. Indeed that is possible, and is based on the following theorem. Theorem 7 Every rational polyhedral cone has a finite integral Hilbert basis. Theorem 8 (Giles-Pulleyblank) Any rational polyhedron P has a representation Ax b such that (i) P = {x : Ax b}, (ii) A is integral, and (iii) Ax b is TDI. Moreover, b is integral if and only if P is integral. 2 The Cunningham-Marsh Theorem Suppose we have a graph G = (V, E). Let P odd (V ) denote the family of all odd subsets of V with size at least 3. Recall that in our study of matchings, we have examined three different systems of inequalities. x(δ(v)) = 1 v V P 1 : x(δ(u)) 1 U P odd (V ) x(δ(v)) 1 v V P 2 : x(e[u]) 1 2 U U P odd (V ) x(δ(v)) = 1 v V P 3 : x(e[u]) 1 2 U U P odd (V )

4 Here P 2 determines the matching polytope for G, while P 1 and P 3 determine the perfect matching polytope. It is not hard to see that P 1 is not TDI. Consider K 4 with w(e) = 1 for every edge e. In this case, the unique optimal dual solution is y v = 1 2 for each vertex v. On the other hand, P 2 and P 3 are TDI; this was proven by Cunningham and Marsh[1]. Consider the primal maximization and dual minimzation problems for P 2 below: maximize wx subject to minimize y v + 1 z U 2 U subject to x(δ(v)) 1 v V v V U P odd (V ) x(e[u]) 1 2 U U P odd (V ) y a + y b + U P odd (V ) a,b U z U w(ab) ab E y 0, z 0 By integrality of the matching polytope, the maximum value of the primal is the maximum weight of a matching under w; by duality, this equals the minimum value of the dual. The Cunningham-Marsh Theorem tells us that this minimum value is achieved by integral dual vectors y, z with the additional condition that the sets {U : zu > 0} form a laminar family. Theorem 9 (Cunningham-Marsh) The system P 2 is TDI (as is P 3 ). More precisely, for every integral w, there exist integral vectors y and z that are dual feasible such that {U : z U > 0} is laminar and y v + 1 z U 2 U = ν(w) v V U P odd (V ) where ν(w) is the maximum weight of a matching under w. Exercise 10 Show that the Tutte-Berge Formula can be derived from the Cunningham-Marsh Theorem. Cunningham and Marsh originally proved this theorem algorithmically, but we present a different proof from [4]; the proof relies on the fact that P 2 is the matching polytope. A different proof is given in [4] that does not assume this and in fact derives that P 2 is the matching polytope as a consequence. Proof: We will use induction on E + w(e) (which is legal because w is integral). Note that if w(e) 0 for some edge e, we may discard it; hence we may assume that w(e) 1 for all e E. Case I: Some vertex v belongs to every maximum-weight matching under w. Define w : E Z + by w (e) = w(e) 1 if e δ(v) w (e) = w(e) if e δ(v) Now induct on w. Let y, z be an integral optimal dual solution with respect to w such that {U : z U > 0} is laminar; the value of this solution is ν(w ). Because v appears in every maximum-weight matching under w, ν(w ) ν(w) 1; by definition of w, ν(w ) ν(w) 1. Thus ν(w ) = ν(w) 1.

5 Let y agree with y everywhere except v, and let yv = y v + 1. Let z = z. Now y, z is a dual feasible solution with respect to w, the solution is optimal since it has weight ν(w ) + 1 = ν(w), and {U : zu > 0} is laminar since z = z. Case II: No vertex belongs to every maximum-weight matching under w. Let y, z be a fractional optimal dual solution. Observe that y = 0, since y v > 0 for some vertex v, together with complementary slackness, would imply that every optimal primal solution covers v, i.e. v belongs to every maximum-weight matching under w. Among all optimal dual solutions y, z (with y = 0) choose the one that maximizes U P odd (V ) z 1 U 2 U 2. To complete the proof, we just need to show that z is integral and {U : z U > 0} is laminar. Suppose {U : z U > 0} is not laminar; choose W, X P odd (V ) with z W > 0, z X > 0, and W X. We claim that W X is odd. Choose v W X, and let M be a maxmimum-weight matching under w that misses v. Since z W > 0, by complementary slackness, M contains 1 2 W edges inside W ; thus v is the only vertex in W missed by M. Similarly, v is the only vertex in X missed by M. Thus M covers W X {v} using only edges inside W X {v}, so W X {v} is even, and so W X is odd. Let ɛ be the smaller of z W and z X ; form a new dual solution by decreasing z W and z X by ɛ and increasing z W X and z W X by ɛ (this is an uncrossing step). We claim that this change maintains dual feasibility and optimality. Clearly z W and z X are still nonnegative. If an edge e is contained in W and X, then the sum in e s dual constraint loses 2ɛ from z W and z X, but gains 2ɛ from z W X and z W X, and hence still holds. Likewise, if e is contained in W but not X (or vice-versa), the sum loses ɛ from z W but gains ɛ from z W X. Thus these changes maintained dual feasibility and did not change the value of the solution, so we still have an optimal solution. However, we have increased U P odd (V ) z 1 U 2 U 2 (the reader should verify this), which contradicts the choice of z. Thus {U : z U > 0} is laminar. Suppose instead that z is not integral. Choose a maximal U P odd (V ) such that z U is not an integer. Let U 1,..., U k be maximal odd sets contained in U such that each z Ui > 0. (Note that we may have k = 0.) By laminarity, U 1,..., U k are disjoint. Let α = z U z U. Form a new dual solution by decreasing z U by α and increasing each z Ui by α. We claim that the resulting solution is dual feasible. Clearly we still have z U 0, and no other dual variable was decreased. Thus we need only consider the edge constraints; moreover, the only constraints affected are those corresponding to edges contained within U. Let e be an edge contained in U. If e is contained in some U i, then the sum in e s constraint loses α from z U but gains α from z Ui, so the sum does not change. On the other hand, suppose e is not contained in any U i. By maximality of U and the U i, U is the only set in P odd containing e. Thus before we changed z U we had z U w(e); because w(e) is integral, we must still have z U w(e). Hence our new solution is dual feasible. Since the U i are disjoint, contained in U, and odd sets, 1 2 U > k 1 i=1 2 U i. Thus our new solution has a smaller dual value than the old solution, which contradicts the optimality of z. It follows that z was integral, which completes the proof. To show that the system P 3 is TDI, we use Corollary 6 and the fact that system P 2 is TDI. References [1] W. H. Cunningham and A. B. Marsh, III. A primal algorithm for optimal matching. Mathematical Programming Study 8 (1978),

6 [2] J. Edmonds and R. Giles. Total dual integrality of linear inequality systems. Progress in combinatorial optimization (Waterloo, Ont., 1982), , Academic Press, Toronto, ON, [3] Lecture notes from Michael Goemans s class on Combinatorial Optimization. goemans/18438/lec6.pdf [4] A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1998.

### 3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

### 1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.

Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S

### Some representability and duality results for convex mixed-integer programs.

Some representability and duality results for convex mixed-integer programs. Santanu S. Dey Joint work with Diego Morán and Juan Pablo Vielma December 17, 2012. Introduction About Motivation Mixed integer

### Approximation Algorithms

Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

### Nan Kong, Andrew J. Schaefer. Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA

A Factor 1 2 Approximation Algorithm for Two-Stage Stochastic Matching Problems Nan Kong, Andrew J. Schaefer Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA Abstract We introduce

### Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal

Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal ABSTACT Mohit Singh Tepper School of Business Carnegie Mellon University Pittsburgh, PA USA mohits@andrew.cmu.edu In the MINIMUM

### MATHEMATICAL ENGINEERING TECHNICAL REPORTS. The Independent Even Factor Problem

MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Independent Even Factor Problem Satoru IWATA and Kenjiro TAKAZAWA METR 2006 24 April 2006 DEPARTMENT OF MATHEMATICAL INFORMATICS GRADUATE SCHOOL OF INFORMATION

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### Optimization in R n Introduction

Optimization in R n Introduction Rudi Pendavingh Eindhoven Technical University Optimization in R n, lecture Rudi Pendavingh (TUE) Optimization in R n Introduction ORN / 4 Some optimization problems designing

### Proximal mapping via network optimization

L. Vandenberghe EE236C (Spring 23-4) Proximal mapping via network optimization minimum cut and maximum flow problems parametric minimum cut problem application to proximal mapping Introduction this lecture:

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### Load Balancing and Switch Scheduling

EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load

### Permutation Betting Markets: Singleton Betting with Extra Information

Permutation Betting Markets: Singleton Betting with Extra Information Mohammad Ghodsi Sharif University of Technology ghodsi@sharif.edu Hamid Mahini Sharif University of Technology mahini@ce.sharif.edu

### Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

### BX in ( u, v) basis in two ways. On the one hand, AN = u+

1. Let f(x) = 1 x +1. Find f (6) () (the value of the sixth derivative of the function f(x) at zero). Answer: 7. We expand the given function into a Taylor series at the point x = : f(x) = 1 x + x 4 x

### ARTICLE IN PRESS. European Journal of Operational Research xxx (2004) xxx xxx. Discrete Optimization. Nan Kong, Andrew J.

A factor 1 European Journal of Operational Research xxx (00) xxx xxx Discrete Optimization approximation algorithm for two-stage stochastic matching problems Nan Kong, Andrew J. Schaefer * Department of

Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one

### ! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.

Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs

Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs Stavros Athanassopoulos, Ioannis Caragiannis, and Christos Kaklamanis Research Academic Computer Technology Institute

### The degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

### Equilibrium computation: Part 1

Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium

### FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is

### it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

### Lecture 4: BK inequality 27th August and 6th September, 2007

CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound

### 2.1 Complexity Classes

15-859(M): Randomized Algorithms Lecturer: Shuchi Chawla Topic: Complexity classes, Identity checking Date: September 15, 2004 Scribe: Andrew Gilpin 2.1 Complexity Classes In this lecture we will look

Adaptive Linear Programming Decoding Mohammad H. Taghavi and Paul H. Siegel ECE Department, University of California, San Diego Email: (mtaghavi, psiegel)@ucsd.edu ISIT 2006, Seattle, USA, July 9 14, 2006

### 8.1 Min Degree Spanning Tree

CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree

### Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

### Classification of Cartan matrices

Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

### OPRE 6201 : 2. Simplex Method

OPRE 6201 : 2. Simplex Method 1 The Graphical Method: An Example Consider the following linear program: Max 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2

### Generalized Induced Factor Problems

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2002-07. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### 24. The Branch and Bound Method

24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### Linear Programming: Chapter 11 Game Theory

Linear Programming: Chapter 11 Game Theory Robert J. Vanderbei October 17, 2007 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544 http://www.princeton.edu/ rvdb Rock-Paper-Scissors

### Permutation Betting Markets: Singleton Betting with Extra Information

Permutation Betting Markets: Singleton Betting with Extra Information Mohammad Ghodsi Sharif University of Technology ghodsi@sharif.edu Hamid Mahini Sharif University of Technology mahini@ce.sharif.edu

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### GROUPS ACTING ON A SET

GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

### The Generalized Assignment Problem with Minimum Quantities

The Generalized Assignment Problem with Minimum Quantities Sven O. Krumke a, Clemens Thielen a, a University of Kaiserslautern, Department of Mathematics Paul-Ehrlich-Str. 14, D-67663 Kaiserslautern, Germany

### Tree-representation of set families and applications to combinatorial decompositions

Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### Two-Stage Stochastic Linear Programs

Two-Stage Stochastic Linear Programs Operations Research Anthony Papavasiliou 1 / 27 Two-Stage Stochastic Linear Programs 1 Short Reviews Probability Spaces and Random Variables Convex Analysis 2 Deterministic

Computational Learning Theory Spring Semester, 2009/10 Lecture 11: Sponsored search Lecturer: Yishay Mansour Scribe: Ben Pere, Jonathan Heimann, Alon Levin 11.1 Sponsored Search 11.1.1 Introduction Search

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### ! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.

Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of

### SOLVING POLYNOMIAL EQUATIONS

C SOLVING POLYNOMIAL EQUATIONS We will assume in this appendix that you know how to divide polynomials using long division and synthetic division. If you need to review those techniques, refer to an algebra

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

### Convex Rationing Solutions (Incomplete Version, Do not distribute)

Convex Rationing Solutions (Incomplete Version, Do not distribute) Ruben Juarez rubenj@hawaii.edu January 2013 Abstract This paper introduces a notion of convexity on the rationing problem and characterizes

### Analysis of Algorithms, I

Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadth-first search (BFS) 4 Applications

### Graphical degree sequences and realizations

swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS - Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös

### Max Flow, Min Cut, and Matchings (Solution)

Max Flow, Min Cut, and Matchings (Solution) 1. The figure below shows a flow network on which an s-t flow is shown. The capacity of each edge appears as a label next to the edge, and the numbers in boxes

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### Key words. Mixed-integer programming, mixing sets, convex hull descriptions, lot-sizing.

MIXING SETS LINKED BY BI-DIRECTED PATHS MARCO DI SUMMA AND LAURENCE A. WOLSEY Abstract. Recently there has been considerable research on simple mixed-integer sets, called mixing sets, and closely related

### On the representability of the bi-uniform matroid

On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large

### THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan

### Polynomials. Dr. philippe B. laval Kennesaw State University. April 3, 2005

Polynomials Dr. philippe B. laval Kennesaw State University April 3, 2005 Abstract Handout on polynomials. The following topics are covered: Polynomial Functions End behavior Extrema Polynomial Division

### Minkowski Sum of Polytopes Defined by Their Vertices

Minkowski Sum of Polytopes Defined by Their Vertices Vincent Delos, Denis Teissandier To cite this version: Vincent Delos, Denis Teissandier. Minkowski Sum of Polytopes Defined by Their Vertices. Journal

### Class One: Degree Sequences

Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

### Duality in General Programs. Ryan Tibshirani Convex Optimization 10-725/36-725

Duality in General Programs Ryan Tibshirani Convex Optimization 10-725/36-725 1 Last time: duality in linear programs Given c R n, A R m n, b R m, G R r n, h R r : min x R n c T x max u R m, v R r b T

### Lecture 7: NP-Complete Problems

IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NP-Complete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit

### THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING

THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The Black-Scholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages

### Module1. x 1000. y 800.

Module1 1 Welcome to the first module of the course. It is indeed an exciting event to share with you the subject that has lot to offer both from theoretical side and practical aspects. To begin with,

CS787: Advanced Algorithms Topic: Online Learning Presenters: David He, Chris Hopman 17.3.1 Follow the Perturbed Leader 17.3.1.1 Prediction Problem Recall the prediction problem that we discussed in class.

### AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.

### FACTORIZATION OF TROPICAL POLYNOMIALS IN ONE AND SEVERAL VARIABLES. Nathan B. Grigg. Submitted to Brigham Young University in partial fulfillment

FACTORIZATION OF TROPICAL POLYNOMIALS IN ONE AND SEVERAL VARIABLES by Nathan B. Grigg Submitted to Brigham Young University in partial fulfillment of graduation requirements for University Honors Department

### Completely Positive Cone and its Dual

On the Computational Complexity of Membership Problems for the Completely Positive Cone and its Dual Peter J.C. Dickinson Luuk Gijben July 3, 2012 Abstract Copositive programming has become a useful tool

### 1 Introduction. Dr. T. Srinivas Department of Mathematics Kakatiya University Warangal 506009, AP, INDIA tsrinivasku@gmail.com

A New Allgoriitthm for Miiniimum Costt Liinkiing M. Sreenivas Alluri Institute of Management Sciences Hanamkonda 506001, AP, INDIA allurimaster@gmail.com Dr. T. Srinivas Department of Mathematics Kakatiya

### The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

### Can linear programs solve NP-hard problems?

Can linear programs solve NP-hard problems? p. 1/9 Can linear programs solve NP-hard problems? Ronald de Wolf Linear programs Can linear programs solve NP-hard problems? p. 2/9 Can linear programs solve

### Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

### SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

### Error Bound for Classes of Polynomial Systems and its Applications: A Variational Analysis Approach

Outline Error Bound for Classes of Polynomial Systems and its Applications: A Variational Analysis Approach The University of New South Wales SPOM 2013 Joint work with V. Jeyakumar, B.S. Mordukhovich and

Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650

### Math 231b Lecture 35. G. Quick

Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the J-homomorphism could be defined by

### An Expressive Auction Design for Online Display Advertising. AUTHORS: Sébastien Lahaie, David C. Parkes, David M. Pennock

An Expressive Auction Design for Online Display Advertising AUTHORS: Sébastien Lahaie, David C. Parkes, David M. Pennock Li PU & Tong ZHANG Motivation Online advertisement allow advertisers to specify

### The Line Connectivity Problem

Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany RALF BORNDÖRFER MARIKA NEUMANN MARC E. PFETSCH The Line Connectivity Problem Supported by the DFG Research

### ABSTRACT. For example, circle orders are the containment orders of circles (actually disks) in the plane (see [8,9]).

Degrees of Freedom Versus Dimension for Containment Orders Noga Alon 1 Department of Mathematics Tel Aviv University Ramat Aviv 69978, Israel Edward R. Scheinerman 2 Department of Mathematical Sciences

### Group Theory. Contents

Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

### A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

### Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information

Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information Lawrence Ong School of Electrical Engineering and Computer Science, The University of Newcastle, Australia Email: lawrence.ong@cantab.net

### THE PROBLEM WORMS (1) WORMS (2) THE PROBLEM OF WORM PROPAGATION/PREVENTION THE MINIMUM VERTEX COVER PROBLEM

1 THE PROBLEM OF WORM PROPAGATION/PREVENTION I.E. THE MINIMUM VERTEX COVER PROBLEM Prof. Tiziana Calamoneri Network Algorithms A.y. 2014/15 2 THE PROBLEM WORMS (1)! A computer worm is a standalone malware

### Topic: Greedy Approximations: Set Cover and Min Makespan Date: 1/30/06

CS880: Approximations Algorithms Scribe: Matt Elder Lecturer: Shuchi Chawla Topic: Greedy Approximations: Set Cover and Min Makespan Date: 1/30/06 3.1 Set Cover The Set Cover problem is: Given a set of

### 3. INNER PRODUCT SPACES

. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.

### On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

### 1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### Ph.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor

Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai

### CSC2420 Fall 2012: Algorithm Design, Analysis and Theory

CSC2420 Fall 2012: Algorithm Design, Analysis and Theory Allan Borodin November 15, 2012; Lecture 10 1 / 27 Randomized online bipartite matching and the adwords problem. We briefly return to online algorithms

### Frequency Capping in Online Advertising

Frequency Capping in Online Advertising Niv Buchbinder Moran Feldman Arpita Ghosh Joseph (Seffi) Naor July 2, 2014 Abstract We study the following online problem. There are n advertisers. Each advertiser

### 954 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH 2005

954 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH 2005 Using Linear Programming to Decode Binary Linear Codes Jon Feldman, Martin J. Wainwright, Member, IEEE, and David R. Karger, Associate

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE

SHOT YLE OVES OF PHS WITH MINIMUM DEEE THEE TOMÁŠ KISE, DNIEL KÁL, END LIDIKÝ, PVEL NEJEDLÝ OET ŠÁML, ND bstract. The Shortest ycle over onjecture of lon and Tarsi asserts that the edges of every bridgeless