We study an equivariant co-assembly map that is dual to the usual Baum–Connes assembly map and closely related to coarse geometry, equivariant Kasparov theory, and the existence of dual Dirac morphisms. As applications, we prove the existence of dual Dirac morphisms for groups with suitable compactifications, that is, satisfying the Carlsson–Pedersen condition, and we study a K–theoretic counte...

We study in this paper the maximal version of the coarse BaumConnes assembly map for families of expanding graphs arising from residually finite groups. Unlike for the usual Roe algebra, we show that this assembly map is closely related to the (maximal) Baum-Connes assembly map for the group and is an isomorphism for a class of expanders. We also introduce a quantitative Baum-Connes assembly ma...

To some Hecke symmetries (i.e. Yang-Baxter braidings of Hecke type) we assign algebras called braided non-commutative spheres. For any such algebra, we introduce and compute a q-analog of the Chern-Connes index. Unlike the standard Chern-Connes index, ours is based on the so-called categorical trace specific for a braided category in which the algebra in question is represented. AMS Mathematics...

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...

The use of computer simulations has revolutionized the way engineers design and improve products and affects all design stages from concept to realization. As a consequence optimization has become an important tool for the engineer to realize better designs without the need of extensive prototype building. One of the algorithms that has shown an important ability to deal with this type of optim...

In this note, we exhibit a method to prove the Baum-Connes conjecture (with coefficients) for extensions with finite quotients of certain groups which already satisfy the Baum-Connes conjecture. Interesting examples to which this method applies are torsion-free finite extensions of the pure braid groups, e.g. the full braid groups. The Baum-Connes conjecture (in this note the term will always m...

We present a simple primal-dual algorithm for computing approximate Nash equilibria in two-person zero-sum sequential games with incomplete information and perfect recall (like Texas Hold’em poker). Our algorithm only performs basic iterations (i.e matvec multiplications, clipping, etc., and no calls to external first-order oracles, no matrix inversions, etc.) and is applicable to a broad class...

In this paper, we investigate, for a locally compact groupG, the operator amenability of the Fourier-Stieltjes algebra B(G) and of the reduced Fourier-Stieltjes algebra Br(G). The natural conjecture is that any of these algebras is operator amenable if and only if G is compact. We partially prove this conjecture with mere operator amenability replaced by operator C-amenability for some constant...

Over a field of characteristic zero, we introduce two motivic operations on additive higher Chow cycles: analogues of the Connes boundary B operator and the shuffle product on Hochschild complexes. The former allows us to apply the formalism of mixed complexes to additive Chow complexes building a bridge between additive higher Chow theory and additive K-theory. The latter induces a wedge produ...

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Approximate KKT and Approximate Gradient Projection conditions are analyzed in this work. These conditions are not necessarily equivalent. Implications between different conditions and counter-examples will be shown. Algorithmic consequences will be discussed.