Related papers: A Note on Objects Built From Bricks without Corner…

A hypergraph is called an r by r grid if it is isomorphic to a pattern of r horizontal and r vertical lines. Three sets form a triangle if they pairwise intersect in three distinct singletons. A hypergraph is linear if every pair of edges…

A minimal counterexample to the Erd\H{o}s-Gy\'arf\'as conjecture is a graph of minimum possible order and size with minimum degree at least 3 that contains no cycle whose length is a power of 2. Markstr\"om observed that any such graph must…

It is an amazing and a bit counter-intuitive discovery by Micha Perles from the sixties that there are ``non-rational polytopes'': combinatorial types of convex polytopes that cannot be realized with rational vertex coordinates. We describe…

In algebraic geometry, trigonal curves can always be embedded into Hirzebruch surfaces. In tropical geometry, the notion of trigonality does not have a unique translation. We focus on the characterization in terms of the existence of a…

Skeletal polyhedra are discrete connected structures consisting of finite (planar or skew) or infinite (linear, planar, or spatial) polygons as faces, with two faces on each edge and a circular vertex figure at each vertex. The present…

Below we construct non-cyclic and torsion-free abelian quotients for subgroups of braid groups generated by cube powers of half-twists. In the case of 3 and 4 strands we compute the abelianization of these groups. Also, we get…

We study convex cyclic polygons, that is, inscribed $n$-gons. Starting from P. Schreiber's idea, published in 1993, we prove that these polygons are not constructible from their side lengths with straightedge and compass, provided $n$ is at…

This is an expository paper. We prove the Cannon-Thurston property for bounded geometry surface groups with or without punctures. We prove three theorems, due to Cannon-Thurston, Minsky and Bowditch. The proofs are culled out of earlier…

Let $S$ be a finite subset of ${\mathbb R}^2 \setminus (0,0)$. Generally, one would expect the pattern of lines $Ax + By = 1$, where $(A, B) \in S$ to contain polygons of all shapes and sizes. We show, however, that when $S$ is a…

The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed…

The objectives of this article are three-fold. Firstly, we present for the first time explicit constructions of an infinite family of \textit{unbalanced} Ramanujan bigraphs. Secondly, we revisit some of the known methods for constructing…

We prove by variational means the existence of a complete, properly embedded, genus-one minimal surface in R^3 that is asymptotic to a helicoid at infinity. We also prove existence of surfaces that are asymptotic to a helicoid away from the…

We prove that the presence or absence of corners is spectrally determined in the following sense: any simply connected domain with piecewise smooth Lipschitz boundary cannot be isospectral to any connected domain, of any genus, which has…

A problem of Erd\H{o}s asks for extremal conditions forcing edge-disjoint cycles with a prescribed nested structure. In the geometric version, the nesting is required to be noncrossing with respect to the cyclic orders. Fern\'andez, Kim,…

We show that the problem of constructing a real rational knot of a reasonably low degree can be reduced to an algebraic problem involving the pure braid group: expressing an associated element of the pure braid group in terms of the…

We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$, for $i\in\{0,\ldots, n-1\}$. The problem of…

An edge e in a matching covered graph G is removable if G-e is matching covered; a pair {e; f} of edges of G is a removable doubleton if G-e-f is matching covered, but neither G-e nor G-f is. Removable edges and removable doubletons are…

The search for universality in random triangulations of manifolds, like those featuring in (Euclidean) Dynamical Triangulations, is central to the random geometry approach to quantum gravity. In case of the 3-sphere, or any other manifold…

A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same queue are nested. The \emph{queue number} of a graph is the…

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…