Preface to the second edition Preface to the first edition Introduction Part I. General Theory: 1. Preliminaries 2. Families of sheaves 3. The Grauert-Mullich Theorem 4. Moduli spaces Part II. Sheaves on Surfaces: 5. Construction methods 6. Moduli spaces on K3 surfaces 7. Restriction of sheaves to curves 8. Line bundles on the moduli space 9. Irreducibility and smoothness 10. Symplectic structures 11. Birational properties Glossary of notations References Index.

/pdf/the-geometry-of-moduli-spaces-of-sheaves-44gematwk3.pdf

The geometry of moduli spaces of sheaves

A symmetric tensor is a higher order generalization of a symmetric matrix. In this paper, we study various properties of symmetric tensors in relation to a decomposition into a symmetric sum of outer product of vectors. A rank-1 order-$k$ tensor is the outer product of $k$ nonzero vectors. Any symmetric tensor can be decomposed into a linear combination of rank-1 tensors, each of which is symmetric or not. The rank of a symmetric tensor is the minimal number of rank-1 tensors that is necessary to reconstruct it. The symmetric rank is obtained when the constituting rank-1 tensors are imposed to be themselves symmetric. It is shown that rank and symmetric rank are equal in a number of cases and that they always exist in an algebraically closed field. We will discuss the notion of the generic symmetric rank, which, due to the work of Alexander and Hirschowitz [J. Algebraic Geom., 4 (1995), pp. 201-222], is now known for any values of dimension and order. We will also show that the set of symmetric tensors of symmetric rank at most $r$ is not closed unless $r=1$.

/pdf/symmetric-tensors-and-symmetric-tensor-rank-1sfgx6fmsr.pdf

Symmetric Tensors and Symmetric Tensor Rank

In this chapter we will present the basic concepts of term rewriting that are needed in this book. More details on term rewriting, its applications, and related subjects can be found in the textbook of Baader and Nipkow [BN98]. Readers versed in German are also referred to the textbooks of Avenhaus [Ave95], Bundgen [Bun98], and Drosten [Dro89]. Moreover, there are several survey articles [HO80, DJ90, Klo92, Pla93] that can also be consulted.

Term Rewriting Systems

The main purpose of this work is the study of the homotopy theory of dg-categories up to quasi-equivalences. Our main result provides a natural description of the mapping spaces between two dg-categories $C$ and $D$ in terms of the nerve of a certain category of $(C,D)$-bimodules. We also prove that the homotopy category $Ho(dg-Cat)$ is cartesian closed (i.e. possesses internal Hom's relative to the tensor product). We use these two results in order to prove a derived version of Morita theory, describing the morphisms between dg-categories of modules over two dg-categories $C$ and $D$ as the dg-category of $(C,D)$-bi-modules. Finally, we give three applications of our results. The first one expresses Hochschild cohomology as endomorphisms of the identity functor, as well as higher homotopy groups of the \emph{classifying space of dg-categories} (i.e. the nerve of the category of dg-categories and quasi-equivalences between them). The second application is the existence of a good theory of localization for dg-categories, defined in terms of a natural universal property. Our last application states that the dg-category of (continuous) morphisms between the dg-categories of quasi-coherent (resp. perfect) complexes on two schemes (resp. smooth and proper schemes) is quasi-equivalent to the dg-category of quasi-coherent complexes (resp. perfect) on their product.

/pdf/the-homotopy-theory-of-dg-categories-and-derived-morita-1tg9nxz1cq.pdf

The homotopy theory of dg-categories and derived Morita theory

The π-Calculus: A theory of mobile processes by Davide Sangiorgi and David Walker Formal methods have formed the foundation of Computer Science since its inception. Although, initially these formal methods dealt with processes and systems on an individual basis, the paradigm has shifted with the dawn of the age of computer networks. When dealing with systems with interconnected, communicating, dependent, cooperative, and competitive components, the older outlook of analyzing and developing singular systems—and the tools that went with it—were hardly suitable. This led to the development of theories and tools that would support the new paradigm. On the tools end, the development has been widespread and satisfactory: programming languages, development frameworks, databases, and even end-user software products such as word processors, have gained network-awareness. However on the theoretical end, the development has been far less satisfactory. The major work was done by Robin Milner, Joachim Parrow, and David Walker who developed the formalism known as π-calculus in 1989. π-calculus is a process calculus that treats communication between its components as the basic form of computation. It has been quite successful as a foundation of several other calculi in the field and as Milner puts it, it has become common to express ideas about interactions and mobility in variants of the calculus. Introduction The current book serves as a comprehensive reference to π-calculus. Besides Milner's own book on the subject, this is the only other book-length publication on the topic. In many ways, it is much more comprehensive than Milner's: a much wider area of topics are dealt with and in more detail as well. Contents The book is split into seven part. The first part presents the basic theory of π-calculus. However, basic does not mean concise: every topic is discussed in great detail. The section on bisimulation is particularly intensive and provides several insights about the motivation for the theory. Part two discusses several variants of the original calculus. By varying several characteristics of the calculus, such as whether a process can communicate with more than processes at a time, we can obtain these variants. A number of interesting properties of the language are studied by the other when discussing these variants. As can be understood from the title, the calculus' contribution to analyzing mobile processes is a major topic, and it is dealt with extensively starting from part three. The basics are introduced by the way of a sophisticated typing system whose application in speciying complex processes is presented in part four. Part five looks at higher-order π-calculus in which composed systems are considered as first-class citizens. Part six is one of the best in the book and discusses the relation between π-calculus and lambda-calculus, which is an older and more basic calculus. Finally part seven shows how π-calculus can be employed in studying practical, modern software engineering concepts such as object-oriented programming. Impressions One of my disappointments with this book is in how often the reader is left perplexed with some of the theoretical developments, specially in part three. π-calculus is a complicated topic, even for the graduate student audience to which this book is directed, and the author would have done much better by reducing the number of topics and instead focusing on more lucid and detailed explanations. There are several experimental digressions throughout the book, which although interesting, take away from some of the momentum of sequential study. For example, topics such as comparison and encoding of one language to another could be easily moved to a separate section in order to make the content more suitable for self-study. Another issue is the little effort towards making the connection from the theoretical to the practical. The main reason why formal methods have not been adopted in mainstream software development pracitces is that often it is unclear to developers how formalisms can contribute towards the software engineering process. The book would have served its purpose much better if it had spent part of eah chapter discussing the practical application of that chapter's content. For example, congruence checking and bisimulation can be incredbily exciting topics for programmers to learn if they can see practical applications of such powerful techniques. Beyond the above criticism, the book is absolutely indispensible to students and researchers in the field of formal methods. Currently it serves as the primary reference for anyone who wishes to learn the various aspects of π-calculus in detail. Raheel Ahmad

The Ï-Calculus: A theory of mobile processes

0. Introduction. Soient pl5..., pr des points suffisamment generaux (ou generiques) du plan projectif et ml9 ..., mr des entiers positifs. Quelle est la dimension du Systeme lineaire des courbes planes de degre d passant par chaque pf avec la multiplicite m,? Dans [aHl], on a etudie certains aspects de cette question, faisant apparaitre des exceptions qu'on a eu la faiblesse de ne pas chercher ä comprendre. La presente note comble cette lacune, en eclairant ces exceptions par une conjecture, qu'on espere plus convaincante que celle avancee dans [aHl]. La nouvelle conjecture est naturelle des qu'on traduit le probleme initial en termes de diviseurs sur une surface rationnelle generique Sr: eile dit, grosso modo, qu'un diviseur sur Sr dont la trace sur toute courbe exceptionnelle de Sr est positive doit avoir la cohomologie naturelle, autrement dit doit etre non special (voir la definition plus bas). Cette conjecture est une Variante, qu'on espere plus expressive, d'une conjecture proposee par Harbourne ([bH2], 1.6.2). On explique ci-dessous comment cette conjecture permettrait de calculer la cohomologie de tous les diviseurs sur les surfaces rationnelles generiques et on recense les quelques cas ou la conjecture est demontree.

Une conjecture pour la cohomologie des diviseurs sur les surfaces rationelles génériques.

The terms of the simply-typed λ-calculus can be used to express the higher-order abstract syntax of objects such as logical formulas, proofs, and programs. Support for the manipulation of such objects is provided in several programming languages (e.g. λProlog, Elf). Such languages also provide embedded implication, a tool which is widely used for expressing hypothetical judgments in natural deduction. In this paper, we show how a restricted form of second-order syntax and embedded implication can be used together with induction in the Coq Proof Development system. We specify typing rules and evaluation for a simple functional language containing only function abstraction and application, and we fully formalize a proof of type soundness in the system. One difficulty we encountered is that expressing the higher-order syntax of an object-language as an inductive type in Coq generates a class of terms that contains more than just those that directly represent objects in the language. We overcome this difficulty by defining a predicate in Coq that holds only for those terms that correspond to programs. We use this predicate to express and prove the adequacy for our syntax.

/pdf/higher-order-abstract-syntax-in-coq-1ph90yief4.pdf

Higher-Order Abstract Syntax in Coq

Smoothing algebraic space curves

An asymptotic vanishing theorem for generic unions of multiple points

We develop the theory of n-stacks (or more generally Segal n-stacks which are $\infty$-stacks such that the morphisms are invertible above degree n). This is done by systematically using the theory of closed model categories (cmc). Our main results are: a definition of n-stacks in terms of limits, which should be perfectly general for stacks of any type of objects; several other characterizations of n-stacks in terms of ``effectivity of descent data''; construction of the stack associated to an n-prestack; a strictification result saying that any ``weak'' n-stack is equivalent to a (strict) n-stack; and a descent result saying that the (n+1)-prestack of n-stacks (on a site) is an (n+1)-stack. As for other examples, we start from a ``left Quillen presheaf'' of cmc's and introduce the associated Segal 1-prestack. For this situation, we prove a general descent result, giving sufficient conditions for this prestack to be a stack. This applies to the case of complexes, saying how complexes of sheaves of $\Oo$-modules can be glued together via quasi-isomorphisms. This was the problem that originally motivated us.

André Hirschowitz

Papers

Une conjecture pour la cohomologie des diviseurs sur les surfaces rationelles génériques.

Higher-Order Abstract Syntax in Coq

Smoothing algebraic space curves

An asymptotic vanishing theorem for generic unions of multiple points

Descente pour les n-champs (Descent for n-stacks)