Related papers: Separable overpartition classes and excludant size…

For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…

Enumeration of pattern-avoiding objects is an active area of study with connections to such disparate regions of mathematics as Schubert varieties and stack-sortable sequences. Recent research in this area has brought attention to colored…

This paper explores the partition properties of roller coaster permutations, a class of permutations characterized by maximizing the number of alternating runs in all subsequences. We establish a connection between the structure of these…

Consider a $q$-ary block code satisfying the property that no $l$-letters long codeword's prefix occurs as a suffix of any codeword for $l$ inside some interval. We determine a general upper bound on the maximum size of these codes and a…

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

We prove general fomulas for the deviations of two overpartition ranks from the average. These formulas are in terms of Appell--Lerch series and sums of quotients of theta functions and can be used, among other things, to recover any of the…

This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed…

We report an algorithm for the partition of a line segment according to a given ratio $\nu$. At each step the length distribution among sets of the partition follows a binomial distribution. We call $k$-set to the set of elements with the…

Andrews introduced the partition function $\overline{C}_{k, i}(n)$, called singular overpartition, which counts the number of overpartitions of $n$ in which no part is divisible by $k$ and only parts $\equiv \pm i\pmod{k}$ may be overlined.…

Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…

In this short note, we prove several new congruences for the overcubic partition triples function, using both elementary techniques and the theory of modular forms. These extend the recent list of such congruences given by Nayaka,…

We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

Let $G=(V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$ \emph{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$. A vertex…

Let $G$ be a finite group. A family $\mathcal{M}$ of maximal subgroups of $G$ is called `irredundant' if its intersection is not equal to the intersection of any proper subfamily. $\mathcal{M}$ is called `maximal irredundant' if…

Continued fractions whose elements are polynomial sequences have been carefully studied mostly in the cases where the degree of the numerator polynomial is less than or equal to two and the degree of the denominator polynomial is less than…

We show that the Zagier-Eisenstein series shares its non-holomorphic part with certain weak Maass forms whose holomorphic parts are generating functions for overpartition rank differences. This has a number of consequences, including exact…

We study the problem of edge partitioning, where the goal is to partition the edge set of a graph into several parts. The replication factor of a vertex $v$ is the number of parts that contain edges incident to $v$. The goal is to minimize…

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…