Related papers: k-Run Overpartitions and Mock Theta Functions

In 2010, Andrews considers a variety of parity questions connected to classical partition identities of Euler, Rogers, Ramanujan and Gordon. As a large part in his paper, Andrews considered the partitions by restricting the parity of…

A q-series with nonnegative power series coefficients is called positive. The partition statistics BG-rank is defined as an alternating sum of parities of parts of a partition. It is known that the generating function for the number of…

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…

This thesis discusses the young fields of quantum pseudo-randomness and quantum learning algorithms. We present techniques for derandomising algorithms to decrease randomness resource requirements and improve efficiency. One key object in…

This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of…

In this paper, we prove a conjecture of Andrews and Bachraoui relating a generating function arising from two-color partitions (with odd smallest part and restrictions on the even parts) to a Hecke-type double sum. Our proof is based on…

Quite recently, the first author investigated vanishing coefficients of the arithmetic progressions in several $q$-series expansions. In this paper, we further study the signs of coefficients in two $q$-series expansions and establish some…

In the theory of harmonic Maass forms and mock modular forms, mock theta functions are distinguished examples which arose from $q$-hypergeometric examples of Ramanujan. Recently, there has been a body of work on higher depth mock modular…

In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…

The modular transformations of Ramanujan's tenth order mock theta functions are computed, beginning from Choi's Hecke-type identites and using Zwegers' results on indefinite theta series. Explicit completions and shadows are found as an…

Let R(n,k) denote the number of permutations of {1,2,...,n} with k alternating runs. We find a grammatical description of the numbers R(n,k) and then present several convolution formulas involving the generating function for the numbers…

We analyze the mock modular behavior of $\bar{P}_\omega(q)$, a partition function introduced by Andrews, Dixit, Schultz, and Yee. This function arose in a study of smallest parts functions related to classical third order mock theta…

Let $\overline{p}_o(n)$ denote the number of overpartitions of $n$ into odd parts. The partition function $\overline{p}_o(n)$ has been the subject of many recent studies where many explicit Ramanujan-like congruences were discovered. In…

In a recent paper, Andrews and Newman introduced certain families of partition functions using the minimal excludant or "mex" function. In this article, we study two of the families of functions Andrews and Newman introduced, namely…

We study the {\em $k$-route} generalizations of various cut problems, the most general of which is \emph{$k$-route multicut} ($k$-MC) problem, wherein we have $r$ source-sink pairs and the goal is to delete a minimum-cost set of edges to…

In a previous paper, we studied an overpartition analogue of Gaussian polynomials as the generating function for overpartitions fitting inside an $m \times n$ rectangle. Here, we add one more parameter counting the number of overlined…

We induce the NonBacktracking Expansion Branch method to analyze the k-core pruning process on the monopartite graph G which does not contain any self-loop or multi-edge. Different from the traditional approaches like the generating…

In recent work, Hickerson and the author demonstrated that it is useful to think of Appell--Lerch sums as partial theta functions. This notion can be used to relate identities involving partial theta functions with identities involving…

Let $k$ and $n$ be natural numbers. Let $\omega_k(n)$ denote the number of distinct prime factors of $n$ with multiplicity $k$ as studied by Elma and the third author. We obtain asymptotic estimates for the first and the second moments of…

We investigate the construction of $\pm1$-valued completely multiplicative functions that take the value $+1$ at at most $k$ consecutive integers, which we call length-$k$ functions. We introduce a way to extend the length based on the idea…