The class MIP∗ of promise problems that can be decided through an interactive proof system with multiple entangled provers provides a complexity-theoretic framework for the exploration of the nonlocal properties of entanglement. Very little is known in terms of the power of this class. The only proposed approach for establishing upper bounds is based on a hierarchy of semidefinite programs intr...

We construct symmetric monoidal categoriesLRF ,LFG of rooted forests and Feynman graphs. These categories closely resemble finitary abelian categories, and in particular, the notion of Ringel-Hall algebra applies. The Ringel-Hall Hopf algebras of LRF ,LFG, HLRF ,HLFG are dual to the corresponding Connes-Kreimer Hopf algebras on rooted trees and Feynman diagrams. We thus obtain an interpretation...

We introduce the concept of extended Hopf algebras and define their cyclic cohomology in the spirit of Connes-Moscovici cyclic cohomology for Hopf algebras. Extended Hopf algebras are closely related to, but different from, Hopf algebroids. Their definition is motivated by attempting to define a cyclic cohomology theory for Hopf algebroids in general. We show that many of Hopf algebraic structu...

C. OGLE Department of Mathematics, Ohio State University, Columbus, 0H43210, U.S.A. (Received: March 1992) Abstraet. Following Connes and Moscovici, we show that the Baum-Connes assembly map for K,(C~*n) is rationally injective when n is word-hyperbolic, implying the Equivariant Novikov conjecture for such groups. Using this result in topological K-theory and BoreI-Karoubi regulators, we also s...

We construct natural representations of the Connes-Kreimer Lie algebras on rooted trees/Feynman graphs arising from Hecke correspondences in the categories LRF ,LFG constructed by K. Kremnizer and the author. We thus obtain the insertion/elimination representations constructed by Connes-Kreimer as well as an isomorphic pair we term top-insertion/top-elimination. We also construct graded finite-...

To some Hecke symmetries (i.e. Yang-Baxter braidings of Hecke type) we associate ”noncommutative varieties” called braided spheres. An example of such a variety is the Podles’ nonstandard quantum sphere. On any braided sphere we introduce and compute an ”equivariant” analogue of Connes’ noncommutative index. In contrast with the Connes’ construction our version of equivariant NC index is based ...

The Connes formula giving the dual description for the distance between points of a Riemannian manifold is extended to the Lorentzian case. It resulted that its validity essentially depends on the global structure of spacetime. The duality principle classifying spacetimes is introduced. The algebraic account of the theory is suggested as a framework for quantization along the lines proposed by ...

Prediction suffix trees (PST) provide an effective tool for sequence modelling and prediction. Current prediction techniques for PSTs rely on exact matching between the suffix of the current sequence and the previously observed sequence. We present a provably correct algorithm for learning a PST with approximate suffix matching by relaxing the exact matching condition. We then present a self-bo...

Recent advances in symbolic dynamic programming (SDP) combined with the extended algebraic decision diagram (XADD) data structure have provided exact solutions for mixed discrete and continuous (hybrid) MDPs with piecewise linear dynamics and continuous actions. Since XADD-based exact solutions may grow intractably large for many problems, we propose a bounded error compression technique for XA...

In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is based on a factor graph representation of the constraint network. It builds a tree structure by eliminating dependencies between the functions and variables within the factor graph that have the least impact on solution qua...