Sciweavers

MOC
1998
66views more  MOC 1998»
13 years 11 months ago
Large primes and Fermat factors
A systematic search for large primes has yielded the largest Fermat factors known.
Jeff Young
MOC
1998
82views more  MOC 1998»
13 years 11 months ago
Vortex method for two dimensional Euler equations in bounded domains with boundary correction
The vortex method for the initial-boundary value problems of the Euler equations for incompressible flow is studied. A boundary correction technique is introduced to generate seco...
Lung-an Ying
MOC
1998
88views more  MOC 1998»
13 years 11 months ago
A space efficient algorithm for group structure computation
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
Edlyn Teske
MOC
1998
97views more  MOC 1998»
13 years 11 months ago
Euclid's algorithm and the Lanczos method over finite fields
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
Jeremy Teitelbaum
MOC
1998
78views more  MOC 1998»
13 years 11 months ago
Factoring elementary groups of prime cube order into subsets
Let p be a prime and let G be the 3-fold direct product of the cyclic group of order p. R´edei conjectured if G is the direct product of subsets A and B, each of which contains th...
Sándor Szabó, Coburn Ward
MOC
1998
88views more  MOC 1998»
13 years 11 months ago
The number of lattice points in alcoves and the exponents of the finite Weyl groups
We count lattice points in certain rational simplices associated with an irreducible finite Weyl group W and observe that these numbers are linked to the exponents of W .
Ruedi Suter
MOC
1998
106views more  MOC 1998»
13 years 11 months ago
Class number bounds and Catalan's equation
We improve a criterion of Inkeri and show that if there is a solution to Catalan’s equation xp − yq = ±1,(1) with p and q prime numbers greater than 3 and both congruent to 3 ...
Ray Steiner
MOC
1998
106views more  MOC 1998»
13 years 11 months ago
Computations of class numbers of real quadratic fields
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...
Anitha Srinivasan
MOC
1998
89views more  MOC 1998»
13 years 11 months ago
Approximation of continuous time stochastic processes by a local linearization method
This paper investigates the rate of convergence of an alternative approximation method for stochastic differential equations. The rates of convergence of the one-step and multi-st...
Isao Shoji
MOC
1998
131views more  MOC 1998»
13 years 11 months ago
An algorithm for evaluation of discrete logarithms in some nonprime finite fields
In this paper we propose an algorithm for evaluation of logarithms in the finite fields Fpn , where the number pn − 1 has a small primitive factor r. The heuristic estimate of ...
Igor A. Semaev