In this note we point out and fill a gap in the proof by Julg-Kasparov of the Baum-Connes conjecture with coefficients for discrete subgroups of $\op{SU}(n,1)$. The issue at stake is the proof that the complex powers of the contact Laplacian are element of the Heisenberg calculus. In particular, we explain why we cannot implement into the setting of the Heisenberg calculus the classical Seeley's approach to complex powers.
The number |K| of non-isotopic framed knots that correspond to a given unframed knot K ⊂ S 3 is infinite. This follows from the existence of the self-linking number slk of a zero homologous framed knot. We use the approach of Vassiliev–Goussarov invariants to construct "affine self-linking numbers" that are extensions of slk to the case of nonzero homologous framed knots in 3-manifolds. As a corollary we get that |K| = ∞ for all knots in an oriented (not necessarily compact) 3-manifold M that is not realizable as a connected sum (S 1 × S 2 )# M′. This result for compact manifolds was first stated by Hoste and Przytycki. They referred to the works of McCullough for the idea of the proof, however to the best of our knowledge prior to this work the proof of this fundamental fact was not given in literature or in a preprint form. Our proof is based on different ideas. For M = (S 1 × S 2 )# M′ we construct K in M such that |K| = 2 ≠∞.
Abstract. Artin’s braid groups currently provide a promising background for cryptographical applications, since the first cryptosystems using braids were introduced in [2, 3, 18] (see also [22]). A variety of key agreement protocols based on braids have been described, but few authentication or signature schemes have been proposed so far. We introduce three authentication schemes based on braids, two of them being zero-knowledge interactive proofs of knowledge. Then we discuss their possible implementations, involving normal forms or an alternative braid algorithm, called handle reduction, which can achieve good efficiency under specific requirements. 1.
The notion of a zero knowledge interactive proof that one party "knows" some secret information is explored. It is shown that any "random self-reducible" problem has a zero knowledge interactive proof of this sort. The zero knowledge interactive proofs for graph isomorphism, quadratic residuosity, and "knowledge" of discrete logarithms all follow as special cases. Based on these results, new zero knowledge interactive proofs are exhibited for "knowledge" of the factorization of an integer, nonmembership in cyclic subgroups of Zp*, and determining whether an element generates Zp*. None of these proofs relies on any unproven assumptions.