Related papers: Arndt and De Morgan Integer Compositions
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…
The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
As Collatz conjecture is still to be proved, a method to arrive at the complete proof is explored here. Conceptually, the process relies on the pre-proven sequence data and the method follows the confirmation of the convergence of the…
For the past several years, numerous authors have studied POD and PED partitions from a variety of perspectives. These are integer partitions wherein the odd parts must be distinct (in the case of POD partitions) or the even parts must be…
In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one implies the existence of interior points in the difference…
We continue the work of Eriksen, Freij, and Wastlund [3], who study derangements that descend in blocks of prescribed lengths. We generalize their work to derangements that ascend in some blocks and descend in others. In particular, we…
Zeckendorf's theorem states that every positive integer can be uniquely decomposed as a sum of nonconsecutive Fibonacci numbers, where the Fibonacci numbers satisfy $F_n=F_{n-1}+F_{n-2}$ for $n\geq 3$, $F_1=1$ and $F_2=2$. The distribution…
We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…
The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…
We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…
Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…
PED partitions are partitions with even parts distinct while odd parts are unrestricted. Similarly, POD partitions have distinct odd parts while even parts are unrestricted. Merca proved several recurrence relations analytically for the…
In this paper we study combinatorial aspects of permutations of $\{1,\ldots,n\}$ and related topics. In particular, we prove that there is a unique permutation $\pi$ of $\{1,\ldots,n\}$ such that all the numbers $k+\pi(k)$ ($k=1,\ldots,n$)…
In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…
We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…
This note examines a problem in enumerative and asymptotic combinatorics involving the classical structure of integer compositions. What is sought is an analysis on average and in distribution of the length of the longest run of consecutive…