中文
相关论文

相关论文: An extension of a second irreducibility theorem of…

200 篇论文

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

环与代数 · 数学 2017-03-22 Jason K. C. Polak

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…

Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…

数论 · 数学 2011-12-20 Andrew Bremner , Maciej Ulas

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

数论 · 数学 2020-12-11 Stephan Ramon Garcia , Ethan Simpson Lee , Josh Suh , Jiahui Yu

A polynomial $f(x)$ over a field $K$ is said to be stable if all its iterates are irreducible over $K$. L. Danielson and B. Fein have shown that over a large class of fields $K$, if $f(x)$ is an irreducible monic binomial, then it is stable…

数论 · 数学 2022-12-21 Mohamed Ayad , Boualem Benseba , Mohamed Madi

By using methods developed in arXiv:math/0602181 we study the irreducibility of certain Wakimoto modules for $\widehat{sl_2}$ at the critical level. We classify all $\chi \in {\Bbb C}((z))$ such that the corresponding Wakimoto module…

量子代数 · 数学 2015-11-26 Drazen Adamovic

We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct…

数论 · 数学 2017-01-20 Andrew Booker , Tim Browning

We study the class of univariate polynomials $\beta_k(X)$, introduced by Carlitz, with coefficients in the algebraic function field $\mathbb F_q(t)$ over the finite field $\mathbb F_q$ with $q$ elements. It is implicit in the work of…

数论 · 数学 2023-10-04 Robert Tichy , Daniel Windisch

The ring of integer-valued polynomials over a given subset $S$ of $\Z$ (or $ \mathrm{Int}(S,\Z ))$ is defined as the set of polynomials in $\Q[x]$ which maps $S$ to $\Z$. In factorization theory, it is crucial to check the irreducibility of…

交换代数 · 数学 2021-09-28 Devendra Prasad

We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite field, to show that for every $k$, the irreducible polynomials in $\mathbf{F}_q[t]$ contain configurations of the…

数论 · 数学 2009-09-02 Thai Hoang Le

While solving a special case of a question of Erd\H{o}s and Graham Steinerberger asks for all integers $n$ with $\phi(n)=\frac{2}{3} \cdot (n+1)$. He discovered the solutions $n\in\{5, 5 \cdot 7, 5\cdot 7\cdot 37, 5\cdot 7\cdot 37\cdot…

数论 · 数学 2025-04-29 Christian Hercher

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

数论 · 数学 2025-03-04 Nicolae Ciprian Bonciocat , Rishu Garg , Jitender Singh

Very simple sufficient conditions for the irreducibility of $f(X^n)$ over an arbitrary unique factorization domain $Z$ are established via a generalization of a well known theorem of A. Capelli.

环与代数 · 数学 2013-08-22 Natalio H. Guersenzvaig

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

数论 · 数学 2017-01-30 D. R. Heath-Brown , Giacomo Micheli

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…

数论 · 数学 2016-04-15 Aleksandr Tuxanidy , Qiang Wang

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

数论 · 数学 2023-03-31 Lenny Jones

Every polynomial of the form $P=(x+1)(x^{n-1}+c_1x^{n-2}+\cdots +c_{n-1})$ is representable as Schur-Szeg\H{o} composition of $n-1$ polynomials of the form $(x+1)^{n-1}(x+a_i)$, where the numbers $a_i$ are unique up to permutation. We give…

经典分析与常微分方程 · 数学 2015-04-08 Vladimir Petrov Kostov

Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…

交换代数 · 数学 2023-07-18 Moritz Hiebler , Sarah Nakato , Roswitha Rissner

The aim of the paper is to produce new families of irreducible polynomials, generalizing previous results in the area. One example of our general result is that for a near-separated polynomial, i.e., polynomials of the form…

符号计算 · 计算机科学 2019-03-21 Jaime Gutierrez , Jorge Jimenez Urroz

Given integers $\ell > m >0$, we define monic polynomials $X_n$, $Y_n$, and $Z_n$ with the property that $\mu$ is a zero of $X_n$ if and only if the triple $(\mu,\mu+m,\mu+\ell)$ satisfies $x^n + y^n = z^n$. It is shown that the…

历史与综述 · 数学 2021-12-13 Pietro Paparella