Related papers: A dichotomy for the stability of arithmetic progre…
We show that self-conformal subsets of $\mathbb{R}$ that do not satisfy the weak separation condition have full Assouad dimension. Combining this with a recent results by K\"aenm\"aki and Rossi we conclude that an interesting dichotomy…
We obtain sufficient conditions ensuring the existence of a uniformly continuous and H\"older continuous homeomorphism between the solutions of a linear system of differential equations with piecewise constant argument of generalized type…
We compute the Hausdorff dimension of the image X(E) of a non random Borel set E $\subset$ [0, 1], where X is a L\'evy multistable process in R. This extends the case where X is a classical stable L\'evy process by letting the stability…
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…
We give a proof of the Neilsen-Thurston classification theorem of a homeomorphism f of a standard surface of finite type as either periodic, pseudo-Anosov, or reducible. In the periodic case, we show that there exists an integer n>0 such…
Let G be an arbitrary finite group and let S and T be two subsets such that |S|>1, |T|>1, and |TS|< |T|+|S|< |G|-1. We show that if |S|< |G|-4|G|^{1/2}+1 then either S is a geometric progression or there exists a non-trivial subgroup H such…
In this paper we show some remarkable consequences of the method which proves that every bisymmetric, symmetric, reflexive, strictly monotonic binary map on a proper interval is continuous, in particular it is a quasi-arithmetic mean. Now…
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
Higher order cohomology of arithmetic groups is expressed in terms of (g,K)-cohomology. Generalizing results of Borel, it is shown that the latter can be computed using functions of (uniform) moderate growth. A higher order versions of…
We prove that autonomous Hamiltonian flows on the two-sphere exhibit the following dichotomy: the Hofer norm either grows linearly or is bounded in time by a universal constant C. Our approach involves a new technique, Hamiltonian…
For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
We show that there is an absolute $c>0$ such that any subset of $\mathbb{F}_2^\infty$ of size $N$ is $O(N^{1-c})$-stable in the sense of Terry and Wolf. By contrast a size $N$ arithmetic progression in the integers is not $N$-stable.
Let V be a variety of not necessarily associative algebras, and A an inverse limit of nilpotent algebras A_i\in V, such that some finitely generated subalgebra S \subseteq A is dense in A under the inverse limit of the discrete topologies…
We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…
This is an exposition of the combinatorial proof of the density Hales--Jewett theorem, due to D.\,H.\,J. Polymath in 2012. The theorem says that for given $\de>0$ and $k$, for every $n>n_0$ every set $A\sus\{1,2,\ds,k\}^n$ with $|A|\ge\de…
We study the extension of the Kechris-Solecki-Todorcevic dichotomy on analytic graphs to dimensions higher than 2. We prove that the extension is possible in any dimension, finite or infinite. The original proof works in the case of the…
These are notes from talks given at ICMS, Edinburgh, 4/2007 ("Geometry and Algorithms workshop") and at Bernoulli Center, Lausanne 5/2007 ("Limits of graphs in group theory and computer science"). We survey the following type of dichotomies…
Given two finite abstract simplicial complexes A and B, one can define a new simplicial complex on the set of simplicial maps from A to B. After adding two technicalities, we call this complex Homsc(A, B). We prove the following dichotomy:…
We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…