Hyperoctahedral Eulerian Idempotents, Hodge Decompositions, and Signed Graph Coloring Complexes
نویسندگان
چکیده
Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B analogue of this result for chromatic polynomials of signed graphs using hyperoctahedral Eulerian idempotents.
منابع مشابه
The Hodge Structure of the Coloring Complex of a Hypergraph ( Extended
Let G be a simple graph with n vertices. The coloring complex ∆(G) was defined by Steingrı́msson, and the homology of ∆(G) was shown to be nonzero only in dimension n − 3 by Jonsson. Hanlon recently showed that the Eulerian idempotents provide a decomposition of the homology group Hn−3(∆(G)) where the dimension of the j component in the decomposition, H n−3(∆(G)), equals the absolute value of th...
متن کاملThe Hodge Structure of the Coloring Complex of a Hypergraph ( Extended Abstract )
Let G be a simple graph with n vertices. The coloring complex ∆(G) was defined by Steingrı́msson, and the homology of ∆(G) was shown to be nonzero only in dimension n − 3 by Jonsson. Hanlon recently showed that the Eulerian idempotents provide a decomposition of the homology group Hn−3(∆(G)) where the dimension of the j component in the decomposition, H n−3(∆(G)), equals the absolute value of th...
متن کاملCombinatorics of Balanced Carries
We study the combinatorics of addition using balanced digits, deriving an analog of Holte’s “amazing matrix” for carries in usual addition. The eigenvalues of this matrix for base b balanced addition of n numbers are found to be 1, 1/b, · · · , 1/b, and formulas are given for its left and right eigenvectors. It is shown that the left eigenvectors can be identified with hyperoctahedral Foulkes c...
متن کاملA Hodge Decomposition for the Complex of Injective Words
Reiner and Webb (preprint, 2002) compute the Sn-module structure for the complex of injective words. This paper refines their formula by providing a Hodge type decomposition. Along the way, this paper proves that the simplicial boundary map interacts in a nice fashion with the Eulerian idempotents. The Laplacian acting on the top chain group in the complex of injective words is also shown to eq...
متن کاملA Hodge Decomposition Interpretation for the Coefficients of the Chromatic Polynomial
Let G be a simple graph with n nodes. The coloring complex of G, as defined by Steingrimsson, has r-faces consisting of all ordered set partitions, (B1, . . . , Br+2) in which at least one Bi contains an edge of G. Jonsson proved that the homology H∗(G) of the coloring complex is concentrated in the top degree. In addition, Jonsson showed that the dimension of the top homology is one less than ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014