Dessin d'enfant

Known as: Dessins d'enfant, Dessins d'enfants, Belyi pair 
In mathematics, a dessin d'enfant is a type of graph embedding used to study Riemann surfaces and to provide combinatorial invariants for the action… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1995-2017
0246819952017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We describe the action of the group GL2(Z) on embeddings of hypercubes on compact orientable surfaces, specifically classifying… (More)
  • table 1
  • figure 2
Is this relevant?
2006
2006
  • Dessins d’enfant
  • 2006
In a paper by Miranda and Persson [MP89], the authors study semi-stable elliptic fibrations over P of K3-surfaces with 6 singular… (More)
  • table 1
  • table 1
Is this relevant?
2006
2006
Grothendieck’s dessins d’enfants are applied to the theory of the sixth Painlevé and Gauss hypergeometric functions, two… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2005
2005
We study polynomial systems whose equations have as common support a set C of n + 2 points in Z called a circuit. We find a bound… (More)
  • figure 3
  • figure 4
Is this relevant?
2005
2005
  • 2005
We show the existence of surfaces of degree d in È 3 () with approximately 3j+2 6j(j+1) d 3 singularities of type A j , 2 ≤ j ≤ d… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
We study the Veech group of an origami, i.e. of a translation surface, tessellated by parallelograms. We show that it is… (More)
  • figure 6
  • figure 7
Is this relevant?
2001
2001
Bipartite graphs occur in many parts of mathematics, and their embeddings into orientable compact surfaces are an old subject. A… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
The two main problems of the theory of dessins d’enfants are the following: i) given a dessin, i.e., a purely combinatorial… (More)
  • figure 1
  • figure 2
Is this relevant?
1999
1999
  • Kevin M. Pilgrim
  • 1999
minimal Hubbard trees. A Hubbard tree can be thought of as giving an almost normal form for a postcritically finite polynomial… (More)
  • figure 1
  • figure 4
  • figure 7
  • figure 8
  • figure 9
Is this relevant?
1997
1997
Grothendieck's theory of Dessins d'Enfants involves combinatorially determined aane, reeective, and conformal structures on… (More)
  • figure 12
  • figure 18
  • figure 19
  • figure 20
  • figure 21
Is this relevant?