中文
相关论文

相关论文: On the irreducibility of a truncated binomial expa…

200 篇论文

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…

交换代数 · 数学 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…

数论 · 数学 2016-07-26 Nour-Eddine Fahssi

In this paper, we study the scaling properties of Legendre polynomials Pn(x). We show that Pn(ax), where a is a constant, can be expanded as a sum of either Legendre polynomials Pn(x) or their multiple derivatives dkPn(x)/dxk, and we derive…

经典分析与常微分方程 · 数学 2017-11-06 Guillaume Marc Laurent , Geoffrey Robert Harrison

Schinzel's Hypothesis H is a general conjecture in number theory on prime values of polynomials that generalizes, e.g., the twin prime conjecture and Dirichlet's theorem on primes in arithmetic progression. We prove an arithmetic analog of…

数论 · 数学 2010-09-21 Lior Bary-Soroker

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

Pak-Robichaux recently introduced a signed puzzle rule for Schubert structure constants, which they use to show that sums $\gamma_k(n)$ of these constants with a bounded number of inversions are polynomial. We give a different, conceptual…

组合数学 · 数学 2025-06-17 Ada Stelzer

Schubert polynomials are a basis for the polynomial ring that represent Schubert classes for the flag manifold. In this paper, we introduce and develop several new combinatorial models for Schubert polynomials that relate them to other…

组合数学 · 数学 2020-03-05 Sami Assaf

H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…

数论 · 数学 2022-09-22 Evan M. O'Dorney

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

数论 · 数学 2026-05-19 Jitender Singh

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…

数论 · 数学 2026-05-19 Siddharth Iyer

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

最优化与控制 · 数学 2021-05-12 Amir Ali Ahmadi , Cemil Dibek , Georgina Hall

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

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

数论 · 数学 2021-09-23 Lucile Devin , Xianchang Meng

We obtain asymptotics for sums of the form $$ \sum_{n=1}^P e(\alpha_kn^k + \alpha_1n), $$ involving lower order main terms. As an application, we show that for almost all $\alpha_2 \in [0,1)$ one has $$ \sup_{\alpha_1 \in [0,1)} \Big|…

The $n^{th}$ cyclotomic polynomial $\Phi_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Its coefficients are the subject of intensive study and some formulas are known for them. Here we are interested in formulas…

数论 · 数学 2018-08-23 Andrés Herrera-Poyatos , Pieter Moree

In this paper one extends the binomial and trinomial coefficients to the concept of 'k-nomial' coefficients, and one obtains some properties of these. As an application one generalizes Pascal's triangle.

综合数学 · 数学 2007-05-23 Florentin Smarandache

The divisibility of truncated binomial series by their exponent n is analyzed. Divisibility is shown to depends on the divisibility characteristics of the integers constituting the binomials. Series division by the highest possible powers…

综合数学 · 数学 2014-06-03 Anatoly Grinberg

The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials. We formulate some basic properties of unitary cyclotomic polynomials and study how they are connected with cyclotomic, inclusion-exclusion and…

数论 · 数学 2019-11-06 Pieter Moree , László Tóth

In this paper, we study the binomial sum $S_{n}(q):=% \overset{n}{\underset{k=0}{\sum }}a_{k}\binom{n}{k}\left( 1-q\right) ^{k}q^{n-k}$ for a given sequence $\left( a_{n}\right) $ of real or complex numbers. We express $S_{n}(q)$ in…

数论 · 数学 2026-03-10 Laid Elkhiri , Miloud Mihoubi , Meriem Moulay

The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients…

数论 · 数学 2014-12-19 Qi-Fei Chen , Victor J. W. Guo