Related papers: Composita and its properties
We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…
We introduce the resolvent composition, a monotonicity-preserving operation between a linear operator and a set-valued operator, as well as the proximal composition, a convexity-preserving operation between a linear operator and a function.…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
Recently, Andrews and Ghosh Dastidar (Ramanujan J. \textbf{69}, Art. No. 26, 2026) studied two interesting functions $SOME(n)$ and $DSOME(n)$, where $SOME(n)$ is the sum of all the odd parts in the partitions of $n$ minus the sum of all…
Lin and Chang gave a generating function of convex polyominoes with an $m+1$ by $n+1$ minimal bounding rectangle. Gessel showed that their result implies that the number of such polyominoes is $$ \frac{m+n+mn}{m+n}{2m+2n\choose…
This monograph presents a detailed analysis of hypercomplex numbers in 2, 3 and 4 dimensions, then presents the properties of hypercomplex numbers in 5 and 6 dimensions. It continues with a detailed analysis of hypercomplex numbers in n…
A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…
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…
In this paper, we study connections between the structure of a group and the structure of the group (under pointwise product) of its polynomial functions.
The aim of this paper is to construct generating functions for new families of special polynomials including the Appel polynomials, the Hermite-Kamp\`e de F\`eriet polynomials, the Milne-Thomson type polynomials, parametric kinds of Apostol…
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…
The main result of this thesis is to show that there are only finitely many integers $n$ such that both $n$ and $d(n)$ are highly composite numbers at the same time, where $d(n)$ is the divisor function. Bertrand's postulate [4] is used…
We give a review of modern approaches to constructing formal solutions to integrable hierarchies of mathematical physics, whose coefficients are answers to various enumerative problems. The relationship between these approaches 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…
In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…
The theory of symmetric functions has been extended to the case where each variable is paired with an anticommuting one. The resulting expressions, dubbed superpolynomials, provide the natural N=1 supersymmetric version of the classical…
The main purpose of this paper is to construct not only generating functions of the new approach Genocchi type numbers and polynomials but also interpolation function of these numbers and polynomials which are related to a, b, c arbitrary…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, and also implicitly when objects can be broken…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…