Related papers: Triangle-Free Triangulations
A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…
Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every $n$-vertex triangulation with at least six vertices has a simultaneous flip into a 4-connected triangulation, and that it can be computed in O(n)…
Weyl semimetals are arguably the most paradigmatic form of a gapless topological phase. While the stability of Weyl nodes, as quantified by their topological charge, has been extensively investigated, recent interest has shifted to the…
This paper investigates conditions under which a given automorphism of a residually torsion-free nilpotent group respects some ordering of the group. For free groups and surface groups, this has relevance to ordering the fundamental groups…
We use methods from the cohomology of groups to describe the finite groups which can act freely and homologically trivially on closed 3-manifolds which are rational homology spheres.
The parameters of the triangular domain wall network in bilayer graphene with a simultaneously twisted and biaxially stretched bottom layer are studied using the two-chain Frenkel-Kontorova model. It is demonstrated that if the graphene…
We prove that every triangle-free graph of tree-width t has chromatic number at most ceil((t + 3)/2), and demonstrate that this bound is tight. The argument also establishes a connection between coloring graphs of tree-width t and on-line…
We present a new class of extended affine Weyl groups $\widetilde{W}^{(k,k+1)}(A_l)$ for $1\leq k <l$ and obtain an analogue of Chevalley-type theorem for their invariants. We further show the existence of Frobenius manifold structures on…
Triangulation graph staining is sufficient for planar graph staining. This article will focus on triangulation and the nature of the color change channel of the staining tool. By construction, the four colors of the vertex are converted…
We report systematic theoretical studies of the inverse Faraday effect in materials with massless Dirac fermions, both in two dimensions such as graphene and surface states in topological insulators, and in three dimensions such as Dirac…
Higher-derivative theories of free higher-spin fields are investigated focusing on their symmetries. Generalizing familiar two-derivative constrained formulations, we first construct less-constrained Einstein-like and Maxwell-like…
We study the C*-algebra of an affine map on a compact abelian group and give necessary and sufficient conditions for strong transitivity when the group is a torus. The structure of the C*-algebra is completely determined for all strongly…
A plane near-triangulation G can be decomposed into a collection of induced subgraphs, described here as the W-components of G, such that G is perfect (respectively, chordal) if and only if each of its W-components is perfect (respectively,…
Let W be a Weyl group, presented as a crystallographic reflection group on a Euclidean vector space V, and C an open Weyl chamber. In a recent paper, Waldspurger proved that the images (id-w)(C), for Weyl group elements w, are all disjoint,…
In these lecture notes we present connections between the theory of iterated function systems, in particular those attractors that are graphs of multivariate real-valued fractal functions, foldable figures and affine Weyl groups, and…
We perform direct numerical simulations of flows over finite-aspect-ratio rotating circular cylinders at a Reynolds number of 150 over a range of aspect ratios ($AR=2-12$) and rotation rates ($\alpha=0-5$), aiming at revealing the free-end…
We extend the definition of the refined topological vertex C to an n-coloured refined topological vertex C_n that depends on n free bosons, and compute the 5D strip partition function made of N pairs of C_n vertices and conjugate C*_n…
Given a graph $G$, we determine the structure of the rotation graph of a graph obtained by applying certain operations to $G$. Specifically, we consider the operations of adding a simplicial vertex, adding a true twin to a vertex, and the…
We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$. More generally, we also determine the…
An elastic foil interacting with a uniform flow with its trailing edge clamped, also known as the inverted foil, exhibits a wide range of complex self-induced flapping regimes such as large amplitude flapping (LAF), deformed and flipped…