In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by Bruno Buchberger.We illustrate with examples from the exploration: (i) the invention of new concepts (functions, relations) in the theory, using knowledge schemes, (ii) the invention of new propositions, using proposition schemes, (iii) the invention of problems, using knowledge schemes, (iv) the introduction of new reasoning rules, by lifting knowledge to the inference level, after their correctness was proved.

We report on a symbolic-numeric algorithm for computing the Alexander polynomial of each singularity of a plane complex algebraic curve defined by a polynomial with coefficients of limited accuracy, i.e. the coefficients are both exact and inexact data. We base the algorithm on combinatorial methods from knot theory which we combine with computational geometry algorithms in order to compute efficient and accurate results. Nonetheless the problem we are dealing with is ill-posed, in the sense that tiny perturbations in the coefficients of the defining polynomial cause huge errors in the computed results.

In the context of a scheme based exploration model proposed by Bruno Buchberger, we investigate the idea of decomposition, applied in the exploration of natural numbers. The free decomposition problem (i.e. whether an element can always be decomposed with respect to an operation) can be arbitrarily difficult, and we illustrate this in the theory of natural numbers. We consider a restriction, the decomposition in domains with a well-founded partial ordering: we introduce the notions of irreducible elements, reducible elements w.r.t. a composition operation, decomposition of domain elements into irreducible ones, and also the problem of irreducible decomposition which we then solve. Natural numbers can be classified as a decomposition domain, in which we know how to solve the decomposition problem. This leads to the prime decomposition theorem.

We approach the algebraic problem of computing topological invariants for the singularities of a plane complex algebraic curve defined by a squarefree polynomial with inexactlyknown coefficients. Consequently, we deal with an ill-posed problem in the sense that, tiny changes in the input data lead to dramatic modifications in the output solution.We present a regularization method for handling the illposedness of the problem. For this purpose, we first design symbolic-numeric algorithms to extract structural information on the plane complex algebraic curve: (i) we compute the link of each singularity by numerical equation solving; (ii) we compute the Alexander polynomial of each link by using algorithms from computational geometry and combinatorial objects from knot theory; (iii) we derive a formula for the delta-invariant and the genus. We then prove the convergence for inexact data of the symbolic-numeric algorithms by using concepts from algebraic geometry and topology.Moreover we perform several numerical experiments, which support the validity for the convergence statement.

Abstract. We report on an adapted version of the Bentley-Ottmann algorithm for computing all the intersection points among the edges of the projection of a three-dimensional graph. This graph is given as a set of vertices together with their space Euclidean coordinates, and a set of edges connecting them. More precisely, the three-dimensional graph represents the approximation of a closed and smooth implicitly defined space algebraic curve, that allows us a simplified treatment of the events encountered in the Bentley-Ottmann algorithm. As applications, we use the adapted algorithm to compute invariants for each singularity of a plane complex algebraic curve, i.e. the Alexander polynomial, the Milnor number, the delta-invariant, etc.

We report on a library for computing the genus of a plane complex algebraic curve using knot theory. The library also computes other type of information about the curve, such as for instance: the set of singularities of the curve, the topological type (algebraic link) of each singularity, the Alexander polynomial of each algebraic link, the delta-invariant of each singularity, etc. Using the algebraic geometric modeler called Axel [1], we integrate symbolic, numeric and graphical capabilities into a single library, which we call GENOM3CK [3].

scite is a Brooklyn-based startup that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.