English
Related papers

Related papers: Splitting fields of $X^n-X-1$ (particularly for $n…

200 papers

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…

Number Theory · Mathematics 2017-06-28 Yoshiyuki Kitaoka

We classify complete permutation polynomials of type $aX^{\frac{q^n-1}{q-1}+1}$ over the finite field with $q^n$ elements, for $n+1$ a prime and $n^4 < q$. For the case $n+1$ a power of the characteristic we study some known families. We…

Combinatorics · Mathematics 2017-02-20 Daniele Bartoli , Massimo Giulietti , Luciane Quoos , Giovanni Zini

We study the distributions of the splitting primes in certain families of number fields. The first and main example is the family Pn,N of integer polynomials monic of degree n with height less or equal then N, and then let N go to infinity.…

Number Theory · Mathematics 2024-09-10 Ilaria Viglino

Extending work of J. Raleigh, we compute polynomials $P_{n,F}(x)$ associated to certain families $F = \{f_m\}_{m = 3, 4, ...}$ of modular forms for Hecke groups $G(\lambda_m)$ with the property that $P_{n,F}(m)$ is the $n^{th}$ coefficient…

Number Theory · Mathematics 2021-09-16 Barry Brent

Let $\mathbb{F}_q$ be a finite field with $q$ elements, $f \in \mathbb{F}_q[x_1, \dots, x_n]$ a polynomial in $n$ variables and let us denote by $N(f)$ the number of roots of $f$ in $\mathbb{F}_q^n$. %Many authors, such as Wei Cao and Kung…

Number Theory · Mathematics 2023-12-08 José Gustavo Coelho , Fabio Enrique Brochero Martínez

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

Number Theory · Mathematics 2019-01-11 F. E. Brochero Martínez , Lucas Reis , Lays Silva

The factorizations of the polynomial $X^n-1$ and the cyclotomic polynomial $\Phi_n$ over a finite field $\mathbb F_q$ have been studied for a very long time. Explicit factorizations have been given for the case that $\mathrm{rad}(n)\mid…

Number Theory · Mathematics 2024-02-09 Anna-Maurin Graner

We characterize the fixed divisor of a polynomial $f(X)$ in $\mathbb{Z}[X]$ by looking at the contraction of the powers of the maximal ideals of the overring ${\rm Int}(\mathbb{Z})$ containing $f(X)$. Given a prime $p$ and a positive…

Commutative Algebra · Mathematics 2018-10-03 Giulio Peruginelli

We investigate some Galois groups of linearized polynomials over fields such as $\mathbb{F}_q(t)$. The space of roots of such a polynomial is a module for its Galois group. We present a realization of the symmetric powers of this module, as…

Number Theory · Mathematics 2022-06-06 Rod Gow , Gary McGuire

For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…

Number Theory · Mathematics 2025-12-01 Foivos Chnaras , Noah Kupinsky

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

Number Theory · Mathematics 2023-12-19 N. A. Carella

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…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

Number Theory · Mathematics 2018-10-16 Oleksiy Klurman , Marc Munsch

For each positive integer n this paper considers a one-parameter family of complex-valued measures on the symmetric group S_n, depending on a complex parameter z. For parameter values z=p^f a prime power, this measure describes splitting…

Number Theory · Mathematics 2018-01-18 Jeffrey C. Lagarias

In this paper, we examine a natural question concerning the divisors of the polynomial x^n-1: "How often does x^n-1 have a divisor of every degree between 1 and n?" In a previous paper, we considered the situation when x^n-1 is factored in…

Number Theory · Mathematics 2012-06-21 Lola Thompson

Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated…

Computational Complexity · Computer Science 2014-07-15 David Harvey , Joris van der Hoeven , Grégoire Lecerf

We explicitly describe the splitting of odd integral primes in the radical extension $\mathbb{Q}(\sqrt[n]{a})$, where $x^n-a$ is an irreducible polynomial in $\mathbb{Z}[x]$. Our motivation is to classify common index divisors, the primes…

Number Theory · Mathematics 2025-07-25 Hanson Smith

For a polynomial $f(x)\in\mathbb Z[x]$ without non-trivial linear relations among roots, we propose a conjecture on the distribution of the least root $r_p$ ($r_p\in\mathbb Z,\,0\le r_p<p)$ of $f(x)\equiv0\bmod p$ where $p$ runs over the…

Number Theory · Mathematics 2017-06-13 Yoshiyuki Kitaoka

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

Number Theory · Mathematics 2015-12-01 F. E. Brochero Martínez , Lucas Reis

Following work of V\'elez, we explicitly describe the splitting of the integral prime 2 in the radical extension $\mathbb{Q}(\sqrt[n]{a})$, where $x^n-a$ is an irreducible polynomial in $\mathbb{Z}[x]$. With previous work of the second…

Number Theory · Mathematics 2025-12-30 Dylan Scofield , Hanson Smith
‹ Prev 1 2 3 10 Next ›