中文
相关论文

相关论文: Shifted Jack polynomials, binomial formula, and ap…

200 篇论文

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 the paper, in light of the generating function of the complete Bell polynomials and other techniques, the author presents concise and elegant proofs of three formulas for the complete Bell polynomials.

组合数学 · 数学 2026-05-25 Feng Qi

In this study, we apply "r" times the binomial transform to k-Lucas sequence. Also, the Binet formula, summation, generating function of this transform are found using recurrence relation. Finally, we give the properties of iterated…

数论 · 数学 2016-04-26 Nazmiye Yilmaz , Necati Taskara

Jacobi-Trudy formula for a generalisation of Schur polynomials related to any sequence of orthogonal polynomials in one variable is given. As a corollary we have Giambelli formula for generalised Schur polynomials.

表示论 · 数学 2009-06-10 A. N. Sergeev , A. P. Veselov

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

离散数学 · 计算机科学 2026-04-10 Antonio E. Porreca , Marius Rolland

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

代数几何 · 数学 2020-06-15 Miguel N. Walsh

We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.

组合数学 · 数学 2022-08-03 Harold R. Parks , Dean C. Wills

In this letter I shall review my joint results with Vadim Kuznetsov and Evgeny Sklyanin [Indag. Math. 14 (2003), 451-482, math.CA/0306242] on separation of variables for the $A_n$ Jack polynomials. This approach originated from the work…

经典分析与常微分方程 · 数学 2008-04-24 Vladimir V. Mangazeev

We present positivity conjectures for the Schur expansion of Jack symmetric functions in two bases given by binomial coefficients. Partial results suggest that there are rich combinatorics to be found in these bases, including Eulerian…

组合数学 · 数学 2026-02-17 Per Alexandersson , James Haglund , George Wang

We extend the polynomial approach to hook length formula proposed in a recent joint paper with K\'arolyi, Nagy and Volkov to several other problems of the same type, including number of paths formula in the Young graph of strict partitions.

组合数学 · 数学 2015-04-07 Fedor Petrov

The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].

经典分析与常微分方程 · 数学 2019-10-03 K. Castillo , M. N. de Jesus , J. Petronilho

In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.

组合数学 · 数学 2013-07-02 Shamik Ghosh , Raibatak Sen Gupta , M. K. Sen

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…

组合数学 · 数学 2007-05-23 Ilse Fischer

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

数论 · 数学 2010-08-12 Melsik K. Kyuregyan , Gohar M. Kyureghyan

In this paper, by using some families of special numbers and polynomials with their generating functions, we give various properties of these numbers and polynomials. These numbers are related to the well-known numbers and polynomials,…

组合数学 · 数学 2023-02-24 Yilmaz Simsek

Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.

组合数学 · 数学 2016-05-12 Ilker Akkus

Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…

综合数学 · 数学 2021-09-10 Roudy El Haddad

We present various identities in the form of convolutions involving Stirling numbers of both kinds, Lah numbers, and binomial coefficients. Certain convolution polynomials are discussed also. The proofs are based on several series…

组合数学 · 数学 2021-03-30 Khristo N. Boyadzhiev

We obtain a series transformation formula involving the classical Hermite polynomials. We then provide a number of applications using appropriate binomial transformations. Several of the new series involve Hermite polynomials and harmonic…

数论 · 数学 2017-10-03 Khristo N. Boyadzhiev , Ayhan Dil

We look for differential equations satisfied by the generalized Jacobi polynomials which are orthogonal on the interval [-1,1] with respect to a weight function consisting of the classical Jacobi weight function together with point masses…

经典分析与常微分方程 · 数学 2007-05-23 J. Koekoek , R. Koekoek