QK空间的插值序列

本文研究了Q_K空间的插值问题.利用复分析和调和分析的方法,获得了单位圆盘上的一个序列{z_n}是Q_K∩H^∞空间的插值序列的一个充分必要条件,推广了Q_p空间的部分结果.     

(α,β)-γ开集与(α,β)-γ-Ti空间

本文首先给出(α,β)-γ开集定义,获得了(α,β)-γ开集性质;然后引入了(α,β)-γ-T_i空间和(α,β)-γ-T_i^*空间概念(i=0,1/2,1,2,5/2),并得到它们更广泛的拓扑性质.     

格的TL-模糊理想

本文研究了格的TL-模糊理想. 利用生成TL-模糊理想, 证明了一个模格的全体T_M-模糊理想形成一个完备的模格. 此外, 利用L-模糊集的投影和截影, 获得了将直积格的TL-模糊理想表示成分量格的TL-模糊理想的L-直积的一个充分必要条件. 所得结果进一步推广和发展了格的模糊理想的理论.     

环Fp+vFp上互补对偶常循环码

本文研究了环F_p+vF_p上互补对偶（1-2v）-常循环码.利用环F_p+vF_p上（1-2v）-常循环码的分解式C=vC_1-v ⊕（1-v）C_v,得到了环F_p+vF_p上互补对偶（1-2v）-常循环码的生成多项式.然后借助从F_p+vF_p到F_p²的Gray映射,证明了环F_p+vF_p上互补对偶（1-2v）-常循环码的Gray像是F_p的互补对偶循环码.     

辫子T-范畴的构造

本文首先引入了一类新的范畴_AYD_G^H, 这个范畴是一簇范畴{_AYD^H(α,β)}_(α,β)∈G的非交并, 获得了范畴{_AYD^H(α,β)}_(α,β)∈G是一个辫子T-范畴当且仅当(A,H,Q)是一个G-偶结构, 推广了2005年Panaite和Staic的主要结论. 最后, 当H是有限维时, 构造了一个拟三角T-余代数{A#H^*(α,β)}_(α,β)∈G, 它的表示范畴与{_AYD^H(α,β)}_(α,β)∈G是同构的.     

与拉回度量相关泛函的f-稳态映射的刘维尔型定理

本文研究了与拉回度量相关的广义泛函Φ_f.利用f-应力能力张量的方法,得到f-稳态映射的单调公式,消灭定理以及常Dirichlet边值问题在星型区域上的唯一常值解.     

具有左中心幂等元的U-富足半群

本文研究了具有左中心幂等元的U-富足半群的半格分解.利用半格分解,证明了半群S为具有左中心幂等元的U-富足半群,当且仅当S为直积M_α×Λ_α的强半格,其中M_α是幂幺半群,Λ_α是右零带.这一结果为具有左中心幂等元的U-富足半群结构的建立奠定了基础.     

离散时间观测下的α-赋权分数桥的参数估计

本文研究了赋权分数桥dX_t=-α(X_t)/(T-t)dt+dB_t^a,b,0≤t < T,中未知参数α>0的参数估计问题,其中B^a,b是参数为a>-1,|b|<1,|b|≤a+1的赋权分数布朗运动.假设对随机过程X_t进行离散观测t_i=i△_n,i=0,…,n,且T_n=n△_n.本文构造了α的最小二乘估计α_n,证明了当n→∞时,α_n依概率收敛到α.     

关于p-可除kG-模的一些结论

本文研究了p-可除kG-模,这是一类由群阶的素数因子来控制的模类.利用Heller算子,证明了n次Heller算子置换非投射不可分解p-可除kG-模的同类;利用模的诱导和限制方法,证明了若H是G的强p-嵌入子群,则Green对应建立了不可分解p-可除kG-模的同构类与不可分解p-可除kH-模的同构类之间的一一对应.推广了不可分解相对投射kG-模上的Green对应.     

在险值与Lp-空间上的连续一致风险度量

本文研究了在险值和L^p-空间上的连续一致风险度量之间的关系.利用凸集分离定理和截尾逼近方法,获得了在险值可以用L^p-空间上的连续一致风险度量表示的结果,并且得到了L^p-空间上的表示定理的一种新的证明方法.它们分别是文献[2]的相关结论从L^∞-空间到L^p-空间上的推广和对Inoue^[4]做的一些补充证明.     

The decomposition of Kv into K2×K5''''s

The decomposition of the complete graph Kv into Kr×Kc's, the products of Kr and Kc,is originated from the use of DNA library screening. In this paper, we consider the case where r=2 and c = 5, and show that such a decomposition exists if and only if v ≡ 1 (mod 25).     

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.     

On potentially K 5-H-graphic sequences

Let K _m -H be the graph obtained from K _m by removing the edges set E(H) of H where H is a subgraph of K _m . In this paper, we characterize the potentially K ₅-P ₄ and K ₅-Y ₄-graphic sequences where Y ₄ is a tree on 5 vertices and 3 leaves. Research was supported by NNSF of China (10271105) and by NSF of Fujian (Z0511034), Fujian Provincial Training Foundation for “Bai-Quan-Wan Talents Engineering”, Project of Fujian Education Department, Project of Zhangzhou Teachers College and by NSERC.     

Kp,q-factorization of complete bipartite graphs

Let K _m,nbe a complete bipartite graph with two partite sets having m and n vertices, respectively. A K _p,q-factorization of K _m,n is a set of edge-disjoint K _p,q-factors of K _m,n which partition the set of edges of K _m,n. When p = 1 and q is a prime number, Wang, in his paper “On K _1,k -factorizations of a complete bipartite graph” (Discrete Math, 1994, 126: 359—364), investigated the K _1,q -factorization of K _m,nand gave a sufficient condition for such a factorization to exist. In the paper “K _1,k -factorizations of complete bipartite graphs” (Discrete Math, 2002, 259: 301—306), Du and Wang extended Wang’s result to the case that q is any positive integer. In this paper, we give a sufficient condition for K _m,n to have a K _p,q-factorization. As a special case, it is shown that the Martin’s BAC conjecture is true when p : q = k : (k+ 1) for any positive integer k.     

The weight twoK-theory of fields

We verify the weight-two portion of the Quillen-Lichtenbaum conjectures, relating the modn weight-twoK-groups of a field with the appropriate étale cohomology groups. This extends the work of Merkurjev and Suslin onK ₂ of a field, and the works of Suslin and the author on the indecomposableK ₃ of a field.Partially supported by the NSF.     

The Smallest Degree Sum That Yields Potentially Kr＋1 - K3-Graphic Sequences

Let a（Kr,＋1 - K3,n） be the smallest even integer such that each n-term graphic sequence п= （d1,d2,…dn） with term sum σ（п） = d1 ＋ d2 ＋…＋ dn 〉 σ（Kr＋1 -K3,n） has a realization containing Kr＋1 - K3 as a subgraph, where Kr＋1 -K3 is a graph obtained from a complete graph Kr＋1 by deleting three edges which form a triangle. In this paper, we determine the value σ（Kr＋1 - K3,n） for r ≥ 3 and n ≥ 3r＋ 5.     

ComplexK-theory ofBSL3(Z)

ComplexK-theory ofBSL₃(Z) andBSt₃(Z) are computed. We first study a Brown-Peterson (BP) version of Soulé's arguments. Then we consider complexK-theory by using a Conner-Floyd type theorem.     

Nondurable K-Theory Equivalence and Bousfield Localization*

In this paper we consider what happens when Adams self maps are modified by adding certain unstable maps. The unstable maps which are added are trivial after a single suspension. We can choose the modification so that the maps are still K-theory equivalences but the loops on the map are no longer K-theory equivalences. As a corollary we note that the maps are K-theory equivalences but not v ₁-periodic equivalences. Another consequence is the behavior of the cobar spectral sequences for generalized homology theories. Tamaki shows that in certain cases a cobar-type spectral sequence for generalized homology theories is well behaved. The maps we construct give an example where despite the connectivity of the spaces the cobar spectral sequence is still poorly behaved. Finally we use our maps to construct spaces whose Bousfield class is distinct from the cofiber of the Adams map but which becomes the same after one suspension.     

Planar graphs without specific cycles are 2-degenerate

A graph G is k-degenerate if each subgraph of G has a vertex of degree at most k. It is known that every simple planar graph with girth 6, or equivalently without 3-, 4-, and 5-cycles, is 2-degenerate. In this work, we investigate for which k every planar graph without 4-, 6-, … , and 2k-cycles is 2-degenerate. We determine that k is 5 and the result is tight since the truncated dodecahedral graph is a 3-regular planar graph without 4-, 6-, and 8-cycles. As a related result, we also show that every planar graph without 4-, 6-, 9-, and 10-cycles is 2-degenerate.     

K3 et formules de Riemann-Hurwitzp-adiques

The well-known formula of Riemann-Hurwitz gives the change of genuses in ann-fold covering of compact connected Riemann surfaces. In Iwasawa theory, there existp-adic analogues which give the change of certain ^±-invariants in ap-extension ofCM number fields. Using functorial and arithmetical properties ofK ₃, we extend such Riemann-Hurwitzp-adic formulas to non-CM fields, assuming some restrictive hypotheses on the capitulation ofK ₂.