Related papers: Enumerating Colorings, Tensions and Flows in Cell …
We present an explicit family of hypergraphs with arbitrarily large uniformity and chromatic number that admit realizations in both geometric and number-theoretic settings. As an application, we give a new proof of a theorem of Chen, Pach,…
The study of nowhere-zero flows began with a key observation of Tutte that in planar graphs, nowhere-zero k-flows are dual to k-colourings (in the form of k-tensions). Tutte conjectured that every graph without a cut-edge has a nowhere-zero…
The properties of semidilute polymer solutions are investigated at equilibrium and under shear flow by mesoscale simulations, which combine molecular dynamics simulations and the multiparticle collision dynamics approach. In semidilute…
Graph colorings are becoming an increasingly useful family of mathematical models for a broad range of applications, such as time tabling and scheduling, frequency assignment, register allocation, computer security and so on. Graph proper…
The intersection numbers of moduli spaces of stable curves $\overline{\mathcal{M}}_{g,m}$ are well-studied and are known to have rich combinatorial structure. We introduce a natural class of these intersection numbers $\omega_{G,g,m}$…
Dynamical systems with quadratic or polynomial drift exhibit complex dynamics, yet compared to nonlinear systems in general form, are often easier to analyze, simulate, control, and learn. Results going back over a century have shown that…
We consider some problems concerning the maximum number of (strong) dominating sets in a regular graph, and their weighted analogues. Our primary tool is Shearer's entropy lemma. These techniques extend to a reasonably broad class of graph…
We propose a consistent expression for the relativistic quadri-force referring to the classical interaction between a coloured particle and a scalar field multiplete. General aspects of the resultant equations of motion are discussed as…
A total coloring of a graph $G = (V, E)$ is an assignment of colors to vertices and edges such that neither two adjacent vertices nor two incident edges get the same color, and, for each edge, the end-points and the edge itself receive…
We calculate the chromatic polynomials $P$ for $n$-vertex strip graphs of the form $J(\prod_{\ell=1}^m H)I$, where $J$ and $I$ are various subgraphs on the left and right ends of the strip, whose bulk is comprised of $m$-fold repetitions of…
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic…
The degree chromatic polynomial $Pm(G,k)$ of a graph $G$ counts the number of $k$-colorings in which no vertex has $m$ adjacent vertices of its same color. We prove Humpert and Martin's conjecture on the leading terms of the degree…
The chromatic polynomial and its generalization, the chromatic symmetric function, are two important graph invariants. Celebrated theorems of Birkhoff, Whitney, and Stanley show how both objects can be expressed in three different ways: as…
We derive some new structural results for the transfer matrix of square-lattice Potts models with free and cylindrical boundary conditions. In particular, we obtain explicit closed-form expressions for the dominant (at large |q|) diagonal…
A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between colorings and flows to design an efficient algorithm for…
We study a stochastic model of a copolymerization process that has been extensively investigated in the physics literature. The main questions of interest include: (i) what are the criteria for transience, null recurrence, and positive…
Using the framework of the Chromo Dielectric Model we perform an analysis of color electric flux tubes in meson-like $q\bar{q}$ and baryon-like $qqq$ quark configurations. We discuss the Abelian color structure of the model and point out a…
In 1982 V\'{i}ctor Neumann-Lara introduced the dichromatic number of a digraph $D$ as the smallest integer $k$ such that the vertices $V$ of $D$ can be colored with $k$ colors and each color class induces an acyclic digraph. Later a flow…
A recently proposed renormalization group technique, based on the hierarchical structures present in theories with fluctuating geometry, is implemented in the model of branched polymers. The renormalization group equations can be solved…
This article is built upon three main ideas. First, for a class of monomial ideals, it is proven that the multiplicity of an ideal equals the number of realizations of its codimension (an intuitive concept that we define later). Next, for…