Related papers: Constructing Goeritz matrix from Dehn coloring mat…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
We build generalizations of the Grassmann algebras from a few simple assumptions which are that they are graded, maximally symmetric and contain an ordinary Grassmann algebra as a subalgebra. These algebras are graded by Z_{n}^{3} and…
A classical knot is described by a one-stroke trajectory with entanglements of a string. The replica method appears as a powerful tool in statistical mechanics for a polymer or self-avoiding walk. We consider this replica N to 0 limit in…
The theory of generalized locally Toeplitz (GLT) sequences is an apparatus for computing the spectral and singular value distribution of sequences of matrices that possess a (possibly hidden) Toeplitz-like structure. Sequences of this kind,…
We associate a moduli space M(G) to a planar trivalent graph G. We proved several decomposition properties of M(G), which implies that the Euler characteristic of M(G) equals to the number of Tait colorings of G when G is bipartite. Then we…
Let $2\le k\in\mathbb{Z}$. A total coloring of a$k$-regular simple graph via $k+1$ colors is an efficient total coloring if each color yields an efficient dominating set, where the efficient domination condition applies to the restriction…
There is a profound connection between copositive matrices and graph theory. Copositive matrices provide a powerful tool for formulating and solving various challenging graph-related problems. Conversely, graph theory provides a rich set of…
This paper presents a new algorithm "A" for constructing Seifert surfaces from n-bridge projections of links. The algorithm produces minimal complexity surfaces for large classes of braids and alternating links. In addition, we consider a…
The set consisting of all rotations of the Euclidean plane is equipped with a quandle structure. We show that a knot is colorable by this quandle if and only if its Alexander polynomial has a root on the unit circle in $\mathbb{C}$. Further…
In this paper, we construct a differential graded Lie algebra whose Maurer-Cartan elements are given by crossed homomorphisms on Leibniz algebras. This allows us to define cohomology for a crossed homomorphism. Finally, we study linear…
The Wiener index of a vertex coloring of a graph is defined to be the sum of all pairwise geodesic distances between vertices of the same color. We provide characterizations of vertex colorings of paths and cycles whose Wiener index is as…
The pair (K,r) consisting of a knot K and a surjective map r from the knot group onto a dihedral group is said to be a p-colored knot. D. Moskovich conjectured that for any odd prime p there are exactly p equivalence classes of p-colored…
Colored tensor models have recently burst onto the scene as a promising conceptual and computational tool in the investigation of problems of random geometry in dimension three and higher. We present a snapshot of the cutting edge in this…
Membranes holomorphically embedded in flat noncompact space are constructed in terms of the degrees of freedom of an infinite collection of 0-branes. To each holomorphic curve we associate infinite-dimensional matrices which are static…
The Grundy number of a graph is the maximal number of colors attained by a first-fit coloring of the graph. The class of Cameron graphs is the Seidel switching class of cographs. In this paper we show that the Grundy number is computable in…
In two previous papers, we exposed a combinatorial approach to the program of Geometry of Interaction, a program initiated by Jean-Yves Girard. The strength of our approach lies in the fact that we interpret proofs by simpler structures -…
The first-fit coloring is a heuristic that assigns to each vertex, arriving in a specified order $\sigma$, the smallest available color. The problem Grundy Coloring asks how many colors are needed for the most adversarial vertex ordering…
A modified $k$-deck of a graph $G$ is obtained by removing $k$ edges of $G$ in all possible ways, and adding $k$ (not necessarily new) edges in all possible ways. Krasikov and Roditty asked if it was possible to construct the usual $k$-edge…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
Given a finite simple graph G=(V,E) with chromatic number c and chromatic polynomial C(x). Every vertex graph coloring f of G defines an index i_f(x) satisfying the Poincare-Hopf theorem sum_x i_f(x)=chi(G). As a variant to the index…