Related papers: Threshold functions for distinct parts: revisiting…
Statistics of distinguishable particles has become relevant in systems of colloidal particles and in the context of applications of statistical mechanics to complex networks. When studying these type of systems with the standard textbook…
We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…
The problem of finding independent components of an indexed object (e.g., a tensor) with arbitrary number of indices and arbitrary linear symmetries is discussed. It is proved that the number of independent components $f(k)$ is a polynomial…
A $k$-wise $\ell$-divisible set family is a collection $\mathcal{F}$ of subsets of ${ \{1,\ldots,n \} }$ such that any intersection of $k$ sets in $\mathcal{F}$ has cardinality divisible by $\ell$. If $k=\ell=2$, it is well-known that…
We find the asymptotic total variation distance between two distributions on configurations of m balls in n labeled bins: in the first, each ball is placed in a bin uniformly at random; in the second, k balls are planted in an arbitrary but…
For all positive integers $k,l,n$, the Little Glaisher theorem states that the number of partitions of $n$ into parts not divisible by $k$ and occurring less than $l$ times is equal to the number of partitions of $n$ into parts not…
We consider a class of "box-like" statistically self-affine functions, and compute the almost-sure box-counting dimension of their graphs. Furthermore, we consider the differentiability of our functions, and prove that, depending on an…
We give a new and elementary proof that the number of elastic collisions of a finite number of balls in the Euclidean space is finite. We show that if there are $n$ balls of equal masses and radii 1, and at the time of a collision between…
Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…
This paper introduces a statistical test inferring whether a variable allows separating two classes by means of a single critical value. Its test statistic is the prediction error of a nonparametric threshold classifier. While this approach…
For integers $d \geq 2$ and $k \geq d+1$, a $k$-hole in a set $S$ of points in general position in $\mathbb{R}^d$ is a $k$-tuple of points from $S$ in convex position such that the interior of their convex hull does not contain any point…
We derive tight quadratic inequalities for all kinds of hybrid separable-inseparable $n$-particle density operators on an arbitrary dimensional space. This methodology enables us to truly derive a tight quadratic inequality as tests for…
This paper shows that the number of hooks of length k contained in all partitions of n equals k times the number of parts of length k in all partitions of n. It contains also formulas for the moments (under uniform distribution) of k-th…
The following class of problems arose out of vain attempts to show that the Pascal's triangle adic transformation has trivial spectrum. Partition a set of size $N$ into sets of size $S \equiv S(N)$ (ignoring leftovers). What is the…
We construct a $k$-fold $q$-series as a generating function of $k$-regular partitions for each positive integer $k$. The $k=1$ case is one of Euler's $q$-series identities pertaining to the partitions into distinct parts. The construction…
We study the weighted $k$-Set Packing problem: Given a collection $S$ of sets, each of cardinality at most $k$, together with a positive weight function $w:\mathcal{S}\rightarrow\mathbb{Q}_{>0}$, the task is to compute a disjoint…
Generalizing Reiner's notion of set partitions of type $B_n$, we define colored $B_n$-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored $B_n$-partitions, we get the…
Given a partition $\{E_0,\ldots,E_n\}$ of the set of primes and a vector $\mathbf{k} \in \mathbb{N}_0^{n+1}$, we compute an asymptotic formula for the quantity $|\{m \leq x: \omega_{E_j}(m) = k_j \ \forall \ 0 \leq j \leq n\}|$ uniformly in…
We study a large class of stochastic $p$-Laplace Allen-Cahn equations with singular potential. Under suitable assumptions on the (multiplicative-type) noise we first prove existence, uniqueness, and regularity of variational solutions.…