Related papers: A note on the equidistribution of $3$-colour parti…
Since the study by Jacobi and Hecke, Hecke-type series have received extensive attention. Especially, Hecke-type series involving infinite products have attracted broad interest among many mathematicians including Kac, Peterson, Andrews,…
We consider two multiplicative statistics on the set of integer partitions: the norm of a partition, which is the product of its parts, and the supernorm of a partition, which is the product of the prime numbers $p_i$ indexed by its parts…
Within the framework of unitary easy quantum groups, we study an analogue of Brauer's Schur-Weyl approach to the representation theory of the orthogonal group. We consider concrete combinatorial categories whose morphisms are formed by…
Let $a_{r,s}(n)$ denote the number of mutlicolored partitions of $n$, wherein both even parts and odd parts may appear in one of $r$-colors and $s$-colors, respectively, for fixed $r,s\ge 1$. The paper aims to study arithmetic properties…
We prove an asymptotic crystallization result in two dimensions for a class of nonlocal particle systems. To be precise, we consider the best approximation with respect to the 2-Wasserstein metric of a given absolutely continuous…
Let $F({\bf x})={\bf x}^tQ_{\bf x}+\mathbf{b}^t{\bf x}+c\in\mathbb{Z}[{\bf x}]$ be a quadratic polynomial in $\ell (\ge 3 )$ variables ${\bf x} =(x_{1},...,x_{\ell})$, where $F({\bf x})$ is positive when ${\bf x}\in\mathbb{R}_{\ge…
In a recent work, Keith and Xiong gave a refinement of Glaisher's theorem by using a Sylvester-style bijection. In this paper, we introduce two families of colored partitions, flat and regular partitions, and generalize the bijection of…
Recently, using machinery's from Ergodic theory, Z. Lian, and R. Xiao proved if $P$ is any polynomial with no constant term, then for every finite coloring of $\mathbb{N}$, there exists two infinite subsets $B,C$ of $\mathbb{N}$ such that…
Let $a(n)$ be the number of partitions of $n$ of the form $a_1 + a_2 + \cdots + a_k$ where $a_{i + 1}$ is a proper divisor of $a_i$ for all $i < k$. Erd{\H o}s and Loxton showed that the sum of $a(n)$ over all $n \leq x$ is asymptotic to a…
We study a one-parameter family ($\ell=1,2,3,\ldots$) of configurations that are square-ice analogues of plane partitions. Using an algorithm due to Bratley and McKay, we carry out exact enumerations in order to study their asymptotic…
In this article, we consider the family $\mathcal{F}(\alpha)$ defined for $\alpha \in (0, 3]$ by \begin{align*} {\rm Re}\left(1+\frac{zf''(z)}{f'(z)}\right) > 1 - \frac{\alpha}{2} \quad \text{for } z \in \mathbb{D}. \end{align*} Our primary…
The main result of this paper is the proof of the simultaneous consistency, modulo a weakly compact cardinal, of the equality $2^{< \mathfrak{c}} = \mathfrak{c}$ with the following property (*) of partitions of pairs of $\mathfrak{c}$:…
Let $S=(s_n)_{n\geq 1}$ be a sequence with elements in a commutative monoid $(\mathcal{M},+,0)$. In this paper, we provide an explicit formula for $$\sum_{\la} C(\la) q^{\sum_{n\geq 1} \la_n\cdot s_n}$$ where $\la=(\la_1,\ldots)$ run…
In this paper we prove that the number of partitions into squares with an even number of parts is asymptotically equal to that of partitions into squares with an odd number of parts. We further show that, for $ n $ large enough, the two…
In this paper we introduce a family of partitions of the set of natural numbers, Fibonacci-like partitions. In particular, we introduce a Fibonacci-like partition in a number of parts corresponding to the Fibonacci numbers, the standard…
Let $F\in\mathbb{C}[x,y,s,t]$ be an irreducible constant-degree polynomial, and let $A,B,C,D\subset\mathbb{C}$ be finite sets of size $n$. We show that $F$ vanishes on at most $O(n^{8/3})$ points of the Cartesian product $A\times B\times…
Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…
Motivated by a question of Lovejoy \cite{lovejoy}, we show that three-colored Frobenius partition function $\c3$ and related arithmetic fuction $\cc3$ vanish modulo some powers of 5 in certain arithmetic progressions.
We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…
An equitable partition of a graph $G$ is a partition of the vertex-set of $G$ such that the sizes of any two parts differ by at most one. We show that every graph with an acyclic coloring with at most $k$ colors can be equitably partitioned…