Add to ORKGAbstract. We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct primes. 1
In order to fully understand the factorization behavior of the ring Int(ℤ) = {f ∈ ℚ[x] | f (ℤ) ⊆ ℤ} ...
We describe an algorithm to compute the different factorizations of a given image primitive integer...
AbstractLet m be a positive integer and fm(x) be a polynomial of the form fm(x)=x2+x−m. We call a po...
Square-free values of reducible polynomials, Discrete Analysis, 2016:8, 18 pp. When does a polynomi...
Let f(x) be a polynomial with integer coefficients. If either f(x) = xdegff(1/x) or f(x) = -xdegff(1...
Let f(x) be a polynomial with integer coefficients. If either f(x) = xdegff(1/x) or f(x) = -xdegff(1...
In this paper we prove that decomposable forms, or homogeneous polynomials F(x1,⋯,xn) with integer c...
International audienceIt has long been conjectured that a polynomial $f(n)$ of degree $r>1$ with int...
AbstractLet K be an algebraic number field of finite degree over the rationals. The two themes of th...
Any irreducible polynomial f(x) in [special characters omitted][x] such that the set of values f([sp...
We explore two specific connections between prime numbers and polynomials. Cohn\u27s C...
A multivariable polynomial is associated with a polytope, called its Newton polytope. A polynomial i...
In order to fully understand the factorization behavior of the ring Int(ℤ) = {f ∈ ℚ[x] | f (ℤ) ⊆ ℤ} ...
Tato práce pojednává o ireducibilitě a reducibilitě polynomů v Z(x). Pomocí Eisensteinova kritéria l...
Tato práce pojednává o ireducibilitě a reducibilitě polynomů v Z(x). Pomocí Eisensteinova kritéria l...
In order to fully understand the factorization behavior of the ring Int(ℤ) = {f ∈ ℚ[x] | f (ℤ) ⊆ ℤ} ...
We describe an algorithm to compute the different factorizations of a given image primitive integer...
AbstractLet m be a positive integer and fm(x) be a polynomial of the form fm(x)=x2+x−m. We call a po...
Square-free values of reducible polynomials, Discrete Analysis, 2016:8, 18 pp. When does a polynomi...
Let f(x) be a polynomial with integer coefficients. If either f(x) = xdegff(1/x) or f(x) = -xdegff(1...
Let f(x) be a polynomial with integer coefficients. If either f(x) = xdegff(1/x) or f(x) = -xdegff(1...
In this paper we prove that decomposable forms, or homogeneous polynomials F(x1,⋯,xn) with integer c...
International audienceIt has long been conjectured that a polynomial $f(n)$ of degree $r>1$ with int...
AbstractLet K be an algebraic number field of finite degree over the rationals. The two themes of th...
Any irreducible polynomial f(x) in [special characters omitted][x] such that the set of values f([sp...
We explore two specific connections between prime numbers and polynomials. Cohn\u27s C...
A multivariable polynomial is associated with a polytope, called its Newton polytope. A polynomial i...
In order to fully understand the factorization behavior of the ring Int(ℤ) = {f ∈ ℚ[x] | f (ℤ) ⊆ ℤ} ...
Tato práce pojednává o ireducibilitě a reducibilitě polynomů v Z(x). Pomocí Eisensteinova kritéria l...
Tato práce pojednává o ireducibilitě a reducibilitě polynomů v Z(x). Pomocí Eisensteinova kritéria l...
In order to fully understand the factorization behavior of the ring Int(ℤ) = {f ∈ ℚ[x] | f (ℤ) ⊆ ℤ} ...
We describe an algorithm to compute the different factorizations of a given image primitive integer...
AbstractLet m be a positive integer and fm(x) be a polynomial of the form fm(x)=x2+x−m. We call a po...