Related papers: A filtration question on Belyi pairs and dessins
We show how a filtration of Delaunay complexes can be used to approximate the persistence diagram of the distance to a point set in $R^d$. Whereas the full Delaunay complex can be used to compute this persistence diagram exactly, it may…
In this paper, following Grothendieck {\it Esquisse d'un programme}, which was motivated by Belyi's work, we study some properties of surfaces $X$ which are triangulated by (possibly ideal) isometric equilateral triangles of one of the…
The purpose of this paper is twofold. First we answer to a question asked by Steingrimsson and Williams about certain permutation tableaux: we construct a bijection between binary trees and the so-called Catalan tableaux. These tableaux are…
Let X be a smooth complex surface of general type such that the image of the canonical map $\phi$ of X is a surface $\Sigma$ and that $\phi$ has degree $\delta\geq 2$. Let $\epsilon\colon S\to \Sigma$ be a desingularization of $\Sigma$ and…
A Platonic surface is a Riemann surface that underlies a regular map and so we can consider its vertices, edge-centres and face-centres. A symmetry (anticonformal involution) of the surface will fix a number of simple closed curves which we…
There is a beautiful correspondence between configurations of lines on a rational surface and tautological bundles over that surface. We extend this correspondence to families, by means of a generalized Fourier-Mukai transform that relates…
Given a finite field, one can form a directed graph using the field elements as vertices and connecting two vertices if their difference lies in a fixed subgroup of the multiplicative group. If -1 is contained in this fixed subgroup, then…
A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph $G$ is the minimum…
A definable set in a pair (K, k) of algebraically closed fields is co-analyzable relative to the subfield k of the pair if and only if it is almost internal to k. To prove this and some related results for tame pairs of real closed fields…
The Symmetries of Feynman Integrals (SFI) is a method for evaluating Feynman Integrals which exposes a novel continuous group associated with the diagram which depends only on its topology and acts on its parameters. Using this method we…
Working over a field ${\mathbb{k}}$ of characteristic $\ne 2$, we study what we call bisector fields, which are arrangements of paired lines in the plane that have the property that each line in the arrangement crosses the paired lines in…
The distributive property can be studied through bilinear maps and various morphisms between these maps. The adjoint-morphisms between bilinear maps establish a complete abelian category with projectives and admits a duality. Thus the…
We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…
For each finite group G, we define the Grothendieck-Teichm\"uller group of G, denoted GT(G), and explore its properties. The theory of dessins d'enfants shows that the inverse limit of GT(G) as G varies can be identified with a group…
The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…
A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements.…
In this paper, we explore the descriptive complexity theory of finite groups by examining the power of the second Ehrenfeucht-Fraisse bijective pebble game in Hella's (Ann. Pure Appl. Log., 1989) hierarchy. This is a Spoiler-Duplicator game…
We provide a pipeline for generating syntax diagrams (also called railroad diagrams) from context free grammars. Syntax diagrams are a graphical representation of a context free language, which we formalize abstractly as a set of mutually…
The knot Floer complex and the concordance invariant $\varepsilon$ can be used to define a filtration on the smooth concordance group. We exhibit an ordered subset of this filtration that is isomorphic to $\mathbb{N} \times \mathbb{N}$ and…
A first step towards a systematic theory of relative line bundles over SUSY-curves is presented. In this paper we deal with the case of relative line bundles over families of ordinary Riemann surfaces. Generalizations of the Gauss-Bonnet…