Related papers: $3$D Farey graph, lambda lengths and $SL_2$-tiling…

This expository essay discusses a finite dimensional approach to dilation theory. How much of dilation theory can be worked out within the realm of linear algebra? It turns out that some interesting and simple results can be obtained. These…

We show that given a trivalent graph in $S^3$, either the graph complement contains an essential almost meridional planar surface or thin position for the graph is also bridge position. This can be viewed as an extension of a theorem of…

Continued fractions are linked to Stern's diatomic sequence 0,1,1,2,1,3,2,3,1,4,... (given by the recursion relation a_2n=a_n and a_{2n+1} = a_n + a_{n+1}, where a_0=0 and a_1=1), which has long been known. Using a particular…

We investigate the Yang-Lee edge singularity on non-planar random graphs, which we consider as the Feynman Diagrams of various d=0 field theories, in order to determine the value of the edge exponent. We consider the hard dimer model on…

Brane tilings are efficient mnemonics for Lagrangians of N=2 Chern-Simons-matter theories. Such theories are conjectured to arise on M2-branes probing singular toric Calabi-Yau fourfolds. In this paper, a simple modification of the…

We prove that for any finite tree $T$ with $n$ vertices and maximal degree $3$, there is a topological embedding of $T$ into the integer grid $Z^2$ which maps vertices to vertices and whose image meets at most $\frac{7}{3}n$ vertices. This…

We give a short introduction to the theory of twisted Alexander polynomials of a 3--manifold associated to a representation of its fundamental group. We summarize their formal properties and we explain their relationship to twisted…

In my 1993 paper, "Pappus's Theorem and the Modular Group", I explained how the iteration of Pappus's Theorem gives rise to a $2$-parameter family of representations of the modular group into the group of projective automorphisms. In this…

We develop a general embedding method based on the Friedman-Pippenger tree embedding technique (1987) and its algorithmic version, essentially due to Aggarwal et al. (1996), enhanced with a roll-back idea allowing to sequentially retrace…

Recently L. B. Beasley introduced $(2,3)$-cordial labelings of directed graphs in [1]. He made two conjectures which we resolve in this article. He conjectured that every orientation of a path of length at least five is $(2,3)$ cordial, and…

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…

We show that, up to minor-equivalence, the Farey graph is the unique minor-minimal graph that is infinitely edge-connected but such that every two vertices can be finitely separated.

Resolving parameters is a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences. In this article, we construct a class of Toeplitz graphs, and will be denoted by…

Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This…

It is well-known that every planar graph has a Tutte path, i.e., a path $P$ such that any component of $G-P$ has at most three attachment points on $P$. However, it was only recently shown that such Tutte paths can be found in polynomial…

Landry, Minsky and Taylor [LMT] introduced two polynomial invariants of veering triangulations -- the taut polynomial and the veering polynomial. We give algorithms to compute these invariants. In their definition [LMT] use only the upper…

Let $G$ be a graph on $n$ vertices, $p$ the order of a longest path and $\kappa$ the connectivity of $G$. In 1989, Bauer, Broersma Li and Veldman proved that if $G$ is a 2-connected graph with $d(x)+d(y)+d(z)\ge n+\kappa$ for all triples…

Let D be the distance matrix of a connected graph G and let nn(G), np(G) be the number of strictly negative and positive eigenvalues of D respectively. It was remarked in [1] that it is not known whether there is a graph for which np(G) >…

A 3-dimensional model dual to the Rozansky-Witten topological sigma-model with a hyper-Kaehler target space is considered. It is demonstrated that a Feynman diagram calculation of the classical part of its partition function yields the…

We continue our investigation into the insertion-elimination Lie algebra of Feynman graphs in the ladder case, emphasizing the structure of this Lie algebra relevant for future applications in the study of Dyson-Schwinger equations. We work…