Related papers: Link colorings and the Goeritz matrix
We obtain the full list of Goeritz invariants of all torus knots and links.
By a $z$-coloring of a graph $G$ we mean any proper vertex coloring consisting of the color classes $C_1, \ldots, C_k$ such that $(i)$ for any two colors $i$ and $j$ with $1 \leq i < j \leq k$, any vertex of color $j$ is adjacent to a…
The aim of this text is to establish some relations between Markov chains in Dirichlet Environments on directed graphs and certain hypergeometric integrals associated with a particular arrangement of hyperplanes. We deduce from these…
The plotting of Riemann surfaces by computational software is discussed. The link between the branches of a multi-valued function $g(z)$, defined on the range of $g(z)$, and a Riemann surface, defined on the domain of $g(z)$, is emphasized.…
We confirm the equitable $\Delta$-coloring conjecture for interval graphs and establish the monotonicity of equitable colorability for them. We further obtain results on equitable colorability about square (or Cartesian) and cross (or…
A coloring of a graph G = (V,E) is a partition {V1, V2, . . ., Vk} of V into independent sets or color classes. A vertex v Vi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj . A coloring is a Grundy…
The notion of a welded link was introduced by Fenn, Rim\'anyi, and Rourke as an analogue of welded braids. A welded link is defined as an equivalence class of link diagrams that may contain virtual crossings, where the equivalence is…
For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed.
In this letter, we propose high order layered complex networks. The synchronization is discussed in detail. The relations of synchronization, individual coupling matrices and the intrinsic function of the uncoupled system are given. As…
Some relations between cohomological dimensions and depths of linked ideals are investigated and discussed by various examples.
The extreme degrees of the colored Jones polynomial of any link are bounded in terms of concrete data from any link diagram. It is known that these bounds are sharp for semi-adequate diagrams. One of the goals of this paper is to show the…
Using random matrix technique we determine an exact relation between the eigenvalue spectrum of the covariance matrix and of its estimator. This relation can be used in practice to compute eigenvalue invariants of the covariance…
Gy\'arf\'as famously showed that in every $r$-coloring of the edges of the complete graph $K_n$, there is a monochromatic connected component with at least $\frac{n}{r-1}$ vertices. A recent line of study by Conlon, Tyomkyn, and the second…
We give a shorter and simpler proof of the result of [2], which gives a necessary and sufficient condition for when a lattice diagram is the projection of a lattice link.
In this paper, a relationship between the determinant of an alternating link and a certain polytope obtained from the link diagram is analyzed. We also show that when the underlying graph of the link diagram is properly oriented, the number…
An updated review is presented of our understanding of color confinement. Lattice results on condensation of magnetic charges are discussed. The role of vortices is analysed.
The dynamics of coupled intermittent maps is used to model the correlated structure of genomic sequences. The use of intermittent maps, as opposed to other simple chaotic maps, is particularly suited for the production of long range…
We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.
Graph colorings is a fundamental topic in graph theory that require an assignment of labels (or colors) to vertices or edges subject to various constraints. We focus on the harmonious coloring of a graph, which is a proper vertex coloring…
The known correspondence between the Kronig-Penney model and certain Jacobi matrices is extended to a wide class of Schroedinger operators on graphs. Examples include rectangular lattices with and without a magnetic field, or comb-shaped…