中文
相关论文

相关论文: Polynomials with roots in ${\Bbb Q}_p$ for all $p$

200 篇论文

Let $F$ be a field of prime characteristic $p$ containing $F_{p^n}$ as a subfield. We refer to $q(X)=X^{p^n}-X-a\in F[X]$ as a generalized Artin-Schreier polynomial. Suppose that $q(X)$ is irreducible and let $C_{q(X)}$ be the companion…

环与代数 · 数学 2014-08-20 Natalio H. Guersenzvaig , Fernando Szechtman

There exist homogeneous polynomials $f$ with $\mathbb Q$-coefficients that are sums of squares over $\mathbb R$ but not over $\mathbb Q$. The only systematic construction of such polynomials that is known so far uses as its key ingredient…

代数几何 · 数学 2021-01-05 Jose Capco , Claus Scheiderer

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

交换代数 · 数学 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

数论 · 数学 2021-11-30 P Vanchinathan , Krithika M

In this paper we obtain new quantitative forms of Hilbert's Irreducibility Theorem. In particular, we show that if $f(X, T_1, \ldots, T_s)$ is an irreducible polynomial with integer coefficients, having Galois group $G$ over the function…

数论 · 数学 2016-02-02 Abel Castillo , Rainer Dietmann

Suppose that $f(x)\in {\mathbb Z}[x]$ is monic and irreducible over ${\mathbb Q}$ of degree $N$. We say that $f(x)$ is monogenic if $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$,…

数论 · 数学 2025-02-10 Lenny Jones

Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of primes, but does not have an integer root. We classify all irreducible monic integer polynomials $h$ for which there is an irreducible monic…

数论 · 数学 2023-08-28 Christian Elsholtz , Benjamin Klahn , Marc Technau

Let $A = a_0T^m + \sum_{j=1}^{m-1} a_j (T^{m-j}+T^{m+j}) + T^{2m}+1 \in \mathbf{Z}[T]$ be a monic reciprocal polynomial of degree $2m$ sampled randomly by selecting its coefficients $a_0,a_1,\dots,a_{m-1}$ independently according to a given…

数论 · 数学 2025-10-22 David Hokken , Dimitris Koukoulopoulos

In this paper, we classify, up to three possible exceptions, all monic, post-critically finite quadratic polynomials $f(x)\in \mathbb{Z}[x]$ with an iterate reducible module every prime, but all of whose iterates are irreducible over…

数论 · 数学 2019-07-09 Vefa Goksel

Fix an odd prime $p$, and let $F$ be a field containing a primitive $p$th root of unity. It is known that a $p$-rigid field $F$ is characterized by the property that the Galois group $G_F(p)$ of the maximal $p$-extension $F(p)/F$ is a…

数论 · 数学 2013-10-31 Sunil K. Chebolu , Jan Minac , Claudio Quadrelli

In this paper we prove the assertion that the number of monic cubic polynomials $F(x) = x^3 + a_2 x^2 + a_1 x + a_0$ with integer coefficients and irreducible, Galois over $\mathbb{Q}$ satisfying $\max\{|a_2|, |a_1|, |a_0|\} \leq X$ is…

数论 · 数学 2020-08-18 Stanley Yao Xiao

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…

数论 · 数学 2023-11-07 Alp Bassa , Gaetan Bisson , Roger Oyono

Let~$E$ be a Hilbertian field of characteristic~$0$. R.W.K. Odoni conjectured that for every positive integer~$n$ there exists a polynomial~$f\in E[X]$ of degree~$n$ such that each iterate~$f^{\circ{k}}$ of~$f$ is irreducible and the Galois…

数论 · 数学 2018-03-13 Joel Specter

An irreducible polynomial $f\in\Bbb F_q[X]$ of degree $n$ is {\em normal} over $\Bbb F_q$ if and only if its roots $r, r^q,\dots,r^{q^{n-1}}$ satisfy the condition $\Delta_n(r, r^q,\dots,r^{q^{n-1}})\ne 0$, where…

This work provides a method(an algorithm) for solving the solvable unary algebraic equation $f(x)=0$ ($f(x)\in\mathbb{Q}[x]$) of arbitrary degree and obtaining the exact radical roots. This method requires that we know the Galois group as…

环与代数 · 数学 2022-03-30 Song Li

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

交换代数 · 数学 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

Let $f(x)=x^{12}+ax^{6}+b\in {\mathbb Z}[x]$, with $ab\ne 0$. We say that $f(x)$ is {\em monogenic} if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots,\theta^{11}\}$ is a basis for the ring of integers of ${\mathbb…

数论 · 数学 2026-04-22 Lenny Jones

This paper is purely expository. We present short elementary proofs of * the Gauss Theorem on constructibility of regular polygons; * the existence of a cubic equation unsolvable in real radicals; * the existence of a quintic equation…

综合数学 · 数学 2026-01-08 A. Skopenkov

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

数论 · 数学 2019-11-04 Patrick Letendre

Let $f(x)=x^{12}+ax^6+b \in \mathbb{Q}[x]$ be an irreducible polynomial, $g_4(x)=x^4+ax^2+b$, $g_6(x)=x^6+ax^3+b$, and let $G_4$ and $G_6$ be the Galois group of $g_4(x)$ and $g_6(x)$, respectively. Building upon known characterizations of…

数论 · 数学 2025-08-08 Malcolm Hoong Wai Chen