Related papers: Block-Separated Overpartitions: Fibonacci Structur…
We give Euler-like recursive formulas for the $t$-colored partition function when $t=2$ or $t=3,$ as well as for all $t$-regular partition functions. In particular, we derive an infinite family of ``triangular number" recurrences for the…
We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…
To flatten a set partition (with apologies to Mathematica) means to form a permutation by erasing the dividers between its blocks. Of course, the result depends on how the blocks are listed. For the usual listing--increasing entries in each…
We prove that reiteratively hypercyclic operators have perfect spectrum. Consequently, it follows that there exist separable infinite dimensional Banach spaces that do not support any reiteratively hypercyclic operator. For this, we study…
Inspired by the recent work by Nadji, Ahmia and Ram\'irez, we examined the arithmetic properties of $\bar{B}_{l_1,l_2} (n)$, the number of overpartitions of n whose parts are neither divisible by $l_1$ nor divisible by $l_2$. In particular,…
In this Ph.D. dissertation (2018, Emory University) we prove theorems at the intersection of the additive and multiplicative branches of number theory, bringing together ideas from partition theory, $q$-series, algebra, modular forms and…
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robustness and compression capability. Asymptotically, these codes provide better compression efficiency as the order of the underlying Fibonacci…
We consider an urn model, whose replacement matrix has all entries nonnegative and is balanced, that is, has constant row sums. We obtain the rates of the counts of balls corresponding to each color for the strong laws to hold. The analysis…
The primary focus of this paper is overpartitions, a type of partition that plays a significant role in $q$-series theory. In 2006, Treneer discovered an explicit infinite family of congruences of overpartitions modulo $5$. In our research,…
Kaur, Rana, and Eyyunni recently defined the mex sequence of a partition and established, by analytic methods, connections to two disparate types of partition-related objects. We make a bijection between partitions with certain mex…
The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…
We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional…
Alanzi et al. (2022) investigated overpartition of a positive integer $n$ with $\ell$-regular non-overlined parts denoted by $\overline R_\ell^\ast (n)$, and proved some results for the case $\ell=3$. As extension to the results of Alanzi…
We study set partitions with $r$ distinguished elements and block sizes found in an arbitrary index set $S$. The enumeration of these $(S,r)$-partitions leads to the introduction of $(S,r)$-Stirling numbers, an extremely wide-ranging…
Integer compositions, integer partitions, Fibonacci numbers, and generalizations of these have recently been shown to be interconnected via two-toned tilings of horizontal grids. In this article, we present refinements of two-toned tilings,…
In a previous paper we have presented a partition formula for the even-index Fibonacci numbers using the preprojective representations of the 3-Kronecker quiver and its universal cover, the 3-regular star. Now we deal in a similar way with…
I am concerned in these lectures with the breakdown of the particle concept in strongly correlated electron matter. I first show that the standard procedure for counting particles, namely Luttinger's theorem, breaks down anytime pole-like…
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…
This paper is devoted to the study of sequences in overpartitions and their relation to 2-color partitions. An extensive study of a general class of double series is required to achieve these ends.
In symmetric groups, studies of permutation factorizations or triples of permutations satisfying certain conditions have a long history. One particular interesting case is when two of the involved permutations are long cycles, for which…