Related papers: Triangle-Free Triangulations

We study single-flip dynamics in sets of three-dimensional rhombus tilings with fixed polyhedral boundaries. This dynamics is likely to be slowed down by so-called ``cycles'': such structures arise when tilings are encoded via the…

Let $P$ be a convex polygon in the plane, and let $T$ be a triangulation of $P$. An edge $e$ in $T$ is called a diagonal if it is shared by two triangles in $T$. A flip of a diagonal $e$ is the operation of removing $e$ and adding the…

The discrete cosine and sine transforms are generalized to a triangular fragment of the honeycomb lattice. The honeycomb point sets are constructed by subtracting the root lattice from the weight lattice points of the crystallographic root…

We extend the notion of canonical ordering (initially developed for planar triangulations and 3-connected planar maps) to cylindric (essentially simple) triangulations and more generally to cylindric (essentially internally) $3$-connected…

Nonlinear optical responses of quantum materials have recently undergone dramatic developments to unveil nontrivial geometry and topology. A remarkable example is the quantized longitudinal circular photogalvanic effect (CPGE) associated…

We study 3-coloring properties of triangle-free planar graphs $G$ with two precolored 4-cycles $C_1$ and $C_2$ that are far apart. We prove that either every precoloring of $C_1\cup C_2$ extends to a 3-coloring of $G$, or $G$ contains one…

Bonamy et al. (2023) proved that an optimal edge coloring of a simple triangle--free graph $G$ can be reached from any given proper edge coloring of $G$ through a series of Kempe changes. We show that a small modification of their proof…

Liouville and Toda gravity theories with non-vanishing interaction potentials have spectra obtained by dividing the free-field spectra for these cases by the Weyl group of the corresponding $A_1$ or $A_2$ Lie algebra. We study the canonical…

The question of whether 3-Coloring can be solved in polynomial-time for the diameter two graphs is a well-known open problem in the area of algorithmic graph theory. We study the problem restricted to graph classes that avoid cycles of…

Let $\mathbf{\Sigma}=(\Sigma,M,O)$ be a surface with marked points and order-2 orbifold points which is either unpunctured or once-punctured closed, and $\omega:O\rightarrow\{1,4\}$ a function. For each triangulation $\tau$ of…

We introduce certain directed multigraphs with extra structure, called Weyl graphs, which model quotients of Tits buildings by type-preserving chamber-free group actions. Their advantage over complexes of groups, which are often used for…

Two triangle meshes are conformally equivalent if for any pair of incident triangles the absolute values of the corresponding cross-ratios of the four vertices agree. Such a pair can be considered as preimage and image of a discrete…

Let G be a plane graph of girth at least five. We show that if there exists a 3-coloring phi of a cycle C of G that does not extend to a 3-coloring of G, then G has a subgraph H on O(|C|) vertices that also has no 3-coloring extending phi.…

Given a simple connected compact Lie group $K$ and a maximal torus $T$ of $K$, the Weyl group $W=N_K(T)/T$ naturally acts on $T$. First, we use the combinatorics of the (extended) affine Weyl group to provide an explicit $W$-equivariant…

We calculate Wilson loops in lowest order of perturbation theory for triangular contours whose edges are circular arcs. Based on a suitable disentanglement of the relations between metrical and conformal parameters of the contours, the…

We introduce the notion of fundamental heap for compact orientable surfaces with boundary embedded in $3$-space, which is an isotopy invariant of the embedding. It is a group, endowed with a ternary heap operation, defined using diagrams of…

Given a triangle-free planar graph G and a 9-cycle C in G, we characterize situations where a 3-coloring of C does not extend to a proper 3-coloring of G. This extends previous results when C is a cycle of length at most 8.

We consider random lattice triangulations of $n\times k$ rectangular regions with weight $\lambda^{|\sigma|}$ where $\lambda>0$ is a parameter and $|\sigma|$ denotes the total edge length of the triangulation. When $\lambda\in(0,1)$ and $k$…

Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…