Bridges and Hamiltonian circuits in planar graphs.
Brown's representability theorem and branched coverings.
Brunnian links
A Brunnian link is a set of n linked loops such that every proper sublink is trivial. Simple Brunnian links have a natural algebraic representation. This is used to determine the form, length and number of minimal simple Brunnian links. Braids are used to investigate when two algebraic words represent equivalent simple Brunnian links that differ only in the arrangement of the component loops.
Brunnian links are determined by their complements.
Brunnian local moves of knots and Vassiliev invariants
K. Habiro gave a neccesary and sufficient condition for knots to have the same Vassiliev invariants in terms of -moves. In this paper we give another geometric condition in terms of Brunnian local moves. The proof is simple and self-contained.
Bundles and finite foliations.
Burnside obstructions to the Montesinos-Nakanishi 3-move conjecture.
Cacti, braids and complex polynomials.
Calcul différentiel libre
Calculation of the Casson-Walker-Lescop invariant from chord diagrams
Calculations with the Temperley - Lieb algebra.
Calculus of clovers and finite type invariants of 3-manifolds.
Can computers discover ideal knots?
Cancellation of lattices and finite two-complexes.
Cannon-Thurston Maps, i-bounded Geometry and a Theorem of McMullen
The notion of i-bounded geometry generalises simultaneously bounded geometry and the geometry of punctured torus Kleinian groups. We show that the limit set of a surface Kleinian group of i-bounded geometry is locally connected by constructing a natural Cannon-Thurston map.
Canonical decompositions of 3-manifolds.
Canonical representatives and equations in hyperbolic groups.
Cappell-Shaneson's 4-dimensional -cobordism.
Casson invariant of links of singularities.
Catégorification des coefficients de la matrice de la représentation de Burau
Nous catégorifions explicitement les coefficients de la matrice de la représentation de Burau en utilisant des méthodes géométriques élémentaires. Nous montrons que cette catégorification est fidèle dans le sens où elle détecte la tresse triviale.