Related papers: A Short Proof of Bernoulli Disjointness via the Lo…

Generalizing a result of Furstenberg, we show that for every infinite discrete group $G$, the Bernoulli flow $2^G$ is disjoint from every minimal $G$-flow. From this, we deduce that the algebra generated by the minimal functions…

Gao, Jackson, and Seward (see arXiv:1201.0513) proved that every countably infinite group $\Gamma$ admits a nonempty free subshift $X \subseteq \{0,1\}^\Gamma$. Furthermore, a theorem of Seward and Tucker-Drob (see arXiv:1402.4184) implies…

The Lov\'{a}sz Local Lemma is a central tool in probabilistic combinatorics, providing a sufficient condition under which a finite collection of undesirable events with limited dependencies can be simultaneously avoided with positive…

Let $\Gamma$ be a countably infinite discrete group. A $\Gamma$-flow $X$ (i.e., a nonempty compact Hausdorff space equipped with a continuous action of $\Gamma$) is called $S$-minimal for a subset $S \subseteq \Gamma$ if the partial orbit…

Gao, Jackson, and Seward proved that every countably infinite group $\Gamma$ admits a nonempty free subshift $X \subseteq 2^\Gamma$. Here we strengthen this result by showing that free subshifts can be "large" in various senses.…

We prove a compactness result with respect to $\Gamma$-convergence for a class of integral functionals which are expressed as a sum of a local and a non-local term. The main feature is that, under our hypotheses, the local part of the…

Given a collection of independent events each of which has strictly positive probability, the probability that all of them occur is also strictly positive. The Lov\'asz local lemma (LLL) asserts that this remains true if the events are not…

The Lovasz Local Lemma [EL75] is a powerful tool to prove the existence of combinatorial objects meeting a prescribed collection of criteria. The technique can directly be applied to the satisfiability problem, yielding that a k-CNF formula…

Each continuous action of a countably infinite discrete group $\Gamma$ on a compact metrizable space X induces a continuous action of $\Gamma$ on the space M(X) of Borel probability measures on X. We compare the local entropy theory for…

Ab\'ert-Weiss have shown that the Bernoulli shift s of a countably infinite group \Gamma is weakly contained in any free measure preserving action (mpa) b of \Gamma. We establish a strong version of this result, conjectured by Ioana, by…

The Lov\'{a}sz Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser and Tardos have shown that the LLL gives more than just…

Let $\Gamma$ be a graph, $A$ an abelian group, $\mathcal{D}$ a given orientation of $\Gamma$ and $R$ a unital subring of the endomorphism ring of $A$. It is shown that the set of all maps $\varphi$ from $E(\Gamma)$ to $A$ such that…

Lov\'asz Local Lemma (LLL) is a probabilistic tool that allows us to prove the existence of combinatorial objects in the cases when standard probabilistic argument does not work (there are many partly independent conditions). LLL can be…

Using percolation techniques, Gaboriau and Lyons recently proved that every countable, discrete, nonamenable group $\Gamma$ contains measurably the free group $\mathbf F_2$ on two generators: there exists a probability measure-preserving,…

We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…

The probabilistic method is a technique for proving combinatorial existence results by means of showing that a randomly chosen object has the desired properties with positive probability. A particularly powerful probabilistic tool is the…

We prove that if $G$ is a finitely generated group and $Z$ is a uniformly recurrent subgroup of $G$ then there exists a minimal system $(X,G)$ with $Z$ as its stability system. This answers a query of Glasner and Weiss \cite{GW} in the case…

We show that if $\Gamma = \Gamma_1\times\dotsb\times \Gamma_n$ is a product of $n\geq 2$ non-elementary ICC hyperbolic groups then any discrete group $\Lambda$ which is $W^*$-equivalent to $\Gamma$ decomposes as a $k$-fold direct sum…

In his seminal 1967 paper "Disjointness in ergodic theory, minimal sets, and a problem in Diophantine approximation" Furstenberg introduced the notion of disjointness of dynamical systems, both topological and measure preserving. In this…

A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roughly correspond to the genuine separators of its local…