On searching for roots of a polynomial in a circular annulus
On semidirect and two-sided semidirect products of finite trivial monoids
On the Algebraic Complexity of Sets of Functions
On the computation of the GCD of 2-D polynomials
The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.
On the computer algebra implementation of the least squares method on the nonnegative orthant.
On the resolvent of an ideal and some applications.
On the Symbolic Evaluation of Determinants
Operational Methods in the Environment of a Computer Algebra System
This article presents the principal results of the doctoral thesis “Direct Operational Methods in the Environment of a Computer Algebra System” by Margarita Spiridonova (Institute of mathematics and Informatics, BAS), successfully defended before the Specialised Academic Council for Informatics and Mathematical Modelling on 23 March, 2009.The presented research is related to the operational calculus approach and its representative applications. Operational methods are considered, as well as their...
Optimality-preserving elimination of linearities in Jacobian accumulation.
P-adic root isolation.
We present an implemented algorithmic method for counting and isolating all p-adic roots of univariate polynomials f over the rational numbers. The roots of f are uniquely described by p-adic isolating balls, that can be refined to any desired precision; their p-adic distances are also computed precisely. The method is polynomial space in all input data including the prime p. We also investigate the uniformity of the method with respect to the coefficients of f and the primes p. Our method thus...
Pinned-flags of some operations on fuzzy subgroups.
Polynomials over the reals in proofs of termination : from theory to practice
This paper provides a framework to address termination problems in term rewriting by using orderings induced by algebras over the reals. The generation of such orderings is parameterized by concrete monotonicity requirements which are connected with different classes of termination problems: termination of rewriting, termination of rewriting by using dependency pairs, termination of innermost rewriting, top-termination of infinitary rewriting, termination of context-sensitive rewriting, etc. We...
Polynomials over the reals in proofs of termination : from theory to practice
This paper provides a framework to address termination problems in term rewriting by using orderings induced by algebras over the reals. The generation of such orderings is parameterized by concrete monotonicity requirements which are connected with different classes of termination problems: termination of rewriting, termination of rewriting by using dependency pairs, termination of innermost rewriting, top-termination of infinitary rewriting, termination of context-sensitive rewriting, etc. We...
Practice of operator relationships in symbolical calculus.
Presentations of finite simple groups: a computational approach
All finite simple groups of Lie type of rank over a field of size , with the possible exception of the Ree groups , have presentations with at most 49 relations and bit-length . Moreover, and have presentations with 3 generators; 7 relations and bit-length , while has a presentation with 6 generators, 25 relations and bit-length .
Primitives des fonctions élémentaires
Puiseux series solutions of ordinary polynomial differential equations: complexity study.
Real and complex pseudozero sets for polynomials with applications
Pseudozeros are useful to describe how perturbations of polynomial coefficients affect its zeros. We compare two types of pseudozero sets: the complex and the real pseudozero sets. These sets differ with respect to the type of perturbations. The first set – complex perturbations of a complex polynomial – has been intensively studied while the second one – real perturbations of a real polynomial – seems to have received little attention. We present a computable formula for the real pseudozero...
Relative bilinear complexity and matrix multiplication.
Relaxed algorithms for -adic numbers
Current implementations of -adic numbers usually rely on so called zealous algorithms, which compute with truncated -adic expansions at a precision that can be specified by the user. In combination with Newton-Hensel type lifting techniques, zealous algorithms can be made very efficient from an asymptotic point of view.In the similar context of formal power series, another so called lazy technique is also frequently implemented. In this context, a power series is essentially a stream of coefficients,...