Related papers: A new generalization of binomial coefficients
Generalized Pascal matrix whose elements are generalized binomial coefficients is included in the group of generalized Riordan arrays. There is a special set of generalized Riordan arrays defined by parameter $q$. If $q=0$, they are…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
We prove two generalisations of the Binomial theorem that are also generalisations of the q-binomial theorem. These generalisations arise from the commutation relations satisfied by the components of the co-multiplications of non-simple…
We introduce a generalization $\pounds_{d}^{(\alpha)}(X)$ of the finite polylogarithms $\pounds_{d}^{(0)}(X)=\pounds_d(X)=\sum_{k=1}^{p-1}X^k/k^d$, in characteristic $p$, which depends on a parameter $\alpha$. The special case…
Using a probabilistic approach, we derive some interesting combinatorial identities involving gamma and beta functions. These results generalize certain well-known combinatorial identities involving binomial coefficients and special…
In this paper we use probabilistic methods to derive some results on the generalized Bernoulli and generalized Euler polynomials. Our approach is based on the properties of Appell polynomials associated with uniformly distributed and…
We introduce a generalization $G^{(\alpha)}(X)$ of the truncated logarithm $\mathcal{L}_1(X) = \sum_{k=1}^{p-1}X^k/k$ in characteristic $p$, which depends on a parameter $\alpha$. The main motivation of this study is $G^{(\alpha)}(X)$ being…
In two recent articles we have examined a generalization of the binomial distribution associated with a sequence of positive numbers, involving asymmetric expressions of probabilities that break the symmetry {\it win-loss}. We present in…
Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…
In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…
We generalise the known fact that for binomial $X_{n,k} \sim \mathrm{Bin}(n, k/n)$ one has $\inf_{k>1,n} \mathrm{P}(X_{n,k} \geq k) \geq \lim_{k \to 1+}\mathrm{P}(X_{2,k} \geq k) = 1/4$ to cover probabilities of exceeding a constant shift…
Following Lucas and then other Fibonacci people Kwasniewski had introduced and had started ten years ago the open investigation of the overall F-nomial coefficients which encompass among others Binomial, Gaussian and Fibonomial coefficients…
This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…
By applying the Newton-Gregory expansion to the polynomial associated with the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$, we derive a couple of infinite families of explicit formulas for $S_k(n)$. One of the families…
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.…
Denote by $x$ a random infinite path in the graph of Pascal's triangle (left and right turns are selected independently with fixed probabilities) and by $d_n(x)$ the binomial coefficient at the $n$'th level along the path $x$. Then for a…
Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.
We generalize Gaeta's Theorem to the family of determinantal schemes. In other words, we show that the schemes defined by minors of a fixed size of a matrix with polynomial entries belong to the same G-biliaison class of a complete…
In the present paper, we introduce Eulerian polynomials with a and b parameters and give the definition of them. By using the definition of generating function for our polynomials, we derive some new identities in Theory of Analytic…
The polynomials that arise as coefficients when a power series is raised to the power $x$ include many important special cases, which have surprising properties that are not widely known. This paper explains how to recognize and use such…