Related papers: Dessins d'enfants for analysts
A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new…
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…
We recover the Riemannian gradient of a given function defined on interior points of a Riemannian submanifold in the Euclidean space based on a sample of function evaluations at points in the submanifold. This approach is based on the…
Representing patterns as labeled graphs is becoming increasingly common in the broad field of computational intelligence. Accordingly, a wide repertoire of pattern recognition tools, such as classifiers and knowledge discovery procedures,…
We propose a refinement of the Betti numbers and of the homology with coefficients in a field of a compact ANR in the presence of a continuous real valued function. The refinement of Betti numbers consists of finite configurations of points…
Bayesian networks (BNs) are graphical \emph{first-order} probabilistic models that allow for a compact representation of large probability distributions, and for efficient inference, both exact and approximate. We introduce a…
Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…
In this work we propose an algorithm that numerically evaluates Kleinian hyperelliptic functions associated with a complex curve of genus 2. This algorithm is based upon constructing a sequence of curves with Richelot isogenous Jacobians…
Grothendieck's theory of dessins provides a bridge between algebraic numbers and combinatorics. This paper adds a new concept, called 'bias', to the bridge. This produces: (i) from a biased plane tree the construction of a sequence of…
Counting the number of small patterns is a central task in network analysis. While this problem is well studied for graphs, many real-world datasets are naturally modeled as hypergraphs, motivating the need for efficient hypergraph motif…
In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first…
We obtain first order linear partial differential equations which are satisfied by exponential generating functions of two variables for the number of connected bipartite graphs with given Betti number. By solving these equations…
In computer aided geometric design a polynomial is usually represented in Bernstein form. This paper presents a family of compensated algorithms to accurately evaluate a polynomial in Bernstein form with floating point coefficients. The…
This paper addresses the enumeration of rooted and unrooted hypermaps of a given genus. For rooted hypermaps the enumeration method consists of considering the more general family of multirooted hypermaps, in which darts other than the root…
The problem of sampling edge-colorings of graphs with maximum degree $\Delta$ has received considerable attention and efficient algorithms are available when the number of colors is large enough with respect to $\Delta$. Vizing's theorem…
Deep neural networks are used for a wide range of regression problems. However, there exists a significant gap in accuracy between specialized approaches and generic direct regression in which a network is trained by minimizing the squared…
While learning the maximum likelihood value of parameters of an undirected graphical model is hard, modelling the posterior distribution over parameters given data is harder. Yet, undirected models are ubiquitous in computer vision and text…
In this paper, we explore creative image generation constrained by small data. To partially automate the creation of cartoon sketches consistent with a specific designer's style, where acquiring a very large original image set is impossible…
Many circumstances of practical importance have performance or success metrics which exist implicitly---in the eye of the beholder, so to speak. Tuning aspects of such problems requires working without defined metrics and only considering…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…