一类康托型集合的子集的维数

设Ｅ为实直线上一康托型集, Ｅα＝ Ｅ ＋ α＝｛β＋α：β∈Ｅ｝;－１≤α≤ １．设 Ｇｐ＝｛β∈Ｅ－Ｅ： ｄｉｍＨ（Ｅα　 Ｅ）＝ｄｉｍＢ（Ｅα　 Ｅ）＝ｐｄｉｍＨ Ｅ）, ０＜ ｐ＜ １,此处Ｅ－Ｅ＝｛ｘ－ｙ：ｘ,ｙ　Ｅ｝．在一定的条件下,集合Ｅα　Ｅ与Ｇｐ的分形维数被确定．     

关于Fujita型反应扩散方程组的Cauchy问题

本文研究Ｆｕｊｉｔａ型反应扩散方程组ｕｔ－Δｕ＝α１｜ｕ｜ｑ１－１ｕ＋β１｜ｖ｜ｐ１－１ｖ，（ｘ∈ＲＮ，ｔ＞０），ｖｔ－Δｖ＝α２｜ｕ｜ｑ２－１ｕ＋β２｜ｖ｜ｐ２－１ｖ，ｕ（ｘ，０）＝ｕ０（ｘ）０，ｖ（ｘ，０）＝ｖ０（ｘ）０，（ｘ∈ＲＮ）Ｌｐ解的整体存在性和有限时间Ｂｌｏｗ ｕｐ问题．这里ｑｉ＞１，ｐｉ＞１（ｉ＝１，２），α１０，α２＞０，β１＞０，β２０，１ｐ＋∞．     

一类多目标非线性规划广义Lagrange对偶函数的几个性质

本文对多目标非线性规划问题（ＶＰ）：ｍｉｎｆ（ｘ）ｓ．ｔ．β（ｘ）∈－Ｐ，ｘ∈Ｃ引进了一种广义的Ｌａｇｒａｎｇｅ对偶函数Ｑ（ｗ）＝ｉｎｆ｛ｆ（ｘ）＋〈ｗ，β（ｘ）〉｜ｘ∈Ｃ｝，并讨论它的性质，得到了类似文献［１］中的结果．     

大次和1—坚韧图中的最长圈

给一个图Ｇ，定义σ３（Ｇ）＝ｍｉｎ｛Σ＾３ｉ＝１ｄ（ｖｉ）│｛ｖ１，ｖ２，ｖ３｝｝是Ｇ的无关集｝，ｐ３（Ｇ）＝ｍｉｎ｛│Ｕ＾３ｉ＝１Ｎ（ｖｉ）‖｛ｖ１，ｖ２，ｖ３｝是Ｇ中使│ｎ＾３ｉ＝１Ｎ（ｖｉ）│≠０｝的无关集｝。本文证明了：设Ｇ是ｎ阶１－坚韧图，如果σ３（Ｇ）≥ｎ，则Ｇ包含长度至少为ｍｉｎ｛ｎ，２ｐ３（Ｇ）＋４｝的圈，为个结果推广了若干已知结果，也解决了Ｂｒｏｅｒｓｍａ－Ｈｅｕｖｅｌ－Ｖｅｌｄ     

一类非线性椭圆方程组正解的存在性定理

本文考虑如下的椭圆方程组△ｙ＋ｆ（ｘ,ｕ）＋Эｕ＝０,ｘ∈Ω △ｕ＋ｕ－ｖ＝０,ｘ∈Ω ｕ＝ｖ＝０,ｘ∈ЭΩ 其中,Ω∈Ｒ＾Ｎ（Ｎ≥３）是带光滑边界的有界区域,ｆ（ｘ,ｕ）＝ｈ（ｘ）ｕ＾α＋ｕ＾β＋λｕ＾ｐ,ｈ（ｘ）∈Ｃ＾ｒ（Ω）（０〈ｒ〈１）,α,β,ｐ是正常数且０〈β〈α〈１〈ｐ〈（Ｎ＋２）／（Ｎ－２）,λ,δ是正参数,由临界点理论证明了该方程组至少存在二对正解。     

一类线性errors－in－variables模型的参数强相合估计及其a．s．收敛速度

本文讨论了如下一类线性ｅｒｒｏｒｓ－ｉｎ－ｖａｒｉａｂｌｅｓ模型——多元线性结构关系模型β′ｘｋ＋α＝０，ξｋ＝ｘｋ＋εｋ．｛ｋ＝１，２，…，ｎ．其中，｛ｘｋ：ｋ＝１，２，…，ｎ｝为一组ｉ．ｉ．ｄ．的ｍ维随机向量，｛εｋ：ｋ＝１，２，…，ｎ｝是ｉ．ｉ．ｄ．的随机误差，Ｅ（ε１）＝０，Ｖａｒ（ε１）＝σ２Ｉｍ．且｛ｘｋ：ｋ＝１，２，…，ｎ｝与｛εｋ：ｋ＝１，２，…，ｎ｝相互独立．在一些条件下，我们证明了估计量β，α，σ２的强相合性、唯一性，并给出了估计量的收敛速度为ｏ（ｎ－１－１ｑ），这里ｑ∈［１，２）．对于Ｅ（ｘ１）ｕ１和Ｖａｒ（ｘ１）Ｖｘ的估计也得出了同样的结果     

△(G)=3的外平面图的邻强边染色

对图Ｇ（Ｖ,Ｅ）,一正常ｋ－边染色ｆ称为Ｇ（Ｖ,Ｅ）的一邻强边染色,当且仅当对任意ｕｖ∈Ｅ（Ｇ）有ｆ［ｕ］≠ｆ［ｖ］．其中ｆ［ｕ］＝｛ｆ（ｕｗ）｜ｕｗ∈Ｅ（Ｇ）｝,ｆ（ｕｗ）表示染边ｕｗ的色,并称ｘａｓ（Ｇ）＝ｍｉｎ｛ｋ｜存在Ｃ的一ｋ种色的郁强边染色｝为Ｇ的邻强边色数．本文证明了对△（Ｇ）＝３的２－连通外平面图,有ｘａｓ（Ｇ）＝４．     

｛0,1,3｝问题摄动形式所对应的测度

给定实数λ,α以及Ｒ上（以λ,α为参数）的压缩自相似映射Ｓ１（ｘ）＝λｘ, Ｓ２（ｘ）＝ λｘ＋ａ, Ｓ３（ｘ）＝ λｘ＋３,记满足测度方程ｖ＝（１／３）∑ｉ＝１ｖｏＳｉ－１的唯一概率测度为ｕλ,α本文得到：（１）当固定 λ∈Ａ Ｅ（１／３, ２／５）时,则在 Ｌｅｂｅｓｇｕｅ测度意义下,对于 ａ．ｅ．的 ａ∈（０,１）,测度 ｕλ,α绝对连续,且存在平方可积密度．（２）若λ－１是 Ｐ．Ｖ．数,且 α是λ的有理系数多项式,则测度ｕλ,α是奇异测度．     

新题征展(3)

题组新编１．（１）设Ｍ＝｛ｘ｜ｆ（ｘ）＝０｝、Ｎ＝｛ｘ｜ｇ（ｘ）＝０｝,则｛ｘ｜ｆ（ｘ）·ｇ（ｘ）＝０｝为（　　）;（Ａ）Ｍ　（Ｂ）Ｎ　（Ｃ）Ｍ∪Ｎ　（Ｄ）以上都不对（２）设ｆ（ｘ）＝ｘ－１ｘ＋３,ｇ（ｘ）＝ｘ＋３ｘ－１,则集合｛ｘ｜ｆ（ｘ）·ｇ（ｘ）＝０｝＝　　;（３）设函数ｆ（ｘ）、ｇ（ｘ）的定义域依次是Ｆ、Ｇ,且Ｍ＝｛ｘ｜ｆ（ｘ）＝０｝、Ｎ＝｛ｘ｜ｇ（ｘ）＝０｝,则｛ｘ｜ｆ（ｘ）·ｇ（ｘ）＝０｝＝　　．２．（１）设ｍ、ｋ∈Ｎ,则Ｃｎｎ＋Ｃｎｎ＋１＋Ｃｎｎ＋２＋…＋Ｃｎｎ＋ｋ＝　　;（２）求…     

2-阶邻域连通无爪图的Hamilton性

设Ｇ是无爪图．对ｘ∈Ｖ（Ｇ），若Ｇ［Ｎ（ｘ）］不连通，则存在ｙｉ∈Ｖ（Ｇ）－｛ｘ｝（ｉ－１，２），使｜Ｎ（ｙｉ）∩Ｋｉ（ｘ）｜≥２，且｜Ｎ（ｙｉ）∩Ｎ（Ｋｉ＋１（ｘ））｛ｘ｝｜≥２（ｉ模２），那么称无爪图Ｇ是强２－阶邻域连通的，其中Ｋ１（ｘ），Ｋ２（ｘ）分别表示Ｇ［Ｎ（ｘ）］的两个分支．本文证明了：连通且强２－阶邻域连通的无爪图是Ｈａｍｉｌｔｏｎ图．     

A relative bound for independence

We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.     

Independence equivalence classes of paths

The independence equivalence class of a graph G is the set of graphs that have the same independence polynomial as G. A graph whose independence equivalence class contains only itself, up to isomorphism, is independence unique. Beaton, Brown and Cameron [2] showed that paths with an odd number of vertices are independence unique and raised the problem of finding the independence equivalence class of paths with an even number of vertices. The problem is completely solved in this paper.     

Independence equivalence classes of cycles

The independence equivalence class of a graph G is the set of graphs that have the same independence polynomial as G. Beaton, Brown and Cameron (2019) found the independence equivalence classes of even cycles, and raised the problem of finding the independence equivalence class of odd cycles. The problem is completely solved in this paper.     

A new test of independence for high-dimensional data

This paper proposes a new statistic to test independence of high-dimensional data. The simulation results suggest that the performance of the test based on our statistic is comparable to the existing ones, and under some circumstances it may have higher power. Therefore, the new statistic can be employed in practice as an alternative choice.     

A DESCRIPTION OF NORMAL SEMIGROUPS OF ENDOMORPHISMS OF PROPER INDEPENDENCE ALGEBRAS

Let A be a strong independence algebra of finite rank with at most one constant, and let G he the group of automorphisms of A. Let α be a singular endomorphism of α^G = 〈{α} U G〉. We describe the elements of α^G and give additional characterisations when A is a proper independence algebra and G is a periodic group.     

A lower bound on independence in terms of degrees

We prove a new lower bound on the independence number of a simple connected graph in terms of its degrees.     

A note on parallelism in affine geometry

The uniqueness of the parallel lines is independent from the analogous statement on parallel planes and the usual further axioms of three-dimensional affine geometry. MSC: 51A15, 03F65.     

A note on the edge cover number and independence number in hypergraphs

Consider a hypergraph of rank r>2 with m edges, independence number α and edge cover number ρ. We prove the inequality

     

A basic elementary extension of the Duchet-Meyniel theorem

The Conjecture of Hadwiger implies that the Hadwiger number h times the independence number α of a graph is at least the number of vertices n of the graph. In 1982 Duchet and Meyniel [P. Duchet, H. Meyniel, On Hadwiger’s number and the stability number, Ann. of Discrete Math. 13 (1982) 71-74] proved a weak version of the inequality, replacing the independence number α by 2α−1, that is,

(2α−1)⋅h≥n.