Sciweavers

10 search results - page 2 / 2
» Rational Divisors in Rational Divisor Classes
Sort
View
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
13 years 5 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
JSC
2008
126views more  JSC 2008»
13 years 4 months ago
Computing singular points of plane rational curves
We compute the singular points of a plane rational curve, parametrically given, using the implicitization matrix derived from the -basis of the curve. It is shown that singularity...
Falai Chen, Wenping Wang, Yang Liu
MOC
2002
113views more  MOC 2002»
13 years 5 months ago
Computation of several cyclotomic Swan subgroups
Let Cl(OK [G]) denote the locally free class group, that is the group of stable isomorphism classes of locally free OK [G]-modules, where OK is the ring of algebraic integers in th...
Timothy Kohl, Daniel R. Replogle
MOC
2002
73views more  MOC 2002»
13 years 5 months ago
Evaluation of zeta function of the simplest cubic field at negative odd integers
Abstract. In this paper, we are interested in the evaluation of the zeta function of the simplest cubic field. We first introduce Siegel's formula for values of the zeta funct...
Hyun Kwang Kim, Jung Soo Kim
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
13 years 11 months ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...