English
Related papers

Related papers: Factorization of spread polynomials

200 papers

We formulate a conjecture concerning spectral factorization of a class of trigonometric polynomials of two variables and prove it for special cases. Our method uses relations between the distribution of values of a polynomial of two…

Number Theory · Mathematics 2012-08-29 Wayne Lawton

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

Number Theory · Mathematics 2024-01-17 Jitender Singh , Rishu Garg

This note gives an elementary exposition of a variant of the spread polynomials in terms of Fibonacci and Lucas polynomials.

Combinatorics · Mathematics 2025-07-15 Johann Cigler

The Schinzel Hypothesis is a celebrated conjecture in number theory linking polynomial values and prime numbers. In the same vein we investigate the common divisors of values $P_1(n),\ldots, P_s(n)$ of several polynomials. We deduce this…

Number Theory · Mathematics 2020-05-04 Arnaud Bodin , Pierre Dèbes , Salah Najib

We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…

Number Theory · Mathematics 2014-08-22 Peter B. Borwein , Stephen K. K. Choi , Greg Martin , Charles L. Samuels

We study a bivariate variant of Hans-Christian Herbig's version of Norman Wildberger's spread polynomials.

Combinatorics · Mathematics 2025-08-08 Johann Cigler

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…

Number Theory · Mathematics 2026-05-19 Jitender Singh

According to the similarity theorem on the distributions of the effective prime factors and by using two-part method, Goldbach theorem and, consequently, Goldbach conjecture was proved.

General Mathematics · Mathematics 2013-11-07 Song Linggen

In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…

History and Overview · Mathematics 2007-05-23 Roberto Anglani , Margherita Barile

An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…

General Mathematics · Mathematics 2007-05-23 Max S. C. Woon

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

Number Theory · Mathematics 2017-11-16 Jonathan Hickman , James Wright

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

Number Theory · Mathematics 2025-12-24 Rishu Garg , Jitender Singh

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

Number Theory · Mathematics 2024-09-10 Jon Grantham , Andrew Granville

In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…

Combinatorics · Mathematics 2010-12-14 Peter J. McNamara

We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…

Combinatorics · Mathematics 2008-03-18 Francois Descouens , Hideaki Morita , Yasuhide Numata

The Schinzel hypothesis is a famous conjectural statement about primes in value sets of polynomials, which generalizes the Dirichlet theorem about primes in an arithmetic progression. We consider the situation that the ring of integers is…

Number Theory · Mathematics 2019-02-22 Arnaud Bodin , Pierre Dèbes , Salah Najib

Define the $n$-th fibotomic polynomial to be the product of the monic irredicible factors of the $n$-th Fibonacci polynomial which are not factors of any Fibonacci polynomial of smaller degree. In this paper, we prove a number of properties…

Number Theory · Mathematics 2025-06-24 Cameron Byer , Tyler Dvorachek , Emily Eckard , Joshua Harrington , Lindsey Wise , Tony W. H. Wong

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…

Classical Analysis and ODEs · Mathematics 2023-11-16 Hamed Taghavian

The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from…

Formal Languages and Automata Theory · Computer Science 2015-08-28 Gabriele Fici
‹ Prev 1 2 3 10 Next ›