弱(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     

基于BDF的无约束优化方法的收敛性分析

1.介 绍 在上个世纪的七十年代末、八十年代初,基于常微分方程的优化方法或者说同伦方法是一类与拟牛顿法和共轭梯度法等我们所熟知的优化方法相竞争的重要方法[1-6,8,13,14,16].由于这类方法只是简单地利用现成的数值求解常微分方程的软件包,如CVODE[7]、LSODE[12],对同伦方程(一般是一个常微分方程的初值问题)进行计算,除了一些特殊的病态问题     

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.     

Rank one perturbations at infinite coupling in Pontryagin spaces

In this paper we relate the operators in the operator representations of a generalized Nevanlinna function N(z) and of the function −N(z)⁻¹ under the assumption that z=∞ is the only (generalized) pole of nonpositive type. The results are applied to the Q-function for S and H and the Q-function for S and H^∞, where H is a self-adjoint operator in a Pontryagin space with a cyclic element w, H^∞ is the self-adjoint relation obtained from H and w via a rank one perturbation at infinite coupling, and S is the symmetric operator given by S=H∩H^∞.     

Controlling rough paths

We formulate indefinite integration with respect to an irregular function as an algebraic problem which has a unique solution under some analytic constraints. This allows us to define a good notion of integral with respect to irregular paths with Hölder exponent greater than 1/3 (e.g. samples of Brownian motion) and study the problem of the existence, uniqueness and continuity of solution of differential equations driven by such paths. We recover Young's theory of integration and the main results of Lyons’ theory of rough paths in Hölder topology.     

Multilinear interpolation between adjoint operators

Multilinear interpolation is a powerful tool used in obtaining strong-type boundedness for a variety of operators assuming only a finite set of restricted weak-type estimates. A typical situation occurs when one knows that a multilinear operator satisfies a weak L^q estimate for a single index q (which may be less than one) and that all the adjoints of the multilinear operator are of similar nature, and thus they also satisfy the same weak L^q estimate. Under this assumption, in this note we give a general multilinear interpolation theorem which allows one to obtain strong-type boundedness for the operator (and all of its adjoints) for a large set of exponents. The key point in the applications we discuss is that the interpolation theorem can handle the case q?1. When q>1, weak L^q has a predual, and such strong-type boundedness can be easily obtained by duality and multilinear interpolation (cf. Interpolation Spaces, An Introduction, Springer, New York, 1976; Math. Ann. 319 (2001) 151; in: Function Spaces and Applications (Lund, 1986), Lecture Notes in Mathematics, Vol. 1302, Springer, Berlin, New York, 1988; J. Amer. Math. Soc. 15 (2002) 469; Proc. Amer. Math. Soc. 21 (1969) 441).