拟Kirkman系的渐近存在性

我们在本文中证明,对任意给定的正整数k≥2,都存在常数v₀=v₀(k),使当v≥v₀时,拟Kirkman系NKS(2,k;v)存在的必要条件v≡0(mod k(k-1))也是充分的。从而解决了拟Kirkman系的渐近存在性问题。     

Banach空间中强增生算子的非线性方程的解的迭代构造

本文研究ｐ一致光滑Ｂａｎａｃｈ空间Ｘ中Ｉｓｈｉｋａｗａ迭代法．受Ｄｅｎｇ与Ｔａｎ，Ｘｕ的启发，证明了，当Ｔ是从Ｘ到自身的Ｌｉｐｓｃｈｉｔｚ强增生算子时，Ｉｓｈｉｋａｗａ迭代法强收敛到方程Ｔｘ＝ｆ的唯一解；当Ｔ是从Ｘ的有界闭凸子集到自身的Ｌｉｐｓｃｈｉｔｚ严格伪压缩映象时，Ｉｓｈｉｋａｗａ迭代法强收敛到Ｔ的唯一不动点．通过去掉限制ｌｉｍ_ｎ→∞β_ｎ＝０或ｌｉｍ_ｎ→∞α_ｎ＝ｌｉｍ_ｎ→∞β_ｎ＝０，结果改进与推广了Ｔａｎ，Ｘｕ的定理４．１与定理４．２，也把Ｄｅｎｇ的定理１与定理２推广到了ｐ一致光滑Ｂａｎａｃｈ空间的背景．     

特殊半鞅的可料表示性

设X为一(■_t)特殊半鞅,X=A+M为其典则分解.称X有可料表示性,如果一切零初值(■_t)局部鞅可表为一可料过程对M的随机积分.本文刻划了一类特殊半鞅的可料表示性(定理1.3及2.2);推广了Yoeurp-Yor定理(定理4.4).作为这些结果的应用,文中给出了Fujisaki-Kallianpur-Kunita定理的一个新证明(定理5.3).     

可交换随机变量序列的随机极限定理

本文讨论了可交换随机变量序列{X_n:n≥1}的极限定理,得到了可交换随机变量序列的随机强大数律及加权和定理,并推广了文[4]中的结果.     

关于DQrC-环

本文引进了DQ_rC-环.给出了DQ_rC-环的K?the根等于它的所有质理想交;右Noether DQ_rC-环每个理想皆可分解为有限个不可缩短右准质理想交，在稍强条件下，给出了Krull交定理在右Nocther DQ_rC-环上的推广.     

两个模糊子半群集合之间的同态

设S,T是半群,F(S)和F_s(S)分别表示S的所有模糊子集的集合和所有模糊子半群的集合。文中,讨论了F(S)(F_s(S))和F(T)(F_s(T))之间的模糊同态,建立了模糊商子半群的概念,把分明半群的基本同态定理推广到模糊子半群。     

某些K2OF的结构

本文研究二次数域F=Q(d^1/2)的K₂O_F结构,其中d≡-3mod9和d≠-3.找到了关于F=Q((-21)^1/2)的K₂O_F的3阶元和F=Q((15)^1/2)的K₂O_F的生成元.推广了Bass和Tate的一个定理和给出了F=Q((29)^1/2)的K₂O_F的结构以及sL_n(O_F)(n≥3)的表示关系.     

Whitney 引理的推广及应用

Ｃ^∞函数芽的局部奇点理论中，Ｗｈｉｔｎｅｙ引理是一个很重要的定理．本文将证明该定理的整体结论．基于这一推广，详细地讨论了一类材料的塑性屈服准则．发现，对于这类材料，塑性屈服准则最一般的形式应是：g(J₁,J′₂,J′₃²)=0．最后举例加以说明     

具有两个射线分布值的亚纯函数

本文目的是把Edrei和Kimura中的结论进行推广,即指出即使除去极点的射线分布的假设,他们的结论仍然成立。我们主要定理是: 定理1 设f(z)是亚纯的且使两方程 f(z)=0 (1) f^(s)(z)=1 (s≥1) (2)的根至多除去有限个外都位于射线组arg z=ω_k(k=1,2,…,q;q≥1;0≤ω₁<ω₂<…<ω_q<2π)。设ρ(f)表示f(z)的级且β=max{π/(ω_2<     

Ch空间与具无限时滞的泛函微分方程解的有界性及周期解

本文主要讨论具无限时滞的泛函微分方程的周期解的存在性.为此,我们首先研究了解的C_h—Rⁿ一致有界性及C_h—Rⁿ一致最终有界性,并将Yoshizawa关于有限时滞方程的周期解存在定理推广到无限时滞方程上来.对于具无限时滞的Volterra积分微分方程,我们得到了保证周期解存在的具体的条件.     

A note on the arboricity of graphs

The well known theorem of Nash-Williams determines the graphs that are union ofk edge disjoint forests. The main result presented in this note is that any graph which is the union ofk edge disjoint forests is in fact a union ofk such forests in which if a vertex has degree at least 3 in one of the forests then its degree is positive in all the other forests. We also discuss consequences of this result with respect to the arboricity of regular graphs.     

Classical proof forestry

Classical proof forests are a proof formalism for first-order classical logic based on Herbrand’s Theorem and backtracking games in the style of Coquand. First described by Miller in a cut-free setting as an economical representation of first-order and higher-order classical proof, defining features of the forests are a strict focus on witnessing terms for quantifiers and the absence of inessential structure, or ‘bureaucracy’.This paper presents classical proof forests as a graphical proof formalism and investigates the possibility of composing forests by cut-elimination. Cut-reduction steps take the form of a local rewrite relation that arises from the structure of the forests in a natural way. Yet reductions, which are significantly different from those of the sequent calculus, are combinatorially intricate and do not exclude the possibility of infinite reduction traces, of which an example is given.Cut-elimination, in the form of a weak normalisation theorem, is obtained using a modified version of the rewrite relation inspired by the game-theoretic interpretation of the forests. It is conjectured that the modified reduction relation is, in fact, strongly normalising.     

森林可持续发展的模糊化模型

本文从不同树种、不同时间、空间的分布出发,应用模糊聚类分区模型先对样本进行分类,以便确定有关参数。然后运用动态规划方法讨论森林可持续发展问题,建立了森林自然长模型和在森林可持续发展条件下的优化开发模型,给出了相应的迭代公式,选用夏冈-夏蜡梅群落进行模拟计算,结果表明,经过一段时间的自然发展,森林群落可达到稳定态,夏蜡梅群落必将过度到青冈-夏蜡梅稳定群落,且总体稳定,与文献[3][4]一致模糊。     

Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs

A forest is the clique complex of a strongly chordal graph and a quasi-forest is the clique complex of a chordal graph. Kruskal-Katona type theorems for forests, quasi-forests, pure forests and pure quasi-forests will be presented.     

A Counting Formula for Labeled, Rooted Forests

Given a power series, the coefficients of the formal inverse may be expressed as polynomials in the coefficients of the original series. Further, these polynomials may be parameterized by certain ordered, labeled forests. There is a known formula for the formal inverse, which indirectly counts these classes of forests, developed in a non-direct manner. Here, we provide a constructive proof for this counting formula that explains why it gives the correct count. Specifically, we develop algorithms for building the forests, enabling us to count them in a direct manner.     

A Hopf Operad of Forests of Binary Trees and Related Finite-Dimensional Algebras

The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees. An explicit formula for the coproduct and its dual product is given, using a poset on forests.     

Prediction of extremal precipitation by quantile regression forests: from SNU Multiscale Team

This paper considers the problem of spatio-temporal extreme value prediction of precipitation data. This work presents some methods that predict monthly extremes over the next 20 years corresponding to 0.998 quantile at several stations over a certain region. The proposed methods are based on a novel combination of quantile regression forests and circular transformation. As the core of the methodology, quantile regression forests by combining many decorrelated bootstrapping trees may improve prediction performance, and circular transformation is used for building circular transformed predictors of months, which are put into the quantile regression forests model for prediction. The empirical performance of the proposed methods are evaluated through real data analysis, which demonstrates promising results of the proposed approaches.     

Covering projective planar graphs with three forests

It is known that all planar graphs and all projective planar graphs have an edge partition into three forests. Gonçalves proved that every planar graph has an edge partition into three forests, one having maximum degree at most four [5]. In this paper, we prove that every projective planar graph has an edge partition into three forests, one having maximum degree at most four.     

Bilabelled increasing trees and hook-length formulae

We introduce two different kinds of increasing bilabellings of trees, for which we provide enumeration formulae. One of the bilabelled tree families considered is enumerated by the reduced tangent numbers and is in bijection with a tree family introduced by Poupard [11]. Both increasing bilabellings naturally lead to hook-length formulae for trees and forests; in particular, one construction gives a combinatorial interpretation of a formula for labelled unordered forests obtained recently by Chen et al. [1].     

The acircuitic directed star arboricity of subcubic graphs is at most four

A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented graph G (that is a digraph with no opposite arcs) is the minimum number of arc-disjoint directed star forests whose union covers all arcs of G and such that the union of any two such forests is acircuitic. We show that every subcubic graph has acircuitic directed star arboricity at most four.