English
Related papers

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

200 papers

Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…

Combinatorics · Mathematics 2024-12-11 Michael Neubauer , Harmony Vargas

Wolstenholme's type summations involve certain powers of all residues $k$ modulo some prime number $p$. We first consider the sums of double or triple products of certain powers of all residues, e.g., the sums of the terms $(a+k)^m(b+k)^n$…

Number Theory · Mathematics 2024-08-22 Zubeyir Cinkir

We study $B(n;k)$, the number of ways of writing $n$ as a sum or difference of the first $k$ Fibonacci numbers. We show that $B(0;k)$ satisfies the Tribonacci-like recurrence $B(0;k+1)=B(0;k)+B(0;k-1)+B(0;k-2)$ and that $B(n;k)$ satisfies a…

Number Theory · Mathematics 2026-04-20 Katie Anders , Madeline L. Dawsey , Joseph Vandehey

A partition on $[n]$ has a crossing if there exists $i\_1<i\_2<j\_1<j\_2$ such that $i\_1$ and $j\_1$ are in the same block, $i\_2$ and $j\_2$ are in the same block, but $i\_1$ and $i\_2$ are not in the same block. Recently, Chen et al.…

Combinatorics · Mathematics 2009-01-23 Mireille Bousquet-Mélou , Guoce Xin

Let $\overline{p}(n)$ denote the overpartition function. Liu and Zhang showed that $\overline{p}(a) \overline{p}(b)>\overline{p}(a+b)$ for all integers $a,b>1$ by using an analytic result of Engle. We offer in this paper a combinatorial…

Combinatorics · Mathematics 2022-07-01 Xixi Li

We introduce the theory of $(\mathcal{P},\rho)$-partitions, depending on a poset $\mathcal{P}$ and a map $\rho$ from $\mathcal{P}$ to positive integers. The generating function $\mathfrak{F}_{\mathcal{P},\rho}$ of…

Combinatorics · Mathematics 2020-03-05 Sami Assaf , Nantel Bergeron

Let $p$ be any prime and let $a$ and $n$ be positive integers with $p\nmid n$. We show that $$\sum_{k=1}^{p^a-1}\frac{B_k}{(-n)^k}\equiv a(-1)^{n-1}D_{n-1}\pmod {p},$$ where $B_0,B_1,\ldots$ are the Bell numbers and $D_0,D_1,\ldots$ are the…

Combinatorics · Mathematics 2020-10-23 Zhi-Wei Sun

Is is shown in this paper that there is a connection between the Riemann zeta-function $\zf$ and the classical Jacobi's polynomials, i.e. the Legendre polynomials, Chebyshev polynomials of the first and the second kind,...

Classical Analysis and ODEs · Mathematics 2010-11-19 Jan Moser

We obtain a finite-sum representation for the general solution of the Jacobi second-order difference equation D(p(n-1)Du(n-1))+q(n)u(n)=l r(n)u(n) in terms of a nonvanishing solution corresponding to some fixed value of the spectral…

Mathematical Physics · Physics 2011-11-18 Hugo M. Campos , Vladislav V. Kravchenko

Let N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…

Number Theory · Mathematics 2018-04-04 Emmanuel Lecouturier

We obtain asymptotic formulas for sums over arithmetic progressions of coefficients of polynomials of the form $$\prod_{j=1}^n\prod_{k=1}^{p-1}(1-q^{pj-k})^s,$$ where $p$ is an odd prime and $n, s$ are positive integers. Let us denote by…

Number Theory · Mathematics 2021-04-08 Jiyou Li , Xiang Yu

In this paper, we give the Jacobi polynomials for first-order generalized Reed--Muller codes. We show as a corollary the nonexistence of combinatorial $3$-designs in these codes.

Combinatorics · Mathematics 2024-02-27 Ryosuke Yamaguchi

We review and discuss some results on the representation of Bernoulli, poly-Bernoulli numbers, and Bernoulli and Cauchy polynomials in terms of Stirling numbers of the first or second kind, or in terms of r-Stirling numbers.

Number Theory · Mathematics 2022-06-17 Khristo N. Boyadzhiev

Szmytkowski derived a certain integral with Gegenbauer polynomials. A natural generalization is to derive lookalike integrals with Jacobi polynomials. Six methods are treated to derive the first integral. The first method should be enough…

Classical Analysis and ODEs · Mathematics 2022-02-01 Enno Diekema

In the present paper, we provide results that relate the Jacobi polynomials in genus $g$. We show that if a code is $t$-homogeneous that is, the codewords of the code for every given weight hold a $t$-design, then its Jacobi polynomial in…

Combinatorics · Mathematics 2025-02-13 Himadri Shekhar Chakraborty , Nur Hamid , Tsuyoshi Miezaki , Manabu Oura

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…

Combinatorics · Mathematics 2017-11-21 Rafael S. González D'León

In this paper, we study higher derivations of Jacobian type in positive characteristic. We give a necessary and sufficient condition for $(n-1)$-tuples of polynomials to be extendable in the polynomial ring in $n$ variables over an integral…

Algebraic Geometry · Mathematics 2019-08-27 Takanori Nagamine

This is a historical introduction to the theory of Stirling numbers of the second kind S(n,k) from the point of view of analysis. We tell the story of their birth in the book of James Stirling (1730) and show how they mature in the works of…

History and Overview · Mathematics 2018-06-26 Khristo N. Boyadzhiev

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

By using techniques of poset representation theory, we present a formula for the number of partitions of a positive integer into three polygonal numbers.

Combinatorics · Mathematics 2008-12-02 Agustin Moreno