Related papers: Derandomizing Chernoff Bound with Union Bound with…
Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…
We prove that the minimally displaced set of a relatively irreducible automorphism of a free splitting, situated in a deformation space, is uniformly locally finite. The minimally displaced set coincides with the train track points for an…
In this paper we investigate the efficiency of quantum cloning of $N$ identical mixed qubits. We employ a recently introduced measure of distinguishability of quantum states called quantum Chernoff bound. We evaluate the quantum Chernoff…
We prove a Kahane-Khinchin type result with a few random vectors, which are distributed independently with respect to an arbitrary log-concave probability measure on $\R^n$. This is an application of small ball estimate and Chernoff's…
We present simple randomized and exchangeable improvements of Markov's inequality, as well as Chebyshev's inequality and Chernoff bounds. Our variants are never worse and typically strictly more powerful than the original inequalities. The…
Given finite sets $X_1,\dotsc,X_m$ in $\mathbb{R}^d$ (with $d$ fixed), we prove that there are respective subsets $Y_1,\dotsc,Y_m$ with $|Y_i|\ge \frac{1}{\operatorname{poly}(m)}|X_i|$ such that, for $y_1\in Y_1,\dotsc,y_m\in Y_m$, the…
In this paper, we address the problem of constructing a uniform probability measure on $\mathbb{N}$. Of course, this is not possible within the bounds of the Kolmogorov axioms and we have to violate at least one axiom. We define a…
Recently new solvable systems of nonlinear evolution equations -- including ODEs, PDEs and systems with discrete time -- have been introduced. These findings are based on certain convenient formulas expressing the $k$-th time-derivative of…
Based on the Chernoff approximation, we provide a general approximation result for convex monotone semigroups which are continuous w.r.t. the mixed topology on suitable spaces of continuous functions. Starting with a family $(I(t))_{t\geq…
We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as…
We prove a multivariate central limit theorem with explicit error bound on a non-smooth function distance for sums of bounded decomposable $d$-dimensional random vectors. The decomposition structure is similar to that of Barbour, Karo\'nski…
We investigate the sets of uniform limits $A(\bar{B}_n)$, $A(\bar{D}^I)$ of polynomials on the closed unit ball $\bar{B}_n$ of $\mathbb{C}^n$ and on the cartesian product $\bar{D}^I$ where $I$ is an arbitrary set and $\bar{D}$ is the closed…
Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with better parameters than explicit constructions do. But the probabilistic…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
This article explores the generalized analysis-of-variance or ANOVA dimensional decomposition (ADD) for multivariate functions of dependent random variables. Two notable properties, stemming from weakened annihilating conditions, reveal…
This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…
We explore asymptotically optimal bounds for deviations of Bernoulli convolutions from the Poisson limit in terms of the Shannon relative entropy and the Pearson $\chi^2$-distance. The results are based on proper non-uniform estimates for…
We present a Law of Large Numbers principle for uniformly continuous random quantum dynamical semigroups. Random iterates of independent copies of these semigroups are shown to be Chernoff equivalent to the quantum dynamical semigroup by…