Related papers: Dimer and fermionic formulations of a class of col…
We study the dimer model for a planar bipartite graph N embedded in a disk, with boundary vertices on the boundary of the disk. Counting dimer configurations with specified boundary conditions gives a point in the totally nonnegative…
The purpose of this paper is to derive some applications of umbral calculus by using extended fermionic p-adic q-integral on Zp. From those applications, we derive some new interesting properties on the new family of Euler numbers and…
We solve the classical square-lattice dimer model with periodic boundaries and in the presence of a field $\boldsymbol{t}$ that couples to the (vector) flux, by diagonalizing a modified version of Lieb's transfer matrix. After deriving the…
In some previous works, the analytic structure of the spectrum of a quantum graph operator as a function of the vertex conditions and other parameters of the graph was established. However, a specific local coordinate chart on the…
We introduce a fermionic formula associated with any quantum affine algebra U_q(X^{(r)}_N). Guided by the interplay between corner transfer matrix and Bethe ansatz in solvable lattice models, we study several aspects related to…
The $(1+1)$-dimensional two-color lattice QCD is studied with the Grassmann tensor renormalization group. We construct tensor network representations of theories with the staggered fermion and the Wilson fermion and show that Grassmann…
The problem of sampling edge-colorings of graphs with maximum degree $\Delta$ has received considerable attention and efficient algorithms are available when the number of colors is large enough with respect to $\Delta$. Vizing's theorem…
Let $G$ be a Class 1 graph with maximum degree $4$ and let $t\geq 5$ be an integer. We show that any proper $t$-edge coloring of $G$ can be transformed to any proper $4$-edge coloring of $G$ using only transformations on $2$-colored…
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is…
We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As particular examples, we explicitly give representatives of all equivalence classes of linear determinantal…
Let P_G(q) denote the number of proper q-colorings of a graph G. This function, called the chromatic polynomial of G, was introduced by Birkhoff in 1912, who sought to attack the famous four-color problem by minimizing P_G(4) over all…
We present an algorithm to automatically derive Feynman rules for lattice perturbation theory in background field gauge. Vertices with an arbitrary number of both background and quantum legs can be derived automatically from both gluonic…
The $q$-Coloring problem asks whether the vertices of a graph can be properly colored with $q$ colors. Lokshtanov et al. [SODA 2011] showed that $q$-Coloring on graphs with a feedback vertex set of size $k$ cannot be solved in time…
We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.
We define vertex-colourings for edge-partitioned digraphs, which unify the theory of P-partitions and proper vertex-colourings of graphs. We use our vertex-colourings to define generalized chromatic functions, which merge the chromatic…
We address the enumeration of properly q-colored planar maps, or more precisely, the enumeration of rooted planar maps M weighted by their chromatic polynomial \chi_M(q) and counted by the number of vertices and faces. We prove that the…
We develop a general scheme for the use of Fermi operators within the framework of integrable systems. This enables us to read off a fermionic Hamiltonian from a given solution of the Yang-Baxter equation and to express the corresponding…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…
We describe an algebraic algorithm which allows to express every one-loop lattice integral with gluon or Wilson-fermion propagators in terms of a small number of basic constants which can be computed with arbitrary high precision. Although…
The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…