Related papers: A strong direct product theorem for two-way public…
We study discrete $\beta$-ensembles as introduced in [17]. We obtain rigidity estimates on the particle locations, i.e. with high probability, the particles are close to their classical locations with an optimal error estimate. We prove the…
We present new concentration of measure inequalities for Markov chains, generalising results for chains that are contracting in Wasserstein distance. These are particularly suited to establishing the cut-off phenomenon for suitable chains.…
In this article, a new class of operators, termed Ad-contractions, is introduced to extend the framework of A-contractions to the setting of dislocated metric spaces. Fixed point results are established for single mappings, sequences of…
In this paper we derive robust super- and subhedging dualities for contingent claims that can depend on several underlying assets. In addition to strict super- and subhedging, we also consider relaxed versions which, instead of eliminating…
This work's major intention is the investigation of the well-posedness of certain cross-diffusion equations in the class of bounded functions. More precisely, we show existence, uniqueness and stability of bounded weak solutions under the…
Recent progress in generalised geometry and extended field theories suggests a deep connection between consistent truncations and dualities, which is not immediately obvious. A prime example is generalised Scherk-Schwarz reductions in…
We consider a standard distributed optimisation setting where $N$ machines, each holding a $d$-dimensional function $f_i$, aim to jointly minimise the sum of the functions $\sum_{i = 1}^N f_i (x)$. This problem arises naturally in…
The results of computer searches for large graphs with given (small) degree and diameter are presented. The new graphs are Cayley graphs of semidirect products of cyclic groups and related groups. One fundamental use of our ``dense graphs''…
We make two observations regarding a recent tight example for a composition theorem for randomized query complexity: (1) it implies general randomized query-to-communication lifting is not always true if one allows relations, (2) it is in a…
In the paper we introduce a notion of a key relation, which is similar to the notion of a critical relation introduced by Keith A.Kearnes and \'Agnes Szendrei. All clones on finite sets can be defined by only key relations. In addition…
In this paper we study the two player randomized communication complexity of the sparse set disjointness and the exists-equal problems and give matching lower and upper bounds (up to constant factors) for any number of rounds for both of…
We show new results about the garden-hose model. Our main results include improved lower bounds based on non-deterministic communication complexity (leading to the previously unknown $\Theta(n)$ bounds for Inner Product mod 2 and…
In the last decade the Fick-Jacobs approximation has been exploited to capture the transport across constrictions. Here, we review the derivation of the Fick-Jacobs equation with particular emphasis on its linear response regime. We show…
We revisit the problem of secret key agreement using interactive public communication for two parties and propose a new secret key agreement protocol. The protocol attains the secret key capacity for general observations and attains the…
In this work, we establish a nontrivial level of distribution for densities on $\{1,\ldots, N\}$ obtained by a biased coin convolution. As a consequence of sieving theory, one then derives the expected lower bound for the weight of such…
Effective conductivity of a 2D random composite is expressed in the form of long series in the volume fraction of ideally conducting disks. The problem of a {\it direct} reconstruction of the critical index for superconductivity from the…
We prove bounds for the popularity of products of sets with weak additive structure, and use these bounds to prove results about continued fractions. Namely, we obtain a nearly sharp upper bound for the cardinality of Zaremba's set modulo…
The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone…
We study the additivity problems for the classical capacity of quantum channels, the minimal output entropy and its convex closure. We show for each of them that additivity for arbitrary pairs of channels holds iff it holds for arbitrary…
In this paper we prove the following results in the plane. They are related to each other, while each of them has its own interest. First we obtain an $\epsilon_0$-increment on intersection between pencils of $\delta$-tubes, under…