中文
相关论文

相关论文: A one--parameter family of polynomials with Galois…

200 篇论文

Let $f(x)=(x^{k}+c)^{m}-ax^{n}\in\mathbb{Z}[x]$ be an irreducible polynomial over $\mathbb{Q}$, where $k,m,n\in\mathbb{N}$ with $km>n$, and let $K=\mathbb{Q}(\theta)$, where $\theta$ is a root of $f(x)$. We investigate the arithmetic…

数论 · 数学 2026-02-24 Rupam Barman , Anuj Jakhar , Ravi Kalwaniya , Prabhakar Yadav

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…

数论 · 数学 2007-05-23 Jack Sonn

We study the irreducibility and Galois group of random polynomials over function fields. We prove that a random polynomial $f=y^n+\sum_{i=0}^{n-1}a_i(x)y^i\in\mathbb F_q[x][y]$ with i.i.d coefficients $a_i$ taking values in the set…

数论 · 数学 2024-07-08 Alexei Entin , Alexander Popov

Let $P(T,X)$ be an irreducible polynomial in two variables with rational coefficients. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $t$ the specialized polynomial $P(t,X)$ is irreducible and has the same…

数论 · 数学 2016-10-13 David Krumm

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

代数几何 · 数学 2016-05-26 Jonathan D. Hauenstein , Jose Israel Rodriguez , Frank Sottile

For positive integers $n$, the truncated binomial expansions of $(1+x)^n$ which consist of all the terms of degree $\le r$ where $1 \le r \le n-2$ appear always to be irreducible. For fixed $r$ and $n$ sufficiently large, this is known to…

数论 · 数学 2018-03-08 Michael Filaseta , Richard Moy

In the present paper we derive complicated families of orthogonal polynomials in one variable from scratch using the known ones as building blocks. We recall the basics of operational formalism and introduce the notations we use throughout…

数论 · 数学 2026-01-14 Danil Krotkov

Andrews and Petsche proposed in 2020 a conjectural characterization of all pairs $(f,\alpha)$, where $f$ is a polynomial over a number field $K$ and $\alpha\in K$, such that the dynamical Galois group of the pair $(f,\alpha)$ is abelian. In…

数论 · 数学 2023-06-01 Andrea Ferraguti , Carlo Pagano

For any $n\geq 1$, let $T_n$ be the complete binary rooted tree of height $n$, and $f(x)=(x+a)^2-a-1$ such that $a\neq \pm b^2$ for any $b\in \mathbb{Z}$. In \cite{Settled}, Jones and Boston empirically observed that iteratively applying a…

数论 · 数学 2018-09-26 Vefa Goksel

We compute the E-polynomials of a family of twisted character varieties by proving they have polynomial count, and applying a result of N. Katz on the counting functions. To compute the number of GF(q)-points of these varieties as a…

数论 · 数学 2010-06-08 Martin Mereb

The Cauchy polynomials with a $q$ parameter were recently defined, and several arithmetical properties were studied. In this paper, we establish explicit formulae for computing the Cauchy polynomials with a $q$ parameter in terms of…

组合数学 · 数学 2018-04-17 F. A. Shiha

We introduce a new family of symmetric multivariate polynomials, whose coefficients are meromorphic functions of two parameters $(q,t)$ and polynomial in a further two parameters $(u,v)$. We evaluate these polynomials explicitly as a matrix…

数学物理 · 物理学 2017-04-05 Alexandr Garbali , Jan de Gier , Michael Wheeler

Let $S= \{ a_{1}, a_{2}, \dots, a_{n} \}$ be a finite set of non-zero integers. In \cite{KBAM21}, Karthick Babu and Anirban Mukhopadhyay calculated the explicit structure of the Galois group of multi-quadratic field…

数论 · 数学 2022-01-05 Karthick Babu C G , Anirban Mukhopadhyay , Sehra Sahu

We present a simple method for the construction of polynomials with cyclic Galois groups, hoping to encourage a reader with some background in algebra to make computations of his/her own.

数论 · 数学 2015-05-25 Kurt Girstmair

We construct explicit non-isotrivial families of polynomials over $\mathbb{Q}$ satisfying uniform boundedness for their rational preperiodic points.

数论 · 数学 2024-08-27 Hector Pasten

The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all…

符号计算 · 计算机科学 2020-05-06 Tao Zheng

In this paper, we utilize our previous results on mod p monodromy of cyclic coverings of the projective line to realize a large series of groups of the form PSL(n, q) and PSU(n, q) as Galois groups over Q. We achieve for the first time a…

数论 · 数学 2026-05-01 Stepan Nesterov

Using the theory of Newton Polygons, we formulate a simple criterion for the Galois group of a polynomial to be ``large.'' For a fixed $\alpha \in \Q - \Z_{<0}$, Filaseta and Lam have shown that the $n$th degree Generalized Laguerre…

数论 · 数学 2007-05-23 Farshid Hajir

We present a new explicit family of polynomials orthogonal on the unit circle with a dense point spectrum. This family is expressed in terms of q-hypergeometric function of type ${_2}\phi_1$. The orthogonality measure is the wrapped…

经典分析与常微分方程 · 数学 2020-12-22 Alexei Zhedanov

Suppose that $f(x)=x^4+Ax^3+Bx^2+Ax+1\in {\mathbb Z}[x]$. We say that $f(x)$ is monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\theta^3\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

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