Results 281 to 290 of about 582,984 (315)
Some of the next articles are maybe not open access.

Polynomials of Binomial Type and Renewal Sequences

Studies in Applied Mathematics, 1987
We study polynomials of binomial type that have an exponential generating function of the form { 1 − f(u)−x}. They have a close connection with renewal sequences. The asymptotic behavior as n − ∞ is studied.
openaire   +1 more source

Polynomial expressions for non-binomial structures

Theoretical Computer Science, 2019
Let \(R=K[x_1,\ldots ,x_n]\) be a polynomial ring over a field \(K\) and \(f,f_1,\ldots ,f_k\in R\). Let us fix a term ordering on \(R\). The classical division algorithm claims that one is able to write \(f\) as an expression like \(g_1f_1+\cdots +g_kf_k+h\) where either \(h=0\) or no term in \(h\) is divisible by the leading terms of the \(f_i\)'s ...
openaire   +1 more source

Binomial formula for Macdonald polynomials and applications

Mathematical Research Letters, 1997
The author gives the non-evident and the very non-trivial generalization of the Macdonald polynomials. He defines the ``interpolation Macdonald polynomial'' \(P^*(x_1,\dots, x_n;q,t)\) (\(q\) and \(t\) are two parameters) by the following conditions: (1) \(P^*\) is symmetric in variables \(x_i t_i^{-1}\), (2) \(\deg P_\mu^*=| \mu|\) for any partition \(
openaire   +2 more sources

BINOMIAL IDENTITIES INVOLVING THE GENERALIZED FIBONACCI TYPE POLYNOMIALS

2011
We present some binomial identities for sums of the bivariate Fibonacci polynomials and for weighted sums of the usual Fibonacci polynomials with indices in arithmetic progression.
Kilic, Emrah, Irmak, Nurettin
openaire   +2 more sources

From local explanations to global understanding with explainable AI for trees

Nature Machine Intelligence, 2020
Scott M Lundberg   +2 more
exaly  

Home - About - Disclaimer - Privacy