中文
相关论文

相关论文: On the irreducibility of the non-cyclotomic part o…

200 篇论文

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

数论 · 数学 2020-06-09 Biswajit Koley , A. Satyanarayana Reddy

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

数论 · 数学 2020-04-02 Biswajit Koley , A. Satyanarayana Reddy

We show that $0,1$-polynomials of high degree and few terms are irreducible with high probability. Formally, let $k\in\mathbb{N}$ and $F(x)=1+\sum_{i=1}^kx^{n_i}$, where $ 0<n_1<\cdots<n_k\leq N. $ Then we show that…

数论 · 数学 2024-10-15 Alexandros Kalogirou

In this article we study the irreducibility of polynomials of the form $x^n+\epsilon_1 x^m+p^k\epsilon_2$, $p$ being a prime number. We will show that they are irreducible for $m=1$. We have also provided the cyclotomic factors and…

数论 · 数学 2019-07-10 Biswajit Koley , A. Satyanarayana Reddy

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

交换代数 · 数学 2016-12-07 Anuj Jakhar , Neeraj Sangwan

We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…

交换代数 · 数学 2022-05-11 Nicholas Phat Nguyen

Let $n \neq 8$ be a positive integer such that $n+1 \neq 2^u$ for any integer $u\geq 2$. Let $\phi(x)$ belonging to $\mathbb{Z}[x]$ be a monic polynomial which is irreducible modulo all primes less than or equal to $n+1$. Let $a_j(x)$ with…

数论 · 数学 2023-06-07 Anuj Jakhar , Ravi Kalwaniya

We present several approaches on finding necessary and sufficient conditions on $n$ so that $\Phi_k(x^n)$ is irreducible where $\Phi_k$ is the $k$-th cyclotomic polynomial.

数论 · 数学 2011-08-10 Pantelis A. Damianou

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

数论 · 数学 2025-11-19 Oleksiy Klurman , Vlad Matei

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

历史与综述 · 数学 2016-12-21 Akash Jena , Binod Kumar Sahoo

The Schinzel Hypothesis is a conjecture about irreducible polynomials in one variable over the integers: under some standard condition, they should assume infinitely many prime values at integers. We consider a relative version: if the…

数论 · 数学 2020-02-13 Arnaud Bodin , Pierre Dèbes , Salah Najib

We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…

数论 · 数学 2018-03-30 William Sawin , Mark Shusterman , Michael Stoll

Let $p$ be a prime number. As a standard application of the irreducibility criterion of Eisenstein, it is well known that the $p$-th cyclotomic polynomial $\Phi_p(t)=1+t+\dots+t^{p-1}$ is the minimal polynomial of $e^{2\pi i/p}$ over…

历史与综述 · 数学 2022-10-28 Tom Moshaiov

The Schinzel hypothesis claims (but it seems hopeless to prove) that any irreducible Q[x] polynomial without a constant factor assumes infinitely many prime values at integer places. On the other hand, it is easy to see that a reducible…

数论 · 数学 2007-05-23 Yong-Gao Chen , Gabor Kun , Gabor Pete , Imre Z. Ruzsa , Adam Timar

We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…

经典分析与常微分方程 · 数学 2020-07-02 Codruţ Grosu , Corina Grosu

For positive integers $n>k$, let $P_{n,k}(x)=\displaystyle\sum_{j=0}^k \binom{n}{j}x^j $ be the polynomial obtained by truncating the binomial expansion of $(1+x)^n$ at the $k^{th}$ stage. These polynomials arose in the investigation of…

数论 · 数学 2013-06-05 Sudesh K. Khanduja , Ramneek Khassa , Shanta Laishram

In this note, we prove an irreducibility criterion for the polynomial of the form $f(x) = a_{n}x^{n} + a_{n-1}x^{n-1} + \cdots + a_{m}x^{m} + p^{u} \in \mathbb{Z}[x]$, where $p$ is a prime number, $u \geqslant 1$, $\gcd(u, m) = 1$, $p \nmid…

数论 · 数学 2023-03-08 Zhang Weilin , Yuan Pingzhi

Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero. In the paper we give a criterion of nearly irreducibility for a given polynomial f in…

代数几何 · 数学 2019-05-08 Mateusz Masternak

Let $f(t_1, \ldots, t_r, X)\in \mathbb{Z}[t_1, \ldots, t_r,X]$ be irreducible and let $a_1, \ldots, a_r\in \mathbb{Z} \smallsetminus \{0,\pm 1\}$. Under a necessary ramification assumption on $f$, and conditionally on the Generalized…

数论 · 数学 2024-05-08 Lior Bary-Soroker , Daniele Garzoni , Vlad Matei

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
‹ 上一页 1 2 3 10 下一页 ›