Strings And Colorings Of Topological Coding Towards Asymmetric Topology Cryptography

We, for anti-quantum computing, will discuss various number-based strings, such as number-based super-strings, parameterized strings, set-based strings, graph-based strings, integer-partitioned and integer-decomposed strings, Hanzi-based strings, as well as algebraic operations based on number-based strings. Moreover, we introduce number-based string-colorings, magic-constraint colorings, and vector-colorings and set-colorings related with strings. For the technique of encrypting the entire network at once, we propose graphic lattices related with number-based strings, Hanzi-graphic lattices, string groups, all-tree-graphic lattices. We study some topics of asymmetric topology cryptography, such as topological signatures, Key-pair graphs, Key-pair strings, one-encryption one-time and self-certification algorithms. Part of topological techniques and algorithms introduced here are closely related with NP-complete problems or NP-hard problems.Comment: Asymmetric topology encryption is a new topic of topological coding towards the certificateless public key cryptograph

Algebraic Analysis of Vertex-Distinguishing Edge-Colorings

Vertex-distinguishing edge-colorings (vdec colorings) are a restriction of proper edge-colorings. These special colorings require that the sets of edge colors incident to every vertex be distinct. This is a relatively new field of study. We present a survey of known results concerning vdec colorings. We also define a new matrix which may be used to study vdec colorings, and examine its properties. We find several bounds on the eigenvalues of this matrix, as well as results concerning its determinant, and other properties. We finish by examining related topics and open problems

A lower bound for the number of Reidemeister moves of type III

We study the number of Reidemeister type III moves using Fox n-colorings of knot diagrams.Comment: Dedicated to Professor Louis H. Kauffman for his 60th birthda

Knot Theory: from Fox 3-colorings of links to Yang-Baxter homology and Khovanov homology

This paper is an extended account of my "Introductory Plenary talk at Knots in Hellas 2016" conference We start from the short introduction to Knot Theory from the historical perspective, starting from Heraclas text (the first century AD), mentioning R.Llull (1232-1315), A.Kircher (1602-1680), Leibniz idea of Geometria Situs (1679), and J.B.Listing (student of Gauss) work of 1847. We spend some space on Ralph H. Fox (1913-1973) elementary introduction to diagram colorings (1956). In the second section we describe how Fox work was generalized to distributive colorings (racks and quandles) and eventually in the work of Jones and Turaev to link invariants via Yang-Baxter operators, here the importance of statistical mechanics to topology will be mentioned. Finally we describe recent developments which started with Mikhail Khovanov work on categorification of the Jones polynomial. By analogy to Khovanov homology we build homology of distributive structures (including homology of Fox colorings) and generalize it to homology of Yang-Baxter operators. We speculate, with supporting evidence, on co-cycle invariants of knots coming from Yang-Baxter homology. Here the work of Fenn-Rourke-Sanderson (geometric realization of pre-cubic sets of link diagrams) and Carter-Kamada-Saito (co-cycle invariants of links) will be discussed and expanded. Dedicated to Lou Kauffman for his 70th birthday.Comment: 35 pages, 31 figures, for Knots in Hellas II Proceedings, Springer, part of the series Proceedings in Mathematics & Statistics (PROMS

On the Number of Synchronizing Colorings of Digraphs

We deal with $k$-out-regular directed multigraphs with loops (called simply \emph{digraphs}). The edges of such a digraph can be colored by elements of some fixed $k$-element set in such a way that outgoing edges of every vertex have different colors. Such a coloring corresponds naturally to an automaton. The road coloring theorem states that every primitive digraph has a synchronizing coloring. In the present paper we study how many synchronizing colorings can exist for a digraph with $n$ vertices. We performed an extensive experimental investigation of digraphs with small number of vertices. This was done by using our dedicated algorithm exhaustively enumerating all small digraphs. We also present a series of digraphs whose fraction of synchronizing colorings is equal to $1-1/k^d$, for every $d \ge 1$ and the number of vertices large enough. On the basis of our results we state several conjectures and open problems. In particular, we conjecture that $1-1/k$ is the smallest possible fraction of synchronizing colorings, except for a single exceptional example on 6 vertices for $k=2$.Comment: CIAA 2015. The final publication is available at http://link.springer.com/chapter/10.1007/978-3-319-22360-5_1