Related papers: Sizes of Simultaneous Core Partitions
We study the problem of extracting randomness from somewhere-random sources, and related combinatorial phenomena: partition analogues of Shearer's lemma on projections. A somewhere-random source is a tuple $(X_1, \ldots, X_t)$ of (possibly…
We prove an asymptotic formula for the number of partitions of $n$ into distinct parts where the largest part is at most $t\sqrt{n}$ for fixed $t \in \mathbb{R}$. Our method follows a probabilistic approach of Romik, who gave a simpler…
Simultaneous bar-cores, core shifted Young diagrams (or CSYDs), and doubled distinct cores have been studied since Morris and Yaseen introduced the concept of bar-cores. In this paper, our goal is to give a formula for the number of these…
We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that…
Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…
A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…
Recently, the concept of parity bias in integer partitions has been studied by several authors. We continue this study here, but for non-unitary partitions (namely, partitions with parts greater than $1$). We prove analogous results for…
This is a review of a set of recent papers with some new data added. After a brief biological introduction a visualization scheme of the string composition of long DNA sequences, in particular, of bacterial complete genomes, will be…
We study some combinatorial statistics defined on the set $NC^{(mton)}(n)$ of monotonically ordered non-crossing partitions of {1,...,n}, and on the set $NC_2^{(mton)}(2n)$ of monotonically ordered non-crossing pair-partitions of…
We introduce and study a family of Markov processes on partitions. The processes preserve the so-called z-measures on partitions previously studied in connection with harmonic analysis on the infinite symmetric group. We show that the…
We study codes that are list-decodable under insertions and deletions. Specifically, we consider the setting where a codeword over some finite alphabet of size $q$ may suffer from $\delta$ fraction of adversarial deletions and $\gamma$…
The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…
In the framework of the Gibbs statistical theory, the question of the size of the particles forming the statistical system is investigated. This task is relevant for a wide variety of applications. The distribution for particle sizes and…
Let $S_r(p,q)$ be the $r$-associated Stirling numbers of the second kind, the number of ways to partition a set of size $p$ into $q$ subsets of size at least $r$. For $r=1$, these are the standard Stirling numbers of the second kind, and…
Motivated by DNA storage in living organisms, and by known biological mutation processes, we study the reverse-complement string-duplication system. We fully classify the conditions under which the system has full expressiveness, for all…
Computer simulation was used to study the random sequential adsorption of identical discorectangles onto a continuous plane . The problem was analyzed for a wide range of discorectangle aspect ratios ($\varepsilon \in [1;100]$). We studied…
Integer partitions which are simultaneously $t$--cores for distinct values of $t$ have attracted significant interest in recent years. When $s$ and $t$ are relatively prime, Olsson and Stanton have determined the size of the maximal…
We show that an intricate relation of cluster properties and optimal bipartitions, which takes place in undirected random graphs, extends to directed and mixed random graphs. In particular, the satisfability threshold coincides with the…
We begin by outlining the ancient puzzle of off shell currents and infinite size particles in a string theory of hadrons. We then consider the problem from the modern AdS/CFT perspective. We argue that although hadrons should be thought of…
We give an exact solution for the complete distribution of component sizes in random networks with arbitrary degree distributions. The solution tells us the probability that a randomly chosen node belongs to a component of size s, for any…