Related papers: Perfect t-embeddings and Lozenge Tilings

A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…

We give an explicit construction of a maximal torsion-free finite-index subgroup of a certain type of Coxeter group. The subgroup is constructed as the fundamental group of a finite and non-positively curved polygonal complex. First we…

We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O(n) time, where n is the number of vertices in the graph. In our proofs, we present an embedding algorithm for…

The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…

In 1992, Hitchin used his theory of Higgs bundles to construct an important family of representations of the fundamental group of a closed, oriented surface of genus at least two into the split real form of a complex adjoint simple Lie…

We present new finite elements for solving the Riesz maps of the de Rham complex on triangular and tetrahedral meshes at high order. The finite elements discretize the same spaces as usual, but with different basis functions, so that the…

We offer new insight into the folding kinematics of degree-4 rigid origami vertices by drawing an analogy to spacetime in special relativity. Specifically, folded states of the vertex, described by pairs of fold angles in terms of cotangent…

Thin sheets can be assembled into tubular origami structures that combine deployability with pronounced anisotropic stiffness, enabling applications ranging from robotics to deployable systems. However, most existing tubular origami designs…

Ratner's theorem implies topological rigidity of immersed totally geodesic subspaces of noncompact type in finite-volume locally symmetric spaces. In higher rank and infinite volume, however, counter-examples to this rigidity have remained…

We discuss a geometrical interpretation of the Z-invariant Ising model in terms of isoradial embeddings of planar lattices. The Z-invariant Ising model can be defined on an arbitrary planar lattice if and only if certain paths on the…

We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…

It is often easier to study pseudo-Riemannian manifolds by presenting them as surfaces in some ambient space. We propose an algorithm for construction of explicit isometric embeddings of pseudo-Riemannian manifolds with symmetries into an…

In this note we present pairs of hyperkaehler orbifolds which satisfy two different versions of mirror symmetry. On the one hand, we show that their Hodge numbers (or more precisely, stringy E-polynomials) are equal. On the other hand, we…

We study Hamilton cycles and perfect matchings in a uniform attachment graph. In this random graph, vertices are added sequentially, and when a vertex $t$ is created, it makes $k$ independent and uniform choices from $\{1,\dots,t-1\}$ and…

Zernike polynomials are widely used in optics and ophthalmology due to their direct connection to classical optical aberrations. While orthogonal on the unit disk, their application to discrete data or non-circular domains--such as…

We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and…

We first show that the tilings of a general domain form a lattice which we then undertake to decompose and generate without any redundance. To this end, we study extensively the relatively simple case of hexagons and their deformations. We…

We prove that, given a compact Riemann surface $\Sigma$ and disjoint finite sets $\varnothing\neq E\subset\Sigma$ and $\Lambda\subset\Sigma$, every map $\Lambda \to \mathbb{R}^3$ extends to a complete conformal minimal immersion…