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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Lectures on Topology of Words
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.
math.COmath.GT
Cobordism of words
We introduce an equivalence relation, called cobordism, for words and study cobordism invariants of words inspired by methods of low-dimensional topology.
math.COmath.GT
Simplified numerical form of universal finite type invariant of Gauss words
In the present paper, we study the finite type invariants of Gauss words. In the Polyak algebra techniques, we reduce the determination of the group structure to transformation of a matrix into its Smith normal form and we give the simplified form of a universal finite type invariant by means of the isomorphism of this transformation. The advantage of this process is that we can implement it as a computer program. We obtain the universal finite type invariant of degree 4, 5, and 6 explicitly. Moreover, as an application, we give the complete classification of Gauss words of rank 4 and the part…
math.COmath.GT
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…
math.ATmath.CO
A topological characterization of Gauss codes
A (smooth) embedding of a closed curve on the plane with finitely many intersections is said to be generic if each point of self-intersection is crossed exactly twice and at non-tangent angles. A finite word $ω$ where each character occurs twice is a Gauss code if it can be obtained as the sequence of traversed self-intersections of a generic plane embedding of a close curved $γ$. Then $γ$ is said to realize $ω$. We present a characterization of Gauss codes using Seifert cycles. The characterization is given by an algorithm that, given a Gauss code $ω$ as input, it outputs a combinatorial plan…
cs.DMmath.CO
