arXiv math/06095162006-09-19math.COmath.GT

Lectures on Topology of Words

Vladimir Turaev

备注：: 40 pages, lecture notes for a series of lectures given in RIMS, Kyoto University in February 2006

英文摘要：

We discuss a topological approach to words introduced by the author. Words on an arbitrary alphabet are approximated by Gauss words and then studied up to natural modifications inspired by the Reidemeister moves on knot diagrams. This leads us to a notion of homotopy for words. We introduce several homotopy invariants of words and give a homotopy classification of words of length five.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Fullerenes, Polytopes and Toric Topology

The lectures are devoted to a remarkable class of $3$-dimensional polytopes, which are mathematical models of the important object of quantum physics, quantum chemistry and nanotechnology -- fullerenes. The main goal is to show how results of toric topology help to build combinatorial invariants of fullerenes. Main notions are introduced during the lectures. The lecture notes are addressed to a wide audience.

2016-09-09math.ATmath.CO

Topology of words

We introduce a topological approach to words. Words are approximated by Gauss words and then studied up to natural modifications inspired by homotopy transformations of curves on the plane.

2005-05-30math.COmath.GT

Topology of random simplicial complexes: a survey

This expository article is based on a lecture from the Stanford Symposium on Algebraic Topology: Application and New Directions, held in honor of Gunnar Carlsson, Ralph Cohen, and Ib Madsen.

2013-10-23math.ATmath.COmath.PR

Poset Topology: Tools and Applications

These lecture notes for the IAS/Park City Graduate Summer School in Geometric Combinatorics (July 2004) provide an overview of poset topology. These notes include introductory material, as well as recent developments and open problems. Some of the topics covered are: subspace arrangements, graph complexes, group actions on poset homology, shellability, recursive techniques, and fiber theorems.

2006-02-11math.CO

On Generalization of Homotopy of Words and Its Applications

V. Turaev introduced the theory of topology of words and phrases in 2005. This is a combinatorialy extension of the theory of virtual knots and links. In this paper we generalize the notion of homotopy of words and phrases and we give geometric meanings of the generalized homotopy of words. Moreover using the generalized homotopy theory of words and phrases, we extend some homotopy invariants of nanophrases to $S$-homotopy invariant of nanowords with some homotopy data $S$.

2009-10-29math.COmath.GT

Homotopy Classification of Generalized Phrases in Turaev's Theory of Words

In 2005 V. Turaev introduced the theory of topology of words and phrases. Turaev defined an equivalence relation on generalized words and phrases which is called homotopy. This is suggested by the Reidemeister moves in the knot theory. Then Turaev gave the homotopy classification of generalized words with less than or equal to five letters. In this paper we give the classification of generalized phrases up to homotopy with less than or equal to three letters. To do this we construct a new homotopy invariant for nanophrases over any $α$.

2009-04-27math.COmath.GT

更多相关论文收起更多论文

Counting Irreducible Double Occurrence Words

A double occurrence word $w$ over a finite alphabet $Σ$ is a word in which each alphabet letter appears exactly twice. Such words arise naturally in the study of topology, graph theory, and combinatorics. Recently, double occurrence words have been used for studying DNA recombination events. We develop formulas for counting and enumerating several elementary classes of double occurrence words such as palindromic, irreducible, and strongly-irreducible words.

2011-05-15math.CO

Topology of scrambled simplices

In this paper we define a family of topological spaces, which contains and vastly generalizes the higher-dimensional Dunce hats. Our definition is purely combinatorial, and is phrased in terms of identifications of boundary simplices of a~standard d-simplex. By virtue of the construction, the obtained spaces may be indexed by words, and they automatically carry the structure of a $Δ$-complex. As our main result, we completely determine the homotopy type of these spaces. In fact, somewhat surprisingly, we are able to prove that each of them is either contractible or homotopy equivalent to an od…

2018-01-18math.ATmath.CO