Related papers: Constructing Goeritz matrix from Dehn coloring mat…
Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…
A procedure is described to construct generalised Scherk-Schwarz uplifts of gauged supergravities. The internal manifold, fluxes, and consistent truncation Ansatz are all derived from the embedding tensor of the lower-dimensional theory. We…
Given a graph $G$ and color set $\{1, \ldots, k\}$, a $\textit{proper coloring}$ is an assignment of a color to each vertex of $G$ such that no two vertices connected by an edge are given the same color. The problem of drawing a proper…
We consider the graph $k$-colouring problem encoded as a set of polynomial equations in the standard way over $0/1$-valued variables. We prove that there are bounded-degree graphs that do not have legal $k$-colourings but for which the…
The aim of this paper is twofold. First, we introduce a new class of linearizations, based on the generalization of a construction used in polynomial algebra to find the zeros of a system of (scalar) polynomial equations. We show that one…
For a graph $H$ and integer $k \geq 1$, two functions $f, g$ from $V(H)$ into $\{1, \dots, k\}$ are adjacent if for all edges $uv$ of $H$, $f(u) \neq g(v)$. The graph of all such functions is the exponential graph $K_k^H$. El-Zahar and…
The theory of generalized locally Toeplitz (GLT) sequences was conceived as an apparatus for computing the spectral distribution of matrices arising from the numerical discretization of differential equations (DEs). The purpose of this…
A g-circulant matrix of order n is defined as a matrix of order n where each row is a right cyclic shift in g-places to the preceding row. Using number theory, certain nonnegative g-circulant real matrices are constructed. In particular, it…
Graph coloring is fundamental to distributed computing. We give the first sub-logarithmic distributed algorithm for coloring cluster graphs. These graphs are obtained from the underlying communication network by contracting nodes and edges,…
Starting from the geometric construction of the framed braid group, we define and study the framization of several Brauer-type monoids and also the set partition monoid, all of which appear in knot theory. We introduce the concept of…
Let $\text{Mod}(S_g)$ be the mapping class group of the closed orientable surface $S_g$ of genus $g \geq 1$. In this paper, we develop various methods for factoring periodic mapping classes into Dehn twists, up to conjugacy. As…
Graph coloring problems are a central topic of study in the theory of algorithms. We study the problem of partially coloring partially colorable graphs. For $\alpha \leq 1$ and $k \in \mathbb{Z}^+$, we say that a graph $G=(V,E)$ is…
Motivated by work of Kinoshita and Teraska, Lamm introduced the notion of a symmetric union, which can be constructed from a partial knot $J$ by introducing additional crossings to a diagram of $J \# -\!J$ along its axis of symmetry. If…
In this article we construct examples of derivations in matrix semirings. We study hereditary and inner derivations, derivatives of diagonal, triangular, Toeplitz, circulant matrices and of matrices of other forms and prove theorems for…
For every positive integer $n$, we construct a Hasse diagram with $n$ vertices and chromatic number $\Omega(n^{1/4})$, which significantly improves on the previously known best constructions of Hasse diagrams having chromatic number…
It is well known that the Lorenz system has $Z_2$-symmetry. Using introducted in math.DS/0105147 topological covering-coloring a new representation for the Lorenz system is obtained. Deleting coloring leads to the factorized Lorenz system…
The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…
We study the rational Kontsevich integral of torus knots. We construct explicitely a series of diagrams made of circles joined together in a tree-like fashion and colored by some special rational functions. We show that this series codes…
In this paper, we convert Collatz map into a simple conjugate iterative maps defined in [0,1]. Such maps are more familiar to us and easier to deal with. Some new features of this map are observed by this method. An interesting heuristic…
We generalize the notion of a coloring complex of a graph to linearized combinatorial Hopf monoids. We determine when a linearized combinatorial Hopf monoid has such a construction, and discover some inequalities that are satisfied by the…