The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We will recall a recent result about the classification of those polynomial in one variable with rational coefficients whose image over the integer is equal to the image of an integer coefficients polynomial in possibly many variables. These set is polynomially generated over the integers by a family of polynomials whose denominator is and they have a symmetry with respect to a particular axis.We will also give a description of the linear factors of the bivariate separated polynomial over a...
Given a monic degree polynomial and a non-negative integer , we may form a new monic degree polynomial by raising each root of to the th power. We generalize a lemma of Dobrowolski to show that if and is prime then divides the resultant of and . We then consider the function . We show that for fixed and that this function is periodic in both and , and exhibits high levels of symmetry. Some discussion of its structure as a union of lattices is also given.
L'objet de ce texte est de donner une estimation arithmétique des valeurs prises par les polynômes de Lagrange sur les entiers d'un corps quadratique imaginaire en des points de ce corps. Ces polynômes interviennent dans l'étude des fonctions entières arithmétiques et dans les minorations de formes linéaires de Logarithmes.
It is shown that the invertible polynomial maps over a finite
field Fq , if looked at as bijections Fn,q −→ Fn,q , give all possible bijections in
the case q = 2, or q = p^r where p > 2. In the case q = 2^r where r > 1
it is shown that the tame subgroup of the invertible polynomial maps gives
only the even bijections, i.e. only half the bijections. As a consequence it
is shown that a set S ⊂ Fn,q can be a zero set of a coordinate if and only if
#S = q^(n−1).
It is shown that the methods established in [HKN3] can be effectively used to study polynomial cycles in certain rings. We shall consider the rings and shall describe polynomial cycles in the case when is either odd or twice a prime.
Let be a finite commutative ring with unity. We determine the set of all possible cycle lengths in the ring of polynomials with rational integral coefficients.
Článek si dává za cíl ukázat, že z kanonických polynomů Dn(x) lze pomocí určitých lineárních kombinací vytvořit všechny polynomy, které jsou dělitelné n!. Autor formuluje větu o dělitelnosti těchto polynomů n!. Z této věty pak vyplývá celá řada tvrzení, z kterých uvádí pouze prvních šest. V každém tvrzení nalezne polynom a postupně tvrdí, že první je dělitelný 2, další 6, další 24, další číslem 120, další 720 a poslední 5040 pro celočíselné koeficienty. Vzhledem k těmto tvrzením formuluje obecné...
We prove that for every quadratic binomial f(x) = rx² + s ∈ ℤ[x] there are pairs ⟨a,b⟩ ∈ ℕ² such that a ≠ b, f(a) and f(b) have the same prime factors and min{a,b} is arbitrarily large. We prove the same result for every monic quadratic trinomial over ℤ.
Let f(x) be a complex rational function. We study conditions under which f(x) cannot be written as the composition of two rational functions which are not units under the operation of function composition. In this case, we say that f(x) is prime. We give sufficient conditions for complex rational functions to be prime in terms of their degrees and their critical values, and we also derive some conditions for the case of complex polynomials.
Currently displaying 1 –
20 of
23