Related papers: New properties for a composition of some generatin…
In this note we prove positivity of Maclaurin coefficients of polynomials written in terms of rising factorials and arbitrary log-concave sequences. These polynomials arise naturally when studying log-concavity of rising factorial series.…
In this paper a small survey is presented on eighteen new functions and four new sequences, such as: Inferior/Superior f-Part, Fractional f-Part, Complementary function with respect with another function, S-Multiplicative, Primitive…
We compute the generating function for the characters of the irreducible representations of SU(n) whose associated Young diagrams have only two rows with the same number of boxes. The result is a rational determinantal expression in which…
In a recent paper we proposed the study of aggregation functions on lattices via clone theory approach. Observing that aggregation functions on lattices just correspond to $0,1$-monotone clones, we have shown that all aggregation functions…
We generalize generating functions for hypergeometric orthogonal polynomials, namely Jacobi, Gegenbauer, Laguerre, and Wilson polynomials. These generalizations of generating functions are accomplished through series rearrangement using…
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…
We present the pattern underlying some of the properties of natural numbers, using the framework of complex networks. The network used is a divisibility network in which each node has a fixed identity as one of the natural numbers and the…
We assume that a high-dimensional datum, like an image, is a compositional expression of a set of properties, with a complicated non-linear relationship between the datum and its properties. This paper proposes a factorial mixture prior for…
The main object of this paper is to construct a new generating function of the (q-) Bernstein type polynomials. We establish elementary properties of this function. By using this generating function, we derive recurrence relation and…
The present note considers a certain family of sums indexed by the set of fixed length compositions of a given number. The sums in question cannot be realized as weighted compositions. However they can be be related to the hypergeometric…
We present a number of identities involving standard and associated Laguerre polynomials. They include double-, and triple-lacunary, ordinary and exponential generating functions of certain classes of Laguerre polynomials.
The likelihood function plays a pivotal role in statistical inference; it is adaptable to a wide range of models and the resultant estimators are known to have good properties. However, these results hinge on correct specification of the…
Following our earlier work, where doubly indexed and irreducible over Q two-variable Laguerre polynomials were introduced, we prove for such polynomials some recurrence formulas and obtain a generating function. In addition, we show how…
Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…
Leveraging the compositional nature of our world to expedite learning and facilitate generalization is a hallmark of human perception. In machine learning, on the other hand, achieving compositional generalization has proven to be an…
Expectations of marginals conditional on the total risk of a portfolio are crucial in risk-sharing and allocation. However, computing these conditional expectations may be challenging, especially in critical cases where the marginal risks…
We introduce a basis of the symmetric functions that evaluates to the (irreducible) characters of the symmetric group, just as the Schur functions evaluate to the irreducible characters of $GL_n$ modules. Our main result gives three…
We find the generating function for $C(n,k,r)$, the number of compositions of $n$ into $k$ positive parts all of whose runs (contiguous blocks of constant parts) have lengths less than $r$, using recent generalizations of the method of…
This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…
The hypergeometric distribution is a popular distribution, whose properties have been extensively investigated. Generating functions of this distribution, such as the probability-generating function, the moment-generating function, and the…