1,165 research outputs found

    Vertex-regular 11-factorizations in infinite graphs

    Full text link
    The existence of 11-factorizations of an infinite complete equipartite graph Km[n]K_m[n] (with mm parts of size nn) admitting a vertex-regular automorphism group GG is known only when n=1n=1 and mm is countable (that is, for countable complete graphs) and, in addition, GG is a finitely generated abelian group GG of order mm. In this paper, we show that a vertex-regular 11-factorization of Km[n]K_m[n] under the group GG exists if and only if GG has a subgroup HH of order nn whose index in GG is mm. Furthermore, we provide a sufficient condition for an infinite Cayley graph to have a regular 11-factorization. Finally, we construct 1-factorizations that contain a given subfactorization, both having a vertex-regular automorphism group

    A complete solution to the infinite Oberwolfach problem

    Full text link
    Let FF be a 22-regular graph of order vv. The Oberwolfach problem, OP(F)OP(F), asks for a 22-factorization of the complete graph on vv vertices in which each 22-factor is isomorphic to FF. In this paper, we give a complete solution to the Oberwolfach problem over infinite complete graphs, proving the existence of solutions that are regular under the action of a given involution free group GG. We will also consider the same problem in the more general contest of graphs FF that are spanning subgraphs of an infinite complete graph K\mathbb{K} and we provide a solution when FF is locally finite. Moreover, we characterize the infinite subgraphs LL of FF such that there exists a solution to OP(F)OP(F) containing a solution to OP(L)OP(L)

    Ten Conferences WORDS: Open Problems and Conjectures

    Full text link
    In connection to the development of the field of Combinatorics on Words, we present a list of open problems and conjectures that were stated during the ten last meetings WORDS. We wish to continually update the present document by adding informations concerning advances in problems solving

    Unique factorization in perturbative QFT

    Get PDF
    We discuss factorization of the Dyson--Schwinger equations using the Lie- and Hopf algebra of graphs. The structure of those equations allows to introduce a commutative associative product on 1PI graphs. In scalar field theories, this product vanishes if and only if one of the factors vanishes. Gauge theories are more subtle: integrality relates to gauge symmetries.Comment: 5pages, Talk given at "RadCor 2002 - Loops and Legs 2002", Kloster Banz, Germany, Sep 8-13, 200

    Matrix factorizations and link homology

    Full text link
    For each positive integer n the HOMFLY polynomial of links specializes to a one-variable polynomial that can be recovered from the representation theory of quantum sl(n). For each such n we build a doubly-graded homology theory of links with this polynomial as the Euler characteristic. The core of our construction utilizes the theory of matrix factorizations, which provide a linear algebra description of maximal Cohen-Macaulay modules on isolated hypersurface singularities.Comment: 108 pages, 61 figures, latex, ep
    • …
    corecore