English
Related papers

Related papers: Irreducible polynomials over $\mathbb{F}_{2^r}$ wi…

200 papers

We give a new proof of the Hansen-Mullen irreducibility conjecture. The proof relies on an application of a (seemingly new) sufficient condition for the existence of elements of degree $n$ in the support of functions on finite fields. This…

Number Theory · Mathematics 2016-04-15 Aleksandr Tuxanidy , Qiang Wang

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

Number Theory · Mathematics 2020-08-03 Anuj Jakhar , Srinivas Koytada

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Classical Analysis and ODEs · Mathematics 2009-04-20 M. A. M. Alwash

Goppa codes are particularly appealing for cryptographic applications. Every improvement of our knowledge of Goppa codes is of particular interest. In this paper, we present a sufficient and necessary condition for an irreducible monic…

Information Theory · Computer Science 2021-07-23 Xia Li , Qin Yue , Daitao Huang

Let $q$ be an odd prime power and $\mathbb{F}_q$ be the finite field of $q$ elements. We define the Rudin-Shapiro function $R$ on monic polynomials $f=t^n+f_{n-1}t^{n-1}+\dots + f_0\in\mathbb{F}_q[t]$ over $\mathbb{F}_q$ by $$…

Number Theory · Mathematics 2025-08-14 László Mérai

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…

Number Theory · Mathematics 2007-05-23 Arnaud Bodin , Pierre Dèbes , Salah Najib

Using Katz's equidistribution framework, we show that for any squarefree polynomial $f \in \mathbb{F}_q[t]$ of degree $n \ge 2$, every residue class modulo $f$ can be represented as a product of two monic irreducible polynomials of degree…

Number Theory · Mathematics 2025-11-11 Likun Xie

We provide an alternative exposition of a result due to Schinzel. Fix an integer $k \ge 2$. For almost all choices of positive integers $n_{1} < \cdots < n_{k}$, we show that the polynomial $F(x) = 1 + x^{n_{1}} + \cdots + x^{n_{k}}$,…

Number Theory · Mathematics 2025-08-19 Michael Filaseta , Alexandros Kalogirou

Let $f(x)$ be a square free quartic polynomial defined over a quadratic field $K$ such that its leading coefficient is a square. If the continued fraction expansion of $\displaystyle \sqrt{f(x)}$ is periodic, then its period $n$ lies in the…

Number Theory · Mathematics 2016-07-01 Mohammad Sadek

We establish a lower bound for the frequency with which an irreducible monic cubic polynomial with negative discriminant can be expressed as a sum of two squares ($\square_{2}$). This provides a quantitative answer to a question posed by…

Number Theory · Mathematics 2026-05-19 Siddharth Iyer

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,…

Number Theory · Mathematics 2023-11-07 Alp Bassa , Gaetan Bisson , Roger Oyono

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

Number Theory · Mathematics 2007-05-23 Anca Iuliana Bonciocat , Alexandru Zaharescu

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements and $\mathbb{F}_{q}[x]$ the ring of polynomials over $\mathbb{F}_{q}$. Let $l(x), k(x)$ be coprime polynomials in $\mathbb{F}_{q}[x]$ and $\Phi(k)$ the Euler function in…

Combinatorics · Mathematics 2020-02-21 Zhang Zihan , Han Dongchun

The goal of this paper is to prove that a random polynomial with i.i.d. random coefficients taking values uniformly in $\{1,\ldots, 210\}$ is irreducible with probability tending to $1$ as the degree tends to infinity. Moreover, we prove…

Number Theory · Mathematics 2020-03-18 Lior Bary-Soroker , Gady Kozma

In this paper we prove that decomposable forms, or homogeneous polynomials $F(x_1, \cdots, x_n)$ with integer coefficients which split completely into linear factors over $\mathbb{C}$, take on infinitely many square-free values subject to…

Number Theory · Mathematics 2019-08-15 Stanley Yao Xiao

Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…

Number Theory · Mathematics 2025-11-07 Péter P. Varjú , Max Wenqiang Xu

Let $f$ be sampled uniformly at random from the set of degree $n$ polynomials whose coefficients lie in $\{ \pm 1\}$. A folklore conjecture, known to hold under GRH, states that the probability that $f$ is irreducible tends to $1$ as $n$…

Number Theory · Mathematics 2024-01-09 Lior Bary-Soroker , David Hokken , Gady Kozma , Bjorn Poonen

Let $k \geq 1$ be a natural number and $f \in \mathbb{F}_q[t]$ be a monic polynomial. Let $\omega_k(f)$ denote the number of distinct monic irreducible factors of $f$ with multiplicity $k$. We obtain asymptotic estimates for the first and…

Number Theory · Mathematics 2024-09-16 Sourabhashis Das , Ertan Elma , Wentang Kuo , Yu-Ru Liu

We estimate several probability distributions arising from the study of random, monic polynomials of degree $n$ with coefficients in the integers of a general $p$-adic field $K_{\mathfrak{p}}$ having residue field with $q= p^f$ elements. We…

Number Theory · Mathematics 2014-09-03 Benjamin L. Weiss

We present three proofs of an observation of Ahmadi on the number of irreducible polynomials over $\text{GF}(2)$ with certain traces and cotraces, the most interesting of which uses an explicit natural bijection. We also present two proofs…

Combinatorics · Mathematics 2023-02-24 Robert Granger
‹ Prev 1 3 4 5 6 7 10 Next ›