The effect of rational maps on polynomial maps

Pierrette Cassou-Noguès

Displaying similar documents to “The effect of rational maps on polynomial maps”

Rational solutions of certain Diophantine equations involving norms

Maciej Ulas (2014)

Acta Arithmetica

Similarity:

We present some results concerning the unirationality of the algebraic variety $_{f}$ given by the equation $N_{K / k} (X ₁ + α X ₂ + α ² X ₃) = f (t)$ , where k is a number field, K=k(α), α is a root of an irreducible polynomial h(x) = x³ + ax + b ∈ k[x] and f ∈ k[t]. We are mainly interested in the case of pure cubic extensions, i.e. a = 0 and b ∈ k∖k³. We prove that if deg f = 4 and $_{f}$ contains a k-rational point (x₀,y₀,z₀,t₀) with f(t₀)≠0, then $_{f}$ is k-unirational. A similar result is proved for a broad family of quintic polynomials...

Rational Points on Certain Hyperelliptic Curves over Finite Fields

Maciej Ulas (2007)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

Let K be a field, a,b ∈ K and ab ≠ 0. Consider the polynomials g₁(x) = xⁿ+ax+b, g₂(x) = xⁿ+ax²+bx, where n is a fixed positive integer. We show that for each k≥ 2 the hypersurface given by the equation $S_{k}^{i} : u ² = \prod_{j = 1}^{k} g_{i} (x_{j})$ , i=1,2, contains a rational curve. Using the above and van de Woestijne’s recent results we show how to construct a rational point different from the point at infinity on the curves $C_{i} : y ² = g_{i} (x)$ , (i=1,2) defined over a finite field, in polynomial time.

On realizability of sign patterns by real polynomials

Vladimir Kostov (2018)

Czechoslovak Mathematical Journal

Similarity:

The classical Descartes’ rule of signs limits the number of positive roots of a real polynomial in one variable by the number of sign changes in the sequence of its coefficients. One can ask the question which pairs of nonnegative integers $(p, n)$ , chosen in accordance with this rule and with some other natural conditions, can be the pairs of numbers of positive and negative roots of a real polynomial with prescribed signs of the coefficients. The paper solves this problem for degree $8$ polynomials. ...

Reduction and specialization of polynomials

Pierre Dèbes (2016)

Acta Arithmetica

Similarity:

We show explicit forms of the Bertini-Noether reduction theorem and of the Hilbert irreducibility theorem. Our approach recasts in a polynomial context the geometric Grothendieck good reduction criterion and the congruence approach to HIT for covers of the line. A notion of “bad primes” of a polynomial P ∈ ℚ[T,Y] irreducible over ℚ̅ is introduced, which plays a central and unifying role. For such a polynomial P, we deduce a new bound for the least integer t₀ ≥ 0 such that P(t₀,Y) is...

Factorization of irreducible polynomials over a finite field with the substitution $x^{(} q^{r}) - x$ for x

Andrew Long (1973)

Acta Arithmetica

Similarity:

Symmetric identity for polynomial sequences satisfying $A_{n + 1}^{'} (x) = (n + 1) A_{n} (x)$

Farid Bencherif, Rachid Boumahdi, Tarek Garici (2021)

Communications in Mathematics

Similarity:

Using umbral calculus, we establish a symmetric identity for any sequence of polynomials satisfying $A_{n + 1}^{'} (x) = (n + 1) A_{n} (x)$ with $A_{0} (x)$ a constant polynomial. This identity allows us to obtain in a simple way some known relations involving Apostol-Bernoulli polynomials, ApostolEuler polynomials and generalized Bernoulli polynomials attached to a primitive Dirichlet character.

Every compact set in $𝐂^{n}$ is a good compact set

Jan Erik Björk (1970)

Annales de l'institut Fourier

Similarity:

Let $K$ be an compact subset of an open set $V$ in $C^{n}$ . We show the existence of an open neighborhood $U$ of $K$ satisfying the following condition : if $f$ is holomorphic in $V$ and if there exists a sequence of polynomials which approximate $f$ uniformly in some open neighborhood $U_{f}$ of $K$ , there exists a sequence of polynomial which approximate $f$ uniformly in $U$ .

Łojasiewicz exponent of the gradient near the fiber

Ha Huy Vui, Nguyen Hong Duc (2009)

Annales Polonici Mathematici

Similarity:

It is well-known that if r is a rational number from [-1,0), then there is no polynomial f in two complex variables and a fiber $f^{- 1} (t ₀)$ such that r is the Łojasiewicz exponent of grad(f) near the fiber $f^{- 1} (t ₀)$ . We show that this does not remain true if we consider polynomials in real variables. More exactly, we give examples showing that any rational number can be the Łojasiewicz exponent near the fiber of the gradient of some polynomial in real variables. The second main result of the paper is...

The image of multilinear polynomials evaluated on $3 \times 3$ upper triangular matrices

Thiago Castilho de Mello (2021)

Communications in Mathematics

Similarity:

We describe the images of multilinear polynomials of arbitrary degree evaluated on the $3 \times 3$ upper triangular matrix algebra over an infinite field.

Rademacher-Carlitz polynomials

Matthias Beck, Florian Kohl (2014)

Acta Arithmetica

Similarity:

We introduce and study the Rademacher-Carlitz polynomial $R (u, v, s, t, a, b) : = \sum_{k = ⌈ s ⌉}^{⌈ s ⌉ + b - 1} u^{⌊ (k a + t) ⌋} / b_{v^{k}}$ where $a, b \in ℤ_{> 0}$ , s,t ∈ ℝ, and u and v are variables. These polynomials generalize and unify various Dedekind-like sums and polynomials; most naturally, one may view R(u,v,s,t,a,b) as a polynomial analogue (in the sense of Carlitz) of the Dedekind-Rademacher sum $r_{t} (a, b) : = \sum_{k = 0}^{b - 1} (((k a + t) / b)) ((k / b))$ , which appears in various number-theoretic, combinatorial, geometric, and computational contexts. Our results come in three flavors: we prove a reciprocity theorem for Rademacher-Carlitz...

The algebra of polynomials on the space of ultradifferentiable functions

Katarzyna Grasela (2010)

Banach Center Publications

Similarity:

We consider the space $^{ℳ}$ of ultradifferentiable functions with compact supports and the space of polynomials on $^{ℳ}$ . A description of the space $(^{ℳ})$ of polynomial ultradistributions as a locally convex direct sum is given.

On prime values of reducible quadratic polynomials

W. Narkiewicz, T. Pezda (2002)

Colloquium Mathematicae

Similarity:

It is shown that Dickson’s Conjecture about primes in linear polynomials implies that if f is a reducible quadratic polynomial with integral coefficients and non-zero discriminant then for every r there exists an integer $N_{r}$ such that the polynomial $f (X) / N_{r}$ represents at least r distinct primes.

On the irreducible factors of a polynomial over a valued field

Anuj Jakhar (2024)

Czechoslovak Mathematical Journal

Similarity:

We explicitly provide numbers $d$ , $e$ such that each irreducible factor of a polynomial $f (x)$ with integer coefficients has a degree greater than or equal to $d$ and $f (x)$ can have at most $e$ irreducible factors over the field of rational numbers. Moreover, we prove our result in a more general setup for polynomials with coefficients from the valuation ring of an arbitrary valued field.

A generalisation of Amitsur's A-polynomials

Adam Owen, Susanne Pumplün (2021)

Communications in Mathematics

Similarity:

We find examples of polynomials $f \in D [t; σ, δ]$ whose eigenring $ℰ (f)$ is a central simple algebra over the field $F = C \cap Fix (σ) \cap Const (δ)$ .

Recurrences for the coefficients of series expansions with respect to classical orthogonal polynomials

Stanislaw Lewanowicz (2002)

Applicationes Mathematicae

Similarity:

Let $P_{k}$ be any sequence of classical orthogonal polynomials. Further, let f be a function satisfying a linear differential equation with polynomial coefficients. We give an algorithm to construct, in a compact form, a recurrence relation satisfied by the coefficients $a_{k}$ in $f = \sum_{k} a_{k} P_{k}$ . A systematic use of the basic properties (including some nonstandard ones) of the polynomials $P_{k}$ results in obtaining a low order of the recurrence.

Sparsity of the intersection of polynomial images of an interval

Mei-Chu Chang (2014)

Acta Arithmetica

Similarity:

We show that the intersection of the images of two polynomial maps on a given interval is sparse. More precisely, we prove the following. Let $f (x), g (x) \in_{p} [x]$ be polynomials of degrees d and e with d ≥ e ≥ 2. Suppose M ∈ ℤ satisfies $p^{1 / E (1 + κ / (1 - κ)} > M > p^{ε}$ , where E = e(e+1)/2 and κ = (1/d - 1/d²) (E-1)/E + ε. Assume f(x)-g(y) is absolutely irreducible. Then $| f ([0, M]) \cap g ([0, M]) | ≲ M^{1 - ε}$ .

The factorization of $f (x) x^{n} + g (x)$ with $f (x)$ monic and of degree $\leq 2$ .

Joshua Harrington, Andrew Vincent, Daniel White (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

In this paper we investigate the factorization of the polynomials $f (x) x^{n} + g (x) \in ℤ [x]$ in the special case where $f (x)$ is a monic quadratic polynomial with negative discriminant. We also mention similar results in the case that $f (x)$ is monic and linear.

Approximation by weighted polynomials in $ℝ^{k}$

Maritza M. Branker (2005)

Annales Polonici Mathematici

Similarity:

We apply pluripotential theory to establish results in $ℝ^{k}$ concerning uniform approximation by functions of the form wⁿPₙ where w denotes a continuous nonnegative function and Pₙ is a polynomial of degree at most n. Then we use our work to show that on the intersection of compact sections $Σ \subset ℝ^{k}$ a continuous function on Σ is uniformly approximable by θ-incomplete polynomials (for a fixed θ, 0 < θ < 1) iff f vanishes on θ²Σ. The class of sets Σ expressible as the intersection of compact...

Nonreciprocal algebraic numbers of small Mahler's measure

Artūras Dubickas, Jonas Jankauskas (2013)

Acta Arithmetica

Similarity:

We prove that there exist at least cd⁵ monic irreducible nonreciprocal polynomials with integer coefficients of degree at most d whose Mahler measures are smaller than 2, where c is some absolute positive constant. These polynomials are constructed as nonreciprocal divisors of some Newman hexanomials $1 + x^{r ₁} + \dots + x^{r ₅}$ , where the integers 1 ≤ r₁ < ⋯ < r₅ ≤ d satisfy some restrictions including $2 r_{j} < r_{j + 1}$ for j = 1,2,3,4. This result improves the previous lower bound cd³ and seems to be closer to the correct...

A class of irreducible polynomials

Joshua Harrington, Lenny Jones (2013)

Colloquium Mathematicae

Similarity:

Let $f (x) = x ⁿ + k_{n - 1} x^{n - 1} + k_{n - 2} x^{n - 2} + \dots + k ₁ x + k ₀ \in ℤ [x]$ , where $3 \leq k_{n - 1} \leq k_{n - 2} \leq \dots \leq k ₁ \leq k ₀ \leq 2 k_{n - 1} - 3$ . We show that f(x) and f(x²) are irreducible over ℚ. Moreover, the upper bound of $2 k_{n - 1} - 3$ on the coefficients of f(x) is the best possible in this situation.