This paper provides methods to decide whether a given analytic function of several complex variables is a linear combination of finitely many given analytic functions with coeffic...
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arran...
Eric Berberich, Efi Fogel, Dan Halperin, Michael K...
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoret...
Abstract. Following Gaudry and G¨urel who extended Kedlaya’s point-counting algorithm to superelliptic curves, we introduce Harvey’s running time improvements for large enough...
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Abstract. In this paper we introduce the concept of an interactive mathematical document. We give a formal description of such a document, which enables us to introduce the notion ...