Three-block exceptional collections over Del Pezzo surfaces

We study complete exceptional collections of coherent sheaves over Del Pezzo surfaces, which consist of three blocks such that inside each block all Ext groups between the sheaves are zero. We show that the ranks of all sheaves in such a block are the same and the three ranks corresponding to a complete 3-block exceptional collection satisfy a Markov-type Diophantine equation that is quadratic in each variable. For each Del Pezzo surface, there is a finite number of these equations; the complete list is given. The 3-string braid group acts by mutations on the set of complete 3-block exceptional collections. We describe this action. In particular, any orbit contains a 3-block collection with the sum of ranks that is minimal for the solutions of the corresponding Markov-type equation, and the orbits can be obtained from each other via tensoring by an invertible sheaf and with the action of the Weyl group. This allows us to compute the number of orbits up to twisting.Comment: LaTex v2.09, 32 pages with 1 figure. To appear in Izvestiya Mat

A Computational Approach to Reflective Meta-Reasoning about Languages with Bindings

We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to reason abstractly about operators, languages, open-ended languages, classes of languages, etc. The theory is based on the ideas of higher-order abstract syntax, with an appropriate induction principle parameterized over the language (i.e. a set of operators) being used. In our approach, both the bound and free variables are treated uniformly and this uniform treatment extends naturally to variable-length bindings. The implementation is reflective, namely there is a natural mapping between the meta-language of the theorem-prover and the object language of our theory. The object language substitution operation is mapped to the meta-language substitution and does not need to be defined recursively. Our approach does not require designing a custom type theory; in this paper we describe the implementation of this foundational theory within a general-purpose type theory. This work is fully implemented in the MetaPRL theorem prover, using the pre-existing NuPRL-like Martin-Lof-style computational type theory. Based on this implementation, we lay out an outline for a framework for programming language experimentation and exploration as well as a general reflective reasoning framework. This paper also includes a short survey of the existing approaches to syntactic reflection

Formal Compiler Implementation in a Logical Framework

The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the use of higher-order abstract syntax and term rewriting in a logical framework. All program transformations, from parsing to code generation, are cleanly isolated and specified as term rewrites. This has several advantages. The correctness of the compiler depends solely on a small set of rewrite rules that are written in the language of formal mathematics. In addition, the logical framework guarantees the preservation of scoping, and it automates many frequently-occurring tasks including substitution and rewriting strategies. As we show, compiler development in a logical framework can be easier than in a general-purpose language like ML, in part because of automation, and also because the framework provides extensive support for examination, validation, and debugging of the compiler transformations. The paper is organized around a case study, using the MetaPRL logical framework to compile an ML-like language to Intel x86 assembly. We also present a scoped formalization of x86 assembly in which all registers are immutable

LP → LQ - Estimates for the Fractional Acoustic Potentials and some Related Operators

Mathematics Subject Classification: 47B38, 31B10, 42B20, 42B15.We obtain the Lp → Lq - estimates for the fractional acoustic potentials in R^n, which are known to be negative powers of the Helmholtz operator, and some related operators. Some applications of these estimates are also given.* This paper has been supported by Russian Fond of Fundamental Investigations under Grant No. 40–01–008632 a

Automorphism groups of Grassmann codes

We use a theorem of Chow (1949) on line-preserving bijections of Grassmannians to determine the automorphism group of Grassmann codes. Further, we analyze the automorphisms of the big cell of a Grassmannian and then use it to settle an open question of Beelen et al. (2010) concerning the permutation automorphism groups of affine Grassmann codes. Finally, we prove an analogue of Chow's theorem for the case of Schubert divisors in Grassmannians and then use it to determine the automorphism group of linear codes associated to such Schubert divisors. In the course of this work, we also give an alternative short proof of MacWilliams theorem concerning the equivalence of linear codes and a characterization of maximal linear subspaces of Schubert divisors in Grassmannians.Comment: revised versio

Spectral approach to linear programming bounds on codes

We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal polynomials. The examples of the method considered in the paper include binary codes, binary constant-weight codes, spherical codes, and codes in the projective spaces.Comment: 11 pages, submitte