相关论文: Constructing Goeritz matrix from Dehn coloring mat…

We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…

We introduce a new method to construct a Grothendieck category from a given colored quiver. This is a variant of the construction used to prove that every partially ordered set arises as the atom spectrum of a Grothendieck category. Using…

Transfer-Matrix Methods originated in physics where they were used to count the number of allowed particle states on a structure whose width $n$ is a parameter. Typically, the number of states is exponential in $n.$ One more mathematical…

We provide a short proof of a conic version of the colorful Carath\'eodory theorem for oriented matroids. Holmsen's extension of the colorful Carath\'eodory theorem to oriented matroids (Advances in Mathematics, 2016) already encompasses…

A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we show a cograph that has a balanced cotree $T_{G}(a_{1},\ldots,a_{r-1},0|0,\ldots,0,a_{r})$ is integral computing its spectrum. As an…

An invariant of knots is constructed from an integral for geometric braids due to Kohno and Kontsevich. It takes values in a quotient by a certain ideal of the algebra generated by chord diagrams over the circle.

The theory of colorful graphs can be developed by working in Galois field modulo (p), p > 2 and a prime number. The paper proposes a program of possible conversion of graph theory into a pleasant colorful appearance. We propose to paint the…

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

Let $K= K(w,b,t)$ be a 1-bridge braid in a solid torus $V$, and let $\gamma$ be a $(p,q)$ curve on the torus $T = \partial V$ of the exterior $M_K$ of $K$. It will be shown that Dehn filling on $T$ along $\gamma$ produces a solid torus if…

Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become colored. A zero forcing set is a set of initially colored…

Einstein-Rosen waves with two polarizations are cylindrically symmetric solutions to vacuum Einstein equations. Einstein equations in this case reduce to an integrable system. In 1971, Geroch has shown that this system admits an…

On spaces of constant curvature, the geodesic equations automatically have higher order integrals, which are just built out of first order integrals, corresponding to the abundance of Killing vectors. This is no longer true for general…

A dimer model is a quiver with faces embedded into a disk. A consistent dimer model gives rise to a strand diagram, and hence to a positroid. The Gorenstein-projective module category over the completed boundary algebra of a dimer model was…

In this paper, we consider minimum numbers of colors of knots for Dehn colorings. In particular, we will show that for any odd prime number $p$ and any Dehn $p$-colorable knot $K$, the minimum number of colors for $K$ is at least $\lfloor…

In this paper we have given a unified graph coloring algorithm for planar graphs. The problems that have been considered in this context respectively, are vertex, edge, total and entire colorings of the planar graphs. The main tool in the…

Given a graph G (or more generally a matroid embedded in a projective space), we construct a sequence of varieties whose geometry encodes combinatorial information about G. For example, the chromatic polynomial of G (giving at each m>0 the…

In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected)…

In the 1970's, Lov\'asz built a bridge between graphs and alternating matrix spaces, in the context of perfect matchings (FCT 1979). A similar connection between bipartite graphs and matrix spaces plays a key role in the recent resolutions…

Margalit and Schleimer constructed nontrivial roots of the Dehn twist about a nonseparating curve. We prove that the conjugacy classes of roots of the Dehn twist about a nonseparating curve correspond to the conjugacy classes of periodic…

We construct a Cartesian product G x H for finite simple graphs. It satisfies the Kuenneth formula: H^k(G x H) is a direct sum of tensor products H^i(G) x H^j(G) with i+j=k and so p(G x H,x) = p(G,x) p(H,y) for the Poincare polynomial…