测度空间上的gλ测度与条件gλ测度

本文在测度空间（Ｘ，μ）上引入了一类μ─密度函数ｆ所生成的ｇλ测度及条件ｇλ测度，并给出了与μ─密度函数ｆ相关的λ独立性的概念，得到了一些有关的结果     

关于可拓测度的研究

以一新的形式给出可拓测度及 Pλ(· )可拓测度的概念 ,并研究它的性质     

Banach空间上集值测度与模糊数测度的扩张

在Banach空间上,给出集值测度的扩张定理并借助集测度的扩张给出了模糊数测度的扩张定理。     

向量值测度产生的集值测度及性质

由有界变差向量值测度的值域,通过取凸包和闭包,构造了L[0,1],L2[0,1]和C[0,1]空间上的有界变差紧凸集值测度,结果由欧氏空间推广到函数空间.     

满Lebesgue测度的D_λ-攀援集

对任意实数λ∈[0,1],在区间[0,1]上构造一个连续自映射,使得它有一个由传递点构成的且Lebesgue测度为1的D_λ-攀援集.这加强了分布混沌的相应结论.     

可数无限维概率乘积测度空间的Loeb空间

Let {(Xi, Si, μi) : i ℃ N} be a sequence of probability measure spaces and (*Xi, L(*Si), L(*μi)) be the Loeb measure space with respect to (Xi, Si, μi) for i ℃ N. Let X =× Xi, S = ×Si,μ = ×μi. We prove that × L(*Si) CL(*S) and in embedding meaning.     

关于测度扩张的若干结论

设Ｘ是任意集合，Ｐ是Ｘ上的集族，空集是Ｐ上的非负广义实值函数且本文讨论了由测度空间（Ｘ．Ｐ，μ）进行外测度扩张所得到的测度空间（Ｘ．Ｓ．μ）．再进行外测度扩张的问题．得到了测度扩张的若干结论。     

符号空间有限型子转移混沌集的Hausdorff测度与Parry测度

设A是一个每列至少有二个元素为1的不可约0，1方阵，(∑4，σA)为由A所决定的符号空间有限型子转移．在∑A上定义一个与其拓扑相容的度量d使得(∑A，d)的Hausdorff维数为1．若G是H^-可测的σA的Li—Yorke混沌集，则H^1(C)＝0；若A是本原的，则存在一个σA的有限型混沌集S使得H^1(S)＝1，其中H^1为1-维的Hausdorff测度．     

集值测度的结构（Ⅰ）

本文引入集值测度的可比较概念，由此给出了由一族有界集值测度生成新的集值测度的方法。     

集值测度的收敛性及其与Castaing向量表示中测度的收敛性之间的关系

本文研究了集值测度的收敛性. 利用极限理论的方法,在X有RNP,且M(∪)s-lim inf_(n→∞) M_n条件下,获得了集值测度的收敛性与其 Castaing表示中向量测度收敛性的关系,建立了集值测度列与集值测度选择列的收敛性,从而对进一步研究集值测度的一些件质提供了理论依据.     

Three Conjectures on Shepard Interpolatory Operators

After establishing direct and converse approximation theorems for the Shepard interpolatory operators, J. Szabados (Approx. Theory Appl.7, No. 3, 1991, 63–76) left some open saturation problems (“the most intriguing questions” as he said), which he raised as three conjectures. The present paper proves the second parts of some conjectures, but constructs counterexamples to show that the first parts of three conjectures are not true. The constructive procedure uses some novel ideas and techniques.     

Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs

Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight 1. Strongly equistable graphs are graphs such that for every and every nonempty subset T of vertices that is not a maximal stable set, there exist positive vertex weights assigning weight 1 to every maximal stable set such that the total weight of T does not equal c . General partition graphs are the intersection graphs of set systems over a finite ground set U such that every maximal stable set of the graph corresponds to a partition of U . General partition graphs are exactly the graphs every edge of which is contained in a strong clique. In 1994, Mahadev, Peled, and Sun proved that every strongly equistable graph is equistable, and conjectured that the converse holds as well. In 2009, Orlin proved that every general partition graph is equistable, and conjectured that the converse holds as well. Orlin's conjecture, if true, would imply the conjecture due to Mahadev, Peled, and Sun. An “intermediate” conjecture, posed by Miklavi? and Milani? in 2011, states that every equistable graph has a strong clique. The above conjectures have been verified for several graph classes. We introduce the notion of equistarable graphs and based on it construct counterexamples to all three conjectures within the class of complements of line graphs of triangle‐free graphs. We also show that not all strongly equistable graphs are general partition.     

Curran两个猜想的证明

本文证明：（１）Ｃｕｒｒａ的两个猜想；（２）ｐ^７阶非循环群是ＬＡ群．     

The Iwasawa Main Conjectures for GL2

We prove the one-, two-, and three-variable Iwasawa-Greenberg Main Conjectures for a large class of modular forms that are ordinary with respect to an odd prime p. The method of proof involves an analysis of an Eisenstein ideal for ordinary Hida families for GU(2,2).     

Conjectures on GCn sets

The paper gives a generalization of the counterexample of C. de Boor on ? ^d and provides an example of GC ₂ set in ?⁴ with three maximal hyperplanes. Also, a conjecture on the number of maximal lines of GC _n sets in ? ^d is discussed and proved that it is true in the case when n = 2, d = 3.     

Conjectures on the dilogarithm

The paper expresses Bloch's dilogarithm D(z) in terms of Clausen's function Cl₂(t). Using Lichtenbaum's conjecture on #K ₂ O _F for quadratic imaginary fields F, we get more than 50 conjectural linear relations between the values of Cl₂(t). We cannot prove most of them.     

On Two Conjectures of Steinhaus

We disprove two conjectures of H. Steinhaus by showing that: (1) there is a convex surface S such that for any point x on S and any point y in the set F _x of farthest points from x, there are at most two segments from x to y; (2) the properties and do not characterize the sphere.