K(o)the-Bochner空间的凸性

本文利用K(o)the函数空间的性质以及K(o)the函数空间与K(o)the-Bochner空间的关系,讨论了K(o)the-Bochner空间E(X)的凸性,主要结果如下:(a)给出E(X)的端点的充分条件,得到了E(X)严格凸的判据,相应地推广了Lp(μ,X)以及LΦ(X)的结果;(b)讨论了E(X)的弱局部一致凸和局部完全k-凸;(c)刻画了E(X)的强凸,给出了E(X)强凸的充要条件.     

Fibrations of bigroupoids

Using Brown's construction (J. Algebra 15 (1970) 103) of an exact 6-term sequence for a fibration of groupoids we show how an exact 9-term sequence can be associated to a fibration of bigroupoids. Applications to topology and algebra are given.     

研究K4-同胚图K4(α,1,1,δ,ε,η)色性的一个引理

主要介绍了一个引理，这个引理奠定了K4－同胚图K4（α，1，1，δ，ε，η）色性研究的基础。     

弱(L_1,L_2)-BLD映射的正则性

本文首先将文［１］中的ＢＬＤ映射推广为弱（Ｌ１，Ｌ２）－ＢＬＤ映射，并证明了如下正则性结果：存在两个可积指数 Ｐ１＝Ｐ１（ｎ，Ｌ１，Ｌ２）＜ｎ＜ｑ１＝ｑ１（ｎ，Ｌ１，Ｌ２），使得对任意弱（Ｌ１，Ｌ２）－ＢＬＤ映射ｆ∈（Ω，Ｒｎ），都有ｆ∈（Ω，Ｒｎ），即ｆ为（Ｌ１，Ｌ２）－ＢＬＤ映射．     

Unavoidable Traces Of Set Systems

Sauer, Shelah, Vapnik and Chervonenkis proved that if a set system on n vertices contains many sets, then the set system has full trace on a large set. Although the restriction on the size of the groundset cannot be lifted, Frankl and Pach found a trace structure that is guaranteed to occur in uniform set systems even if we do not bound the size of the groundset. In this note we shall give three sequences of structures such that every set system consisting of sufficiently many sets contains at least one of these structures with many sets.     

Higher Order Peak Algebras

Using the theory of noncommutative symmetric functions, we introduce the higher order peak algebras (Sym(N))_N≥1, a sequence of graded Hopf algebras which contain the descent algebra and the usual peak algebra as initial cases (N=1 and N=2). We compute their Hilbert series, introduce and study several combinatorial bases, and establish various algebraic identities related to the multisection of formal power series with noncommutative coefficients. Received November 19, 2004     

On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance

The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004     

From a Nonlinear, Nonconvex Variational Problem to a Linear, Convex Formulation

   Abstract. We propose a general approach to deal with nonlinear, nonconvex variational problems based on a reformulation of the problem resulting in an optimization problem with linear cost functional and convex constraints. As a first step we explicitly explore these ideas to some one-dimensional variational problems and obtain specific conclusions of an analytical and numerical nature.     

Model spectral function and superconductivity in BaxK1−xBiO3 (x=0.5-0.7)

The Eliashberg spectral density function is constructed for the superconducting compound Ba_xK_1−xBiO₃ with x=0.5, 0.6, 0.7. The functions, besides yielding some prominent structures, show widely spreading spectra that inhibit lattice instability by yielding not too large values of λ(<1.32). The resulting spectral functions show similar shape as other results, where available, and also successfully reproduce the observed critical temperature, isotope exponent, gap ratio and several other parameters.