122 research outputs found

    Generalizing the Connes Moscovici Hopf algebra to contain all rooted trees

    Full text link
    This paper defines a generalization of the Connes-Moscovici Hopf algebra, H(1)\mathcal{H}(1) that contains the entire Hopf algebra of rooted trees. A relationship between the former, a much studied object in non-commutative geometry, and the later, a much studied object in perturbative Quantum Field Theory, has been established by Connes and Kreimer. The results of this paper open the door to study the cohomology of the Hopf algebra of rooted trees

    Dyson-Schwinger equations in the theory of computation

    Get PDF
    Following Manin's approach to renormalization in the theory of computation, we investigate Dyson-Schwinger equations on Hopf algebras, operads and properads of flow charts, as a way of encoding self-similarity structures in the theory of algorithms computing primitive and partial recursive functions and in the halting problem.Comment: 26 pages, LaTeX, final version, in "Feynman Amplitudes, Periods and Motives", Contemporary Mathematics, AMS 201

    Rado matroids and a graphical calculus for boundaries of Wilson loop diagrams

    Full text link
    We study the boundaries of the positroid cells which arise from N = 4 super Yang Mills theory. Our main tool is a new diagrammatic object which generalizes the Wilson loop diagrams used to represent interactions in the theory. We prove conditions under which these new generalized Wilson loop diagrams correspond to positroids and give an explicit algorithm to calculate the Grassmann necklace of said positroids. Then we develop a graphical calculus operating directly on noncrossing generalized Wilson loop diagrams. In this paradigm, applying diagrammatic moves to a generalized Wilson loop diagram results in new diagrams that represent boundaries of its associated positroid, without passing through cryptomorphisms. We provide a Python implementation of the graphical calculus and use it to show that the boundaries of positroids associated to ordinary Wilson loop diagram are generated by our diagrammatic moves in certain cases.Comment: 80 page

    An algorithm for Tambara-Yamagami quantum invariants of 3-manifolds, parameterized by the first Betti number

    Full text link
    Quantum topology provides various frameworks for defining and computing invariants of manifolds. One such framework of substantial interest in both mathematics and physics is the Turaev-Viro-Barrett-Westbury state sum construction, which uses the data of a spherical fusion category to define topological invariants of triangulated 3-manifolds via tensor network contractions. In this work we consider a restricted class of state sum invariants of 3-manifolds derived from Tambara-Yamagami categories. These categories are particularly simple, being entirely specified by three pieces of data: a finite abelian group, a bicharacter of that group, and a sign ±1\pm 1. Despite being one of the simplest sources of state sum invariants, the computational complexities of Tambara-Yamagami invariants are yet to be fully understood. We make substantial progress on this problem. Our main result is the existence of a general fixed parameter tractable algorithm for all such topological invariants, where the parameter is the first Betti number of the 3-manifold with Z/2Z\mathbb{Z}/2\mathbb{Z} coefficients. We also explain that these invariants are sometimes #P-hard to compute (and we expect that this is almost always the case). Contrary to other domains of computational topology, such as graphs on surfaces, very few hard problems in 3-manifold topology are known to admit FPT algorithms with a topological parameter. However, such algorithms are of particular interest as their complexity depends only polynomially on the combinatorial representation of the input, regardless of size or combinatorial width. Additionally, in the case of Betti numbers, the parameter itself is easily computable in polynomial time.Comment: 24 pages, including 3 appendice

    GG-crossed braided zesting

    Full text link
    For a finite group GG, a GG-crossed braided fusion category is GG-graded fusion category with additional structures, namely a GG-action and a GG-braiding. We develop the notion of GG-crossed braided zesting: an explicit method for constructing new GG-crossed braided fusion categories from a given one by means of cohomological data associated with the invertible objects in the category and grading group GG. This is achieved by adapting a similar construction for (braided) fusion categories recently described by the authors. All GG-crossed braided zestings of a given category C\mathcal{C} are GG-extensions of their trivial component and can be interpreted in terms of the homotopy-based description of Etingof, Nikshych and Ostrik. In particular, we explicitly describe which GG-extensions correspond to GG-crossed braided zestings

    Correlation of infused CD3+CD8+ cells with single-donor dominance after double-unit cord blood transplantation.

    Get PDF
    Single-donor dominance is observed in the majority of patients following double-unit cord blood transplantation (dCBT); however, the biological basis for this outcome is poorly understood. To investigate the possible influence of specific cell lineages on dominance in dCBT, flow cytometry assessment for CD34(+), CD14(+), CD20(+), CD3(-)CD56(+), CD3(+)CD56(+) (natural killer), and T cell subsets (CD4(+), CD8(+), memory, naïve, and regulatory) was performed on individual units. Subsets were calculated as infused viable cells per kilogram of recipient actual weight. Sixty patients who underwent dCBT were included in the final analysis. Higher CD3(+) cell dose was statistically concordant with the dominant unit in 72% of cases (P = .0006). Further T cell subset analyses showed that dominance was correlated more with the naive CD8(+) cell subset (71% concordance; P = .009) than with the naive CD4(+) cell subset (61% concordance; P = .19). These data indicate that a greater total CD3(+) cell dose, particularly of naïve CD3(+)CD8(+) T cells, may play an important role in determining single-donor dominance after dCBT
    corecore