Moufang Loops and Groups with Triality are Essentially the Same Thing


Book Description

In 1925 Élie Cartan introduced the principal of triality specifically for the Lie groups of type D4, and in 1935 Ruth Moufang initiated the study of Moufang loops. The observation of the title in 1978 was made by Stephen Doro, who was in turn motivated by the work of George Glauberman from 1968. Here the author makes the statement precise in a categorical context. In fact the most obvious categories of Moufang loops and groups with triality are not equivalent, hence the need for the word “essentially.”




The Bounded and Precise Word Problems for Presentations of Groups


Book Description

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.




Rigid Character Groups, Lubin-Tate Theory, and (φ,Γ)-Modules


Book Description

The construction of the p-adic local Langlands correspondence for GL2(Qp) uses in an essential way Fontaine's theory of cyclotomic (φ,Γ)-modules. Here cyclotomic means that Γ=Gal(Qp(μp∞)/Qp) is the Galois group of the cyclotomic extension of Qp. In order to generalize the p-adic local Langlands correspondence to GL2(L), where L is a finite extension of Qp, it seems necessary to have at our disposal a theory of Lubin-Tate (φ,Γ)-modules. Such a generalization has been carried out, to some extent, by working over the p-adic open unit disk, endowed with the action of the endomorphisms of a Lubin-Tate group. The main idea of this article is to carry out a Lubin-Tate generalization of the theory of cyclotomic (φ,Γ)-modules in a different fashion. Instead of the p-adic open unit disk, the authors work over a character variety that parameterizes the locally L-analytic characters on oL. They study (φ,Γ)-modules in this setting and relate some of them to what was known previously.




Automorphisms of Fusion Systems of Finite Simple Groups of Lie Type


Book Description

For a finite group G of Lie type and a prime p, the authors compare the automorphism groups of the fusion and linking systems of G at p with the automorphism group of G itself. When p is the defining characteristic of G, they are all isomorphic, with a very short list of exceptions. When p is different from the defining characteristic, the situation is much more complex but can always be reduced to a case where the natural map from Out(G) to outer automorphisms of the fusion or linking system is split surjective. This work is motivated in part by questions involving extending the local structure of a group by a group of automorphisms, and in part by wanting to describe self homotopy equivalences of BG∧p in terms of Out(G).




Higher Orbifolds and Deligne-Mumford Stacks as Structured Infinity-Topoi


Book Description

The author develops a universal framework to study smooth higher orbifolds on the one hand and higher Deligne-Mumford stacks (as well as their derived and spectral variants) on the other, and use this framework to obtain a completely categorical description of which stacks arise as the functor of points of such objects. He chooses to model higher orbifolds and Deligne-Mumford stacks as infinity-topoi equipped with a structure sheaf, thus naturally generalizing the work of Lurie, but his approach applies not only to different settings of algebraic geometry such as classical algebraic geometry, derived algebraic geometry, and the algebraic geometry of commutative ring spectra but also to differential topology, complex geometry, the theory of supermanifolds, derived manifolds etc., where it produces a theory of higher generalized orbifolds appropriate for these settings. This universal framework yields new insights into the general theory of Deligne-Mumford stacks and orbifolds, including a representability criterion which gives a categorical characterization of such generalized Deligne-Mumford stacks. This specializes to a new categorical description of classical Deligne-Mumford stacks, which extends to derived and spectral Deligne-Mumford stacks as well.




Subgroup Decomposition in Out(Fn)


Book Description

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 Triangle-Free Process and the Ramsey Number R(3,k)


Book Description

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.




Global Well-Posedness of High Dimensional Maxwell–Dirac for Small Critical Data


Book Description

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.




A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth


Book Description

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.