English
Related papers

Related papers: A filtration question on Belyi pairs and dessins

200 papers

We state and solve a discrete version of the classical Riemann-Hilbert problem. In particular, we associate a Riemann-Hilbert problem to every dessin d'enfants. We show how to compute the solution for a dessin that is a tree. This amounts…

Complex Variables · Mathematics 2007-05-23 Finnur Larusson , Timur Sadykov

We give an alternative argument for the classification of real bundle pairs over smooth symmetric surfaces and extend this classification to nodal symmetric surfaces. We also classify the homotopy classes of automorphisms of real bundle…

Algebraic Geometry · Mathematics 2015-12-23 Penka Georgieva , Aleksey Zinger

In this paper, in the context of the ``Dessins d'enfants'' theory, we give a combinatorial criterion for a plane tree to cover a tree from the classes of "chains" or "stars''. Besides, we discuss some applications of this result which are…

Algebraic Geometry · Mathematics 2008-01-15 F. Pakovich

We obtain an explicit formula for the number of Lam\'e equations (modulo scalar equivalence) with index $n$ and projective monodromy group of order $2N$, for given $n \in \Z$ and $N \in \N$. This is done by performing the combinatorics of…

Classical Analysis and ODEs · Mathematics 2007-05-23 Sander Dahmen

We combine the idea of confluent drawings with Sugiyama style drawings, in order to reduce the edge crossings in the resultant drawings. Furthermore, it is easier to understand the structures of graphs from the mixed style drawings. The…

Computational Geometry · Computer Science 2007-06-14 David Eppstein , Michael T. Goodrich , Jeremy Yu Meng

A pair of sequences of natural numbers is called planar if there exists a simple, bipartite, planar graph for which the given sequences are the degree sequences of its parts. For a pair to be planar, the sums of the sequences have to be…

Combinatorics · Mathematics 2018-05-08 Patrick Adams , Yuri Nikolayevsky

A generalised Paley map is a Cayley map for the additive group of a finite field F, with a subgroup S=-S of the multiplicative group as generating set, cyclically ordered by powers of a generator of S. We characterise these as the…

Combinatorics · Mathematics 2010-06-04 Gareth A. Jones

The pencil of conics featuring three degenerate conics each of which is a line-pair is briefly inspected in a Galois field of characteristic two. It is shown that if two degenerates are conjugate imaginary line pairs, the third must be a…

Algebraic Geometry · Mathematics 2007-05-23 Metod Saniga

Earlier the authors considered and, in some cases, computed Poincare series of two sorts of multi-index filtrations on the ring of germs of functions on a complex (normal) surface singularity (in particular on the complex plane). A…

Algebraic Geometry · Mathematics 2008-09-12 A. Campillo , F. Delgado , S. M. Gusein-Zade

Geometry arising from two diffusion operators (smooth semi-elliptic, second order differential operators) on different spaces but intertwined by a smooth map is described. Particular cases arise from Riemannian submersions when the…

Differential Geometry · Mathematics 2016-07-22 K. D. Elworthy , Y. LeJan , Xue-Mei Li

We consider N=2 supersymmetric gauge theories perturbed by tree level superpotential terms near isolated singular points in the Coulomb moduli space. We identify the Seiberg-Witten curve at these points with polynomial equations used to…

High Energy Physics - Theory · Physics 2007-05-23 Sujay K. Ashok , Freddy Cachazo , Eleonora Dell'Aquila

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…

Combinatorics · Mathematics 2024-10-08 Ricky X. F. Chen

We define a metric filtration of the Gordian graph by an infinite family of 1-dense subgraphs. The n-th subgraph of this family is generated by all knots whose fundamental groups surject to a symmetric group with parameter at least n, where…

Geometric Topology · Mathematics 2020-07-08 Sebastian Baader , Alexandra Kjuchukova

The Deligne category of symmetric groups is the additive Karoubi closure of the partition category. It is semisimple for generic values of the parameter t while producing categories of representations of the symmetric group when modded out…

Quantum Algebra · Mathematics 2020-07-24 Mikhail Khovanov , Radmila Sazdanovic

Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…

Rings and Algebras · Mathematics 2023-06-22 Robin Hirsch , Brett McLean

Semilinear maps are a generalization of linear maps between vector spaces where we allow the scalar action to be twisted by a ring homomorphism such as complex conjugation. In particular, this generalization unifies the concepts of linear…

Logic in Computer Science · Computer Science 2022-02-14 Frédéric Dupuis , Robert Y. Lewis , Heather Macbeth

We use a numerical method to compute a database of three-point branched covers of the complex projective line of small degree. We report on some interesting features of this data set, including issues of descent.

Number Theory · Mathematics 2019-02-13 Michael Musty , Sam Schiavone , Jeroen Sijsling , John Voight

The image of the branch set of a PL branched cover between PL $n$-manifolds is a simplicial $(n-2)$-complex. We demonstrate that the reverse implication also holds: an open and discrete map $f \colon \mathbb{S}^n \to \mathbb{S}^n$ with the…

Complex Variables · Mathematics 2020-12-09 Rami Luisto , Eden Prywes

In this paper, we focus on properties of dessins d'enfants associated to trigonal curves. Degtyarev studied dessins d'enfants to compute braid monodromies and fundamental groups of trigonal curves using their combinatorial data. We first…

Algebraic Geometry · Mathematics 2017-07-03 Mehmet Emin Aktas

The spectra of digraphs, unlike those of graphs, is a relatively unexplored territory. In a digraph, a separation is a pair of sets of vertices X and Y such that there are no arcs from X and Y . For a subclass of eulerian digraphs, we give…

Combinatorics · Mathematics 2015-11-12 Krystal Guo
‹ Prev 1 4 5 6 7 8 10 Next ›