Related papers: Primes in quadratic fields
In many simple integral domains, such as $\mathbb{Z}$ or $\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact…
The reduction algorithm is used to compute reduced ideals of a number field. However, there are reduced ideals that can never be obtained from this algorithm. In this paper, we will show that these ideals have inverses of larger norms among…
The set of minimal primes of a ring is a very important set as far the spectrum of a ring is concerned as every prime contains a minimal prime. So, knowing the minimal primes is the first (important and difficult) step in describing the…
Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…
This paper presents fundamental algorithms for the computational theory of quadratic forms over number fields. In the first part of the paper, we present algorithms for checking if a given non-degenerate quadratic form over a fixed number…
We describe several algorithms for computing $e$-th roots of elements in a number field $K$, where $e$ is an odd prime-power integer. In particular we generalize Couveignes' and Thom\'e's algorithms originally designed to compute…
We construct a collection of matrices defined by quadratic residue symbols, termed "quadratic residue matrices", associated to the splitting behavior of prime ideals in a composite of quadratic extensions of $\mathbb{Q}$, and prove a simple…
Let us consider the pure quartic fields of the form $\K=\Q(\sqrt[4]{p})$ where $0<p\equiv 7\pmod{16}$ is a prime integer. We prove that the $2$-class group of $\K$ has order $2$. As a consequence of this, if the class number of $\K$ is $2$,…
The polyadic integer numbers, which form a polyadic ring, are representatives of a fixed congruence class. The basics of polyadic arithmetic are presented: prime polyadic numbers, the polyadic Euler function, polyadic division with a…
In this paper, we establish a theorem on the distribution of primes in quadratic progressions on average.
Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…
In this paper we intend to show that certain integers do not occur as the norms of principal ideals in a family of cubic fields studied by Cohn, Shanks, and Ennola. These results will simplify the construction of certain unramified…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
Computation of the extended gcd of two quadratic integers. The ring of integers considered is principal but could be euclidean or not euclidean ring. This method rely on principal ideal ring and reduction of binary quadratic forms.
Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…
We present a new sieve that allows us to find the prime numbers by using only regular patterns and, more importantly, avoiding any duplication of elements between them.
Already Dedekind and Weber considered the problem of counting integral ideals of norm at most $x$ in a given number field $K$. Here we improve on the existing results in case $K/\mathbb Q$ is abelian and has degree at least four. For these…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
For which monomial supports do most polynomials generate a prime ideal? We give necessary and sufficient conditions for the radical of the ideal to be prime over an algebraically closed field. In characteristic zero, the same conditions…
A binary string representation of prime occurrences is a sequence of bits, where $1$ entries encode positions of prime numbers. This is a convenient representation for analysis of prime distribution, since it allows for application of a…