Related papers: Partition bound is quadratically tight for product…
We study the communication complexity of symmetric XOR functions, namely functions $f: \{0,1\}^n \times \{0,1\}^n \rightarrow \{0,1\}$ that can be formulated as $f(x,y)=D(|x\oplus y|)$ for some predicate $D: \{0,1,...,n\} \rightarrow…
Suppose some random resource (energy, mass or space) $\chi \geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}\chi =\theta <\infty $ and suppose the amount of the individual…
Partitions, the partition function $p(n)$, and the hook lengths of their Ferrers-Young diagrams are important objects in combinatorics, number theory and representation theory. For positive integers $n$ and $t$, we study $p_t^e(n)$ (resp.…
The paper presents complexity results and performance guaranties for a family of approximation algorithms for an optimisation problem arising in software testing and manufacturing. The problem is formulated as a partitioning of a set where…
\textit{Fair division} of resources among competing agents is a fundamental problem in computational social choice and economic game theory. It has been intensively studied on various kinds of items (\textit{divisible} and…
A new recursive procedure for calculation of restricted partition function is suggested. An explicit formula for the restricted partition function is found based on this procedure.
Motivated by applications in production planning and storage allocation in hierarchical databases, we initiate the study of covering partially ordered items (CPO). Given a capacity $k \in \mathbb{Z}^+$, and a directed graph $G=(V,E)$ where…
In some non-equilibrium systems, the distribution of entropy production $p(\Sigma)$ satisfies the detailed fluctuation theorem (DFT), $p(\Sigma)/p(-\Sigma)=\exp(\Sigma)$. When the distribution $p(\Sigma)$ shows time-dependency, the…
We define an $f$-restricted partition $p_f(n,k)$ of fixed length $k$ given by the bivariate generating series \begin{align*} Q_f(z,u) \coloneqq 1+\sum_{n=1}^{\infty}\sum_{k=1}^{\infty} p_f(n,k) u^kz^n…
Fair division is the problem of dividing one or several goods amongst two or more agents in a way that satisfies a suitable fairness criterion. These Notes provide a succinct introduction to the field. We cover three main topics. First, we…
We prove a direct product theorem for the one-way entanglement-assisted quantum communication complexity of a general relation $f\subseteq\mathcal{X}\times\mathcal{Y}\times\mathcal{Z}$. For any $\varepsilon, \zeta > 0$ and any $k\geq1$, we…
We provide evidence that it is computationally difficult to approximate the partition function of the ferromagnetic q-state Potts model when q>2. Specifically we show that the partition function is hard for the complexity class #RHPi_1…
We study an extension of the standard two-party communication model in which Alice and Bob hold probability distributions $p$ and $q$ over domains $X$ and $Y$, respectively. Their goal is to estimate \[ \mathbb{E}_{x \sim p,\, y \sim…
The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…
We study the problem of distributed distinct element estimation, where $\alpha$ servers each receive a subset of a universe $[n]$ and aim to compute a $(1+\varepsilon)$-approximation to the number of distinct elements using minimal…
We present marginal cumulative distribution functions (CDF) for density matrices $\rho$ of fixed purity $\tfrac{1}{N}\le\mu_N(\rho)=\textrm{Tr}[\rho^2]\le 1$ for arbitrary dimension $N$. We give closed form analytic formulas for the cases…
The data processing inequality is the most basic requirement for any meaningful measure of information. It essentially states that distinguishability measures between states decrease if we apply a quantum channel and is the centerpiece of…
This paper is concerned with the fast computation of a relation $\R$ on the edge set of connected graphs that plays a decisive role in the recognition of approximate Cartesian products, the weak reconstruction of Cartesian products, and the…
This paper addresses the problem of optimizing partition functions in a stochastic learning setting. We propose a stochastic variant of the bound majorization algorithm that relies on upper-bounding the partition function with a quadratic…
Let $\mathcal{C}$ denote the family of all coherent distributions on the unit square $[0,1]^2$, i.e. all those probability measures $\mu$ for which there exists a random vector $(X,Y)\sim \mu$, a pair $(\mathcal{G},\mathcal{H})$ of…