Related papers: Counting rises, levels, and drops in compositions
The Compositional Integral is defined, formally constructed, and discussed. A direct generalization of Riemann's construction of the integral; it is intended as an alternative way of looking at First Order Differential Equations. This brief…
It is shown that the set of decimal palindromes is an additive basis for the natural numbers. Specifically, we prove that every natural number can be expressed as the sum of forty-nine (possibly zero) decimal palindromes.
For integer $g\ge 5$, we prove that any positive integer can be written as a sum of three palindromes in base $g$.
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
This is a compendium of generating functions involving single, double sums and definite integrals. These generating functions also involve special functions in both the summand function and closed form solution.
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
In classical music and in any genre of contemporary music, the tonal elements or notes used for playing are the same. The numerous possibilities of chords for a given instance in a piece make the playing, in general, very intricate, and…
A composition of an integer is called Carlitz if adjacent parts are different. Several characteristics of random Carlitz compsitions have been studied recently by Knopfmacher and Prodinger. We complement their work by establishing the…
The purpose of this paper is to find an explicit formula and asymptotic estimate for the total number of sum of weighted records over set partitions of $[n]$ in terms of Bell numbers. For that we study the generating function for the number…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…
Using elementary methods, we prove new formulas for $\operatorname{pp}(n)$, the number of plane partitions of $n$, $\operatorname{pp}_r(n)$, the number of plane partitions of $n$ with at most $r$ rows, $\operatorname{pp}^s(n)$, the number…
A random composition of $n$ appears when the points of a random closed set $\widetilde{\mathcal{R}}\subset[0,1]$ are used to separate into blocks $n$ points sampled from the uniform distribution. We study the number of parts $K_n$ of this…
A construction sequence for a graph is a listing of the elements of the graph (the set of vertices and edges) such that each edge follows both its endpoints. The construction number of the graph is the number of such sequences. We determine…
Compositionality in language refers to how much the meaning of some phrase can be decomposed into the meaning of its constituents and the way these constituents are combined. Based on the premise that substitution by synonyms is…
A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of…
An aggregative composition is a binary operation obeying the principle that the whole is determined by the sum of its parts. The development of graph algebras, on which the theory of formal graph languages is built, relies on aggregative…
We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…
We study sums of arithmetic functions, defined on Gaussian integers and taken over those pairs of integers whose coordinates give rise to a singular system.
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…