Equivariant completions of toric contraction morphisms

We treat equivariant completions of toric contraction morphisms as an application of the toric Mori theory. For this purpose, we generalize the toric Mori theory for non-$\mathbb Q$-factorial toric varieties. So, our theory seems to be quite different from Reid's original combinatorial toric Mori theory. We also explain various examples of non-$\mathbb Q$-factorial contractions, which imply that the $\mathbb Q$-factoriality plays an important role in the Minimal Model Program. Thus, this paper completes the foundations of the toric Mori theory and show us a new aspect of the Minimal Model Program.Comment: 21 pages; typos were corrected, new remarks were adde

Moduli spaces of weighted pointed stable curves

A weighted pointed curve consists of a nodal curve and a sequence of marked smooth points, each assigned a number between zero and one. A subset of the marked points may coincide if the sum of the corresponding weights is no greater than one. We construct moduli spaces for these objects using methods of the log minimal model program, and describe the induced birational morphisms between moduli spaces as the weights are varied. In the genus zero case, we explain the connection to Geometric Invariant Theory quotients of points in the projective line, and to compactifications of moduli spaces studied by Kapranov, Keel, and Losev-Manin.Comment: To appear in Advances in Mathematic

The Power of Programs over Monoids in DA

The program-over-monoid model of computation originates with Barrington\u27s proof that it captures the complexity class NC^1. Here we make progress in understanding the subtleties of the model. First, we identify a new tameness condition on a class of monoids that entails a natural characterization of the regular languages recognizable by programs over monoids from the class. Second, we prove that the class known as DA satisfies tameness and hence that the regular languages recognized by programs over monoids in DA are precisely those recognizable in the classical sense by morphisms from QDA. Third, we show by contrast that the well studied class of monoids called J is not tame and we exhibit a regular language, recognized by a program over a monoid from J, yet not recognizable classically by morphisms from the class QJ. Finally, we exhibit a program-length-based hierarchy within the class of languages recognized by programs over monoids from DA