Results 11 to 20 of about 21,598 (116)
Product of prime ideals as factorization of submodules
For a proper submodule $N$ of a finitely generated module $M$ over a Noetherian ring, the product of prime ideals which occur in a regular prime extension filtration of $M$ over $N$ is defined as its generalized prime ideal factorization in $M$.
Thulasi, K. R. +2 more
openaire +2 more sources
In this paper, we present some elementary properties of neutrosophic rings. The structure of neutrosophic polynomial rings is also presented. We provide answers to the questions raised by Vasantha Kandasamy and Florentin Smarandache in [1] concerning ...
Agboola A.A.A. +2 more
core +1 more source
Factorization of prime ideal extensions in number rings [PDF]
It is introduced a method for factoring a prime ideal extension in number rings. The method makes use of factorization of polynomials in many variables over finite fields. The method can be applied to any prime and any number field extensions.
openaire +2 more sources
A note on a characterization theorem for a certain class of domains [PDF]
We have introduced and studied in [3] the class of Globalized multiplicatively pinched-Dedekind domains (GMPD domains). This class of domains could be characterized by a certain factorization property of the non-invertible ideals, (see [3, Theorem 4 ...
Rehman, Shafiq ur
core +2 more sources
Index, the prime ideal factorization in simplest quartic fields and counting their discriminants
We consider the simplest quartic number fields Km defined by the irreducible quartic polynomials x4-mx3-6x2+mx+1, where m runs over the positive rational integers such that the odd part of m2+16 is square free. In this paper, we study the index I(Km) and determine the explicit prime ideal factorization of rational primes in simplest quartic
Bayad, Abdelmejid, Seddik, Mohammed
openaire +6 more sources
Some Constacyclic Codes over Finite Chain Rings [PDF]
For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes.
Batoul, Aicha +2 more
core +1 more source
Prime Factorization of ideals in commutative rings, with a focus on Krull rings
To appear in J.
Chang, Gyu Whan, Oh, Jun Seok
openaire +3 more sources
Controlling the dimensions of formal fibers of a unique factorization domain at the height one prime ideals [PDF]
15 ...
Fleming, Sarah M. +5 more
openaire +4 more sources
Prime ideal factorization in quartic number fields
For every prime integer p, and for every number field K defined by a p-regular polynomial, the form of the factorization of the principal ideal pℤK into prime ideals of ℤK is given. To illustrate the potential applications of this factorization, we derive from this result an explicit description of the factorization of pℤK, where K is a quartic number ...
L. El Fadil +2 more
openaire +1 more source
On ideals free of large prime factors [PDF]
In 1989, E. Saias established an asymptotic formula for Ψ(x,y)=n≤x:p∣n⇒p≤y with a very good error term, valid for exp(loglogx) (5/3)+ϵ ≤y≤x, x≥x 0 (ϵ), ϵ>0. We extend this result to an algebraic number field K by obtaining an asymptotic formula for the analogous function Ψ K (x,y) with the same error term and valid in the same region.
openaire +2 more sources

