The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 121 –
140 of
187
We prove that the number of distinct homotopy types of limits of one-parameter semi-algebraic families of closed and bounded semi-algebraic sets is bounded singly exponentially in the additive complexity of any quantifier-free first order formula defining the family. As an important consequence, we derive that the number of distinct homotopy types of semi-algebraic subsets of defined by a quantifier-free first order formula , where the sum of the additive complexities of the polynomials appearing...
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.
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...
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...
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...
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...
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 .
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...
Currently displaying 121 –
140 of
187