Chordal networks of polynomial ideals
|
|
- Magnus Armstrong
- 5 years ago
- Views:
Transcription
1 Chordal networks of polynomial ideals Diego Cifuentes Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology Joint work with Pablo A. Parrilo (MIT) arxiv: , , Algebra Seminar - Georgia Tech Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 1 / 24
2 Polynomial systems Systems of polynomial equations have been used to model problems in areas such as: robotics, cryptography, statistics, optimization, computer vision, power networks, graph theory. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 2 / 24
3 Polynomial systems Systems of polynomial equations have been used to model problems in areas such as: robotics, cryptography, statistics, optimization, computer vision, power networks, graph theory. Given polynomial equations F = {f 1,..., f m }, let V(F ) := {x R n : f 1 (x) = = f m (x) = } denote the associated variety. Depending on the application we might be interesting in: Feasibility Is there any solution, i.e., V(F )? Counting How many solutions? Dimension What is the dimension of V(F )? Components Decompose V(F ) into irreducible components. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 2 / 24
4 Polynomial systems and graphs Systems coming from applications often have simple sparsity structure. We can represent this structure using graphs. Given m equations in n variables, construct a graph as: Nodes are the variables {x,..., x n 1 }. For each equation, add a clique connecting the variables appearing in that equation Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 3 / 24
5 Polynomial systems and graphs Systems coming from applications often have simple sparsity structure. We can represent this structure using graphs. Given m equations in n variables, construct a graph as: Nodes are the variables {x,..., x n 1 }. For each equation, add a clique connecting the variables appearing in that equation Example: F = {x 2 x 1 x 2 + 2x 1 + 1, x x 2, x 1 + x 2, x 2 x 3 } Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 3 / 24
6 Polynomial systems and graphs Systems coming from applications often have simple sparsity structure. We can represent this structure using graphs. Given m equations in n variables, construct a graph as: Nodes are the variables {x,..., x n 1 }. For each equation, add a clique connecting the variables appearing in that equation Example: F = {x 2 x 1 x 2 + 2x 1 + 1, x x 2, x 1 + x 2, x 2 x 3 } Question: Can the graph structure help solve polynomial systems? Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 3 / 24
7 Graphical modelling Pervasive idea in many areas, in particular: numerical linear algebra, graphical models, constraint satisfaction, database theory,... Key notions: chordality and treewidth. Many names: Arnborg, Beeri/Fagin/Maier/Yannakakis, Blair/Peyton, Bodlaender, Courcelle, Dechter, Lauritzen/Spiegelhalter, Pearl, Robertson/Seymour,... Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 4 / 24
8 Graphical modelling Pervasive idea in many areas, in particular: numerical linear algebra, graphical models, constraint satisfaction, database theory,... Key notions: chordality and treewidth. Many names: Arnborg, Beeri/Fagin/Maier/Yannakakis, Blair/Peyton, Bodlaender, Courcelle, Dechter, Lauritzen/Spiegelhalter, Pearl, Robertson/Seymour,... Remarkably (AFAIK) almost no work in computational algebraic geometry exploits this structure. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 4 / 24
9 Graphical modelling Pervasive idea in many areas, in particular: numerical linear algebra, graphical models, constraint satisfaction, database theory,... Key notions: chordality and treewidth. Many names: Arnborg, Beeri/Fagin/Maier/Yannakakis, Blair/Peyton, Bodlaender, Courcelle, Dechter, Lauritzen/Spiegelhalter, Pearl, Robertson/Seymour,... Remarkably (AFAIK) almost no work in computational algebraic geometry exploits this structure. We hope to change this... ;) Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 4 / 24
10 Example 1: Coloring a cycle Let C n = (V, E) be the cycle graph and consider the ideal I given by the equations xi 3 1 =, i V xi 2 + x i x j + xj 2 =, ij E These equations encode the proper 3-colorings of the graph. Note that coloring the cycle graph is very easy! Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 5 / 24
11 Example 1: Coloring a cycle Let C n = (V, E) be the cycle graph and consider the ideal I given by the equations xi 3 1 =, i V xi 2 + x i x j + xj 2 =, ij E These equations encode the proper 3-colorings of the graph. Note that coloring the cycle graph is very easy! However, a Gröbner basis is not so simple: one of its 13 elements is x x 2 x 4 x 6 + x x 2 x 4 x 7 + x x 2 x 4 x 8 + x x 2 x 5 x 6 + x x 2 x 5 x 7 + x x 2 x 5 x 8 + x x 2 x 6 x 8 + x x 2 x 7 x 8 + x x 2 x x x 3 x 4 x 6 + x x 3 x 4 x 7 +x x 3 x 4 x 8 + x x 3 x 5 x 6 + x x 3 x 5 x 7 + x x 3 x 5 x 8 + x x 3 x 6 x 8 + x x 3 x 7 x 8 + x x 3 x x x 4 x 6 x 8 + x x 4 x 7 x 8 + x x 4 x2 8 + x x 5 x 6 x 8 +x x 5 x 7 x 8 + x x 5 x x x 6 x2 8 + x x 7 x2 8 + x + x 1 x 2 x 4 x 6 + x 1 x 2 x 4 x 7 + x 1 x 2 x 4 x 8 + x 1 x 2 x 5 x 6 + x 1 x 2 x 5 x 7 + x 1 x 2 x 5 x 8 +x 1 x 2 x 6 x 8 + x 1 x 2 x 7 x 8 + x 1 x 2 x x 1 x 3 x 4 x 6 + x 1 x 3 x 4 x 7 + x 1 x 3 x 4 x 8 + x 1 x 3 x 5 x 6 + x 1 x 3 x 5 x 7 + x 1 x 3 x 5 x8 + x 1 x 3 x 6 x 8 + x 1 x 3 x 7 x 8 +x 1 x 3 x x 1 x 4 x 6 x 8 + x 1 x 4 x 7 x 8 + x 1 x 4 x2 8 + x 1 x 5 x 6 x 8 + x 1 x 5 x 7 x 8 + x 1 x 5 x2 8 + x 1 x 6 x2 8 + x 1 x 7 x2 8 + x 1 + x 2 x 4 x 6 x 8 + x 2 x 4 x 7 x 8 +x 2 x 4 x x 2 x 5 x 6 x 8 + x 2 x 5 x 7 x 8 + x 2 x 5 x2 8 + x 2 x 6 x2 8 + x 2 x 7 x2 8 + x 2 + x 3 x 4 x 6 x 8 + x 3 x 4 x 7 x 8 + x 3 x 4 x2 8 + x 3 x 5 x 6 x 8 + x 3 x 5 x 7 x 8 +x 3 x 5 x x 3 x 6 x2 8 + x 3 x 7 x2 8 + x 3 + x 4 x 6 x2 8 + x 4 x 7 x2 8 + x 4 + x 5 x 6 x2 8 + x 5 x 7 x2 8 + x 5 + x 6 + x 7 + x 8 Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 5 / 24
12 Example 1: Coloring a cycle There is an alternative representation of the ideal, that respects its graphical structure. The variety can be decomposed into triangular sets: V(I) = T V(T ) where the union is overall all maximal directed paths (or chains). The number of triangular sets is 21, which is the 8-th Fibonacci number x 2 + xx8 + x 2 8 x + x 1 + x 8 x 1 x 8 x x1 2 + x1x8 + x x 2 + x 8 x x2x8 + x 2 8 x 2 + x 3 + x 8 x 2 x 8 x 3 x 8 x x3 2 + x3x8 + x x 4 + x 8 x x4x8 + x 2 8 x 4 + x 5 + x 8 x 4 x 8 x 5 x 8 x x5 2 + x5x8 + x x 6 + x 8 x 6 + x 7 + x 8 x 6 x 8 x x7x8 + x 2 8 x Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 6 / 24
13 Example 2: Ideal of adjacent minors 1 x x 3 x 1 x 2 I = {x 2i x 2i+3 x 2i+1 x 2i+2 : i < n} 23 x 2, x 3 x 2 x 5 x 3 x 4 This is the ideal of adjacent minors of the matrix ( x x 2 x 4 ) x 2n 2 x 1 x 3 x 5 x 2n x 4 x 7 x 5 x 6 x 4, x 5 x 6, x 7 x 6 x 9 x 7 x 8 x 8 x 11 x 9 x 1 x 8, x 9 The total number of irreducible components is the n-th Fibonacci number. 1,11 12,13 x 1, x 11 x 1 x 13 x 11 x 12 x 12 x 15 x 13 x 14 x 12, x 13 Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 7 / 24
14 Example 2: Ideal of adjacent minors 1 x x 3 x 1 x 2 I = {x 2i x 2i+3 x 2i+1 x 2i+2 : i < n} 23 x 2, x 3 x 2 x 5 x 3 x 4 This is the ideal of adjacent minors of the matrix ( x x 2 x 4 ) x 2n 2 x 1 x 3 x 5 x 2n x 4 x 7 x 5 x 6 x 4, x 5 x 6, x 7 x 6 x 9 x 7 x 8 x 8 x 11 x 9 x 1 x 8, x 9 The total number of irreducible components is the n-th Fibonacci number. 1,11 12,13 x 1, x 11 x 1 x 13 x 11 x 12 x 12 x 15 x 13 x 14 x 12, x 13 More generally, the ideal of adjacent minors of a k n matrix also has a simple chordal network representation. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 7 / 24
15 Our results We introduce the notion of chordal networks, a new representation of structured polynomial ideals. An algorithm to compute chordal network representations. We show that several families of polynomial systems admit a chordal network representation of size O(n), even though the number of components is exponentially large. We show how to effectively use chordal networks to solve: feasibility, counting, dimension, elimination, radical membership and sometimes components. Implementation and experimental results. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 8 / 24
16 Chordal graphs For a graph G, an ordering of its vertices x > x 1 > > x n 1 is a perfect elimination ordering if for each x l X l := {x m : x m is adjacent to x l, x l > x m } is a clique. A graph is chordal if it has a perfect elimination ordering. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 9 / 24
17 Chordal graphs For a graph G, an ordering of its vertices x > x 1 > > x n 1 is a perfect elimination ordering if for each x l X l := {x m : x m is adjacent to x l, x l > x m } is a clique. A graph is chordal if it has a perfect elimination ordering. A chordal completion of G is supergraph that is chordal. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 9 / 24
18 Elimination tree of a chordal graph The elimination tree of a graph G is the following directed spanning tree: For each l there is an arc towards its smallest neighbor p, with p > l. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 1 / 24
19 Chordal networks A G-chordal network is a directed graph N, whose nodes are polynomial sets, satisfying the following conditions arcs follow elimination tree: if (F l, F p ) is an arc, then (l, p) is an arc of the elimination tree, where l = rank(f l ), p = rank(f p ). nodes supported on cliques: each node F of N is given a rank l := rank(f ), such that F only involves variables in the clique X l. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
20 Chordal networks (Example) 1 2 x 3 + x 2 x7 + xx x 3 7 g(x, x6, x7) x x 2 1 x9 + x1x x 3 9 g(x1, x4, x9) x x 2 2 x5 + x2x x 3 5 g(x2, x3, x5) 3 x3 x5 x3 + x5 + x7 + x8 g(x3, x7, x8) 4 x4 x9 x4 + x5 + x8 + x9 g(x4, x8, x9) 5 g(x5, x8, x9) x5 + x7 + x8 + x9 x5 x7 x5 x9 x5 x9 6 x6 x7 g(x6, x8, x9) x6 + x7 + x8 + x9 7 x7 x9 g(x7, x8, x9) 8 x x 2 8 x9 + x8x x 3 9 g(a, b, c) := a 2 + b 2 + c 2 + ab + bc + ca 9 x Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
21 Computing chordal networks: Triangular sets Defn: A zero dimensional triangular set is T = {t,..., t n 1 } such that t = x d + g (x, x 1,..., x n 1 ), (deg x (g ) < d ). t n 2 = x d n 2 n 2 + g n 2(x n 2, x n 1 ), (deg xn 2 (g 1 ) < d n 2 ) t n 1 = g n 1 (x n 1 ) Remk: A triangular set is a Gröbner basis w.r.t. lexicographic order. Defn: Let I K[X] be a zero dimensional ideal. A triangular decomposition of I is a collection T of triangular sets, such that V(I) = T T V(T ) Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
22 Computing chordal networks (Example) The ideal I = x x 2 x 2, x 3 x, x 1 x 2, x2 2 x 2, x 2 x 3 can be decomposed into three triangular sets T 1 = (x 3 x, x 1 x 2, x 2, x 3 ), T 2 = (x 1, x 1 x 2, x 2 1, x 3 ), T 3 = (x 1, x 1 x 2, x 2 1, x 3 1). Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
23 Computing chordal networks (Example) The ideal I = x x 2 x 2, x 3 x, x 1 x 2, x2 2 x 2, x 2 x 3 can be decomposed into three triangular sets T 1 = (x 3 x, x 1 x 2, x 2, x 3 ), T 2 = (x 1, x 1 x 2, x 2 1, x 3 ), T 3 = (x 1, x 1 x 2, x 2 1, x 3 1). These triangular sets correspond to chains of a chordal network x 3 x x 1 1 x 1 x 2 2 x 2 x x 3 x 3 1 Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
24 Computing chordal networks (Example) x 3 x, xx2 x2, x 2 2 x2 x 1 x 2, x 2 2 x2 x 2 2 x2, x2x 2 3 x3 Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
25 Computing chordal networks (Example) x 3 x, xx2 x2, x 2 2 x2 x 1 x 2, x 2 2 x2 tria x 3 x, x2 x 1, x 2 1 x 1 x 2, x 2 2 x2 x 2 2 x2, x2x 2 3 x3 x 2 2 x2, x2x 2 3 x3 Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
26 Computing chordal networks (Example) x 3 x, xx2 x2, x 2 2 x2 x 1 x 2, x 2 2 x2 tria x 3 x, x2 x 1, x 2 1 x 1 x 2, x 2 2 x2 elim x 3 x x 1 x 1 x 2, x 2 2 x2 x 2 2 x2, x2x 2 3 x3 x 2 2 x2, x2x 2 3 x3 x2 2 x2, x2x 3 2 x3, x2 x 2 2 x2, x2x 3 2 x3, x2 1 Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
27 Computing chordal networks (Example) x 3 x, xx2 x2, x 2 2 x2 x 1 x 2, x 2 2 x2 tria x 3 x, x2 x 1, x 2 1 x 1 x 2, x 2 2 x2 elim x 3 x x 1 x 1 x 2, x 2 2 x2 x 2 2 x2, x2x 2 3 x3 x 2 2 x2, x2x 2 3 x3 x2 2 x2, x2x 3 2 x3, x2 x 2 2 x2, x2x 3 2 x3, x2 1 elim x 3 x x 1 x 1 x 2 x2 2 x2, x2x 3 2 x3, x2 x 2 2 x2, x2x 3 2 x3, x2 1 Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
28 Computing chordal networks (Example) x 3 x, xx2 x2, x 2 2 x2 x 1 x 2, x 2 2 x2 tria x 3 x, x2 x 1, x 2 1 x 1 x 2, x 2 2 x2 elim x 3 x x 1 x 1 x 2, x 2 2 x2 x 2 2 x2, x2x 2 3 x3 x 2 2 x2, x2x 2 3 x3 x2 2 x2, x2x 3 2 x3, x2 x 2 2 x2, x2x 3 2 x3, x2 1 x 3 x x 1 x 3 x x 1 elim x 1 x 2 x2 2 x2, x2x 3 2 x3, x2 x 2 2 x2, x2x 3 2 x3, x2 1 tria x 1 x 2 x 2, x 3 x 2 1, x 3 x 2 1, x 3 1 Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
29 Computing chordal networks (Example) x 3 x, xx2 x2, x 2 2 x2 x 1 x 2, x 2 2 x2 tria x 3 x, x2 x 1, x 2 1 x 1 x 2, x 2 2 x2 elim x 3 x x 1 x 1 x 2, x 2 2 x2 x 2 2 x2, x2x 2 3 x3 x 2 2 x2, x2x 2 3 x3 x2 2 x2, x2x 3 2 x3, x2 x 2 2 x2, x2x 3 2 x3, x2 1 x 3 x x 1 x 3 x x 1 elim x 1 x 2 x2 2 x2, x2x 3 2 x3, x2 x 2 2 x2, x2x 3 2 x3, x2 1 tria x 1 x 2 x 2, x 3 x 2 1, x 3 x 2 1, x 3 1 x 3 x x 1 elim x 1 x 2 x 2 x 2 1 x 2 1 x 3 x 3 x 3 1 Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
30 Computing chordal networks (Example) x 3 x, xx2 x2, x 2 2 x2 x 1 x 2, x 2 2 x2 tria x 3 x, x2 x 1, x 2 1 x 1 x 2, x 2 2 x2 elim x 3 x x 1 x 1 x 2, x 2 2 x2 x 2 2 x2, x2x 2 3 x3 x 2 2 x2, x2x 2 3 x3 x2 2 x2, x2x 3 2 x3, x2 x 2 2 x2, x2x 3 2 x3, x2 1 x 3 x x 1 x 3 x x 1 elim x 1 x 2 x2 2 x2, x2x 3 2 x3, x2 x 2 2 x2, x2x 3 2 x3, x2 1 tria x 1 x 2 x 2, x 3 x 2 1, x 3 x 2 1, x 3 1 x 3 x x 1 x 3 x x 1 elim x 1 x 2 x 2 x 2 1 x 2 1 merge 1 2 x 1 x 2 x 2 x 2 1 x 3 x 3 x x 3 x 3 1 Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
31 Main results Thm 1: Chordal triangularization obtains a G-chordal network, whose chains give a triangular decomposition of F. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
32 Main results Thm 1: Chordal triangularization obtains a G-chordal network, whose chains give a triangular decomposition of F. For nice cases the chordal network obtained has linear size. Thm 2: Let F be a family of structured polynomial systems such that V(F K[X l ]) is bounded for any F F and for any maximal clique X l. Then any F F admits a chordal network representation of size O(n). Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
33 Chordal networks in computational algebra Given a triangular chordal network N of an ideal I, we can compute in linear time: the cardinality of V(I). the dimension of V(I) the top dimensional part of V(I). We also show efficient algorithms for: radical ideal membership. computing equidimensional (sometimes irreducible) components. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
34 Chordal networks in computational algebra Given a triangular chordal network N of an ideal I, we can compute in linear time: the cardinality of V(I). the dimension of V(I) the top dimensional part of V(I). We also show efficient algorithms for: radical ideal membership. computing equidimensional (sometimes irreducible) components. The main difficulty is that there might be exponentially many chains. It can be overcomed by cleverly using dynamic programming (or message-passing). Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
35 Radical ideal membership Problem: Determine if a polynomial h vanishes on a variety. Given a chordal network, we need to determine whether h mod C for all chains C Note that there might be exponentially many chains. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
36 Radical ideal membership (Sketch) h(x) h(x) x 3 + x 2 x7 + xx x 3 7 x 2 + xx6 + xx7 + x x6x7 + x h a 1 h b 1 h b x 6 x 7 x x6x8 + x6x9 + x x8x9 + x 2 9 x 6 + x 7 + x 8 + x 9 1 h b ha 6 x 7 x 9 x x7x8 + x7x9 + x x8x9 + x ha 7 x x 2 8 x9 + x8x x hb hc 6 1 h 8 9 x h 9 = Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
37 Implementation and examples Implemented in Sage. Graph colorings (counting q-colorings) Cryptography ( baby AES, Cid et al.) Sensor Network localization Discretization of differential equations Algebraic statistics Reachability in vector addition systems Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT 17 2 / 24
38 Application: Vector addition systems Given a set of vectors B Z n, construct a graph with vertex set N n in which u, v N n are adjacent if u v ±B. The reachability problem is to describe the connected components of the graph Problem: There are n card decks on a circle. Given any four consecutive decks we can: take one card from the inner decks and place them in the outer decks. take one card from the outer decks and place them on the inner decks. Initially the number of cards in the decks are 1, 2,..., n. Is it possible to reverse the number of cards in the decks? Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
39 Application: Vector addition systems The problem is equivalent to determining whether f n I n, where f n := x x 2 1 x 3 2 x n n 1 x n x n 1 1 x n 1, I n := {x i x i+3 x i+1 x i+2 : i < n}, and where the indices are taken modulo n. We compare our radical membership test with Singular (Gröbner bases) and Epsilon (triangular decompositions). n ChordalNet Singular Epsilon Test result true false false false true false true false false false true Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
40 Application: Algebraic statistics (Evans et al.) Consider the binomial ideal I n,n 2 that models a 2D dimensional generalization of the birth-death Markov process. We fix n 2 = 1. We can compute faster all irreducible components of the ideal than the Macaulay2 package Binomials. n #components ChordTriaD :: ::1 ::4 ::13 :2:1 :37:35 12:22:19 time Binomials :: :: ::1 ::12 :3: 4:15:36 - Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
41 Application: Algebraic statistics (Evans et al.) Consider the binomial ideal I n,n 2 that models a 2D dimensional generalization of the birth-death Markov process. We fix n 2 = 1. We can compute faster all irreducible components of the ideal than the Macaulay2 package Binomials. n #components ChordTriaD :: ::1 ::4 ::13 :2:1 :37:35 12:22:19 time Binomials :: :: ::1 ::12 :3: 4:15:36 - Our methods are particularly efficient to compute the highest dimensional components. Highest 5 dimensions Highest 7 dimensions n #comps time :1:7 :4:54 :15:12 :41:52 1:34:5 :5:2 :41:41 3:3:29 9:53:9 Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
42 Summary Chordal structure can notably help in computational algebraic geometry. Under assumptions (chordality + algebraic structure), tractable! Yields practical, implementable algorithms. A Macaulay2 package Chordal is in preparation. Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
43 Summary Chordal structure can notably help in computational algebraic geometry. Under assumptions (chordality + algebraic structure), tractable! Yields practical, implementable algorithms. A Macaulay2 package Chordal is in preparation. If you want to know more: D. Cifuentes, P.A. Parrilo (217), Chordal networks of polynomial ideals. SIAM J. of Applied Algebra and Geometry, 1(1): arxiv: D. Cifuentes, P.A. Parrilo (216), Exploiting chordal structure in polynomial ideals: a Gröbner basis approach. SIAM J. Discrete Math., 3(3): arxiv: D. Cifuentes, P.A. Parrilo (216), An efficient tree decomposition method for permanents and mixed discriminants. Linear Alg. and its Appl., 493: arxiv: Thanks for your attention! Cifuentes (MIT) Chordal networks of polynomial ideals Algebra seminar GT / 24
Graph structure in polynomial systems: chordal networks
Graph structure in polynomial systems: chordal networks Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology
More informationGraph structure in polynomial systems: chordal networks
Graph structure in polynomial systems: chordal networks Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology
More informationChordal structure and polynomial systems
Chordal structure and polynomial systems Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology Joint work with
More informationSta$s$cal models and graphs
Sta$s$cal models and graphs AFOSR FA9550-11-1-0305 Fundamental methodology and applica$ons Convex op$miza$on and graphs as underlying engines Examples: Sparse graph es$ma$on, latent-variable modeling,
More informationChordal structure in computer algebra: Permanents
Chordal structure in computer algebra: Permanents Diego Cifuentes Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology Joint
More informationExploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach
Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation
More informationOn the chordality of polynomial sets in triangular decomposition in top-down style
On the chordality of polynomial sets in triangular decomposition in top-down style Chenqi Mou joint work with Yang Bai LMIB School of Mathematics and Systems Science Beihang University, China ISSAC 2018,
More informationCommuting birth-and-death processes
Commuting birth-and-death processes Caroline Uhler Department of Statistics UC Berkeley (joint work with Steven N. Evans and Bernd Sturmfels) MSRI Workshop on Algebraic Statistics December 18, 2008 Birth-and-death
More informationBounded Treewidth Graphs A Survey German Russian Winter School St. Petersburg, Russia
Bounded Treewidth Graphs A Survey German Russian Winter School St. Petersburg, Russia Andreas Krause krausea@cs.tum.edu Technical University of Munich February 12, 2003 This survey gives an introduction
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science Algorithms For Inference Fall 2014
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 Problem Set 3 Issued: Thursday, September 25, 2014 Due: Thursday,
More informationComputing Minimal Polynomial of Matrices over Algebraic Extension Fields
Bull. Math. Soc. Sci. Math. Roumanie Tome 56(104) No. 2, 2013, 217 228 Computing Minimal Polynomial of Matrices over Algebraic Extension Fields by Amir Hashemi and Benyamin M.-Alizadeh Abstract In this
More informationACO Comprehensive Exam March 20 and 21, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms Part a: You are given a graph G = (V,E) with edge weights w(e) > 0 for e E. You are also given a minimum cost spanning tree (MST) T. For one particular edge
More informationCOMPSCI 276 Fall 2007
Exact Inference lgorithms for Probabilistic Reasoning; OMPSI 276 Fall 2007 1 elief Updating Smoking lung ancer ronchitis X-ray Dyspnoea P lung cancer=yes smoking=no, dyspnoea=yes =? 2 Probabilistic Inference
More informationLikelihood Analysis of Gaussian Graphical Models
Faculty of Science Likelihood Analysis of Gaussian Graphical Models Ste en Lauritzen Department of Mathematical Sciences Minikurs TUM 2016 Lecture 2 Slide 1/43 Overview of lectures Lecture 1 Markov Properties
More informationDecomposable Graphical Gaussian Models
CIMPA Summerschool, Hammamet 2011, Tunisia September 12, 2011 Basic algorithm This simple algorithm has complexity O( V + E ): 1. Choose v 0 V arbitrary and let v 0 = 1; 2. When vertices {1, 2,..., j}
More informationReasoning with Deterministic and Probabilistic graphical models Class 2: Inference in Constraint Networks Rina Dechter
Reasoning with Deterministic and Probabilistic graphical models Class 2: Inference in Constraint Networks Rina Dechter Road Map n Graphical models n Constraint networks Model n Inference n Search n Probabilistic
More informationConvex sets, conic matrix factorizations and conic rank lower bounds
Convex sets, conic matrix factorizations and conic rank lower bounds Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Monday 14 April. Binomial Ideals
Binomial Ideals Binomial ideals offer an interesting class of examples. Because they occur so frequently in various applications, the development methods for binomial ideals is justified. 1 Binomial Ideals
More informationProf. Dr. Lars Schmidt-Thieme, L. B. Marinho, K. Buza Information Systems and Machine Learning Lab (ISMLL), University of Hildesheim, Germany, Course
Course on Bayesian Networks, winter term 2007 0/31 Bayesian Networks Bayesian Networks I. Bayesian Networks / 1. Probabilistic Independence and Separation in Graphs Prof. Dr. Lars Schmidt-Thieme, L. B.
More informationVariable Elimination (VE) Barak Sternberg
Variable Elimination (VE) Barak Sternberg Basic Ideas in VE Example 1: Let G be a Chain Bayesian Graph: X 1 X 2 X n 1 X n How would one compute P X n = k? Using the CPDs: P X 2 = x = x Val X1 P X 1 = x
More informationTree-width. September 14, 2015
Tree-width Zdeněk Dvořák September 14, 2015 A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists
More informationGraphical Model Inference with Perfect Graphs
Graphical Model Inference with Perfect Graphs Tony Jebara Columbia University July 25, 2013 joint work with Adrian Weller Graphical models and Markov random fields We depict a graphical model G as a bipartite
More informationOn sums of eigenvalues, and what they reveal about graphs and manifolds
On sums of eigenvalues, and what they reveal about graphs and manifolds Evans Harrell Georgia Tech Université F. Rabelais www.math.gatech.edu/~harrell Tours le 30 janvier, 2014 Copyright 2014 by Evans
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 informationThe Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks Johan H.P. Kwisthout and Hans L. Bodlaender and L.C. van der Gaag 1 Abstract. Algorithms for probabilistic inference in Bayesian
More informationMessage Passing and Junction Tree Algorithms. Kayhan Batmanghelich
Message Passing and Junction Tree Algorithms Kayhan Batmanghelich 1 Review 2 Review 3 Great Ideas in ML: Message Passing Each soldier receives reports from all branches of tree 3 here 7 here 1 of me 11
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 informationRevisiting the Limits of MAP Inference by MWSS on Perfect Graphs
Revisiting the Limits of MAP Inference by MWSS on Perfect Graphs Adrian Weller University of Cambridge CP 2015 Cork, Ireland Slides and full paper at http://mlg.eng.cam.ac.uk/adrian/ 1 / 21 Motivation:
More informationCS281A/Stat241A Lecture 19
CS281A/Stat241A Lecture 19 p. 1/4 CS281A/Stat241A Lecture 19 Junction Tree Algorithm Peter Bartlett CS281A/Stat241A Lecture 19 p. 2/4 Announcements My office hours: Tuesday Nov 3 (today), 1-2pm, in 723
More information4-1 The Algebraic-Geometric Dictionary P. Parrilo and S. Lall, ECC
4-1 The Algebraic-Geometric Dictionary P. Parrilo and S. Lall, ECC 2003 2003.09.02.02 4. The Algebraic-Geometric Dictionary Equality constraints Ideals and Varieties Feasibility problems and duality The
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
More informationT -choosability in graphs
T -choosability in graphs Noga Alon 1 Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel. and Ayal Zaks 2 Department of Statistics and
More informationToric Ideals, an Introduction
The 20th National School on Algebra: DISCRETE INVARIANTS IN COMMUTATIVE ALGEBRA AND IN ALGEBRAIC GEOMETRY Mangalia, Romania, September 2-8, 2012 Hara Charalambous Department of Mathematics Aristotle University
More informationAlgebra II Vocabulary Word Wall Cards
Algebra II Vocabulary Word Wall Cards Mathematics vocabulary word wall cards provide a display of mathematics content words and associated visual cues to assist in vocabulary development. The cards should
More informationAlgebra II Vocabulary Cards
Algebra II Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Complex Numbers Complex Number (examples)
More informationExact Inference Algorithms Bucket-elimination
Exact Inference Algorithms Bucket-elimination COMPSCI 276, Spring 2011 Class 5: Rina Dechter (Reading: class notes chapter 4, Darwiche chapter 6) 1 Belief Updating Smoking lung Cancer Bronchitis X-ray
More informationarxiv: v1 [cs.dm] 29 Oct 2012
arxiv:1210.7684v1 [cs.dm] 29 Oct 2012 Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem. Babak Farzad 1 and Majid Karimi 2 Department of Mathematics Brock University, St. Catharines,
More informationImplementing Machine Reasoning using Bayesian Network in Big Data Analytics
Implementing Machine Reasoning using Bayesian Network in Big Data Analytics Steve Cheng, Ph.D. Guest Speaker for EECS 6893 Big Data Analytics Columbia University October 26, 2017 Outline Introduction Probability
More informationOn the extremal Betti numbers of binomial edge ideals of block graphs
On the extremal Betti numbers of binomial edge ideals of block graphs Jürgen Herzog Fachbereich Mathematik Universität Duisburg-Essen Essen, Germany juergen.herzog@uni-essen.de Giancarlo Rinaldo Department
More informationGeneralized Micro-Structures for Non-Binary CSP
Generalized Micro-Structures for Non-Binary CSP Achref El Mouelhi LSIS - UMR CNRS 7296 Aix-Marseille Université Avenue Escadrille Normandie-Niemen 13397 Marseille Cedex 20 (France) achref.elmouelhi@lsis.org
More informationDynamic Programming on Trees. Example: Independent Set on T = (V, E) rooted at r V.
Dynamic Programming on Trees Example: Independent Set on T = (V, E) rooted at r V. For v V let T v denote the subtree rooted at v. Let f + (v) be the size of a maximum independent set for T v that contains
More informationLecture 4 October 18th
Directed and undirected graphical models Fall 2017 Lecture 4 October 18th Lecturer: Guillaume Obozinski Scribe: In this lecture, we will assume that all random variables are discrete, to keep notations
More informationPolynomial Functions
Polynomial Functions Polynomials A Polynomial in one variable, x, is an expression of the form a n x 0 a 1 x n 1... a n 2 x 2 a n 1 x a n The coefficients represent complex numbers (real or imaginary),
More informationAlgebra 2. Curriculum (524 topics additional topics)
Algebra 2 This course covers the topics shown below. Students navigate learning paths based on their level of readiness. Institutional users may customize the scope and sequence to meet curricular needs.
More informationParameterized Domination in Circle Graphs
Parameterized Domination in Circle Graphs Nicolas Bousquet 1, Daniel Gonçalves 1, George B. Mertzios 2, Christophe Paul 1, Ignasi Sau 1, and Stéphan Thomassé 3 1 AlGCo project-team, CNRS, LIRMM, Montpellier,
More informationLearning from Sensor Data: Set II. Behnaam Aazhang J.S. Abercombie Professor Electrical and Computer Engineering Rice University
Learning from Sensor Data: Set II Behnaam Aazhang J.S. Abercombie Professor Electrical and Computer Engineering Rice University 1 6. Data Representation The approach for learning from data Probabilistic
More informationarxiv: v1 [math.co] 31 Oct 2017
arxiv:1711.00374v1 [math.co] 31 Oct 2017 Graph classes for critical ideals, minimum rank and zero forcing number Carlos A. Alfaro September 19, 2018 Abstract Recently, there have been found new relations
More informationInference and Representation
Inference and Representation David Sontag New York University Lecture 5, Sept. 30, 2014 David Sontag (NYU) Inference and Representation Lecture 5, Sept. 30, 2014 1 / 16 Today s lecture 1 Running-time of
More informationAlgebraic Classification of Small Bayesian Networks
GROSTAT VI, Menton IUT STID p. 1 Algebraic Classification of Small Bayesian Networks Luis David Garcia, Michael Stillman, and Bernd Sturmfels lgarcia@math.vt.edu Virginia Tech GROSTAT VI, Menton IUT STID
More informationTest 2 Review Math 1111 College Algebra
Test 2 Review Math 1111 College Algebra 1. Begin by graphing the standard quadratic function f(x) = x 2. Then use transformations of this graph to graph the given function. g(x) = x 2 + 2 *a. b. c. d.
More informationCases Where Finding the Minimum Entropy Coloring of a Characteristic Graph is a Polynomial Time Problem
Cases Where Finding the Minimum Entropy Coloring of a Characteristic Graph is a Polynomial Time Problem Soheil Feizi, Muriel Médard RLE at MIT Emails: {sfeizi,medard}@mit.edu Abstract In this paper, we
More informationStrongly chordal and chordal bipartite graphs are sandwich monotone
Strongly chordal and chordal bipartite graphs are sandwich monotone Pinar Heggernes Federico Mancini Charis Papadopoulos R. Sritharan Abstract A graph class is sandwich monotone if, for every pair of its
More informationStructural Tractability of Counting of Solutions to Conjunctive Queries
Structural Tractability of Counting of Solutions to Conjunctive Queries Arnaud Durand 1 1 University Paris Diderot Journées DAG, june 2013 Joint work with Stefan Mengel (JCSS (to appear) + ICDT 2013) 1
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Brown University CSCI 295-P, Spring 213 Prof. Erik Sudderth Lecture 11: Inference & Learning Overview, Gaussian Graphical Models Some figures courtesy Michael Jordan s draft
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-284 Research Reports on Mathematical and Computing Sciences Exploiting Sparsity in Linear and Nonlinear Matrix Inequalities via Positive Semidefinite Matrix Completion Sunyoung Kim, Masakazu
More informationProbability Propagation
Graphical Models, Lecture 12, Michaelmas Term 2010 November 19, 2010 Characterizing chordal graphs The following are equivalent for any undirected graph G. (i) G is chordal; (ii) G is decomposable; (iii)
More informationJunction Tree, BP and Variational Methods
Junction Tree, BP and Variational Methods Adrian Weller MLSALT4 Lecture Feb 21, 2018 With thanks to David Sontag (MIT) and Tony Jebara (Columbia) for use of many slides and illustrations For more information,
More informationApproximating fractional hypertree width
Approximating fractional hypertree width Dániel Marx Abstract Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Lecture 4 Learning Bayesian Networks CS/CNS/EE 155 Andreas Krause Announcements Another TA: Hongchao Zhou Please fill out the questionnaire about recitations Homework 1 out.
More informationSummer Project. August 10, 2001
Summer Project Bhavana Nancherla David Drescher August 10, 2001 Over the summer we embarked on a brief introduction to various concepts in algebraic geometry. We used the text Ideals, Varieties, and Algorithms,
More informationHilbert Polynomials. dimension and counting monomials. a Gröbner basis for I reduces to in > (I)
Hilbert Polynomials 1 Monomial Ideals dimension and counting monomials 2 The Dimension of a Variety a Gröbner basis for I reduces to in > (I) 3 The Complexity of Gröbner Bases a bound on the degrees of
More informationAlgebra, Functions, and Data Analysis Vocabulary Cards
Algebra, Functions, and Data Analysis Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Complex Numbers
More informationmathematics Smoothness in Binomial Edge Ideals Article Hamid Damadi and Farhad Rahmati *
mathematics Article Smoothness in Binomial Edge Ideals Hamid Damadi and Farhad Rahmati * Faculty of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez
More informationADVANCED TOPICS IN ALGEBRAIC GEOMETRY
ADVANCED TOPICS IN ALGEBRAIC GEOMETRY DAVID WHITE Outline of talk: My goal is to introduce a few more advanced topics in algebraic geometry but not to go into too much detail. This will be a survey of
More informationExact Inference Algorithms Bucket-elimination
Exact Inference Algorithms Bucket-elimination COMPSCI 276, Spring 2013 Class 5: Rina Dechter (Reading: class notes chapter 4, Darwiche chapter 6) 1 Belief Updating Smoking lung Cancer Bronchitis X-ray
More informationMath 312/ AMS 351 (Fall 17) Sample Questions for Final
Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply
More informationUndirected Graphical Models
Undirected Graphical Models 1 Conditional Independence Graphs Let G = (V, E) be an undirected graph with vertex set V and edge set E, and let A, B, and C be subsets of vertices. We say that C separates
More informationInderjit Dhillon The University of Texas at Austin
Inderjit Dhillon The University of Texas at Austin ( Universidad Carlos III de Madrid; 15 th June, 2012) (Based on joint work with J. Brickell, S. Sra, J. Tropp) Introduction 2 / 29 Notion of distance
More informationT -equivariant tensor rank varieties and their K-theory classes
T -equivariant tensor rank varieties and their K-theory classes 2014 July 18 Advisor: Professor Anders Buch, Department of Mathematics, Rutgers University Overview 1 Equivariant K-theory Overview 2 Determinantal
More informationA multivariate interlace polynomial
A multivariate interlace polynomial Bruno Courcelle LaBRI, Université Bordeaux 1 and CNRS General objectives : Logical descriptions of graph polynomials Application to their computations Systematic construction
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationDensest/Heaviest k-subgraph on Interval Graphs, Chordal Graphs and Planar Graphs
1 / 25 Densest/Heaviest k-subgraph on Interval Graphs, Chordal Graphs and Planar Graphs Presented by Jian Li, Fudan University Mar 2007, HKUST May 8, 2006 2 / 25 Problem Definition: Densest k-subgraph
More informationChange of Ordering for Regular Chains in Positive Dimension
Change of Ordering for Regular Chains in Positive Dimension X. Dahan, X. Jin, M. Moreno Maza, É. Schost University of Western Ontario, London, Ontario, Canada. École polytechnique, 91128 Palaiseau, France.
More informationCOMBINATORIAL SYMBOLIC POWERS. 1. Introduction The r-th symbolic power of an ideal I in a Notherian ring R is the ideal I (r) := R 1
COMBINATORIAL SYMBOLIC POWERS SETH SULLIVANT arxiv:math/0608542v1 [mathac] 22 Aug 2006 Abstract Symbolic powers of ideals are studied in the combinatorial context of monomial ideals When the ideals are
More informationEdge-maximal graphs of branchwidth k
Electronic Notes in Discrete Mathematics 22 (2005) 363 368 www.elsevier.com/locate/endm Edge-maximal graphs of branchwidth k Christophe Paul 1 CNRS - LIRMM, Montpellier, France Jan Arne Telle 2 Dept. of
More informationACP ALGEBRA II MIDTERM REVIEW PACKET
ACP ALGEBRA II MIDTERM REVIEW PACKET 0-8 Name Per Date This review packet includes new problems and a list of problems from the textbook. The answers to the problems from the textbook can be found in the
More informationOptimization Bounds from Binary Decision Diagrams
Optimization Bounds from Binary Decision Diagrams J. N. Hooker Joint work with David Bergman, André Ciré, Willem van Hoeve Carnegie Mellon University ICS 203 Binary Decision Diagrams BDDs historically
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science Algorithms For Inference Fall 2014
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 Recitation 3 1 Gaussian Graphical Models: Schur s Complement Consider
More informationFall River Joint Unified School District
1 Fall River Joint Unified School District McDougal Littell Math Algebra 2 Pacing Guide Begin First Semester Use the state released STAR test questions as warm-ups 1.1, 1.2, 1.3 1.4, 1.5, 1.6 3 Chapter
More informationComputability and Complexity Theory: An Introduction
Computability and Complexity Theory: An Introduction meena@imsc.res.in http://www.imsc.res.in/ meena IMI-IISc, 20 July 2006 p. 1 Understanding Computation Kinds of questions we seek answers to: Is a given
More informationUndirected graphical models
Undirected graphical models Semantics of probabilistic models over undirected graphs Parameters of undirected models Example applications COMP-652 and ECSE-608, February 16, 2017 1 Undirected graphical
More informationFPT is Characterized by Useful Obstruction Sets
FPT is Characterized by Useful Obstruction Sets Bart M. P. Jansen Joint work with Michael R. Fellows, Charles Darwin Univ. June 21st 2013, WG 2013, Lübeck A NEW CHARACTERIZATION OF FPT 2 Well-Quasi-Orders
More informationPrecoloring extension on chordal graphs
Precoloring extension on chordal graphs Dániel Marx 17th August 2004 Abstract In the precoloring extension problem (PrExt) we are given a graph with some of the vertices having a preassigned color and
More informationApplications of the Lopsided Lovász Local Lemma Regarding Hypergraphs
Regarding Hypergraphs Ph.D. Dissertation Defense April 15, 2013 Overview The Local Lemmata 2-Coloring Hypergraphs with the Original Local Lemma Counting Derangements with the Lopsided Local Lemma Lopsided
More informationDetermine the size of an instance of the minimum spanning tree problem.
3.1 Algorithm complexity Consider two alternative algorithms A and B for solving a given problem. Suppose A is O(n 2 ) and B is O(2 n ), where n is the size of the instance. Let n A 0 be the size of the
More informationProbabilistic Graphical Models (I)
Probabilistic Graphical Models (I) Hongxin Zhang zhx@cad.zju.edu.cn State Key Lab of CAD&CG, ZJU 2015-03-31 Probabilistic Graphical Models Modeling many real-world problems => a large number of random
More informationOn the oriented chromatic index of oriented graphs
On the oriented chromatic index of oriented graphs Pascal Ochem, Alexandre Pinlou, Éric Sopena LaBRI, Université Bordeaux 1, 351, cours de la Libération 33405 Talence Cedex, France February 19, 2006 Abstract
More informationSolving Quadratic Equations Review
Math III Unit 2: Polynomials Notes 2-1 Quadratic Equations Solving Quadratic Equations Review Name: Date: Period: Some quadratic equations can be solved by. Others can be solved just by using. ANY quadratic
More informationModel Checking Lower Bounds for Simple Graphs. Michael Lampis KTH Royal Institute of Technology
Model Checking Lower Bounds for Simple Graphs Michael Lampis KTH Royal Institute of Technology March 11, 2013 Algorithmic Meta-Theorems Positive results Problem X is tractable. Negative results Problem
More informationAlgebra II. A2.1.1 Recognize and graph various types of functions, including polynomial, rational, and algebraic functions.
Standard 1: Relations and Functions Students graph relations and functions and find zeros. They use function notation and combine functions by composition. They interpret functions in given situations.
More informationCombinatorial Commutative Algebra, Graph Colorability, and Algorithms
I G,k = g 1,...,g n Combinatorial Commutative Algebra, Graph Colorability, and Algorithms Chris Hillar (University of California, Berkeley) Joint with Troels Windfeldt! (University of Copenhagen)! Outline
More informationPrimary Decomposition
Primary Decomposition p. Primary Decomposition Gerhard Pfister pfister@mathematik.uni-kl.de Departement of Mathematics University of Kaiserslautern Primary Decomposition p. Primary Decomposition:References
More informationCollege Algebra To learn more about all our offerings Visit Knewton.com
College Algebra 978-1-63545-097-2 To learn more about all our offerings Visit Knewton.com Source Author(s) (Text or Video) Title(s) Link (where applicable) OpenStax Text Jay Abramson, Arizona State University
More informationLecture 21: Spectral Learning for Graphical Models
10-708: Probabilistic Graphical Models 10-708, Spring 2016 Lecture 21: Spectral Learning for Graphical Models Lecturer: Eric P. Xing Scribes: Maruan Al-Shedivat, Wei-Cheng Chang, Frederick Liu 1 Motivation
More informationMin-Max Message Passing and Local Consistency in Constraint Networks
Min-Max Message Passing and Local Consistency in Constraint Networks Hong Xu, T. K. Satish Kumar, and Sven Koenig University of Southern California, Los Angeles, CA 90089, USA hongx@usc.edu tkskwork@gmail.com
More informationAlgebra I Vocabulary Cards
Algebra I Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Order of Operations Expression Variable Coefficient
More informationCoding the Matrix Index - Version 0
0 vector, [definition]; (2.4.1): 68 2D geometry, transformations in, [lab]; (4.15.0): 196-200 A T (matrix A transpose); (4.5.4): 157 absolute value, complex number; (1.4.1): 43 abstract/abstracting, over
More informationBayesian & Markov Networks: A unified view
School of omputer Science ayesian & Markov Networks: unified view Probabilistic Graphical Models (10-708) Lecture 3, Sep 19, 2007 Receptor Kinase Gene G Receptor X 1 X 2 Kinase Kinase E X 3 X 4 X 5 TF
More informationEXCLUDING SUBDIVISIONS OF INFINITE CLIQUES. Neil Robertson* Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA
EXCLUDING SUBDIVISIONS OF INFINITE CLIQUES Neil Robertson* Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA P. D. Seymour Bellcore 445 South St. Morristown, New
More information