English
Related papers

Related papers: Jacobi-Stirling polynomials and $P$-partitions

200 papers

Let us consider a cyclic extension of a function field defined over a finite field. For a character (non-trivial) of this extension, we calculate, as a linear combinations of products of Jacobi sums, the coefficients of the polynomial given…

Number Theory · Mathematics 2014-09-22 Alvarez Arturo

The aim of this paper is to give a new approach to modified $q$-Bernstein polynomials for functions of several variables. By using these polynomials, the recurrence formulas and some new interesting identities related to the second Stirling…

Number Theory · Mathematics 2019-07-04 Serkan Araci , Mehmet Acikgoz , Hassan Jolany , Armen Bagdasaryan

In this paper, we study a class of orthogonal polynomials defined by a three-term recurrence relation with periodic coefficients. We derive explicit formulas for the generating function, the associated continued fraction, the orthogonality…

Classical Analysis and ODEs · Mathematics 2025-07-01 Dan Dai , Mourad E. H. Ismail , Xiang-Sheng Wang

In the paper, the author establishes some identities which show that the functions $\frac1{(1-e^{\pm t})^k}$ and the derivatives $\bigl(\frac1{e^{\pm t}-1}\bigr)^{(i)}$ can be expressed each other by linear combinations with coefficients…

Classical Analysis and ODEs · Mathematics 2014-03-07 Feng Qi

We construct noncomplete orthogonal systems on the ray $[0,\infty)$ that look like Jacobi polynomials $P_n(x)$ after a shift of degree $n\mapsto n+a$, where $a$ is a real constant. These systems are solutions of some exotic Sturm-Liouville…

Classical Analysis and ODEs · Mathematics 2012-11-27 Yurii A. Neretin

In the paper, by establishing a new and explicit formula for computing the $n$-th derivative of the reciprocal of the logarithmic function, the author presents new and explicit formulas for calculating Bernoulli numbers of the second kind…

Combinatorics · Mathematics 2014-05-06 Feng Qi

In this paper we give simple expressions, involving binomials coefficients, for the value of $c(n,k)$ modulo $p^{v_p(n)}$, when $v_p(n) > 0$. Here $c(n,k)$ denotes a Stirling number of the first kind, and $v_p(n)$ is the highest power of…

Number Theory · Mathematics 2015-12-04 Pierre Guillot , Yohann Ségalat

We introduce a new generalization of Stirling numbers of the second kind and analyze their properties, including generating functions, integral representations, and recurrence relations. These numbers are used to approximate Riemann zeta…

Number Theory · Mathematics 2025-10-09 Kamel Mezlini , Tahar Moumni , Najib Ouled Azaiez

We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…

Number Theory · Mathematics 2016-05-10 George E. Andrews , Matthias Beck , Neville Robbins

We show that the determinant of a Hankel matrix of odd dimension n whose entries are the enumerators of the Jacobi symbols which depend on the row and the column indices vanishes iff n is composite. If the dimension is a prime p, then the…

Combinatorics · Mathematics 2008-03-20 Omer Egecioglu

Main purpose of this paper is to reconstruct generating function of the Bernstein type polynomials. Some properties this generating functions are given. By applying this generating function, not only derivative of these polynomials but also…

Classical Analysis and ODEs · Mathematics 2011-12-12 Yilmaz Simsek

In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…

Discrete Mathematics · Computer Science 2010-12-30 Manosij Ghosh Dastidar , Sourav Sen Gupta

We find that a wide variety of families of partition statistics stabilize in a fashion similar to $p_k(n)$, the number of partitions of n with k parts, which satisfies $p_k(n) = p_{k+1}(n + 1), k \geq n/2$. We bound the regions of…

Combinatorics · Mathematics 2013-07-05 Robert P. Boyer , William J. Keith

We investigate the differential equation for the Jacobi-type polynomials which are orthogonal on the interval $[-1,1]$ with respect to the classical Jacobi measure and an additional point mass at one endpoint. This scale of higher-order…

Classical Analysis and ODEs · Mathematics 2017-04-25 Clemens Markett

We present a natural extension of Andrews' multiple sums counting partitions with difference 2 at distance $k-1$, by deriving the generating function for $K$-restricted jagged partitions. A jagged partition is a collection of non-negative…

Mathematical Physics · Physics 2007-05-23 J. -F. Fortin , P. Jacob , P. Mathieu

In this paper, we consider the poly-Bernoulli numbers and polynomials of the second kind and presents new and explicit formulae for calculating the poly-Bernoulli numbers of the second kind and the Stirling numbers of the second kind.

Number Theory · Mathematics 2014-06-25 Taekyun Kim , Sang-Hun Lee , Jongjin Seo

The discrete acyclic convolution computes the 2n-1 sums sum_{i+j=k; (i,j) in [0,1,2,...,n-1]^2} (a_i b_j) in O(n log n) time. By using suitable offsets and setting some of the variables to zero, this method provides a tool to calculate all…

Data Structures and Algorithms · Computer Science 2019-10-28 Mitsuru Funakoshi , Julian Pape-Lange

We present a constructive proof of Jacobi's identity for the sum of two squares. We present a combinatorial proof of the Jacobi Triple Product and combine with a proof of Hirschhorn to define an algorithm. The input is a factorization…

Combinatorics · Mathematics 2019-07-16 Mario DeFranco

We introduce the $B$-Stirling numbers of the first and second kind, which are the coefficients of the potential polynomials when we express them in terms of the monomials and the falling factorials, respectively. These numbers include, as…

Combinatorics · Mathematics 2024-10-17 José A. Adell , Beáta Bényi

For $k$ a positive integer let $S_k(n) = 1^k + 2^k + \cdots + n^k$, i.e., $S_k(n)$ is the sum of the first $k$-th powers. Faulhaber conjectured (later proved by Jacobi) that for $k$ odd, $S_k(n)$ could be written as a polynomial of…

Number Theory · Mathematics 2020-09-08 Steven J. Miller , Enrique Treviño