Related papers: Ribbon decomposition and twisted Hurwitz numbers
This note gives a brief and `crash' introduction to the method of Homogenization with the use of wave equation and diffusion equation with periodic in space coefficients as instructive examples. We expose the method with the use of an…
Edge-contraction operations form an effective tool in various graph enumeration problems, such as counting Grothendieck's dessins d'enfants and simple and double Hurwitz numbers. These counting problems can be solved by a mechanism known as…
The canonical covering maps from Hurwitz varieties to configuration varieties are important in algebraic geometry. The scheme-theoretic fiber above a rational point is commonly connected, in which case it is the spectrum of a Hurwitz number…
We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…
We introduce and study an infinite random triangulation of the unit disk that arises as the limit of several recursive models. This triangulation is generated by throwing chords uniformly at random in the unit disk and keeping only those…
Going beyond the studies of single and double Hurwitz numbers, we report some progress towards studying Hurwitz numbers which correspond to ramified coverings of the Riemann sphere involving three nonsimple branch points. We first prove a…
We define cut-and-join operator in Hurwitz theory for merging of two branching points of arbitrary type. These operators have two alternative descriptions:(i) they have the GL characters as eigenfunctions and the symmetric-group characters…
We use algebraic methods to compute the simple Hurwitz numbers for arbitrary source and target Riemann surfaces. For an elliptic curve target, we reproduce the results previously obtained by string theorists. Motivated by the Gromov-Witten…
In a previous work arXiv:physics/0611108v2, it was shown that the volume spanned by a molecular system in its conformational space can be effectively bounded by a polyhedral cone, this cone is described by means of a simple combinatorial…
A closer look at an example introduced by Livingston & Melvin and later studied by Miyazaki shows that a plumbing of two fibered ribbon knots (along their fiber surfaces) may be algebraically slice yet not ribbon.
We consider the problem of defining and computing real analogs of polynomial Hurwitz numbers, in other words, the problem of counting properly normalized real polynomials with fixed ramification profiles over real branch points. We show…
Motivated by indoor localization by tripwire lasers, we study the problem of cutting a polygon into small-size pieces, using the chords of the polygon. Several versions are considered, depending on the definition of the "size" of a piece.…
We construct a combinatorial moduli space closely related to the KSV-compactification of the moduli space of bordered marked Riemann surfaces. The open part arises from symmetric metric ribbon graphs. The compactification is obtained by…
A novel high-order numerical scheme is proposed to compute the covariant derivative, particularly for divergence and curl, on any curved surface. The proposed scheme does not require the construction of a curved axis or metric tensor, which…
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…
We prove that a special alternating knot does not decompose as a non-trivial band sum. This restricts concordances from special alternating knots, and we conjecture that special alternating knots are ribbon concordance minimal. We verify…
The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman and Menasco. The approach is to consider…
An hieroglyph on n letters is a cyclic sequence of the letters 1,2, . . . , n of length 2n such that each letter appears in the sequence twice.Take an hieroglyph H. Take a convex polygon with 2n sides. Put the letters in the sequence of…
We obtain Hurwitz numbers as the number of Feynman diagrams of a certain type divided by the order of the automorphism group of the diagram.
We enumerate the state diagrams of the twist knot shadow which consist of the disjoint union of two trivial knots. The result coincides with the maximal number of regions into which the plane is divided by a given number of circles. We then…