ﻻ يوجد ملخص باللغة العربية
We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f in mathbb{Z}[x]$. We use an explicit version of Mertens theorem for number fields to estimate a related sum over rational primes. For a given $f in mathbb{Z}[x]$, our result yields a finite list of primes that certifies the number of distinct irreducible factors of $f$.
We fix data $(K/F, E)$ consisting of a Galois extension $K/F$ of characteristic $p$ global fields with arbitrary abelian Galois group $G$ and a Drinfeld module $E$ defined over a certain Dedekind subring of $F$. For this data, we define a $G$-equivar
Rank-2 Drinfeld modules are a function-field analogue of elliptic curves, and the purpose of this paper is to investigate similarities and differences between rank-2 Drinfeld modules and elliptic curves in terms of supersingularity. Specifically, we
This paper deals with properties of the algebraic variety defined as the set of zeros of a typical sequence of polynomials. We consider various types of nice varieties: set-theoretic and ideal-theoretic complete intersections, absolutely irreducible
We consider the summatory function of the number of prime factors for integers $leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg Martin conject
In this paper we use a theorem first proved by S.W.Golomb and a famous inequality by J.B. Rosser and L.Schoenfeld in order to prove that there exists an exact formula for $pi(n)$ which holds infinitely often.