Computer Mathematics

Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations.- An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions.- Finding the Symbolic Solution of a Geometric Problem through Numeric Computations.- A Simple Quantifier-free Formula of Positive Semidefinite Cyclic Ternary Quartic Forms.- The vanishing ideal of a finite set of points with multiplicity structures.- Signature-based Method of Deciding Program Termination.- High-precision eigenvalue bound for the Laplacian with singularities.- Degree and dimension estimates for invariant ideals of P-solvable recurrences.- POLY : A new polynomial data structure for Maple 17.- A Symbolic Approach to Compute a Null-Space Basis in the Projection Method.- Real Root Isolation of Polynomial Equations Based on Hybrid Computation.- Overview of the Mathemagix type system.- Resultant-Free Computation of Indefinite Hyperexponential Integrals.- ImUp: A Maple Package for Uniformity-Improved Reparameterization of Plane Curves.- The Diagonal Reduction Algorithm Using Fast Givens.- Constructing Generalized Bent Functions from Trace Forms over Galois Rings.- Matrix Formula of Differential Resultant for First Order Generic Ordinary Differential Polynomials.- Simplification of the lattice based attack of Boneh and Durfee for RSA cryptoanalysis.- A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices.- Computing Popov Forms of Matrices over PBW Extensions.- On the simplest quartic fields and related Thue equations.- On the Implementation of Boolean Gröbner Bases.- Towards the calculation of Casimir forces for inhomogeneous planar media.- Comprehensive Gröbner Bases in a Java Computer Algebra System.- A Symbolic Approach to Compute a Null-Space Basis in the Projection Method.- Real Root Isolation of Regular Chains.- A Practical Method for Floating-point Groebner Basis Computation.- Series-Expansion of Multivariate Algebraic Functions atSingular Points: Nonmonic Case.- A Sequence of Nearest Polynomials with Given Factors.- Digitisation Workflow in the Czech Digital Mathematics Library.- The Implementation and Complexity Analysis of the Branch Gröbner Bases Algorithm over Boolean Ring.