Related papers: A unimodal sequence with mode at a quarter length

The dimension of an irreducible representation of $GL(n,\mathbb{C})$, $Sp(2n)$, or $SO(n)$ is given by the respective hook-length and content formulas for the corresponding partition. The first author, inspired by the Nekrasov-Okounkov…

We study frequency moments of partition statistics arising from Euler products $A(q)=\prod_{r\ge1}(1-q^r)^{-c(r)}$ via a transform that expresses the moment generating functions as $B(q)$ times explicit divisor--sum series determined by…

Arithmetical congruence monoids, which arise in non-unique factorization theory, are multiplicative monoids $M_{a,b}$ consisting of all positive integers $n$ satsfying $n \equiv a \bmod b$. In this paper, we examine the asymptotic behavior…

An n-core partition is an integer partition whose Young diagram contains no hook lengths equal to n. We consider partitions that are simultaneously a-core and b-core for two relatively prime integers a and b. These are related to abacus…

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

This paper investigates the zero distribution of a sequence of polynomials $\left\{ P_{m}(z)\right\} _{m=0}^{\infty}$ generated by the reciprocal of $1+ct+B(z)t^{2}+A(z)t^{3}$ where $c\in\mathbb{R}$ and $A(z)$, $B(z)$ are real linear…

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

The nearly complete bipartite graph $G(m,n,k)$ is obtained by removing $k$ independent edges from the complete bipartite graph $K_{m,n}$. In this paper, we prove that for any nearly complete bipartite graph $G(m,n,k)$ with $m, n\geq 3$, and…

Motivated by the theorem of Gy\H ori and Lov\'asz, we consider the following problem. For a connected graph $G$ on $n$ vertices and $m$ edges determine the number $P(G,k)$ of unordered solutions of positive integers $\sum_{i=1}^k m_i = m$…

For nonnegative integers $q,n,d$, let $A_q(n,d)$ denote the maximum cardinality of a code of length $n$ over an alphabet $[q]$ with $q$ letters and with minimum distance at least $d$. We consider the following upper bound on $A_q(n,d)$. For…

Let $d >1$ and $(A_n)_{n \ge 1}$ be a sequence of independent identically distributed random matrices with nonnegative entries and no zero column. This induces a Markov chain $M_n = A_n M_{n-1}$ on the cone of d-vectors with nonnegative…

In 2012 Bryson, Ono, Pitman and Rhoades showed how the generating functions for certain strongly unimodal sequences are related to quantum modular and mock modular forms. They proved some parity results and conjectured some mod 4…

Let $P$ be a set of $m$ points in ${\mathbb R}^2$, let $\Sigma$ be a set of $n$ semi-algebraic sets of constant complexity in ${\mathbb R}^2$, let $(S,+)$ be a semigroup, and let $w: P \rightarrow S$ be a weight function on the points of…

The stable roommates problem does not necessarily have a solution, i.e. a stable matching. We had found that, for the uniformly random instance, the expected number of solutions converges to $e^{1/2}$ as $n$, the number of members, grows,…

This paper investigates the dynamics of the iterated sum-of-divisors function $\sigma_k(m)$ and its behaviour modulo $m$, motivated by classical questions on perfect and multiperfect numbers and by the congruences $\sigma_k(m) \equiv 0…

Let $\mathcal{A}$ be a finite subset of $\mathbb{N}$ including $0$ and $f_\mathcal{A}(n)$ be the number of ways to write $n=\sum_{i=0}^{\infty}\epsilon_i2^i$, where $\epsilon_i\in\mathcal{A}$. The sequence $\left(f_\mathcal{A}(n)\right)…

Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which…

In a recent article on overpartitions, Merca considered the auxiliary function $a(n)$ which counts the number of partitions of $n$ where odd parts are repeated at most twice (and there are no restrictions on the even parts). In the course…

Let $p(n)$ denote the partition function. In this article, we will show that congruences of the form $$ p(m^j\ell^kn+B)\equiv 0\mod m \text{for all} n\ge 0 $$ exist for all primes $m$ and $\ell$ satisfying $m\ge 13$ and $\ell\neq 2,3,m$.…

For $0<\alpha<1$, we study the zeros of the sequence of polynomials $\left\{ P_{m}(z)\right\} _{m=0}^{\infty}$ generated by the reciprocal of $(1-t)^{\alpha}(1-2zt+t^{2})$, expanded as a power series in $t$. Equivalently, this sequence is…