相关论文: Dessins d'enfants for analysts

We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…

We present a general technique for computing large deviations of nonlinear functions of independent Bernoulli random variables. The method is applied to compute the large deviation rate functions for subgraph counts in sparse random graphs.…

In this work we will construct bipartite graphs, famously known as Dessin d'enfant, corresponding to finite index subgroups of Hecke triangle groups $(2, q, \infty )$. Then using a results of \cite{ll} we shall show the correspondences…

Given a map $\mathcal M$ on a connected and closed orientable surface, the delta-matroid of $\mathcal M$ is a combinatorial object associated to $\mathcal M$ which captures some topological information of the embedding. We explore how…

We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…

We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…

We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti numbers of semi-algebraic sets. Aside from…

We describe a randomized algorithm that, given a set $P$ of points in the plane, computes the best location to insert a new point $p$, such that the Delaunay triangulation of $P\cup\{p\}$ has the largest possible minimum angle. The expected…

In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…

A result of Belyi can be stated as follows. Every curve defined over a number field can be expressed as a cover of the projective line with branch locus contained in a rigid divisor. We define the notion of geometrically rigid divisors in…

The problem of finding the densest subgraph in a given graph has several applications in graph mining, particularly in areas like social network analysis, protein and gene analyses etc. Depending on the application, finding dense subgraphs…

We propose and study a hierarchical algorithm to generate graphs having a predetermined distribution of cliques, the fully connected subgraphs. The construction mechanism may be either random or incorporate preferential attachment. We…

We investigate algorithms with predictions in computational geometry, specifically focusing on the basic problem of computing 2D Delaunay triangulations. Given a set $P$ of $n$ points in the plane and a triangulation $G$ that serves as a…

Saliency methods can make deep neural network predictions more interpretable by identifying a set of critical features in an input sample, such as pixels that contribute most strongly to a prediction made by an image classifier.…

A tree, embedded into plane, is a dessin d'enfant and its Belyi function is a polynomial --- Shabat polynomial. The Zapponi form of this polynomial is unique, so we can correspond to an embedded tree the Julia set of its Shabat-Zapponi…

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…

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…

Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of…

We present a new and simple randomized algorithm for constructing the Delaunay triangulation using nearest neighbor graphs for point location. Under suitable assumptions, it runs in linear expected time for points in the plane with…

We introduce a new framework for manipulating and interacting with deep generative models that we call network bending. We present a comprehensive set of deterministic transformations that can be inserted as distinct layers into the…