403 research outputs found

    The h-vector of coned graphs

    Get PDF
    AbstractThe coned graph Gˆ on a finite graph G is obtained by joining each vertex of G to a new vertex p with a simple edge. In this work we show a combinatorial interpretation of each term in the h-vector of Gˆ in terms of partially edge-rooted forests in the base graph G. In particular, our interpretation does not require edge ordering. For an application, we will derive an exponential generating function for the sequence of h-polynomials for the complete graphs. We will also give a new proof for the number of spanning trees of the wheels

    Biconed graphs, edge-rooted forests, and h-vectors of matroid complexes

    Full text link
    A well-known conjecture of Richard Stanley posits that the hh-vector of the independence complex of a matroid is a pure O{\mathcal O}-sequence. The conjecture has been established for various classes but is open for graphic matroids. A biconed graph is a graph with two specified `coning vertices', such that every vertex of the graph is connected to at least one coning vertex. The class of biconed graphs includes coned graphs, Ferrers graphs, and complete multipartite graphs. We study the hh-vectors of graphic matroids arising from biconed graphs, providing a combinatorial interpretation of their entries in terms of `edge-rooted forests' of the underlying graph. This generalizes constructions of Kook and Lee who studied the M\"obius coinvariant (the last nonzero entry of the hh-vector) of graphic matroids of complete bipartite graphs. We show that allowing for partially edge-rooted forests gives rise to a pure multicomplex whose face count recovers the hh-vector, establishing Stanley's conjecture for this class of matroids.Comment: 15 pages, 3 figures; V2: added omitted author to metadat

    Growth of quasiconvex subgroups

    Full text link
    We prove that non-elementary hyperbolic groups grow exponentially more quickly than their infinite index quasiconvex subgroups. The proof uses the classical tools of automatic structures and Perron-Frobenius theory. We also extend the main result to relatively hyperbolic groups and cubulated groups. These extensions use the notion of growth tightness and the work of Dahmani, Guirardel, and Osin on rotating families.Comment: 28 pages, 1 figure. v3 is the final version, to appear in Math Proc. Cambridge Philos. So

    Super Stable Tensegrities and Colin de Verdi\`{e}re Number ν\nu

    Full text link
    A super stable tensegrity introduced by Connelly in 1982 is a globally rigid discrete structure made from stiff bars or struts connected by cables with tension. In this paper we show an exact relation between the maximum dimension that a multigraph can be realized as a super stable tensegrity and Colin de Verdi\`{e}re number~ν\nu from spectral graph theory. As a corollary we obtain a combinatorial characterization of multigraphs that can be realized as 3-dimensional super stable tensegrities

    Proper actions on p\ell^p spaces for relatively hyperbolic groups

    Full text link
    We show that for any group GG that is hyperbolic relative to subgroups that admit a proper affine isometric action on a uniformly convex Banach space, then GG acts properly on a uniformly convex Banach space as well.Comment: 28 pages, revise
    corecore