English
Related papers

Related papers: Convolution polynomials

200 papers

One can think of power series or polynomials in one variable, such as $P(x)=2x^3+x+5$, as functors from the category $\mathsf{Set}$ of sets to itself; these are known as polynomial functors. Denote by $\mathsf{Poly}_{\mathsf{Set}}$ the…

Category Theory · Mathematics 2020-11-05 David I. Spivak , David Jaz Myers

We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…

Classical Analysis and ODEs · Mathematics 2007-05-23 Geert-Jan Uytdewilligen

The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) +…

General Mathematics · Mathematics 2024-08-20 Subham De

The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…

General Mathematics · Mathematics 2024-11-20 Eteri Samsonadze

A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…

Quantum Physics · Physics 2009-11-10 Nicolae Cotfas

A characterization is given of those sequences of quasi-orthogonal polynomials which form also $q$-Appell sets.

Classical Analysis and ODEs · Mathematics 2017-07-18 P. Njionou Sadjang

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…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

A general description of the Vi\`ete coefficients of the gaussian period polynomials is given, in terms of certain symmetric representations of the subgroups and the corresponding quotient groups of the multiplicative group…

Combinatorics · Mathematics 2014-02-18 Serban Barcanescu

The operational calculus associated with Hermite numbers has been shown to be an effective tool for simplifying the study of special functions. Within this context, Hermite polynomials have been viewed as Newton binomials, with the…

Number Theory · Mathematics 2026-04-23 Giuseppe Dattoli , Subuhi Khan , Ujair Ahmad

We say a polynomial f having integer coefficients is strongly coefficient convex if the set of coefficients of f consists of consecutive integers only. We establish various results suggesting that the divisors of x^n-1 with integer…

Number Theory · Mathematics 2020-08-28 Andreas Decker , Pieter Moree

Recently, the functional equation \[ \sum_{i=0}^mf_i(b_ix+c_iy)= \sum_{i=1}^na_i(y)v_i(x) \] with $x,y\in\mathbb{R}^d$ and $b_i,c_i\in\mathbf{GL}_d(\mathbb{C})$, was studied by Almira and Shulman, both in the classical context of continuous…

Classical Analysis and ODEs · Mathematics 2017-02-06 J. M. Almira

Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…

Combinatorics · Mathematics 2016-01-13 Xueliang Li , Yongtang Shi

We introduce a refined version of group cohomology and relate it to the space of polynomials on the group in question. We show that the polynomial cohomology with trivial coefficients admits a description in terms of ordinary cohomology…

Group Theory · Mathematics 2020-08-12 David Kyed , Henrik Densing Petersen

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao

Some changes in a recent convolution formula are performed here in order to clean it up by using more conventional notations and by making use of more referrenced and documented components (namely Sierpi\'nski's polynomials, the Thue-Morse…

Number Theory · Mathematics 2020-01-15 Thomas Baruchel

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

Number Theory · Mathematics 2019-01-25 Fabián Arias , Jerson Borja , Luis Rubio

We look at the asymptotic behavior of the coefficients of the $q$-binomial coefficients (or Gaussian polynomials) $\binom{a+k}{k}_q$, when $k$ is fixed. We give a number of results in this direction, some of which involve Eulerian…

Combinatorics · Mathematics 2016-10-11 Richard P. Stanley , Fabrizio Zanello

We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…

Combinatorics · Mathematics 2024-03-07 Paweł Hitczenko

Systems of orthogonal polynomials whose recurrence coefficients tend to infinity are considered. A summability condition is imposed on the coefficients and the consequences for the measure of orthogonality are discussed. Also discussed are…

Classical Analysis and ODEs · Mathematics 2014-08-28 A. I. Aptekarev , J. S. Geronimo

In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of powers is studying. The…

Number Theory · Mathematics 2018-06-20 Svinin Andrei K