Related papers: A Gessel-Viennot-type method for cycle systems in …
The author gave a proof of a generalization of the Aztec diamond theorem for a family of $4$-vertex regions on the square lattice with southwest-to-northeast diagonals drawn in (Electron. J. Combin., 2014) by using a bijection between…
A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in directed graphs is well studied and is known to be hard. One of…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…
This note derives the characteristic polynomial of a graph that represents nonjump moves in a generalized game of checkers. The number of spanning trees is also determined.
We introduce a family of domino tilings that includes tilings of the Aztec diamond and pyramid partitions as special cases. These tilings live in a strip of $\mathbb{Z}^2$ of the form $1 \leq x-y \leq 2\ell$ for some integer $\ell \geq 1$,…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
We introduce a general model of dimer coverings of certain plane bipartite graphs, which we call rail yard graphs (RYG). The transfer matrices used to compute the partition function are shown to be isomorphic to certain operators arising in…
We introduce an adic (Bratteli-Vershik) dynamical system based on a diagram whose path counts from the root are the Delannoy numbers. We identify the ergodic invariant measures, prove total ergodicity for each of them, and initiate the…
In this article we define a generalization of the domino shuffling algorithm for tilings of the Aztec diamond to the interacting $k$-tilings recently introduced by S. Corteel, A. Gitlin, and the first author. We describe the algorithm both…
In this paper, we study discrete Lyapunov models, which consist of steady-state distributions of first-order vector autoregressive models. The parameter matrix of such a model encodes a directed graph whose vertices correspond to the…
We revisit the concepts of acyclic orderings and number of acyclic orderings of acyclic digraphs in terms of dispositions and counters for arbitrary multidigraphs. We prove that when we add a sequence of nested directed paths to a directed…
A polynomial-time exact algorithm for counting the number of directed acyclic graphs in a Markov equivalence class was recently given by Wien\"obst, Bannach, and Li\'skiewicz (AAAI 2021). In this paper, we consider the more general problem…
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
Consider a weighted directed acyclic graph $G$ having an upward planar drawing. We give a formula for the total weight of the families of non-intersecting paths on $G$ with any given starting and ending points. While the…
We study directed random graphs (random graphs whose edges are directed), and present new results on the so-called strong components of those graphs. We provide analytic and simulation results on two special classes of strong component,…
For various sets of tiles, we count the ways to tile an Aztec diamond of order $n$ using tiles from that set. The resulting function $f(n)$ often has interesting behavior when one looks at $n$ and $f(n)$ modulo powers of 2.
Random domino tilings of the Aztec diamond shape exhibit interesting features and some of the statistical properties seen in random matrix theory. As a statistical mechanical model it can be thought of as a dimer model or as a certain…
We introduce the arrow product, a systematic generating function technique for directed graph enumeration. It provides short proofs for previous results of Gessel on the number of directed acyclic graphs and of Liskovets, Robinson and…
We use the subgraph replacement method to investigate new properties of the tilings of regions on the square lattice with diagonals drawn in. In particular, we show that the centrally symmetric tilings of a generalization of the Aztec…
We present Digenes, a new discovery system that aims to help researchers in graph theory. While its main task is to find extremal graphs for a given (function of) invariants, it also provides some basic support in proof conception. This has…