Sciweavers

JSC
2006
76views more  JSC 2006»
13 years 11 months ago
Fast computation of special resultants
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
Alin Bostan, Philippe Flajolet, Bruno Salvy, &Eacu...
JSC
2006
49views more  JSC 2006»
13 years 11 months ago
Parameterized norm form equations with arithmetic progressions
Attila Bérczes, Attila Pethö, Volker Z...
JSC
2006
84views more  JSC 2006»
13 years 11 months ago
Normal forms for general polynomial matrices
Bernhard Beckermann, George Labahn, Gilles Villard
JSC
2006
85views more  JSC 2006»
13 years 11 months ago
Fraction-free row reduction of matrices of Ore polynomials
In this paper we give formulas for performing row reduction of a matrix of Ore polynomials in a fraction-free way. The reductions can be used for finding the rank and left nullspa...
Bernhard Beckermann, Howard Cheng, George Labahn
JSC
2006
83views more  JSC 2006»
13 years 11 months ago
Phylogenetic invariants for stationary base composition
Changing base composition during the evolution of biological sequences can mislead some of the phylogenetic inference techniques in current use. However, detecting whether such a ...
Elizabeth S. Allman, John A. Rhodes
JSC
2006
71views more  JSC 2006»
13 years 11 months ago
Towards a clausal analysis of cut-elimination
In this paper we show that a large class of cut-elimination methods can be analyzed by clause terms representing sets of characteristic clauses extractable from the original proof...
Matthias Baaz, Alexander Leitsch