For a number fieldK, that is, a finite extension of Q, and a prime number p, a fundamental theorem of algebraic number theory implies that the ideal (p) ⊆ OK factors uniquely into prime ideals as (p) = p1 1 · · · p eg g . In this paper we explore different interpretations of this using the factorization of polynomials in finite and p-adic fields and Galois theory. In particular, we present some...

We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory requirements of the algorithm appear to be very good: for a given prime number p, it computes the p-valuation of the discriminant and the factorization of p in a nu...

Following what is basically Kummer’s relatively neglected approach to non-unique factorization, we determine the structure of the irreducible factorizations of an element n in the ring of integers of a number field K. Consequently, we give a combinatorial expression for the number of irreducible factorizations of n in the ring. When K is quadratic, we show in certain cases how quadratic forms c...

Following an idea of Kronecker, we describe a method for factoring prime ideal extensions in number rings. The method needs factorization of polynomials in many variables over finite fields, but it works for any prime and any number field extension. Introduction Let F c K be number fields, let ¿fp c <?* be their corresponding number rings, i.e., the integral closures of Z in F and K, respective...

The ILU factorization is one of the most popular preconditioners for the Krylov subspace method, alongside the GMRES. Properties of the preconditioner derived from the ILU factorization are relayed onto the dropping rules. Recently, Zhang et al. [Numer. Linear. Algebra. Appl., Vol. 19, pp. 555–569, 2011] proposed a Flexible incomplete Cholesky (IC) factorization for symmetric linear systems. Th...

This paper presents particle swarm optimization (PSO) method to find the prime factors of a composite number. Integer factorization is a well known NP hard problem and security of many cryptosystem is based on difficulty of integer factorization. A particle swarm optimization algorithm for integer factorization has been devised and tested on different 100 numbers. It has been found that the PSO...

Familiarly, in Z, we have unique factorization. We investigate the general ring and what conditions we can impose on it to necessitate analogs of unique factorization. The trivial ideal structure of a field, the extent to which primary decomposition is unique, that a Noetherian ring necessarily has one, that a principal ideal domain is a unique factorization domain, and that a Dedekind domain h...

Methods to compute 1–factorizations of a complete graphs of even order are presented. For complete graphs where the number of vertices is a power of 2, we propose several new methods to construct 1–factorizations. Our methods are different from methods that make use of algebraic concepts such as Steiner triple systems, starters and all other existing methods. We also show that certain complete ...

It was shown that the Runge-Lenz vector for a hydrogen atom is equivalent to the raising and lowering operators derived from the factorization of radial Schrödinger equation. Similar situation exists for an isotropic harmonic oscillator. It seems that there may exist intimate relation between the closeness of classical orbits and the factorization of radial Schrödinger equation. Some discussion...