Related papers: A filtration question on Belyi pairs and dessins
We show that for each d>0 the d-dimensional Hamming graph H(d,q) has an orientably regular surface embedding if and only if q is a prime power p^e. If q>2 there are up to isomorphism \phi(q-1)/e such maps, all constructed as Cayley maps for…
A dessin d'enfant, or dessin, is a bicolored graph embedded into a Riemann surface. Acyclic dessins can be described analytically by pre-images of certain polynomials, called Shabat polynomials, and also algebraically by their monodromy…
In this paper we study the relationship between a very classical algebraic object associated to a filtration of spaces, namely a spectral sequence introduced by Leray in the 1940's, and a more recently invented object that has found many…
In this work, we determine all Lattes maps which are Belyi morphisms. It turns out that in the generic case, i.e. when the automorphism group is $\ZZ/2\ZZ$, the corresponding family of Lattes maps are Belyi morphisms if and only if the…
The reader is informed about a method for the objective identification of the plane symmetry group of a "noisy" crystal pattern. Without giving numerical details, this information theory based method is applied to two beautiful pieces of…
Since their introduction by Beilinson-Drinfeld \cite{BD,Opers1}, opers have seen several generalizations. In \cite{BSY} a higher rank analog was studied, named {generalized $B$-opers}, where the successive quotients of the oper filtration…
This paper gives a key definition, for a new approach to dessins and algebraic numbers. The distant goal is to construct from each dessin $D$ an algebraic number $\eta_D$, in a systematic and useful way. The algebra of balanced dessins is…
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…
We show how to define a canonical Riemannian metric on a "dessin d'enfants' drawn on a topological surface. This gives a possible explanation of a claim of A. Grothendieck.
The icosahedron $I_4$ of genus 4 is a dessin d'enfant embedded in Bring's curve $\mathcal{B}$. The dessin $I_4$ is related in some sense to a regular icosahedron $I_0$ embedded in the complex Riemann sphere. In particular, decompositions of…
A regular map is a surface together with an embedded graph, having properties similar to those of the surface and graph of a platonic solid. We analyze regular maps with reflection symmetry and a graph of density strictly exceeding 1/2, and…
A dessin is a 2-cell embedding of a connected bipartite graph into an orientable closed surface. An automorphism of a dessin is a permutation of the edges of the underlying graph which preserves the colouring of the vertices and extends to…
The Bubble-sort graph $BS_n,\,n\geqslant 2$, is a Cayley graph over the symmetric group $Sym_n$ generated by transpositions from the set $\{(1 2), (2 3),\ldots, (n-1 n)\}$. It is a bipartite graph containing all even cycles of length…
Interaction nets are a graphical model of computation, which has been used to define efficient evaluators for functional calculi, and specifically lambda calculi with patterns. However, the flat structure of interaction nets forces pattern…
Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$,…
Let $N$ be a positive integer. For any positive integer $L\leq N$ and any positive divisor $r$ of $N$, we enumerate the equivalence classes of dessins d'enfants with $N$ edges, $L$ faces and two vertices whose automorphism groups are cyclic…
Given S_1, a finite set of points in the plane, we define a sequence of point sets S_i as follows: With S_i already determined, let L_i be the set of all the line segments connecting pairs of points of the union of S_1,...,S_i, and let…
Bifiltered graphs are a versatile tool for modelling relations between data points across multiple grades of a two-dimensional scale. They are especially popular in topological data analysis, where the homological properties of the induced…
A spline is an assignment of polynomials to the vertices of a graph whose edges are labeled by ideals, where the difference of two polynomials labeling adjacent vertices must belong to the corresponding ideal. The set of splines forms a…
Given a Klein surface Y, there is a unique symmetric Riemann surface X being the complex double of Y. In this paper we shall show that the situation is not the same when we work in the category of surfaces with nodes.