Partial Colorings of Uni modular Hypergraphs

1. Benjamin Doerr (MPI Saarbrücken) Partial Colorings of Unimodular Hypergraphs

2. 8 PostDoc Positions • Where: • MPI für Informatik (Saarbrücken, Germany) • Group: Kurt Mehlhorn • 40-50 researchers in Discrete Maths and Algorithms • Position: • 1 or 2 years • Reasonably paid, almost unlimited support • No teaching duties, but teaching possible • Deadline: January 31, 2007 Benjamin Doerr Partial Colorings of Unimodular Hypergraphs

3. Partial colorings of unimodular hypergraphs Overview • Introduction • Hypergraphs • Discrepancy • Unimodular hypergraphs • Partial coloring • Partially coloring unimodular hypergraphs • Motivation • Result • Application Benjamin Doerr Partial Colorings of Unimodular Hypergraphs

4. V j j j j ( ) V H E E V V E 2 4 5 µ = = = ; Introduction Hypergraphs • Hypergraph: • : finite set of vertices • : set of hyperedges vertices hyperedges Benjamin Doerr Partial Colorings of Unimodular Hypergraphs

5. V ( ( ) f j g ) H V H E V V E E V E E 2 µ \ 2 ) = = V 0 0 ; ; 0 Introduction Hypergraphs • Hypergraph: • : finite set of vertices • : set of hyperedges • Induced subhypergraph: Benjamin Doerr Partial Colorings of Unimodular Hypergraphs

6. ( ( ( ( ( ) ) ) P f ) ) j ( ( ( g ) j ) ) ( j ( ) ) j d d d d d d E V H H H H H E H E i i i i i i i 1 1 1 1 1 2 ¡ + +   s s s s : c c c c :   : : m s c m  n  a x v  s c   ! = = = = = = = = E E 2 E  ; ; 2 ; ; ; v ( ) E 1 1 1 + ¡ ¡  = 1 ¡ = +1 +1 +1 -1 -1 Introduction Discrepancy of Hypergraphs • Color vertices s.t. all hyperedges are balanced: • “2-coloring” • “imbalance of hyperedge E” Well studied problem, applications in maths and CS, famous papers by Roth, Beck, Lovász, Spencer, Matoušek, ... Benjamin Doerr Partial Colorings of Unimodular Hypergraphs

7. j j j j j ( ( ( ( [ ) ) ) ] j f [ ] j g ) d H H E E H E E i i j i j 1 0 1 1 · · · · s c   n n ) ) = = = ; : : : … Introduction Unimodular Hypergraphs • Def: unimodular iff each induced subhypergraph has discrepancy at most one. • Remark: means • even “perfectly balanced” • odd “almost perfect”, “1” cannot be avoided The queen of low-discrepancy hypergraphs! Benjamin Doerr Partial Colorings of Unimodular Hypergraphs

8. [ ] f [ f f g ] [ [ ] ] j g [ ] g f [ ] f g j [ ] g E V i i j j 1 £ £ £ [ 2 2 n : m n n n m m n = = = ; : : : ; Introduction Unimodular Hypergraphs: Examples • Intervals in . • Rows/Columns in a grid: • Bipartite graphs. Benjamin Doerr Partial Colorings of Unimodular Hypergraphs

9. ( ( ) ( ( ) ) P f f ) g ( ) g d d E V V H H i i 0 0 1 1 0 0 1 ¡ + v     s s : : v c c   v = = ! ! = = E ; 2 ; ; v -1 +1 ? -1 +1 0 Introduction Partial Coloring • Observe: is “caused” by the “odd” vertex in odd-cardinality hyperedges. • Plan: Don’t color all vertices! • “partial coloring” • vertices with are “uncolored” • , ... as before • Aim: , but doesn’t count! Benjamin Doerr Partial Colorings of Unimodular Hypergraphs

10. ( ( ( [ [ [ ] ] ] f f f [ f [ ] g j j ] j [ [ ] g ] g ) ) g ) H H H i i i j i i j i j i 2 4 ¡ ¡ _ 2 2 n n n n n = = = = = ; ; ; : : Partial Colorings of Unimodular Hypergraphs Partial Coloring NOT always possible • “singletons” • “initial intervals” • “intervals of length 3 and 5” No hope for partial coloring?  Benjamin Doerr Partial Colorings of Unimodular Hypergraphs

11. ( [ ] f f g j [ ] g ) H i i i i 1 2 2 + + ¡ 2 n n = ; ; ; +1 0 -1 +1 0 -1 +1 0 -1 Partial Colorings Sometimes it works: • “length 3 intervals” • Rows and columns in the grid. • Uniform unimodular hypergraphs: All hyperedges contain the same number of vertices (needs proof). Question: When are there non-trivial partial colorings? Benjamin Doerr Partial Colorings of Unimodular Hypergraphs

12. ( ( ) ) P f = ( ) ( ) = g 6 k k k H E V 0 0 1 1 ¡ w w w : u w v = = ! E ; 2 ; : : : v Partial Colorings Result • The following two properties are equivalent: • (i) has a perfectly balanced non-trivial partial coloring; • (ii) there are an integer k and non-trivial vertex weights • such that all hyperedges • have integral weight . 3/5 • Remark: The partial coloring in (i) colors at least half of the vertices with in (ii). • Application: “Rounding rationals is as easy as rounding half-integers” [STACS 2007?] 1/5 1/5 2/5 3/5 Benjamin Doerr Partial Colorings of Unimodular Hypergraphs

13. Application • IF: For all x Є{0,1/2}^n there is a y Є {0,1}^n such that • Ax ≈ Ay [low rounding errors] • Bx = By [sometimes no rounding error] • some other nice features • THEN: For all rational x there is a y Є {0,1}^n such that • Ax ≈ Ay • Bx = By • some other nice features Heart of the proof: Partial coloring of unimodular hypergraphs Benjamin Doerr Partial Colorings of Unimodular Hypergraphs

14. ( ( ) ) P f = ( ) ( ) = g 6 k k k H E V 0 0 1 1 ¡ w w w : u w v = = ! E ; 2 ; : : : v Partial Colorings of unimodular hypergraphs Summary • The following two properties are equivalent: • (i) has a perfectly balanced non-trivial partial coloring; • (ii) there are an integer k and non-trivial vertex weights • such that all hyperedges • have integral weight . 3/5 • Remark: The partial coloring in (i) colors at least half of the vertices with in (ii). • Application: “Rounding rationals is as easy as rounding half-integers” [STACS 2007?] 1/5 1/5 2/5 3/5 Thanks! Benjamin Doerr Partial Colorings of Unimodular Hypergraphs