Sciweavers

ISSAC
1994
Springer
136views Mathematics» more  ISSAC 1994»
14 years 4 months ago
The Albert Nonassociative Algebra System: A Progress Report
After four years of experience with the nonassociative algebra program Albert, we highlight its successes and drawbacks. Among its successes are the discovery of several new resul...
David Pokrass Jacobs
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
14 years 4 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
ISSAC
1994
Springer
102views Mathematics» more  ISSAC 1994»
14 years 4 months ago
An Application of Symbolic Computation in the Physical Sciences
An example of a problem in the physical sciences is discussed where application of various symbolic computation facilities available in many algebraic computing systems leads to a...
Charles C. Dyer
ISSAC
1994
Springer
119views Mathematics» more  ISSAC 1994»
14 years 4 months ago
Branch Cuts in Computer Algebra
Many standard functions, such as the logarithm and square root functions, cannot be de ned continuously on the complex plane. Mistaken assumptions about the properties of these fu...
Adam Dingle, Richard J. Fateman
ISSAC
1993
Springer
119views Mathematics» more  ISSAC 1993»
14 years 4 months ago
Finding all Hypergeometric Solutions of Linear Differential Equations
Hypergeometric sequences are such that the quotient of two successive terms is a fixed rational function of the index. We give a generalization of M. Petkov6ek’s algorithm to fi...
Marko Petkovsek, Bruno Salvy
ISSAC
1993
Springer
101views Mathematics» more  ISSAC 1993»
14 years 4 months ago
A Practical Method for the Sparse Resultant
Ioannis Z. Emiris, John F. Canny
ISSAC
1997
Springer
125views Mathematics» more  ISSAC 1997»
14 years 4 months ago
A Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials
Abstract. This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polyn...
Ziming Li, István Nemes
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
14 years 4 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
ISSAC
1997
Springer
138views Mathematics» more  ISSAC 1997»
14 years 4 months ago
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
Erich Kaltofen, Victor Shoup
ISSAC
1997
Springer
110views Mathematics» more  ISSAC 1997»
14 years 4 months ago
Integration of the Signum, Piecewise and Related Functions
David J. Jeffrey, George Labahn, Martin von Mohren...