The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 221 –
240 of
643
We give a homotopy classification of nanophrases with at most four letters. It is an extension of the classification of nanophrases of length 2 with at most four letters, given by the author in a previous paper. As a corollary, we give a stable classification of ordered, pointed, oriented multi-component curves on surfaces with minimal crossing number less than or equal to 2 such that any equivalent curve has no simply closed curves in its components.
We formulate first results of our larger project based on first fixing some easily accessible invariants of topological spaces (typically the cup product structure in low dimensions) and then studying the variations of more complex invariants such as (the homotopy Lie algebra) or (the graded Lie algebra associated to the lower central series of the fundamental group). We prove basic rigidity results and give also an application in low-dimensional topology.
We collect several results on the determination of hyperbolic knots by means of their cyclic branched covers. We construct examples of knots having two common cyclic branched covers. Finally, we briefiy discuss the problem of determination of hyperbolic links.
Nous considérons un germe de feuilletage holomorphe singulier non-dicritique défini sur une boule fermée , satisfaisant des hypothèses génériques, de courbe de séparatrice . Nous démontrons l’existence d’un voisinage ouvert de dans tel que, pour toute feuille de , l’inclusion naturelle induit un monomorphisme au niveau du groupe fondamental. Pour cela, nous introduisons la notion géométrique de « connexité feuilletée » avec laquelle nous réinterprétons la notion d’incompressibilité....
We show that, given any n and α, any embedding of any sufficiently large complete graph in ℝ³ contains an oriented link with components Q₁, ..., Qₙ such that for every i ≠ j, and , where denotes the second coefficient of the Conway polynomial of .
Currently displaying 221 –
240 of
643