Related papers: Constructing Goeritz matrix from Dehn coloring mat…
Color refinement is an important technique that works very well in practice for the graph isomorphism problem. Tinhofer graphs are the class of graphs for which refinement together with individualization correctly tests graph isomorphism…
We describe a wide class of polynomials, which is a natural generalization of Hurwitz stable polynomials. We also give a detailed account of so-called self-interlacing polynomials, which are dual to Hurwitz stable polynomials but have only…
The concept of centrally symmetric configurations of integer matrices is introduced. We study the problem when the toric ring of a centrally symmetric configuration is normal as well as is Gorenstein. In addition, Gr\"obner bases of toric…
A theory about the implication structure in graph coloring is presented. Discovering hidden relations is a crucial activity in every scientific discipline. The development of mathematical models to study and discover such hidden relations…
K\H{o}nig's edge-coloring theorem for bipartite graphs and Vizing's edge-coloring theorem for general graphs are celebrated results in graph theory and combinatorial optimization. Schrijver generalized K\H{o}nig's theorem to a framework…
For $n\leq 6$, we compute the integral Chow ring of every modular compactification of $\mathcal{M}_{1,n}$ parametrising only Gorenstein curves with smooth, distinct markings. These include the Deligne--Mumford, Schubert, and Smyth…
We study variants of the well-known Collatz graph, by considering the action of the 3n+1 function on congruence classes. For moduli equal to powers of 2, these graphs are shown to be isomorphic to binary De Bruijn graphs. Unlike the Collatz…
We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…
A new calculus of planar diagrams involving diagrammatics for biadjoint functors and degenerate affine Hecke algebras is introduced. The calculus leads to an additive monoidal category whose Grothendieck ring contains an integral form of…
In this paper, we introduce a novel way to use geometric deep learning for knot data by constructing a functor that takes knots to graphs and using graph neural networks. We will attempt to predict several knot invariants with this…
We extend the notion of canonical ordering (initially developed for planar triangulations and 3-connected planar maps) to cylindric (essentially simple) triangulations and more generally to cylindric (essentially internally) $3$-connected…
Given an undirected graph $G=(V,E)$ with a set of vertices $V$ and a set of edges $E$, a graph coloring problem involves finding a partition of the vertices into different independent sets. In this paper we present a new framework that…
We introduce and begin the study of new knot energies defined on knot diagrams. Physically, they model the internal energy of thin metallic solid tori squeezed between two parallel planes. Thus the knots considered can perform the second…
The graph coloring problem asks for an assignment of the minimum number of distinct colors to vertices in an undirected graph with the constraint that no pair of adjacent vertices share the same color. The problem is a thoroughly studied…
Coupled nonlinear integrable systems are generated from usual zero curvature equation. The relevant Maurer-Cartan forms are constructed by combining suitably chosen matrices (nilpotent, Hadamard, idempotent and k-idempotent) and Lie…
We develop the first parallel graph coloring heuristics with strong theoretical guarantees on work and depth and coloring quality. The key idea is to design a relaxation of the vertex degeneracy order, a well-known graph theory concept, and…
Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…
Starting from the vacuum, iterated Grassmann-algebra formation consecutively introduces vector spaces and groups with the structure first of charge, then of isospin, then of color.
Construction of (colored) knot polynomials for double-fat graphs is further generalized to the case when "fingers" and "propagators" are substituting R-matrices in arbitrary closed braids with m-strands. Original version of arXiv:1504.00371…
According to generalized Mellin derivative (Kargin), we introduce a new family of polynomials called higher order generalized geometric polynomials. We obtain some properties of them.We discuss their connections to degenerate Bernoulli and…