74 research outputs found
Hypergraph polynomials and the Bernardi process
Recently O. Bernardi gave a formula for the Tutte polynomial of a
graph, based on spanning trees and activities just like the original
definition, but using a fixed ribbon structure to order the set of edges in a
different way for each tree. The interior polynomial is a generalization of
to hypergraphs. We supply a Bernardi-type description of using a
ribbon structure on the underlying bipartite graph . Our formula works
because it is determined by the Ehrhart polynomial of the root polytope of
in the same way as is. To prove this we interpret the Bernardi process as a
way of dissecting the root polytope into simplices, along with a shelling
order. We also show that our generalized Bernardi process gives a common
extension of bijections (and their inverses) constructed by Baker and Wang
between spanning trees and break divisors.Comment: 46 page
The integral cohomology of the group of loops
Let PSigma_n denote the group that can be thought of either as the group of
motions of the trivial n-component link or the group of symmetric automorphisms
of a free group of rank n. The integral cohomology ring of PSigma_n is
determined, establishing a conjecture of Brownstein and Lee.Comment: This is the version published by Geometry & Topology on 11 July 200
- …