Related papers: Dessins d'Enfants for Single-Cycle Belyi Maps
Motivated by recent work of Florian Pop, we study the connections between three notions of equivalence of function fields: isomorphism, elementary equivalence, and the condition that each of a pair of fields can be embedded in the other,…
In this paper, we associate a finite dimensional algebra, called a Brauer graph algebra, to every clean dessin d'enfant by constructing a quiver based on the monodromy of the dessin. We show that Galois conjugate dessins d'enfants give rise…
The study of bipartite maps (or Grothendieck's dessins d'enfants) is closely connected with geometry, mathematical physics and free probability. Here we study these objects from their permutation factorization formulation using a novel…
A reduction of Benney's equations is constructed corresponding to Schwartz-Christoffel maps associated with a family of genus six cyclic tetragonal curves. The mapping function, a second kind Abelian integral on the associated Riemann…
The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…
We describe the structure of the bijective transformations on the set of density operators which preserve the Bregman $f$-divergence for an arbitrary differentiable strictly convex function $f.$ Furthermore, we determine the preservers of…
We construct classes in the motivic cohomology of certain 1-parameter families of Calabi-Yau hypersurfaces in toric Fano n-folds, with applications to local mirror symmetry (growth of genus 0 instanton numbers) and inhomogeneous…
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn digraph of higher order and connecting these cycles into one…
Recently, regular Cayley maps of cyclic groups and dihedral groups have been classified. A nature question is to classify regular Cayley maps of elementary abelian $p$-groups $Z_p^n$. In this paper, a complete classification of regular…
The Erd\H{o}s, Gr\"unwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article we prove an effective version of the Erd\H{o}s,…
Two main theorems are proved in this paper. Theorem 1: There is a constant C(n, D) depending only on n and D such that for a closed Riemannian n-manifold satisfying Ric > -(n-1) and Diam < D, the ith bounded Betti number is bounded by C(n,…
Properties of the `$k$-equivalent' graph families constructed in Cai, F\"{u}rer and Immerman, and Evdokimov and Ponomarenko are analysed relative the the recursive $k$-dim WL method. An extension to the recursive $k$-dim WL method is…
We prove several unique continuation results for biharmonic maps between Riemannian manifolds.
Using Traizet's regeneration method, we prove the existence of many new 3-dimensional families of embedded, doubly periodic minimal surfaces. All these families have a foliation of 3-dimensional Euclidean space by vertical planes as a…
We point out an explicit connection between graphs drawn on compact Riemann surfaces defined over the field $\bar{\mathbb{Q}}$ of algebraic numbers --- so-called Grothendieck's {\it dessins d'enfants} --- and a wealth of distinguished…
We introduce the concept of alternate-edge-colourings for maps, and study highly symmetric examples of such maps. Edge-biregular maps of type $(k,l)$ occur as smooth normal quotients of a particular index two subgroup of $T_{k,l}$, the full…
This work dynamically classifies a 9-parametric family of birational maps f : C2 -> C2. From the sequence of the degrees dn of the iterates of f, we find the dynamical degree delta(f) of f. We identify when dn grows periodically, linearly,…
An isogeny graph is a graph whose vertices are principally polarized abelian varieties and whose edges are isogenies between these varieties. In his thesis, Kohel described the structure of isogeny graphs for elliptic curves and showed that…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…