Related papers: A Central Limit Theorem for Integer Partitions int…
We solve multiple conjectures by Byszewski and Ulas about the sum of base $b$ digits function. In order to do this, we develop general results about summations over the sum of digits function. As a corollary, we describe an unexpected new…
We present a new tool to compute the number $\phi_\A (\b)$ of integer solutions to the linear system $$ \x \geq 0 \qquad \A \x = \b $$ where the coefficients of $\A$ and $\b$ are integral. $\phi_\A (\b)$ is often described as a \emph{vector…
Andrews' $(k, i)$-singular overpartition function $\overline{C}_{k, i}(n)$ 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. In recent times, divisibility…
The centerpoint theorem is a well-known and widely used result in discrete geometry. It states that for any point set $P$ of $n$ points in $\mathbb{R}^d$, there is a point $c$, not necessarily from $P$, such that each halfspace containing…
The Ewens-Pitman model defines a distribution on random partitions of $\{1,\ldots,n\}$, with parameters $\alpha \in [0,1)$ and $\theta > -\alpha$; the case $\alpha=0$ reduces to the classical Ewens model from population genetics. We…
We prove limit theorems for sums of randomly chosen random variables conditioned on the summands. We consider several versions of the corner growth setting, including specific cases of dependence amongst the summands and summands with heavy…
We provide a refined combinatorial identity for the set of partitions of $\{1,\dots, n\}$, which plays an important role in investigating several limit theorems related to finite free convolutions. Firstly, we present the finite free…
We consider a generic system composed of a fixed number of particles distributed over a finite number of energy levels. We make only general assumptions about system's properties and the entropy. System's constraints other than fixed number…
Johnson recently proved Armstrong's conjecture which states that the average size of an $(a,b)$-core partition is $(a+b+1)(a-1)(b-1)/24$. He used various coordinate changes and one-to-one correspondences that are useful for counting…
Let $(A_n)_{n\in\mathbb{N}}$ be a stationary sequence of topical (i.e., isotone and additively homogeneous) operators. Let $x(n,x_0)$ be defined by $x(0,x_0)=x_0$ and $x(n+1,x_0)=A_nx(n,x_0)$. It can model a wide range of systems including…
We develop a simple and unified approach to investigate several aspects of the cluster statistics of random expansive (multi-)sets. In particular, we determine the limiting distribution of the size of the smallest and largest clusters, we…
In this article we study the "norm" of an integer partition, which we define to be the product of the parts. This partition-theoretic statistic has appeared here and there in the literature of the last century or so, and is at the heart of…
The objective of this study is to investigate the limiting behavior of a subgraph counting process. The subgraph counting process we consider counts the number of subgraphs having a specific shape that exist outside an expanding ball as the…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
Recently, Blecher and Knopfmacher applied the notion of fixed points to integer partitions. This has already been generalized and refined in various ways such as $h$-fixed points for an integer parameter $h$ by Hopkins and Sellers. Here, we…
We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…
A Central Limit Theorem for linear combinations of iterates of an inner function is proved. The main technical tool is Aleksandrov Desintegration Theorem for Aleksandrov-Clark measures.
In a multi-base representation of an integer (in contrast to, for example, the binary or decimal representation) the base (or radix) is replaced by products of powers of single bases. The resulting numeral system has desirable properties…
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 establish Central Limit Theorems for the volumes of intersections of $B_{p}^n$ (the unit ball of $\ell_p^n$) with uniform random subspaces of codimension $d$ for fixed $d$ and $n\to \infty$. As a corollary we obtain higher order…