نتایج جستجو برای: factorial polynomials

تعداد نتایج: 59981  

Journal: :Electr. J. Comb. 2006
Peter R. W. McNamara

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 generalisation of a Littlewood-Richardson rule for Grothendieck polynomials.

Journal: :Advances in Applied Mathematics 2019

2007
William Y. C. Chen Peter Paule Husam L. Saad

Given two polynomials, we find a convergence property of the GCD of the rising factorial and the falling factorial. Based on this property, we present a unified approach to computing the universal denominators as given by Gosper’s algorithm and Abramov’s algorithm for finding rational solutions to linear difference equations with polynomial coefficients.

1994
V. V. Dodonov I. M. Dremin P. G. Polynkin V. I. Man ’ ko Lebedev

The cumulants and factorial moments of photon distribution for squeezed and correlated light are calculated in terms of Chebyshev, Legendre and Laguerre polynomials. The phenomenon of strong oscillations of the ratio of the cumulant to factorial moment is found. Running title: Oscillations of cumulants in squeezed states.

2010
Maxie D. Schmidt

The paper generalizes the traditional single factorial function to integer-valued multiple factorial (j-factorial) forms. The generalized factorial functions are defined recursively as triangles of coefficients corresponding to the polynomial expansions of a subset of degenerate falling factorial functions. The resulting coefficient triangles are similar to the classical sets of Stirling number...

2016
Eric Edo Arno van den Essen

In this paper, we present an unexpected link between the Factorial Conjecture ([8]) and Furter’s Rigidity Conjecture ([13]). The Factorial Conjecture in dimension m asserts that if a polynomial f in m variables Xi over C is such that L(f) = 0 for all k ≥ 1, then f = 0, where L is the C-linear map from C[X1, · · · , Xm] to C defined by L(X l1 1 · · ·X lm m ) = l1! · · · lm!. The Rigidity Conject...

2006
William Y.C. Chen Amy M. Fu Iris F. Zhang

Abstract. We show that the classical Faulhaber’s theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression a + b, a + 2b, . . . , a + nb is a polynomial in na+ n(n+ 1)b/2. The coefficients of these polynomials are given in terms of the Bernoulli polynomials. Following Knuth’s approach by using the central factorial...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید