ABSTRACT. The minimal models M(p ′ , p) with p ′> 2 have a unique (non-trivial) simple current of conformal dimension h = 1 4 (p ′ − 2)(p − 2). The representation theory of the extended algebra defined by this simple current is investigated in detail. All highest weight representations

This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrix-vector operations which should provide for efficient and portable implementations of algorithms for high performance computers.

is important in order to make constraint databases a practical technology. In this paper, we extend the previously defined constraint algebra (called generalized relational algebra). First, we show that the relational model is not the only possible semantic reference model for constraint relational databases

We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary

Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3-dimensional Calabi-Yau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual

Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical methods are necessarily incomplete and imprecise. Using the singular value decomposition (SVD), one can take advantage of the implicit higher-order structure in the association of terms with documents by determining the SVD of large sparse term by document matrices. Terms and documents represented by 200-300 of the largest singular vectors are then matched against user queries. We call this retrieval method Latent Semantic Indexing (LSI) because the subspace represents important associative relationships between terms and documents that are not evident in individual documents. LSI is a completely automatic yet intelligent indexing method, widely applicable, and a promising way to improve users...

much ofthe technology and approach developed here can be applied to the other Level 3 BLAS and the general strategy can have an impact on basic linear algebra operations in general and may be extended to other important kernel operations.

Abstract. We present a self-contained account of Woodin’s extender algebra and its use in proving absoluteness results, including a proof of the Σ 2 1-absoluteness theorem. We also include a proof that the existence of an inner model with Woodin limit of Woodin cardinals implies the existence

We review the construction of the extender algebra, a Boolean algebra which is due to Woodin, with δ-many generators. The resulting genericity iteration is applied to prove a new Σ 2 1-absoluteness theorem for c.c.c. forcings with ordinal parameters. Additionally we introduce and discuss sets

Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k