Related papers: On the complexity function for sequences which are…

We prove the existence of a bound on the number of steps of the minimal model program for singular surfaces in terms of discrepancies and top Chern numbers. As an application, we prove that given $R\in\mathbb{R}$ and $\epsilon\in (0,1)$,…

We show by a constructive proof that in all aperiodic dynamical system, for all sequences $(a_n)_{n\in\N}\subset\R_+$ such that $a_n\nearrow\infty$ and $\frac{a_n}{n}\to 0$ as $n\to\infty$, there exists a set $A\in\A$ having the property…

We study the complexity of $\mathscr{B}$-free subshifts which are proximal and of zero entropy. Such subshifts are generated by Behrend sets. The complexity is shown to achieve any subexponential growth and is estimated for some classical…

In this paper, we show that the presence of the Archimedean and the mixture-continuity properties of a binary relation, both empirically non-falsifiable in principle, foreclose the possibility of consistency (transitivity) without…

Periodic and quasi-periodic orbits of the $n$-body problem are critical points of the action functional constrained to the Sobolev space of symmetric loops. Variational methods yield collisionless orbits provided the group of symmetries…

A central limit theorem is proved for some strictly stationary sequences of random variables that satisfy certain mixing conditions and are subjected to the "shrinking operators" $U_r(x):=[\max\{|x|-r,0\}]\cdot x/|x|,\ r \ge 0$. For…

We call a metric space $s$-negligible iff its $s$-dimensional Hausdorff measure vanishes. We show that every countably $m$-rectifiable subset of $\mathbb{R}^{2n}$ can be displaced from every $(2n-m)$-negligible subset by a Hamiltonian…

We prove that the sensitivity of any non-trivial graph property on $n$ vertices is at least $\lfloor \frac{1}{2}n \rfloor$ , provided $n$ is sufficiently large.

Any $n$-vertex $3$-graph with minimum codegree at least $\lfloor n/3\rfloor$ must have a spanning tight component, but immediately below this threshold it is possible for no tight component to span more than $\lceil 2n/3\rceil$ vertices.…

We show that for every non-elementary hyperbolic group, an associated topological flow space admits a coding based on a transitive subshift of finite type. Applications include regularity results for Manhattan curves, the uniqueness of…

In this paper we show that $e/n$ is the sharp threshold for the existence of tight Hamilton cycles in random $k$-uniform hypergraphs, for all $k\ge 4$. When $k=3$ we show that $1/n$ is an asymptotic threshold. We also determine thresholds…

A binary matrix has the consecutive ones property (C1P) if it is possible to order the columns so that all 1s are consecutive in every row. In [McConnell, SODA 2004 768-777] the notion of incompatibility graph of a binary matrix was…

I will discuss the recent proof that the complexity class NEXP (nondeterministic exponential time) lacks nonuniform ACC circuits of polynomial size. The proof will be described from the perspective of someone trying to discover it.

We consider word complexity and topological entropy for random substitution subshifts. In contrast to previous work, we do not assume that the underlying random substitution is compatible. We show that the subshift of a primitive random…

Minimal surfaces in the sub-Riemannian Heisenberg group can be constructed by means of a Riemannian approximation scheme, as limit of Riemannian minimal surfaces. We study the regularity of Lipschitz, non-characteristic minimal surfaces…

Let $A$ be a finite multiset of integers. If $B$ be a multiset such that $A$ and $B$ are $t$-complementing multisets of integers, then $B$ is periodic. We obtain the Biro-type upper bound for the smallest such period of $B$: Let…

We generalize to the setting of Arveson's maximal subdiagonal subalgebras of finite von Neumann algebras, the Szeg\"o $L^p$-distance estimate, and classical theorems of F. and M. Riesz, Gleason and Whitney, and Kolmogorov. In so doing, we…

The Kestelman-Borwein-Ditor Theorem asserts that a non-negligible subset of $\mathbb{R}$ which is Baire (=has the Baire property, BP) or measurable is shift-compact: it contains some subsequence of any null sequence to within translation by…

Let $\hil$ be a finite dimensional (real or complex) Hilbert space and let $\{a_i\}_{i=1}^\infty$ be a non-increasing sequence of positive numbers. Given a finite sequence of vectors $\f$ in $\hil$ we find necessary and sufficient…

For $1\le \ell<k/2$, we show that for sufficiently large $n$, every $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $\frac n{2 (k-\ell)} $ contains a Hamilton $\ell$-cycle. This codegree condition is best possible and…