Related papers: Edge Geometry of Regular Polygons -- Part 2

A finite simple graph is called a 2-graph if all of its unit spheres S(x) are cyclic graphs of length 4 or larger. A 2-graph G is Eulerian if all vertex degrees of G are even. An edge refinement of a graph splits an edge (a,b) to two edges…

Networks are mathematical structures that are universally used to describe a large variety of complex systems such as the brain or the Internet. Characterizing the geometrical properties of these networks has become increasingly relevant…

In a rectilinear dual of a planar graph vertices are represented by simple rectilinear polygons and edges are represented by side-contact between the corresponding polygons. A rectilinear dual is called a cartogram if the area of each…

Inspired by the prospect of having discretized spaces emerge from random graphs, we construct a collection of simple and explicit exponential random graph models that enjoy, in an appropriate parameter regime, a roughly constant vertex…

While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of…

In this paper, we use new results together with established facts about Thurston's compactification of Teichm\"uller space to address the geometric P=W conjecture for $\mathrm{SL}(2,\mathbb{C})$, which concerns projective compactifications…

We investigate the geometry of the matrix model associated with an N=1 super Yang-Mills theory with three adjoint fields, which is a massive deformation of N=4. We study in particular the Riemann surface underlying solutions with arbitrary…

Tilings of the plane resemble the simplicial and other complexes from algebraic topology, but have not been studied from this perspective. We construct finite categories corresponding to polygons with labeled directed edges, and introduce…

The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…

We describe computer algorithms that produce the complete set of isohedral tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups of…

In this first of a series of three papers we outline an approach to classifying 4d $\mathcal{N}{=}2$ superconformal field theories at rank 2. The classification of allowed scale invariant $\mathcal{N}=2$ Coulomb branch geometries of…

Let $\mathbb{F}_q$ denote a finite field with $q$ elements. Let $n,k$ denote integers with $n>2k\geq 6$. Let $V$ denote a vector space over $\mathbb{F}_{q}$ that has dimension $n$. The vertex set of the Grassmann graph $J_q(n,k)$ consists…

Quantification of symmetries in complex networks is typically done globally in terms of automorphisms. Extending previous methods to locally assess the symmetry of nodes is not straightforward. Here we present a new framework to quantify…

We study random surfaces constructed by glueing together $N/k$ filled $k$-gons along their edges, with all $(N-1)!! = (N-1)(N-3)...3\cdot 1$ pairings of the edges being equally likely. (We assume that lcm $\{2,k\}$ divides $N$.) The Euler…

Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…

We analyze conformational properties of branched polymer structures, formed on the base of Erd\"os-R\'enyi random graph model. We consider networks with $N=5$ vertices and variable parameter $c$, that controls graph connectedness. The…

Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the…

Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out degree of a vertex in the resulting directed graph. This…

Let G be a finite subgroup of GL_n(C). A study is made of the ways in which resolutions of the quotient space C^n / G can parametrise G-constellations, that is, G-regular finite length sheaves. These generalise G-clusters, which are used in…

We study curve singularities in a smooth surface relative to a smooth boundary curve. We consider the semiuniversal deformations and equisingular deformations of curves with a fixed local intersection number $w$ with the boundary, and prove…