Related papers: Belyi map verification using certified path tracki…
The paper proposes an image-guided depth completion method to estimate accurate dense depth maps with fast computation time. The proposed network has two-stage structure. The first stage predicts a first depth map. Then, the second stage…
We consider components of Hurwitz moduli space of G-Galois covers and set up a powerful algebraic framework to study the set of corresponding equivalence classes of monodromy maps. Within that we study geometric stabilisation by various…
In this article we establish some results that allow to deduce the continuity of homomorphisms of (topological) abelian groups from commutative diagrams. In particular, we present a new topological version of the classical Five-Lemma. These…
We discuss the use of gauge fields to stabilize complex structure moduli in Calabi-Yau three-fold compactifications of heterotic string and M-theory. The requirement that the gauge fields in such models preserve supersymmetry leads to a…
We determine the topology of the moduli space of periodic tilings of the plane by parallelograms. To each such tiling, we associate combinatorial data via the zone curves of the tiling. We show that all tilings with the same combinatorial…
A precise meaning is given to the notion of continuous iteration of a mapping. Usual discrete iterations are extended into a dynamical flow which is a homotopy of them all. The continuous iterate reveals that a dynamical map is formend by…
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. Both the static and dynamic load balancing models are implemented in C with…
A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of Persistent Homology in this context, its interaction with the ordering and the repercussions of the process…
We give a complete description of the normal subgroups of arboreal Galois groups of Belyi maps. The normal groups form a unique chief series. We also carefully compute the discriminate of the iterate of a polynomial minus an algebraic…
Three aspects of applying homotopy continuation, which is commonly used to solve parameterized systems of polynomial equations, are investigated. First, for parameterized systems which are homogeneous, we investigate options for performing…
Belyi's theorem asserts that a smooth projective curve $X$ defined over a number field can be realized as a cover of the projective line unramified outside three points. In this short paper we investigate the bejaviour of the minimal degree…
We present an approach to unsolvability certification of temporal planning. Our approach is based on encoding the planning problem into a network of timed automata, and then using an efficient model checker on the network followed by a…
Following the author's previous works, we continue to consider the problem of counting the number of affine conjugacy classes of polynomials of one complex variable when its unordered collection of holomorphic fixed point indices is given.…
Multi-label classification is a common challenge in various machine learning applications, where a single data instance can be associated with multiple classes simultaneously. The current paper proposes a novel tree-based method for…
In this paper, we present our ongoing work and initial results on the formal specification and verification of MiniMaple (a substantial subset of Maple with slight extensions) programs. The main goal of our work is to find behavioral errors…
PHCpack is a software package for polynomial homotopy continuation, which provides a robust path tracker [Telen, Van Barel, Verschelde, SISC 2020]. This tracker computes the radius of convergence of Newton's method, estimates the distance…
We track the trajectories of individual horocycles on the modular surface. Our tracking is constructive, and we thus \emph{effectively} establish topological transitivity and even line-transitivity for the horocyclic flow. We also describe…
The goal of the LEDA project was to build an easy-to-use and extendable library of correct and efficient data structures, graph algorithms and geometric algorithms. We report on the use of formal program verification to achieve an even…
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyond the state of the art of current automatic verification tools and usually involves intricate mathematical theorems. Certifying algorithms…
Recently it was proved that the group of rough paths modulo tree-like equivalence is isomorphic to the corresponding signature group through the signature map S (a generalized notion of taking iterated path integrals). However, the proof of…