Related papers: Triangle-Free Triangulations

We find the Stratonovich-Weyl quantizer for the nonunimodular affine group of the line. A noncommutative product of functions on the half-plane, underlying a noncompact spectral triple in the sense of Connes, is obtained from it. The…

We study large-scale height fluctuations of random stepped surfaces corresponding to uniformly random lozenge tilings of polygons on the triangular lattice. For a class of polygons (which allows arbitrarily large number of sides), we show…

In this paper, we review the properties and representations of the Weyl groups relevant in the study of discrete integrable systems. Previously in \cite{jns4, Shi:19}, properties of Weyl groups of type $ADE$ (known as simply-laced) were…

A classic result of Conway and Coxeter on frieze patterns has been generalized to a bijection between $p$-angulations of regular polygons and frieze patterns of type $\Lambda_p$. One of the features of Conway-Coxeter theory is a…

We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…

In this paper we investigate the structure of flip graphs on non-crossing perfect matchings in the plane. Specifically, consider all non-crossing straight-line perfect matchings on a set of $2n$ points that are placed equidistantly on the…

We demonstrate that in Weyl semimetals, the momentum-space helical spin texture can couple to the chirality of the Weyl node to generate a frequency-independent magnetization in response to circularly polarized light through the inverse…

We observe a property of orthogonality of the Mellin-Barnes transformation of the triangle one-loop diagrams, which follows from our previous papers [JHEP {\bf 0808} (2008) 106, JHEP {\bf 1003} (2010) 051, JMP {\bf 51} (2010) 052304]. In…

We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-\frac{1}{n+1/3}$.

The conformal invariance of the low energy limit theory governing the electronic properties of graphene is explored. In particular, it is noted that the massless Dirac theory in point enjoys local Weyl symmetry, a very large symmetry.…

We provide a fundamental domain for the action of the finite Weyl group on a maximal torus of a compact Lie group of the corresponding type. The general situation is reduced to the adjoint case and, from the perspective of root data, this…

A flip is a minimal move between two triangulations of a polytope. An open question is whether any two triangulations of the product of two simplices can be connected through a series of flips. This was proven in the case where one of the…

In a recent article Hasenfratz and von Allmen have suggested a fixed point action for two flavors of Weyl fermions on the lattice with gauge group SU(2). The block-spin transformation they use maps the chiral and vector symmetries of the…

In this paper, we give a polynomial time algorithm which determines if a given graph containing a triangle and no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists. In previous work, we gave a polynomial…

We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one using at most floor((3n - 9)/5) edge flips. We also give an example of an infinite family of triangulations that requires this many flips…

We give a randomized algorithm that properly colors the vertices of a triangle-free graph G on n vertices using O(\Delta(G)/ log \Delta(G)) colors, where \Delta(G) is the maximum degree of G. The algorithm takes O(n\Delta2(G)log\Delta(G))…

Let G be a plane graph with exactly one triangle T and all other cycles of length at least 5, and let C be a facial cycle of G of length at most six. We prove that a 3-coloring of C does not extend to a 3-coloring of G if and only if C has…

Consider a surface $\Sigma$ with punctures that serve as marked points and at least one marked point on each boundary component. We build a filling surface $\Sigma_n$ by singling out one of the boundary components and denoting by $n$ the…

The classical Weisfeiler-Lehman method WL[2] uses edge colors to produce a powerful graph invariant. It is at least as powerful in its ability to distinguish non-isomorphic graphs as the most prominent algebraic graph invariants. It…

We show that, under mild conditions on the underlying metric, duals of appropriately defined anisotropic Voronoi diagrams are embedded triangulations. Furthermore, they always triangulate the convex hull of the vertices, and have other…