Related papers: ($\ell,0)$-Carter partitions, a generating functio…

We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…

In this paper, we generalize a few important results in Integer Partitions; namely the results known as Stanley's theorem and Elder's theorem, and the congruence results proposed by Ramanujan for the partition function. We generalize the…

Extending the notion of $r$-(class) regular partitions, we define $(r_{1},...,r_{m})$-class regular partitions. A partition identity is presented and described by making use of the Glaisher correspondence.

We consider the number of the $6$-regular partitions of $n$, $b_6(n)$, and give infinite families of congruences modulo $3$ (in arithmetic progression) for $b_6(n)$. We also consider the number of the partitions of $n$ into distinct parts…

We determine the partitions $\lambda$ for which the corresponding induced module (or Schur module in the language of Buchsbaum et. al., [1]) $\nabla(\lambda)$ is injective in the category of polynomial modules for a general linear group…

The partition function $ p_{[1^c\ell^d]}(n)$ can be defined using the generating function, \[\sum_{n=0}^{\infty}p_{[1^c{\ell}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{\ell n})^d}.\] In \cite{P}, we proved infinite family of…

Let $\lambda$ be a partition, viewed as a Young diagram. We define the hook difference of a cell of $\lambda$ to be the difference of its leg and arm lengths. Define $h_{1,1}(\lambda)$ to be the number of cells of $\lambda$ with hook…

For a prime $\ell$ and an abelian variety $A$ over a global field $K$, the $\ell$-parity conjecture predicts that, in accordance with the ideas of Birch and Swinnerton-Dyer, the $\mathbb{Z}_{\ell}$-corank of the $\ell^{\infty}$-Selmer group…

Let $r$ be an odd prime and $\mathbb{F}$ a field containing a primitive $r$th root of unity. Then for all $\ell \geq 1$, there is a faithful representation $f: \operatorname{Sp}_{2\ell}(r) \rightarrow \operatorname{GL}_{r^\ell}(\mathbb{F})$…

This paper investigates a class of deterministic fractals whose construction is governed by arithmetic sequences. We introduce the essential fractal prime set P_{ess} , a variant of the Cantor set constructed using the sequence of prime…

In 1956, 48 years after Hausdorff provided a comprehensive account on ordered sets and defined the notion of a scattered order, Erd\H{o}s and Rado founded the partition calculus in a seminal paper. The present paper gives an account of…

For a CM abelian extension $F/K$ of an arbitrary totally real number field $K$, we construct the Stickelberger splitting maps (in the sense of \cite{Ba1}) for both the \'etale and the Quillen $K$--theory of $F$ and we use these maps to…

We prove the following: there is a primitive recursive function f_-^*(-,-), in the three variables, such that: for every natural numbers t,n>0, and c, for any natural number k>=f^*_t(n,c) the following holds. Assume L is an alphabet with…

$W$-representation realizes partition functions by an action of a cut-and-join-like operator on the vacuum state with a zero-mode background. We provide explicit formulas of this kind for $\beta$- and $q,t$-deformations of the simplest…

By work of Bringmann, Ono, and Rhoades it is known that the generating function of the $M_2$-rank of partitions without repeated odd parts is the so-called holomorphic part of a certain harmonic Maass form. Here we improve the standing of…

Let $\nabla^\lambda$ denote the Schur functor labelled by the partition $\lambda$ and let $E$ be the natural representation of $\mathrm{SL}_2(\mathbb{C})$. We make a systematic study of when there is an isomorphism $\nabla^\lambda…

We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…

Szemeredi's Regularity Lemma is a very useful tool of extremal combinatorics. Recently, several refinements of this seminal result were obtained for special, more structured classes of graphs. We survey these results in their rich…

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of…