The main object of this work is to present a powerful method of construction of subshifts which the authors use chiefly to construct WAP systems with various properties. Among many other applications of these so-called labeled subshifts, the authors obtain examples of null as well as non-null WAP subshifts, WAP subshifts of arbitrary countable (Birkhoff) height, and completely scrambled WAP systems of arbitrary countable height. They also construct LE but not HAE subshifts and recurrent non-tame subshifts.

The authors develop a comprehensive theory of conformal graph directed Markov systems in the non-Riemannian setting of Carnot groups equipped with a sub-Riemannian metric. In particular, they develop the thermodynamic formalism and show that, under natural hypotheses, the limit set of an Carnot conformal GDMS has Hausdorff dimension given by Bowen's parameter. They illustrate their results for a variety of examples of both linear and nonlinear iterated function systems and graph directed Markov systems in such sub-Riemannian spaces. These include the Heisenberg continued fractions introduced by Lukyanenko and Vandehey as well as Kleinian and Schottky groups associated to the non-real classical rank one hyperbolic spaces.

This book concentrates on the modern theory of dynamical systems and its interactions with number theory and combinatorics. The greater part begins with a course in analytic number theory and focuses on its links with ergodic theory, presenting an exhaustive account of recent research on Sarnak's conjecture on Möbius disjointness. Selected topics involving more traditional connections between number theory and dynamics are also presented, including equidistribution, homogenous dynamics, and Lagrange and Markov spectra. In addition, some dynamical and number theoretical aspects of aperiodic order, some algebraic systems, and a recent development concerning tame systems are described.

In this work the authors develop a decomposition theory for subgroups of Out(Fn) which generalizes the decomposition theory for individual elements of Out(Fn) found in the work of Bestvina, Feighn, and Handel, and which is analogous to the decomposition theory for subgroups of mapping class groups found in the work of Ivanov.

The areas of Ramsey theory and random graphs have been closely linked ever since Erdős's famous proof in 1947 that the “diagonal” Ramsey numbers R(k) grow exponentially in k. In the early 1990s, the triangle-free process was introduced as a model which might potentially provide good lower bounds for the “off-diagonal” Ramsey numbers R(3,k). In this model, edges of Kn are introduced one-by-one at random and added to the graph if they do not create a triangle; the resulting final (random) graph is denoted Gn,△. In 2009, Bohman succeeded in following this process for a positive fraction of its duration, and thus obtained a second proof of Kim's celebrated result that R(3,k)=Θ(k2/logk). In this paper the authors improve the results of both Bohman and Kim and follow the triangle-free process all the way to its asymptotic end.

In this paper, the authors prove global well-posedness of the massless Maxwell–Dirac equation in the Coulomb gauge on R1+d(d≥4) for data with small scale-critical Sobolev norm, as well as modified scattering of the solutions. Main components of the authors' proof are A) uncovering null structure of Maxwell–Dirac in the Coulomb gauge, and B) proving solvability of the underlying covariant Dirac equation. A key step for achieving both is to exploit (and justify) a deep analogy between Maxwell–Dirac and Maxwell-Klein-Gordon (for which an analogous result was proved earlier by Krieger-Sterbenz-Tataru, which says that the most difficult part of Maxwell–Dirac takes essentially the same form as Maxwell-Klein-Gordon.

In this paper the authors introduce a general framework for the study of limits of relational structures and graphs in particular, which is based on a combination of model theory and (functional) analysis. The authors show how the various approaches to graph limits fit to this framework and that the authors naturally appear as “tractable cases” of a general theory. As an outcome of this, the authors provide extensions of known results. The authors believe that this puts these into a broader context. The second part of the paper is devoted to the study of sparse structures. First, the authors consider limits of structures with bounded diameter connected components and prove that in this case the convergence can be “almost” studied component-wise. They also propose the structure of limit objects for convergent sequences of sparse structures. Eventually, they consider the specific case of limits of colored rooted trees with bounded height and of graphs with bounded tree-depth, motivated by their role as “elementary bricks” these graphs play in decompositions of sparse graphs, and give an explicit construction of a limit object in this case. This limit object is a graph built on a standard probability space with the property that every first-order definable set of tuples is measurable. This is an example of the general concept of modeling the authors introduce here. Their example is also the first “intermediate class” with explicitly defined limit structures where the inverse problem has been solved.

The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE, i.e., it can be solved in polynomial space. The main technical result of the paper states that, for certain finite presentations of groups, which include the Baumslag-Solitar one-relator groups and free products of cyclic groups, the bounded word problem and the precise word problem can be solved in polylogarithmic space. As consequences of developed techniques that can be described as calculus of brackets, the author obtains polylogarithmic space bounds for the computational complexity of the diagram problem for free groups, for the width problem for elements of free groups, and for computation of the area defined by polygonal singular closed curves in the plane. The author also obtains polynomial time bounds for these problems.

All the new tools mentioned above apply to non-orientable minimal surfaces endowed with a fixed choice of a conformal structure. This enables the authors to obtain significant new applications to the global theory of non-orientable minimal surfaces. In particular, they construct proper non-orientable conformal minimal surfaces in Rn with any given conformal structure, complete non-orientable minimal surfaces in Rn with arbitrary conformal type whose generalized Gauss map is nondegenerate and omits n hyperplanes of CPn−1 in general position, complete non-orientable minimal surfaces bounded by Jordan curves, and complete proper non-orientable minimal surfaces normalized by bordered surfaces in p-convex domains of Rn.