Falling factorials, generating functions, and conjoint ranking tables.
Finding the roots of polynomial equations: an algorithm with linear command.
We show how an old principle, due to Walsh (1922), can be used in order to construct an algorithm which finds the roots of polynomials with complex coefficients. This algorithm uses a linear command. From the very first step, the zero is located inside a disk, so several zeros can be searched at the same time.
Finite Rogers-Ramanujan type identities.
Finite vector spaces and certain lattices.
Fonctions symétriques et séries hypergéométriques basiques multivariées
From -Motzkin paths to Schröder paths.
Fully degenerate poly-Bernoulli numbers and polynomials
In this paper, we introduce the new fully degenerate poly-Bernoulli numbers and polynomials and inverstigate some properties of these polynomials and numbers. From our properties, we derive some identities for the fully degenerate poly-Bernoulli numbers and polynomials.