A survey of Tutte-Whitney polynomials
|
|
- Lora Goodman
- 5 years ago
- Views:
Transcription
1 A survey of Tutte-Whitney polynomials Graham Farr Faculty of IT Monash University July 2007
2 Counting colourings proper colourings
3 Counting colourings proper colourings
4 Counting colourings proper colourings Adjacent vertices receive different colours
5 Counting colourings proper colourings Adjacent vertices receive different colours chromatic polynomial: P(G; q) = # q-colourings of G
6 Deletion-contraction For any edge e: P(G; q) = P(G \ e; q) P(G/e; q) e u v u v u = v
7 Partition functions: Potts models general q-colourings (may be improper)
8 Partition functions: Potts models general q-colourings (may be improper)
9 Partition functions: Potts models general q-colourings (may be improper)
10 Partition functions: Potts models general q-colourings (may be improper) Good and bad edges
11 Partition functions: Potts models general q-colourings (may be improper) Good and bad edges Partition function: Z(G; K, q) = all q-colourings (not just proper) e K (# good edges)
12 All-terminal reliability Choose edges randomly: Pr(edge) = p
13 All-terminal reliability Choose edges randomly: Pr(edge) = p Want chosen edges to contain a spanning tree
14 All-terminal reliability Choose edges randomly: Pr(edge) = p Want chosen edges to contain a spanning tree
15 All-terminal reliability Choose edges randomly: Pr(edge) = p Want chosen edges to contain a spanning tree chosen edges
16 All-terminal reliability Choose edges randomly: Pr(edge) = p Want chosen edges to contain a spanning tree chosen edges Reliability: Π(G, p) = Pr(chosen edges contain a spanning tree)
17 ... etc
18 ... etc flow polynomial
19 ... etc flow polynomial # spanning trees, forests, spanning subgraphs
20 ... etc flow polynomial # spanning trees, forests, spanning subgraphs weight enumerator of a linear code
21 ... etc flow polynomial # spanning trees, forests, spanning subgraphs weight enumerator of a linear code Jones polynomial of an alternating link
22 ... etc flow polynomial # spanning trees, forests, spanning subgraphs weight enumerator of a linear code Jones polynomial of an alternating link...
23 Tutte-Whitney polynomials The rank function of a graph: for all X E: ρ(x ) := (# vertices that meet X ) (# components of X ).
24 Tutte-Whitney polynomials The rank function of a graph: for all X E: ρ(x ) := (# vertices that meet X ) (# components of X ). Whitney rank generating function: R(G; x, y) = X E x ρ(e) ρ(x ) y X ρ(x ).
25 Tutte-Whitney polynomials The rank function of a graph: for all X E: ρ(x ) := (# vertices that meet X ) (# components of X ). Whitney rank generating function: R(G; x, y) = X E x ρ(e) ρ(x ) y X ρ(x ). Tutte polynomial: T (G; x, y) = R(G; x 1, y 1).
26 The Recipe Theorem Theorem (Tutte 1947 Brylawski 1972 Oxley & Welsh 1979) If a function f on graphs... is invariant under isomorphism, satisfies a deletion-contraction relation, is multiplicative over components (i.e., f (G 1 G 2 ) = f (G 1 ) f (G 2 )),... then f is essentially a (partial) evaluation of the Tutte-Whitney polynomial.
27 The Recipe Theorem Theorem (Tutte 1947 Brylawski 1972 Oxley & Welsh 1979) If a function f on graphs... is invariant under isomorphism, satisfies a deletion-contraction relation, is multiplicative over components (i.e., f (G 1 G 2 ) = f (G 1 ) f (G 2 )),... then f is essentially a (partial) evaluation of the Tutte-Whitney polynomial. Example P(G; q) = ( 1) ρ(e) q k(g) R(G; q, 1)
28 y x -1-2
29 chromatic y x -1-2
30 chromatic flow y x -1-2
31 chromatic flow reliability y x -1-2
32 chromatic flow reliability weight enumerator y x -1-2
33 chromatic flow reliability weight enumerator Potts model y x -1-2
34 chromatic flow reliability weight enumerator Potts model Jones y x -1-2
35 chromatic flow reliability weight enumerator Potts model Jones easy y x -1-2
36 chromatic flow reliability weight enumerator Potts model Jones easy y x -1-2
37 History
38 History Graphs: Chrom. poly
39 History Graphs: Chrom. poly Birkhoff 1912 P(G; q)
40 History Graphs: Chrom. poly Birkhoff 1912 P(G; q) Whitney, 1935 Tutte, 1947 R(G; x, y)
41 History Graphs: Chrom. poly Birkhoff 1912 P(G; q) Whitney, 1935 Tutte Tutte, 1947 R(G; x, y) 1954 T (G; x, y)
42 History Graphs: Chrom. poly Birkhoff 1912 P(G; q) Whitney, 1935 Tutte Tutte, 1947 R(G; x, y) 1954 T (G; x, y)
43 History Stat Mech: partition functions Graphs: Chrom. poly Birkhoff 1912 P(G; q) Whitney, 1935 Tutte Tutte, 1947 R(G; x, y) 1954 T (G; x, y)
44 History Stat Mech: partition functions Ising 1925 Ising model (q = 2) Graphs: Chrom. poly Birkhoff 1912 P(G; q) Whitney, 1935 Tutte Tutte, 1947 R(G; x, y) 1954 T (G; x, y)
45 History Stat Mech: partition functions Ising 1925 Ising model (q = 2) Potts 1952 Potts model (all q) Graphs: Chrom. poly Birkhoff 1912 P(G; q) Whitney, 1935 Tutte Tutte, 1947 R(G; x, y) 1954 T (G; x, y)
46 History Stat Mech: partition functions A. & T., 1943 Ashkin-Teller model (q = 4) Ising Potts Ising Potts model model (q = 2) (all q) Graphs: Chrom. poly Birkhoff 1912 P(G; q) Whitney, 1935 Tutte Tutte, 1947 R(G; x, y) 1954 T (G; x, y)
47 History Stat Mech: partition functions Graphs: Chrom. poly A. & T., 1943 Ashkin-Teller model (q = 4) Ising Potts Ising Potts model model (q = 2) (all q) Fortuin & Birkhoff Whitney, 1935 Tutte Kasteleyn 1912 P(G; q) Tutte, 1947 R(G; x, y) T (G; x, y)
48 History Stat Mech: partition functions Graphs: Chrom. poly Linear codes: weight enumerator A. & T., 1943 Ashkin-Teller model (q = 4) Ising Potts Ising Potts model model (q = 2) (all q) Fortuin & Birkhoff Whitney, 1935 Tutte Kasteleyn 1912 P(G; q) Tutte, 1947 R(G; x, y) T (G; x, y)
49 History Stat Mech: partition functions Graphs: Chrom. poly Linear codes: weight enumerator A. & T., 1943 Ashkin-Teller model (q = 4) Ising Potts Ising Potts model model (q = 2) (all q) Fortuin & Birkhoff Whitney, 1935 Tutte Kasteleyn 1912 P(G; q) Tutte, 1947 R(G; x, y) T (G; x, y) MacWilliams 1963 A C(z)
50 History Stat Mech: partition functions Graphs: Chrom. poly Linear codes: weight enumerator A. & T., 1943 Ashkin-Teller model (q = 4) Ising Potts Ising Potts model model (q = 2) (all q) Fortuin & Birkhoff Whitney, 1935 Tutte Kasteleyn 1912 P(G; q) Tutte, 1947 R(G; x, y) T (G; x, y) MacWilliams 1963 Greene 1974 A C(z)
51 History Stat Mech: partition functions Graphs: Chrom. poly Linear codes: weight enumerator A. & T., 1943 Network reliability: Ashkin-Teller model (q = 4) Ising Potts Ising Potts model model (q = 2) (all q) Fortuin & Birkhoff Whitney, 1935 Tutte Kasteleyn 1912 P(G; q) Tutte, 1947 R(G; x, y) T (G; x, y) MacWilliams 1963 Greene 1974 A C(z)
52 History Stat Mech: partition functions Graphs: Chrom. poly Linear codes: weight enumerator A. & T., 1943 Network reliability: Ashkin-Teller van Slyke & model (q = 4) Ising Frank, Potts Π(G; p) Ising Potts model model (q = 2) (all q) Fortuin & Birkhoff Whitney, 1935 Tutte Kasteleyn 1912 P(G; q) Tutte, 1947 R(G; x, y) T (G; x, y) MacWilliams 1963 Greene 1974 A C(z)
53 History Stat Mech: partition functions Graphs: Chrom. poly Linear codes: weight enumerator A. & T., 1943 Network reliability: Ashkin-Teller van Slyke & model (q = 4) Ising Frank, Potts Π(G; p) Ising Potts model model (q = 2) (all q) Fortuin & Birkhoff Whitney, 1935 Oxley & Tutte Kasteleyn 1912 P(G; q) Tutte, 1947 R(G; x, y) 1954 Welsh T (G; x, y) MacWilliams 1963 Greene 1974 A C(z)
54 History Stat Mech: partition functions Graphs: Chrom. poly Linear codes: weight enumerator A. & T., 1943 Network reliability: Ashkin-Teller van Slyke & model (q = 4) Ising Frank, Potts Π(G; p) Ising Potts model model (q = 2) (all q) Fortuin & Birkhoff Whitney, 1935 Oxley & Tutte Kasteleyn 1912 P(G; q) Tutte, 1947 R(G; x, y) 1954 Welsh T (G; x, y) MacWilliams 1963 Greene 1974 A C(z) Knots: Jones poly
55 History Stat Mech: partition functions Graphs: Chrom. poly Linear codes: weight enumerator Knots: Jones poly A. & T., 1943 Network reliability: Ashkin-Teller van Slyke & model (q = 4) Ising Frank, Potts Π(G; p) Ising Potts model model (q = 2) (all q) Fortuin & Birkhoff Whitney, 1935 Oxley & Tutte Kasteleyn 1912 P(G; q) Tutte, 1947 R(G; x, y) 1954 Welsh T (G; x, y) MacWilliams 1963 Greene 1974 A C(z) Jones 1985 V L (t)
56 History Stat Mech: partition functions Graphs: Chrom. poly Linear codes: weight enumerator Knots: Jones poly A. & T., 1943 Network reliability: Ashkin-Teller van Slyke & model (q = 4) Ising Frank, Potts Π(G; p) Ising Potts model model (q = 2) (all q) Fortuin & Birkhoff Whitney, 1935 Oxley & Tutte Kasteleyn 1912 P(G; q) Tutte, 1947 R(G; x, y) 1954 Welsh T (G; x, y) MacWilliams 1963 Greene Thistlethwaite A C(z) Jones 1985 V L (t)
57 Complexity of computing all of R(G; x, y) Graphs: #P-hard (Linial, 1986)
58 Complexity of computing all of R(G; x, y) Graphs: #P-hard (Linial, 1986) Bipartite graphs: #P-hard (Linial, 1986)
59 Complexity of computing all of R(G; x, y) Graphs: #P-hard (Linial, 1986) Bipartite graphs: #P-hard (Linial, 1986) Bipartite planar graphs: #P-hard (Vertigan & Welsh, 1992)
60 Complexity of computing all of R(G; x, y) Graphs: #P-hard (Linial, 1986) Bipartite graphs: #P-hard (Linial, 1986) Bipartite planar graphs: #P-hard (Vertigan & Welsh, 1992) Planar graphs, max degree 3: #P-hard (Vertigan, 1990)
61 Complexity of computing all of R(G; x, y) Graphs: #P-hard (Linial, 1986) Bipartite graphs: #P-hard (Linial, 1986) Bipartite planar graphs: #P-hard (Vertigan & Welsh, 1992) Planar graphs, max degree 3: #P-hard (Vertigan, 1990) Bounded tree-width: p-time (Noble, 1998; Andrzejak, 1998)
62 Complexity of computing all of R(G; x, y) Graphs: #P-hard (Linial, 1986) Bipartite graphs: #P-hard (Linial, 1986) Bipartite planar graphs: #P-hard (Vertigan & Welsh, 1992) Planar graphs, max degree 3: #P-hard (Vertigan, 1990) Square grid graphs: Open (in #P 1 ) Bounded tree-width: p-time (Noble, 1998; Andrzejak, 1998)
63 Complexity of computing all of R(G; x, y) Graphs: #P-hard (Linial, 1986) Bipartite graphs: #P-hard (Linial, 1986) Bipartite planar graphs: #P-hard (Vertigan & Welsh, 1992) Planar graphs, max degree 3: #P-hard (Vertigan, 1990) Square grid subgraphs, max deg 3: #P-hard (GF, 2006) Square grid graphs: Open (in #P 1 ) Bounded tree-width: p-time (Noble, 1998; Andrzejak, 1998)
64 Complexity of evaluating at specific points Theorem (Jaeger, Vertigan and Welsh, 1990) The problem of determining R(G; x, y), given a graph G, is #P-hard at all points (x, y) except those where xy = 1 and (x, y) = (0, 0), ( 1, 2), ( 2, 1), ( 2, 2).
65 Generalisations Extensions from graphs to:
66 Generalisations Extensions from graphs to: representable matroids (Smith), matroids (Tutte, Crapo), greedoids (Gordon & McMahon), Boolean functions or set systems (GF), hyperplane arrangements (Welsh & Whittle, Ardila), semimatroids (Ardila), signed graphs (Murasugi), rooted graphs (Wu, King & Lu), K-terminal graphs (Traldi), biased graphs (Zaslavsky), matroid perspectives (Las Vergnas), matroid pairs (Welsh & Kayibi), bimatroids (Kung), graphic polymatroids (Borzacchini), general polymatroids (Oxley & Whittle),...
67 Generalisations Extensions from graphs to: representable matroids (Smith), matroids (Tutte, Crapo), greedoids (Gordon & McMahon), Boolean functions or set systems (GF), hyperplane arrangements (Welsh & Whittle, Ardila), semimatroids (Ardila), signed graphs (Murasugi), rooted graphs (Wu, King & Lu), K-terminal graphs (Traldi), biased graphs (Zaslavsky), matroid perspectives (Las Vergnas), matroid pairs (Welsh & Kayibi), bimatroids (Kung), graphic polymatroids (Borzacchini), general polymatroids (Oxley & Whittle), or extend the polynomials:
68 Generalisations Extensions from graphs to: representable matroids (Smith), matroids (Tutte, Crapo), greedoids (Gordon & McMahon), Boolean functions or set systems (GF), hyperplane arrangements (Welsh & Whittle, Ardila), semimatroids (Ardila), signed graphs (Murasugi), rooted graphs (Wu, King & Lu), K-terminal graphs (Traldi), biased graphs (Zaslavsky), matroid perspectives (Las Vergnas), matroid pairs (Welsh & Kayibi), bimatroids (Kung), graphic polymatroids (Borzacchini), general polymatroids (Oxley & Whittle), or extend the polynomials: multivariate polynomials of various kinds: variables at each vertex (Noble & Welsh), or edge (Fortuin & Kasteleyn, Traldi, Kung, Sokal, Bollobás & Riordan, Zaslavsky, Ellis-Monaghan & Riordan, Britz).
69 Generalisations
70 Generalisations Common themes:
71 Generalisations Common themes: interesting partial evaluations
72 Generalisations Common themes: interesting partial evaluations deletion-contraction relations
73 Generalisations Common themes: interesting partial evaluations deletion-contraction relations Recipe Theorems
74 Generalisations Common themes: interesting partial evaluations deletion-contraction relations Recipe Theorems easier proofs
75 Generalisations Common themes: interesting partial evaluations deletion-contraction relations Recipe Theorems easier proofs roots
76 Generalisations Common themes: interesting partial evaluations deletion-contraction relations Recipe Theorems easier proofs roots how much of the graph is determined by the polynomial?
77 Generalisations Common themes: interesting partial evaluations deletion-contraction relations Recipe Theorems easier proofs roots how much of the graph is determined by the polynomial? We now look at a generalisation to Boolean functions...
78 Rank rowspace Incidence matrix edges vertices 0/1 entries..
79 Rank rowspace Incidence matrix vertices E (edge set) {}}{ E \ W {}}{ 0/1 entries.. W {}}{
80 Rank rowspace Incidence matrix echelon form vertices E (edge set) {}}{ E \ W {}}{ 0/1 entries.. W {}}{
81 Rank rowspace Incidence matrix echelon form E (edge set) {}}{ E \ W {}}{ W {}}{ 0 I 0 0 I 0.
82 Rank rowspace Incidence matrix echelon form ρ(e \ W ) ρ(e) E (edge set) {}}{ E \ W {}}{ W {}}{ 0 I 0 0 I 0.
83 Rank rowspace Incidence matrix echelon form ρ(e \ W ) ρ(e) E (edge set) {}}{ E \ W {}}{ W {}}{ 0 I 0 0 I 0. Count rowspace members that are 0 outside W : 2 ρ(e) ρ(e\w ) = ind Rowspace (X ) X W
84 Count rowspace members that are 0 outside W : 2 ρ(e) ρ(e\w ) = ind Rowspace (X ) X W
85 Count rowspace members that are 0 outside W : 2 ρ(e) ρ(e\w ) = ind Rowspace (X ) X W ( X E ρ(w ) = log ind(x ) ) 2 X E\W ind(x )
86 Count rowspace members that are 0 outside W : 2 ρ(e) ρ(e\w ) = ind Rowspace (X ) X W ( X E ρ(w ) = log ind(x ) ) 2 X E\W ind(x ) Generalise to other functions (not necessarily indicator functions of rowspaces) (GF, 1993):
87 Count rowspace members that are 0 outside W : 2 ρ(e) ρ(e\w ) = ind Rowspace (X ) X W ( X E ρ(w ) = log ind(x ) ) 2 X E\W ind(x ) Generalise to other functions (not necessarily indicator functions of rowspaces) (GF, 1993): For any f : 2 E {0, 1}... or... R... : Define Qf by: ( X E (Qf )(W ) = log f (X ) ) 2 X E\W f (X )
88 Count rowspace members that are 0 outside W : 2 ρ(e) ρ(e\w ) = ind Rowspace (X ) X W ( X E ρ(w ) = log ind(x ) ) 2 X E\W ind(x ) Generalise to other functions (not necessarily indicator functions of rowspaces) (GF, 1993): For any f : 2 E {0, 1}... or... R... : Define Qf by: ( X E (Qf )(W ) = log f (X ) ) 2 X E\W f (X ) Inversion:
89 Count rowspace members that are 0 outside W : 2 ρ(e) ρ(e\w ) = ind Rowspace (X ) X W ( X E ρ(w ) = log ind(x ) ) 2 X E\W ind(x ) Generalise to other functions (not necessarily indicator functions of rowspaces) (GF, 1993): For any f : 2 E {0, 1}... or... R... : Define Qf by: ( X E (Qf )(W ) = log f (X ) ) 2 X E\W f (X ) Inversion: if ρ : 2 E {0, 1} then define Q ρ by (Q ρ)(v ) = ( 1) V ( 1) W 2 ρ(e) ρ(e\w ) W V
90 Properties of the transform Q Basic properties: (Q Qf )(V ) = f (V ) f ( ) (QQ ρ)(v ) = ρ(v ) ρ( )
91 Properties of the transform Q Basic properties: (Q Qf )(V ) = f (V ) f ( ) (QQ ρ)(v ) = ρ(v ) ρ( ) Q QQ = Q QQ Q = Q
92 Properties of the transform Q Basic properties: (Q Qf )(V ) = f (V ) f ( ) (QQ ρ)(v ) = ρ(v ) ρ( ) Q QQ = Q QQ Q = Q Relationship with the Hadamard transform: ˆf (W ) := 1 2 n ( 1) W X f (X ) X E
93 Properties of the transform Q Basic properties: (Q Qf )(V ) = f (V ) f ( ) (QQ ρ)(v ) = ρ(v ) ρ( ) Q QQ = Q QQ Q = Q Relationship with the Hadamard transform: ˆf (W ) := 1 2 n ( 1) W X f (X ) X E f Hadamard transform ˆf Q Q Qf matroid-style dual (Qf ) = Qˆf
94 Extending the Whitney rank generating function R(f ; x, y) = X E x Qf (E) Qf (X ) X Qf (X ) y
95 Extending the Whitney rank generating function R(f ; x, y) = X E R 1 (f ; x, y) = x Qf (E) X E x Qf (E) Qf (X ) X Qf (X ) y (xy) Qf (X ) y X
96 Extending the Whitney rank generating function R(f ; x, y) = X E R 1 (f ; x, y) = x Qf (E) X E x Qf (E) Qf (X ) X Qf (X ) y (xy) Qf (X ) y X Example: E = {1, 2} X f 1 {1} 1 {2} 1 {1, 2} 0
97 Extending the Whitney rank generating function R(f ; x, y) = X E R 1 (f ; x, y) = x Qf (E) X E x Qf (E) Qf (X ) X Qf (X ) y (xy) Qf (X ) y X Example: E = {1, 2} X f 1 {1} 1 {2} 1 {1, 2} 0 R(f ; x, y) = x log xy 2 log y 2 log 23
98 Deletion-contraction For e E, X E \ {e}: Deletion (f \e)(x ) = Contraction f (X ) + f (X {e}) ; (f //e)(x ) = f (X ) f ( ) + f ({e}) f ( ).
99 Deletion-contraction For e E, X E \ {e}: Deletion (f \e)(x ) = Contraction f (X ) + f (X {e}) ; (f //e)(x ) = f (X ) f ( ) + f ({e}) f ( ). Deletion-contraction rule: R(f ; x, y) = x log 2 1+ f ({e} f ( ) R(f \e; x, y)+y log 2 1+ ˆf ({e} ˆf ( ) R(f //e; x, y)
100 Generalised Tutte-Whitney plane y x -1-2
101 Generalised Tutte-Whitney plane chromatic y x -1-2
102 Generalised Tutte-Whitney plane chromatic clutter reliability y x -1-2
103 Generalised Tutte-Whitney plane chromatic clutter reliability weight enum. nonlinear code y x -1-2
104 Generalised Tutte-Whitney plane chromatic y clutter reliability weight enum. nonlinear code gen. Potts model x -1-2
105 Generalised Tutte-Whitney plane chromatic y clutter reliability weight enum. nonlinear code gen. Potts model easy x -1-2
106 Generalised Tutte-Whitney plane chromatic y clutter reliability weight enum. nonlinear code gen. Potts model easy x -1-2
107 Generalised Tutte-Whitney plane chromatic y clutter reliability weight enum. nonlinear code gen. Potts model easy x -1-2
108 Interpolating between contraction and deletion For e E, X E \ {e}: Contraction Deletion (f //e)(x ) (f \e)(x ) f (X ) f ( ) f (X ) + f (X {e}) f ( ) + f ({e})
109 Interpolating between contraction and deletion For e E, X E \ {e}: Contraction λ-minor Deletion (f //e)(x ) (f λ e)(x ) (f \e)(x ) f (X ) f ( ) f (X ) + λf (X {e}) f ( ) + λf ({e}) f (X ) + f (X {e}) f ( ) + f ({e})
110 Interpolating between contraction and deletion For e E, X E \ {e}: Contraction λ-minor Deletion (λ = 0) (λ = 1) (f //e)(x ) (f λ e)(x ) (f \e)(x ) f (X ) f ( ) f (X ) + λf (X {e}) f ( ) + λf ({e}) f (X ) + f (X {e}) f ( ) + f ({e})
111 Interpolating between contraction and deletion For e E, X E \ {e}: Contraction λ-minor Deletion (λ = 0) (λ = 1) (f //e)(x ) (f λ e)(x ) (f \e)(x ) f (X ) f ( ) f (X ) + λf (X {e}) f ( ) + λf ({e}) f (X ) + f (X {e}) f ( ) + f ({e}) 0 λ 1
112 Duality Duality between deletion and contraction can be extended.
113 Duality Duality between deletion and contraction can be extended. Define λ := 1 λ 1 + λ
114 Duality Duality between deletion and contraction can be extended. Define λ := 1 λ 1 + λ Then f λ e = ˆf λ e
115 Duality Duality between deletion and contraction can be extended. Define λ := 1 λ 1 + λ Then Fixed points: f λ e = ˆf λ e λ = ± 2 1
116 λ-rank functions Define Q (λ) f by: ( (1 + λ (Q (λ) ) V ) X E f )(W ) = log λ X f (X ) 2 X E\W λ W V (λ ) W V f (X )
117 λ-rank functions Define Q (λ) f by: ( (1 + λ (Q (λ) ) V ) X E f )(W ) = log λ X f (X ) 2 X E\W λ W V (λ ) W V f (X ) Duality: (Q (λ) ) = Q (λ )
118 λ-rank functions Define Q (λ) f by: ( (1 + λ (Q (λ) ) V ) X E f )(W ) = log λ X f (X ) 2 X E\W λ W V (λ ) W V f (X ) Duality: Inversion: (Q (λ) ) = Q (λ ) (Q (λ) ρ)(v ) = ( 1) V (λ λ ) S ( 1) W (1 + λ ) W (λ ) W V λ W V 2 ρ(e) ρ(e\w ) W V
119 A continuum of λ-whitney functions R (λ) (f ; x, y) = X E x Q(λ) f (E) Q (λ) f (X ) y X Q(λ) f (X )
120 A continuum of λ-whitney functions R (λ) (f ; x, y) = X E x Q(λ) f (E) Q (λ) f (X ) y X Q(λ) f (X ) R (λ) 1 (f ; x, y) = x Q(λ) f (E) (xy) Q(λ) f (X ) y X X E
121 A continuum of λ-whitney functions R (λ) (f ; x, y) = X E x Q(λ) f (E) Q (λ) f (X ) y X Q(λ) f (X ) R (λ) 1 (f ; x, y) = x Q(λ) f (E) (xy) Q(λ) f (X ) y X X E R(ˆf ; x, y) ( x + y) E R (λ) (f ; x, y) R(f ; x, y) λ 1
122 Properties of the λ-whitney function: R (λ) (f ; x, y) obeys a deletion-contraction-type relation (with operations λ, λ );
123 Properties of the λ-whitney function: R (λ) (f ; x, y) obeys a deletion-contraction-type relation (with operations λ, λ ); contains the weight enumerator of a nonlinear code
124 Properties of the λ-whitney function: R (λ) (f ; x, y) obeys a deletion-contraction-type relation (with operations λ, λ ); contains the weight enumerator of a nonlinear code... but this is also in R(f ; x, y), i.e., don t need λ;
125 Properties of the λ-whitney function: R (λ) (f ; x, y) obeys a deletion-contraction-type relation (with operations λ, λ ); contains the weight enumerator of a nonlinear code... but this is also in R(f ; x, y), i.e., don t need λ; contains the partition function of the Ashkin-Teller model on a graph G
126 Properties of the λ-whitney function: R (λ) (f ; x, y) obeys a deletion-contraction-type relation (with operations λ, λ ); contains the weight enumerator of a nonlinear code... but this is also in R(f ; x, y), i.e., don t need λ; contains the partition function of the Ashkin-Teller model on a graph G... which is not determined by R(G; x, y), so do need λ.
127 Ashkin-Teller model (1943) 4-colourings (may be improper): colours are (±1, ±1)
128 Ashkin-Teller model (1943) 4-colourings (may be improper): colours are (±1, ±1)
129 Ashkin-Teller model (1943) 4-colourings (may be improper): colours are (±1, ±1) Left colours: Good and bad edges
130 Ashkin-Teller model (1943) 4-colourings (may be improper): colours are (±1, ±1)
131 Ashkin-Teller model (1943) 4-colourings (may be improper): colours are (±1, ±1) Right colours: Good and bad edges
132 Ashkin-Teller model (1943) 4-colourings (may be improper): colours are (±1, ±1)
133 Ashkin-Teller model (1943) 4-colourings (may be improper): colours are (±1, ±1) Product colours: Good and bad edges
134 Ashkin-Teller model (1943) 4-colourings (may be improper): colours are (±1, ±1) Partition function (symmetric Ashkin-Teller): Z AT (G; K, K, q) = e (2K+K ) E e 0 Product colours: Good and bad edges K (# good left edges) + K (# good right edges) + K (# good product edges) 1 C A
135 Ashkin-Teller model (1943) Special cases: K = K : Potts model (up to a factor) K = 0: product of two Ising models (each q = 2) For these, Z AT (G) is a specialisation of R(G : x, y).
136 Ashkin-Teller model (1943) Special cases: K = K : Potts model (up to a factor) K = 0: product of two Ising models (each q = 2) For these, Z AT (G) is a specialisation of R(G : x, y). In general, Z AT (G) is not a specialisation of R(G : x, y). Example (M. C. Gray; see Tutte (1974)): These graphs have same R(G; x, y), but different Z AT (G) (even in symmetric case).
137 λ-tutte-whitney plane y x -1-2
138 λ-tutte-whitney plane y weight enum. nonlinear code x -1-2
139 λ-tutte-whitney plane y weight enum. nonlinear code Ashkin-Teller model x -1-2
140 λ-tutte-whitney plane y weight enum. nonlinear code Ashkin-Teller model easy x -1-2
141 λ-tutte-whitney plane y weight enum. nonlinear code Ashkin-Teller model easy x -1-2
Minors and Tutte invariants for alternating dimaps
Minors and Tutte invariants for alternating dimaps Graham Farr Clayton School of IT Monash University Graham.Farr@monash.edu Work done partly at: Isaac Newton Institute for Mathematical Sciences (Combinatorics
More informationThe Tutte polynomial: sign and approximability
: sign and approximability Mark Jerrum School of Mathematical Sciences Queen Mary, University of London Joint work with Leslie Goldberg, Department of Computer Science, University of Oxford Durham 23rd
More informationThe Complexity of Computing the Sign of the Tutte Polynomial
The Complexity of Computing the Sign of the Tutte Polynomial Leslie Ann Goldberg (based on joint work with Mark Jerrum) Oxford Algorithms Workshop, October 2012 The Tutte polynomial of a graph G = (V,
More informationTutte Polynomials with Applications
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 6 (26), pp. 4781 4797 Research India Publications http://www.ripublication.com/gjpam.htm Tutte Polynomials with Applications
More informationMatroids/1. I and I 2 ,I 2 > I 1
Matroids 1 Definition A matroid is an abstraction of the notion of linear independence in a vector space. See Oxley [6], Welsh [7] for further information about matroids. A matroid is a pair (E,I ), where
More informationPolynomial time randomised approximation schemes for Tutte-Gröthendieck invariants: the dense case
Polynomial time randomised approximation schemes for Tutte-Gröthendieck invariants: the dense case Noga Alon Alan Frieze Dominic Welsh Abstract The Tutte-Gröthendieck polynomial T (G; x, y) of a graph
More informationCombining the cycle index and the Tutte polynomial?
Combining the cycle index and the Tutte polynomial? Peter J. Cameron University of St Andrews Combinatorics Seminar University of Vienna 23 March 2017 Selections Students often meet the following table
More informationFrom Potts to Tutte and back again... A graph theoretical view of statistical mechanics
From Potts to Tutte and back again... A graph theoretical view of statistical mechanics Jo Ellis-Monaghan e-mail: jellis-monaghan@smcvt.edu website: http://academics.smcvt.edu/jellis-monaghan 10/27/05
More informationEvaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width
Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width S. D. Noble Department of Mathematical Sciences Brunel University Kingston Lane, Uxbridge UB8 3PH, U.K. steven.noble@brunel.ac.uk
More informationNon-Recursively Constructible Recursive Families of Graphs
Non-Recursively Constructible Recursive Families of Graphs Colleen Bouey Department of Mathematics Loyola Marymount College Los Angeles, CA 90045, USA cbouey@lion.lmu.edu Aaron Ostrander Dept of Math and
More informationA 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 informationTUTTE POLYNOMIALS OF GENERALIZED PARALLEL CONNECTIONS
TUTTE POLYNOMIALS OF GENERALIZED PARALLEL CONNECTIONS JOSEPH E. BONIN AND ANNA DE MIER ABSTRACT. We use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel connections
More informationThe Tutte Polynomial for Matroids of Bounded Branch-Width
Combinatorics, Probability and Computing 9XX 00, 000 000. c 9XX Cambridge University Press DOI: 0.07/S0000000000000000 Printed in the United Kingdom The Tutte Polynomial for Matroids of Bounded Branch-Width
More informationNotes on matroids and codes
Notes on matroids and codes Peter J. Cameron Abstract The following expository article is intended to describe a correspondence between matroids and codes. The key results are that the weight enumerator
More informationAn Introduction to Transversal Matroids
An Introduction to Transversal Matroids Joseph E Bonin The George Washington University These slides and an accompanying expository paper (in essence, notes for this talk, and more) are available at http://homegwuedu/
More informationThe Tutte polynomial, its applications and generalizations. Sergei Chmutov The Ohio State University, Mansfield
University of South Alabama The Tutte polynomial, its applications and generalizations Sergei Chmutov The Ohio State University, Mansfield Thursday, April 5, 00 :0 4:0 p.m. Chromatic polynomial C Γ (q)
More informationTUTTE POLYNOMIALS OF q-cones
TUTTE POLYNOMIALS OF q-cones JOSEPH E. BONIN AND HONGXUN QIN ABSTRACT. We derive a formula for the Tutte polynomial t(g ; x, y) of a q-cone G of a GF (q)-representable geometry G in terms of t(g; x, y).
More informationRELATIVE TUTTE POLYNOMIALS FOR COLORED GRAPHS AND VIRTUAL KNOT THEORY. 1. Introduction
RELATIVE TUTTE POLYNOMIALS FOR COLORED GRAPHS AND VIRTUAL KNOT THEORY Y. DIAO AND G. HETYEI Abstract. We introduce the concept of a relative Tutte polynomial. We show that the relative Tutte polynomial
More informationTutte Functions of Matroids
Tutte Functions of Matroids Joanna Ellis-Monaghan Thomas Zaslavsky AMS Special Session on Matroids University of Kentucky 27 March 2010... and then, what? F (M) = δ e F (M\e) + γ e F (M/e) 1 2 E-M & Z
More informationA characteristic polynomial for rooted graphs and rooted digraphs
Discrete Mathematics 232 (2001) 19 33 www.elsevier.com/locate/disc A characteristic polynomial for rooted graphs and rooted digraphs Gary Gordon, Elizabeth McMahon Mathematics Department, Lafayette College,
More informationEvaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
Combinatorics, Probability and Computing (1998) 7, 307 321. c 1998 Cambridge University Press Printed in the United Kingdom Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width S. D. NOBLE
More informationCounting bases of representable matroids
Counting bases of representable matroids Michael Snook School of Mathematics, Statistics and Operations Research Victoria University of Wellington Wellington, New Zealand michael.snook@msor.vuw.ac.nz Submitted:
More informationGraph Polynomials and Their Representations
Graph Polynomials and Their Representations By the Faculty of Mathematik und Informatik of the Technische Universität Bergakademie Freiberg approved Thesis to attain the academic degree of doctor rerum
More informationExtremal Restraints for Graph Colourings
Extremal Restraints for Graph Colourings Aysel Erey Dalhousie University CanaDAM 2015 University of Saskatchewan, Saskatoon, June 1 (Joint work with Jason Brown) Definition A proper k-colouring of G is
More informationFine Grained Counting Complexity I
Fine Grained Counting Complexity I Holger Dell Saarland University and Cluster of Excellence (MMCI) & Simons Institute for the Theory of Computing 1 50 Shades of Fine-Grained #W[1] W[1] fixed-parameter
More informationPublications of James G. Oxley. Books and edited books
Books and edited books Publications of James G. Oxley 1. Matroid Theory, Oxford University Press, New York, 1992 (532 pages). 2. Matroid Theory (edited with J.E. Bonin and B. Servatius), Proc. AMS- IMS-SIAM
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationTutte polynomials of bracelets
J Algebr Comb (2010) 32: 389 398 DOI 10.1007/s10801-010-0220-1 Tutte polynomials of bracelets Norman Biggs Received: 15 May 2009 / Accepted: 15 February 2010 / Published online: 2 March 2010 Springer Science+Business
More informationOn the study of the Potts model, Tutte and Chromatic Polynomials, and the Connections with Computation Complexity and Quantum Computing.
On the study of the Potts model, Tutte and Chromatic Polynomials, and the Connections with Computation Complexity and Quantum Computing Marina von Steinkirch Institute of Physics and Astronomy, State University
More informationCHARACTERISTIC POLYNOMIALS WITH INTEGER ROOTS
CHARACTERISTIC POLYNOMIALS WITH INTEGER ROOTS Gordon Royle School of Mathematics & Statistics University of Western Australia Bert s Matroid Jamboree Maastricht 2012 AUSTRALIA PERTH WHERE EVERY PROSPECT
More informationMARTIN LOEBL AND JEAN-SEBASTIEN SERENI
POTTS PARTITION FUNCTION AND ISOMORPHISMS OF TREES MARTIN LOEBL AND JEAN-SEBASTIEN SERENI Abstract. We explore the well-known Stanley conjecture stating that the symmetric chromatic polynomial distinguishes
More informationSubmodular Functions, Optimization, and Applications to Machine Learning
Submodular Functions, Optimization, and Applications to Machine Learning Spring Quarter, Lecture http://www.ee.washington.edu/people/faculty/bilmes/classes/eeb_spring_0/ Prof. Jeff Bilmes University of
More informationA tree-decomposed transfer matrix for computing exact partition functions for arbitrary graphs
A tree-decomposed transfer matrix for computing exact partition functions for arbitrary graphs Andrea Bedini 1 Jesper L. Jacobsen 2 1 MASCOS, The University of Melbourne, Melbourne 2 LPTENS, École Normale
More informationSubmodular Functions, Optimization, and Applications to Machine Learning
Submodular Functions, Optimization, and Applications to Machine Learning Spring Quarter, Lecture http://www.ee.washington.edu/people/faculty/bilmes/classes/ee_spring_0/ Prof. Jeff Bilmes University of
More informationSiegel s theorem, edge coloring, and a holant dichotomy
Siegel s theorem, edge coloring, and a holant dichotomy Tyson Williams (University of Wisconsin-Madison) Joint with: Jin-Yi Cai and Heng Guo (University of Wisconsin-Madison) Appeared at FOCS 2014 1 /
More informationTutte Polynomials of Bracelets. Norman Biggs
Tutte Polynomials of Bracelets Norman Biggs Department of Mathematics London School of Economics Houghton Street London WC2A 2AE U.K. n.l.biggs@lse.ac.uk January 2009 CDAM Research Reports Series LSE-CDAM
More informationA Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
Combinatorics, Probability and Computing (1994) 3, 273-283 Copyright 1994 Cambridge University Press A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs J. D. ANNANt
More informationWhat Do Lattice Paths Have To Do With Matrices, And What Is Beyond Both?
What Do Lattice Paths Have To Do With Matrices, And What Is Beyond Both? Joseph E. Bonin The George Washington University These slides are available at blogs.gwu.edu/jbonin Some ideas in this talk were
More informationThe Tutte polynomial of some matroids
The Tutte polynomial of some matroids arxiv:203.0090v [math.co] Mar 22 Criel Merino, Marcelino Ramírez-Ibañez Guadalupe Rodríguez-Sánchez March 2, 22 Abstract The Tutte polynomial of a graph or a matroid,
More informationHolger Dell Saarland University and Cluster of Excellence (MMCI) Simons Institute for the Theory of Computing
Fine-Grained Complexity Classification of Counting Problems Holger Dell Saarland University and Cluster of Excellence (MMCI) Simons Institute for the Theory of Computing 1 In P or not in P? Exact counting
More informationAN INTRODUCTION TO CHROMATIC POLYNOMIALS
BACKGROUND POLYNOMIALS COMPLEX ZEROS AN INTRODUCTION TO CHROMATIC POLYNOMIALS Gordon Royle School of Mathematics & Statistics University of Western Australia Junior Mathematics Seminar, UWA September 2011
More informationDeterminant density and the Vol-Det Conjecture
Determinant density and the Vol-Det Conjecture Ilya Kofman College of Staten Island and The Graduate Center City University of New York (CUNY) Joint work with Abhijit Champanerkar and Jessica Purcell December
More informationKNOT INVARIANTS AND THE BOLLOBÁS-RIORDAN POLYNOMIAL OF EMBEDDED GRAPHS
KNOT INVARIANTS AND THE BOLLOBÁS-RIORDAN POLYNOMIAL OF EMBEDDED GRAPHS IAIN MOFFATT Abstract. For a graph G embedded in an orientable surface Σ, we consider associated links LG in the thickened surface
More informationChromatic, Flow, and Reliability Polynomials: the Complexity of their Coefficients
Chromatic, Flow, and Reliability Polynomials: the Complexity of their Coefficients James Oxley Department of Mathematics Louisiana State University Baton Rouge, Louisiana, 70803, USA and Dominic Welsh
More informationarxiv: v1 [math.co] 29 May 2017
Several extreme coefficients of the Tutte polynomial of graphs arxiv:1705.1003v1 [math.co] 9 May 017 Abstract Helin Gong School of Mathematical Sciences Xiamen University P. R. China Department of Fundamental
More informationPERFECT BINARY MATROIDS
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT PERFECT BINARY MATROIDS Allan Mills August 1999 No. 1999-8 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookeville, TN 38505 PERFECT BINARY MATROIDS ALLAN D. MILLS Abstract.
More informationCharacterizing binary matroids with no P 9 -minor
1 2 Characterizing binary matroids with no P 9 -minor Guoli Ding 1 and Haidong Wu 2 1. Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana, USA Email: ding@math.lsu.edu 2. Department
More informationarxiv: v1 [math.co] 3 Aug 2009
GRAPHS WHOSE FLOW POLYNOMIALS HAVE ONLY INTEGRAL ROOTS arxiv:0908.0181v1 [math.co] 3 Aug 009 JOSEPH P.S. KUNG AND GORDON F. ROYLE Abstract. We show if the flow polynomial of a bridgeless graph G has only
More informationSERGEI CHMUTOV AND IGOR PAK
Dedicated to Askold Khovanskii on the occasion of his 60th birthday THE KAUFFMAN BRACKET OF VIRTUAL LINKS AND THE BOLLOBÁS-RIORDAN POLYNOMIAL SERGEI CHMUTOV AND IGOR PAK Abstract. We show that the Kauffman
More informationEfficient Computation of Chromatic and Flow Polynomials
RICE UNIVERSITY Efficient Computation of Chromatic and Flow Polynomials by Boris Brimkov A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree Master of Arts Approved, Thesis Committee:
More informationGRAPHS, LINKS, AND DUALITY ON SURFACES
GRAPHS, LINKS, AND DUALITY ON SURFACES VYACHESLAV KRUSHKAL Abstract. We introduce a polynomial invariant of graphs on surfaces, P G, generalizing the classical Tutte polynomial. Topological duality on
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 informationModularity and Structure in Matroids
Modularity and Structure in Matroids by Rohan Kapadia A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Doctor of Philosophy in Combinatorics and
More informationSpanning trees on the Sierpinski gasket
Spanning trees on the Sierpinski gasket Shu-Chiuan Chang (1997-2002) Department of Physics National Cheng Kung University Tainan 70101, Taiwan and Physics Division National Center for Theoretical Science
More informationThe adjacency matroid of a graph
The adjacency matroid of a graph Robert Brijder Hasselt University and Transnational University of Limburg Belgium Hendrik Jan Hoogeboom LIACS, Leiden University The Netherlands h.j.hoogeboom@cs.leidenuniv.nl
More informationEindhoven University of Technology MASTER. Counting matroids. van der Pol, J.G. Award date: Link to publication
Eindhoven University of Technology MASTER Counting matroids van der Pol, J.G. Award date: 2013 Link to publication Disclaimer This document contains a student thesis (bachelor's or master's), as authored
More informationMaps of matroids with applications
Discrete Mathematics 303 (2005) 75 85 www.elsevier.com/locate/disc Maps of matroids with applications András Recski a,b, a Department of Computer Science and Information Theory, Budapest University of
More informationarxiv: v1 [math.co] 20 Sep 2012
arxiv:1209.4628v1 [math.co] 20 Sep 2012 A graph minors characterization of signed graphs whose signed Colin de Verdière parameter ν is two Marina Arav, Frank J. Hall, Zhongshan Li, Hein van der Holst Department
More informationExponential Time Complexity of the Permanent and the Tutte Polynomial
Exponential Time Complexity of the Permanent and the Tutte Polynomial arxiv:1206.1775v1 [cs.cc] 8 Jun 2012 Holger Dell University of Wisconsin Madison, USA holger@cs.wisc.edu Dániel Marx Computer and Automation
More information1. Introduction ON THE COMPLEXITY OF THE INTERLACE POLYNOMIAL
Symposium on Theoretical Aspects of Computer Science 2008 (Bordeaux), pp. 97-108 www.stacs-conf.org ON THE COMPLEXITY OF THE INTERLACE POLYNOMIAL MARKUS BLÄSER 1 AND CHRISTIAN HOFFMANN 1 1 Saarland University,
More informationCounting Matroids. Rudi Pendavingh. 6 July, Rudi Pendavingh Counting Matroids 6 July, / 23
Counting Matroids Rudi Pendavingh 6 July, 2015 Rudi Pendavingh Counting Matroids 6 July, 2015 1 / 23 First steps Definitions [n] := {1,..., n} m n := #{M matroid : E(M) = [n]} m n,r := #{M matroid : E(M)
More informationarxiv: v1 [math.co] 15 Sep 2011
From spanning forests to edge subsets MartinTrinks September 16, 2011 arxiv:1109.3282v1 [math.co] 15 Sep 2011 The author receives the grant 080940498 from the European Social Fund (ESF) of the European
More informationOn zeros of the characteristic polynomial of matroids of bounded tree-width
On zeros of the characteristic polynomial of matroids of bounded tree-width By Carolyn Chun, Rhiannon Hall, Criel Merino, Steven Noble Birkbeck Pure Mathematics Preprint Series Preprint Number 26 www.bbk.ac.uk/ems/research/pure/preprints
More informationThe Classification Program II: Tractable Classes and Hardness Proof
The Classification Program II: Tractable Classes and Hardness Proof Jin-Yi Cai (University of Wisconsin-Madison) January 27, 2016 1 / 104 Kasteleyn s Algorithm and Matchgates Previously... By a Pfaffian
More informationALTERNATING KNOT DIAGRAMS, EULER CIRCUITS AND THE INTERLACE POLYNOMIAL
ALTERNATING KNOT DIAGRAMS, EULER CIRCUITS AND THE INTERLACE POLYNOMIAL P. N. BALISTER, B. BOLLOBÁS, O. M. RIORDAN AND A. D. SCOTT Abstract. We show that two classical theorems in graph theory and a simple
More informationAn extension of the bivariate chromatic polynomial
An extension of the bivariate chromatic polynomial I. AVERBOUCH, B. GODLIN and J.A. MAKOWSKY Faculty of Computer Science Israel Institute of Technology Haifa, Israel {ailia,bgodlin,janos}@cs.technion.ac.il
More informationSiegel s Theorem, Edge Coloring, and a Holant Dichotomy
Siegel s Theorem, Edge Coloring, and a Holant Dichotomy Jin-Yi Cai (University of Wisconsin-Madison) Joint with: Heng Guo and Tyson Williams (University of Wisconsin-Madison) 1 / 117 2 / 117 Theorem (Siegel
More informationNotes on Graph Theory
Notes on Graph Theory Maris Ozols June 8, 2010 Contents 0.1 Berge s Lemma............................................ 2 0.2 König s Theorem........................................... 3 0.3 Hall s Theorem............................................
More informationInterval Partitions and Activities for the Greedoid Tutte Polynomial
Ž. ADVANCES IN APPLIED MAHEMAICS 18, 3349 1997 ARICLE NO. AM960495 Interval Partitions and Activities for the Greedoid utte Polynomial Gary Gordon and Elizabeth McMahon Lafayette College, Easton, Pennsylania
More informationTOTALLY FRUSTRATED STATES IN THE CHROMATIC THEORY OF GAIN GRAPHS
TOTALLY FRUSTRATED STATES IN THE CHROMATIC THEORY OF GAIN GRAPHS THOMAS ZASLAVSKY Abstract. We generalize proper coloring of gain graphs to totally frustrated states, where each vertex takes a value in
More informationPolynomials in graph theory
Polynomials in graph theory Alexey Bogatov Department of Software Engineering Faculty of Mathematics and Mechanics Saint Petersburg State University JASS 2007 Saint Petersburg Course 1: Polynomials: Their
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Luis A. Goddyn Winfried Hochstättler: Nowhere-zero flows in regular matroids and Hadwiger s Conjecture Technical Report feu-dmo031.13 Contact: goddyn@sfu.ca winfried.hochstaettler@fernuni-hagen.de
More informationPolynomial aspects of codes, matroids and permutation groups
Polynomial aspects of codes, matroids and permutation groups Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS UK p.j.cameron@qmul.ac.uk Contents
More informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationThe topology of the external activity complex of a matroid
The topology of the external activity complex of a matroid Federico Ardila Federico Castillo José Alejandro Samper Abstract We prove that the external activity complex Act < (M) of a matroid is shellable.
More informationSemimatroids and their Tutte polynomials
Semimatroids and their Tutte polynomials Federico Ardila Abstract We define and study semimatroids, a class of objects which abstracts the dependence properties of an affine hyperplane arrangement. We
More informationWHAT IS A MATROID? JAMES OXLEY
WHAT IS A MATROID? JAMES OXLEY Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of dependence. Whitney s definition embraces a surprising diversity of combinatorial
More informationComputing Tutte Polynomials
Computing Tutte Polynomials GARY HAGGARD Department of Computer Science, Bucknell University and DAVID J. PEARCE School of Engineering and Computer Science, Victoria University of Wellington, NZ and GORDON
More informationON THE CHROMATIC POLYNOMIAL OF A CYCLE GRAPH
International Journal of Applied Mathematics Volume 25 No. 6 2012, 825-832 ON THE CHROMATIC POLYNOMIAL OF A CYCLE GRAPH Remal Shaher Al-Gounmeein Department of Mathematics Al Hussein Bin Talal University
More informationSOLUTION TO A COMBINATORIAL PUZZLE ARISING FROM MAYER S THEORY OF CLUSTER INTEGRALS
SOLUTION TO A COMBINATORIAL PUZZLE ARISING FROM MAYER S THEORY OF CLUSTER INTEGRALS OLIVIER BERNARDI Abstract. Mayer s theory of cluster integrals allows one to write the partition function of a gas model
More informationGraphs & Algorithms: Advanced Topics Nowhere-Zero Flows
Graphs & Algorithms: Advanced Topics Nowhere-Zero Flows Uli Wagner ETH Zürich Flows Definition Let G = (V, E) be a multigraph (allow loops and parallel edges). An (integer-valued) flow on G (also called
More informationReference Notes for Lectures on Signed Graphs and Geometry. Thomas Zaslavsky
Reference Notes for Lectures on Signed Graphs and Geometry by Thomas Zaslavsky Workshop on Signed Graphs, Set-Valuations and Geometry CMS Pala Campus, Pala, and Mary Matha Arts and Science College, Manathavady,
More informationCombinatorics and Optimization 442/642, Fall 2012
Compact course notes Combinatorics and Optimization 44/64, Fall 0 Graph Theory Contents Professor: J. Geelen transcribed by: J. Lazovskis University of Waterloo December 6, 0 0. Foundations..............................................
More informationGraph invariants, homomorphisms, and the Tutte polynomial
Graph invariants, homomorphisms, and the Tutte polynomial A. Goodall, J. Nešetřil February 26, 2013 1 The chromatic polynomial 1.1 The chromatic polynomial and proper colourings There are various ways
More informationMatrix representations of matroids of biased graphs correspond to gain functions
Matrix representations of matroids of biased graphs correspond to gain functions Daryl Funk Daniel Slilaty September 19, 2016 Abstract Let M be a frame matroid or a lifted-graphic matroid and let (G, B)
More informationSpanning cycles in regular matroids without M (K 5 ) minors
Spanning cycles in regular matroids without M (K 5 ) minors Hong-Jian Lai, Bolian Liu, Yan Liu, Yehong Shao Abstract Catlin and Jaeger proved that the cycle matroid of a 4-edge-connected graph has a spanning
More informationOn Matroid and Polymatroid Connectivity
Louisiana State University LSU Digital Commons LSU Doctoral Dissertations Graduate School 2014 On Matroid and Polymatroid Connectivity Dennis Wayne Hall II Louisiana State University and Agricultural and
More informationBicircular Matroids are 3-colorable
Bicircular Matroids are 3-colorable Luis Goddyn Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby BC V5A 1S6, Canada Winfried Hochstättler FernUniversität in Hagen, Fakultät
More information1 Matroid intersection
CS 369P: Polyhedral techniques in combinatorial optimization Instructor: Jan Vondrák Lecture date: October 21st, 2010 Scribe: Bernd Bandemer 1 Matroid intersection Given two matroids M 1 = (E, I 1 ) and
More informationAn Introduction of Tutte Polynomial
An Introduction of Tutte Polynomial Bo Lin December 12, 2013 Abstract Tutte polynomial, defined for matroids and graphs, has the important property that any multiplicative graph invariant with a deletion
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler, Robert Nickel: On the Chromatic Number of an Oriented Matroid Technical Report feu-dmo007.07 Contact: winfried.hochstaettler@fernuni-hagen.de
More informationGraph polynomials from simple graph sequences
Graph polynomials from simple graph sequences Delia Garijo 1 Andrew Goodall 2 Patrice Ossona de Mendez 3 Jarik Nešetřil 2 1 University of Seville, Spain 2 Charles University, Prague, Czech Republic 3 CAMS,
More informationGraphs and matroids determined by their Tutte polynomials
Graphs and matroids determined by their Tutte polynomials Memòria presentada per optar al grau de Doctora en Matemàtiques per Anna de Mier Vinué Director de tesi: Marc Noy Serrano Programa de doctorat
More informationRegular matroids without disjoint circuits
Regular matroids without disjoint circuits Suohai Fan, Hong-Jian Lai, Yehong Shao, Hehui Wu and Ju Zhou June 29, 2006 Abstract A cosimple regular matroid M does not have disjoint circuits if and only if
More informationAN ALGORITHM FOR CONSTRUCTING A k-tree FOR A k-connected MATROID
AN ALGORITHM FOR CONSTRUCTING A k-tree FOR A k-connected MATROID NICK BRETTELL AND CHARLES SEMPLE Dedicated to James Oxley on the occasion of his 60th birthday Abstract. For a k-connected matroid M, Clark
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS III
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS III CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. This paper proves a preliminary step towards a splitter theorem for internally
More informationPage Line Change 80-5 Replace by Adjoin or delete a zero row Omit non-zero before column Replace the sentence beginning Clearly
MATROID THEORY James G. Oxley Oxford University Press, New York, 1992 Errata and Update on Conjectures, Problems, and References Latest update: December 10, 2005 The comments below apply to all printings
More informationMonomial Bases for Broken Circuit Complexes
Monomial Bases for Broken Circuit Complexes Jason I. Brown Department of Mathematics and Statistics Dalhousie University Halifax, NS B3H 3J5 CANADA brown@mscs.dal.ca Bruce E. Sagan Department of Mathematics
More informationTOPOLOGICAL REPRESENTATIONS OF MATROIDS
JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0894-0347(XX)0000-0 TOPOLOGICAL REPRESENTATIONS OF MATROIDS E. SWARTZ 1. Introduction One of the foundations of oriented
More information