The Bott-Borel-Weil Theorem for direct limit groups

We show how highest weight representations of certain infinite dimensional Lie groups can be realized on cohomology spaces of holomorphic vector bundles. This extends the classical Bott-Borel-Weil Theorem for finite-dimensional compact and complex Lie groups. Our approach is geometric in nature, in the spirit of Bott's original generalization of the Borel-Weil Theorem. The groups for which we prove this theorem are strict direct limits of compact Lie groups, or their complexifications. We previously proved that such groups have an analytic structure. Our result applies to most of the familiar examples of direct limits of classical groups. We also introduce new examples involving iterated embeddings of the classical groups and see exactly how our results hold in those cases. One of the technical problems here is that, in general, the limit Lie algebras will have root systems but need not have root spaces, so we need to develop machinery to handle this somewhat delicate situation.

     

On the Maximum Number of Cliques in a Graph

A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m edges; (2) graphs with n vertices, m edges, and maximum degree Δ; (3) d-degenerate graphs with n vertices and m edges; (4) planar graphs with n vertices and m edges; and (5) graphs with n vertices and no K₅-minor or no K_3,3-minor. For example, the maximum number of cliques in a planar graph with n vertices is 8(n − 2). Research supported by a Marie Curie Fellowship of the European Community under contract 023865, and by the projects MCYT-FEDER BFM2003-00368 and Gen. Cat 2001SGR00224.     

The Interpolation Problem on the Maximal Ideal Space of H~∞

ＴｈｅＩｎｔｅｒｐｏｌａｔｉｏｎＰｒｏｂｌｅｍｏｎｔｈｅＭａｘｉｍａｌＩｄｅａｌＳｐａｃｅｏｆＨ~∞￥ＧｕｏＫｕｎｇｕ（郭坤宇）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｉｃｈｕａｎＵｎｉｖｅｒｓｉｔｙ，Ｃｈｅｎｇｄｕ，６１００６４）Ａｂｓ?..     

Asymptotic analysis of stochastic programs

In this paper we discuss a general approach to studying asymptotic properties of statistical estimators in stochastic programming. The approach is based on an extended delta method and appears to be particularly suitable for deriving asymptotics of the optimal value of stochastic programs. Asymptotic analysis of the optimal value will be presented in detail. Asymptotic properties of the corresponding optimal solutions are briefly discussed.     

蕴含G?del定理抽象形式的集合论引理

本文证明了—个集合论性质的引理,由它可直接得出G?del不完全性定理的抽象形式. 文中还述及该引理的有关诸推论.     

A version of Orlicz-Pettis Theorem for quasi-homogeneous operator space

A version of Orlicz-Pettis Theorem is established for multiplier convergent series and quasi-homogeneous operator. Applications to spaces of quasi-homogeneous operators are given.     

Embedding processes in combinatorial game theory

Berlekamp asked the question “What is the habitat of ∗2?” (See Guy, 1996 [6].) It is possible to generalize the question and ask “For a game G, what is the largest n such that ∗n is a position of G?” This leads to the concept of the nim dimension. In Santos and Silva (2008) [8] a fractal process was proposed for analyzing the previous questions. For the same purpose, in Santos and Silva (2008) [9], an algebraic process was proposed. In this paper we implement a third idea related to embedding processes. With Alan Parr’s traffic lights, we exemplify the idea of estimating the “difficulty” of the game and proving that its nim dimension is infinite.     

A combinatorial proof of the Dense Hindman’s Theorem

The Dense Hindman’s Theorem states that, in any finite coloring of the natural numbers, one may find a single color and a “dense” set B₁, for each b₁∈B₁ a “dense” set (depending on b₁), for each a “dense” set (depending on b₁,b₂), and so on, such that for any such sequence of b_i, all finite sums belong to the chosen color. (Here density is often taken to be “piecewise syndetic”, but the proof is unchanged for any notion of density satisfying certain properties.) This theorem is an example of a combinatorial statement for which the only known proof requires the use of ultrafilters or a similar infinitary formalism. Here we give a direct combinatorial proof of the theorem.     

Student Quantifications as Meanings for Quantified Variables in Complex Mathematical Statements

This study investigates undergraduate students’ meanings for quantified variables in mathematical statements involving multiple quantifiers. Clinical interviews with nine undergraduate students were conducted to explore students’ meanings for quantified variables. More specifically, students were asked to interpret and evaluate the Intermediate Value Theorem (IVT) and three other statements with similar logical structure to the IVT. In this paper, we provide our definitions for a quantified variable and student quantification as theoretical constructs from a constructivist viewpoint. Using these theoretical constructs, we interpret our main results, five categories of students’ meanings for quantified variables, which emerged from our qualitative analysis. We also discuss how our findings of students’ various meanings for quantified variables contribute to literature on theories of meaning and address issues in curriculum and instruction.     

M.Riesz定理的注记

设u(z)是单位圆内的实值调和函数 ,若 p_平均Mp(r ,u) =12π∫2π0｜u(reiθ) ｜pdθ1 p <∞ ,则称u(z) ∈hp( 1

相似文献