Related papers: Non-Tiles and Walls - A Variant on the Heesch Prob…

An h-tiling on a finite simplicial complex is a partition of its geometric realization by maximal simplices deprived of several codimension one faces together with possibly their remaining face of highest codimension. In this last case, the…

We describe constructions of infinite graphs which are not representable as integral graphs in the plane, addressing a question of Erd\H{o}s. We also mention some related problems.

Smooth complex surfaces polarized with an ample and globally generated line bundle of degree three and four, such that the adjoint bundle is not globally generated, are considered. Scrolls of a vector bundle over a smooth curve are shown to…

This survey focuses on the geometric problem of log-surfaces, which are pairs consisting of a smooth projective surface and a reduced non-empty boundary divisor. In the first part, we focus on the geography problem for complex log-surfaces…

A central problem of geometry is the tiling of space with simple structures. The classical solutions, such as triangles, squares, and hexagons in the plane and cubes and other polyhedra in three-dimensional space are built with sharp…

Define a ``slice'' curve as the intersection of a plane with the surface of a polytope, i.e., a convex polyhedron in three dimensions. We prove that a slice curve develops on a plane without self-intersection. The key tool used is a…

For compact Riemann surfaces, the collar theorem and Bers' partition theorem are major tools for working with simple closed geodesics. The main goal of this paper is to prove similar theorems for hyperbolic cone-surfaces. Hyperbolic…

We compute the number of rhombus tilings of a hexagon with sides $a+2,b+2,c+2,a+2,b+2,c+2$ with three fixed tiles touching the border. The particular case $a=b=c$ solves a problem posed by Propp. Our result can also be viewed as the…

Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…

The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…

The "square peg problem" or "inscribed square problem" of Toeplitz asks if every simple closed curve in the plane inscribes a (non-degenerate) square, in the sense that all four vertices of that square lie on the curve. By a variety of…

Regular edge-colored graphs encode colored triangulations of pseudo-manifolds. Here we study families of edge-colored graphs built from a finite but arbitrary set of building blocks, which extend the notion of $p$-angulations to arbitrary…

We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…

We construct and classify, in the case of two complex dimensions, the possible tangent cones at points of limit spaces of non-collapsed sequences of K\"ahler-Einstein metrics with cone singularities.

To better understand the allowed range of black hole geometries, we study Weyl-distorted Schwarzschild solutions. They always contain trapped surfaces, a singularity and an isolated horizon and so should be understood to be (geometric)…

In this PhD thesis, we give a new geometric approach to higher Teichm\"uller theory. In particular we construct a geometric structure on surfaces, generalizing the complex structure, and we explore its link to Hitchin components. The…

This article contains a short and entertaining list of unsolved problems in Plane Geometry. Their statement may seem naive and can be understood at an elementary level. But their solutions have refused to appear for forty years in the best…

We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…

In a previous work of the authors, a result to algorithmically compute the topology types of the level curves of an algebraic surface, is given. From this result, here we derive applications based on level curves to determine some…

Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…