二分（0，mf—m＋1）-图的正交（0，f）-因子分解

设G=（X,Y,E（G））是一个二分图,分别用V（G）=X∪Y和E（G）表示G的顶点集和边集．设f是定义在V（G）上的整数值函数且对任意x∈V（G）有f（x）≥k．设H1,H2,…,Hk是G的k个顶点不相交的子图,且｜E（Hi）｜=m,1≤i≤k．本文证明了每个二分（0,mf—m＋1）．图G有一个（0,f）-因子分解正交于Hi（i=1,2,…,k）     

二分(0,mf-m+1)-图的正交(0,f)-因子分解

设G=(X,Y,E(G))是一个二分图,分别用V(G)=XUY和E(G)表示G的顶点集和边集.设f是定义在V(G)上的整数值函数且对(A)x∈V(G)有f(x)≥k.设H_1,H_2,…,H_k是G的k个顶点不相交的子图,且|E(H_i)|=m,1≤i≤k.本文证明了每个二分(0,mf-m+1)-图G有一个(0,f)-因子分解正交于Hi(i=1,2,…,k).     

极大3限制边连通二部图的充分条件

设G=(V,E)是一个连通图.称一个边集合S■E是一个k限制边割,如果G-S的每个连通分支至少有k个顶点.称G的所有k限制边割中所含边数最少的边割的基数为G的k限制边连通度,记为λ_k(G).定义ξ_k(G)=min{[X,■]:|X|=k,G[X]连通,■=V(G)\X}.称图G是极大k限制边连通的,如果λ_k(G)=ξ_k(G).本文给出了围长为g>6的极大3限制边连通二部图的充分条件.     

On algebraic automorphisms and their rational invariants

Let X be an affine irreducible variety over an algebraically closed field k of characteristic zero. Given an automorphism Φ, we denote by k(X)^Φ its field of invariants, i.e., the set of rational functions f on X such that f o Φ = f. Let n(Φ) be the transcendence degree of k(X)^Φ over k. In this paper we study the class of automorphisms Φ of X for which n(Φ) = dim X - 1. More precisely, we show that under some conditions on X, every such automorphism is of the form Φ = ϕ_g, where ϕ is an algebraic action of a linear algebraic group G of dimension 1 on X, and where g belongs to G. As an application, we determine the conjugacy classes of automorphisms of the plane for which n(Φ) = 1.     

Distinguished Representations for Quadratic Extensions

Let K be a quadratic extension of a field k which is either local field or a finite field. Let G be an algebraic group over k. The aim of the present paper is to understand when a representation of G(K) has a G(k) invariant linear form. We are able to accomplish this in the case when G is the group of invertible elements of a division algebra over k of odd index if k is a local field, and for general connected groups over finite fields.     

The Computation of Invariant Fields and a Constructive Version of a Theorem by Rosenlicht

Let G be an algebraic group acting on an irreducible variety X. We present an algorithm for computing the invariant field k(X)^G. Moreover, we give a constructive version of a theorem of Rosenlicht, which says that almost all orbits can be separated by rational invariants. More precisely, we give an algorithm for computing a nonempty open subset of X with a geometric quotient.     

Über die Glattheit von Quotientenabbildungen

Let G be a semisimple algebraic group acting on a factorial Gorenstein algebra S. Let X:=Spec S, Y:=Spec S^G and π:X→Y be the quotient map. The main results are:

1. Let x be a smooth point of X whose orbit has maximal dimension and such that π(x) is a smooth point of Y. Then π is smooth at x.
2. Let S be positively graded and let χ_S(t) be its generating function which is a rational function. Then: deg χ_S≦deg \(X_{S^G } \) .

     

Tate-Shafarevich products in elliptic curves over pseudolocal fields with residue fields of characteristic 3

Let k be a general local field with pseudolocal residue field x, char x=3, and A an elliptic curve defined over k. It is proved that the Tate-Shafarevich product H¹(k, A)×A_k Q/ of the group H¹(k, A) of principal homogeneous spaces of the curve A over k and the group A_k of its k-rational points is left nondegenerate.Translated from Ukrayins'kyy Matematychnyy Zhurnal, Vol. 44, No. 9, pp. 1157–1165, September, 1992.     

广义共同逼近问题的适定性

设C是实Banach空间X中有界闭凸子集且0是C的内点，G是X中非空闭的有界相对弱紧子集.记K(X)为X的非空紧凸子集全体并赋Hausdorff距离，KG(X)为集合｛A∈K(X)；A∩G=｝的闭包.称广义共同逼近问题minC(A,G)是适定的是指它有唯一解(x0,z0)，且它的每个极小化序列均强收敛到(x0,z0).在C是严格凸和Kadec的假定下，证明了｛A∈K(X)；minC(A，G)是适定的｝含有KG(X)中稠Gδ子集，这本质地推广和延拓了包括De Blasi,Myjak and Papini［1］、Li［2］和De Blasi and Myjak［3］等人在内的近期相应结果.     

星扇轮联图的邻点可约边染色

对简单图G(V,E),若存在自然数κ(1≤κ≤Δ(G))和映射f:E(G)→{1,2,…,κ}使得对任意相邻两点u,v∈V(G),uv∈E(G),当d(u)=d(v)时,有C(u)=C(u),则f为G的κ-邻点可约边染色(简记为κ-AVREC of G),而x′_(aur)(G)=max{κ|κ-AVREC of G}称为G的邻点可约边染色数.其中C(u)={f(uv)|uv∈E(G)}.证明了联图在若干情况下的邻点可约边染色定理,得到了S_n+S_n,F_n+F_n,W_n+W_n,S_n+F_n,S_n+W_n和F_n+W_n的邻点可约边色数.     

Strong Approximation for a Toric Variety

Let X be a toric variety over a number field k with k[X]~×=k~×.Let W ■ X be a closed subset of codimension at least 2.We prove that X \ W satisfies strong approximation with algebraic Brauer-Manin obstruction.     

Fixed Points of Mappings Satisfying a Weakly Contractive Type Condition

In this paper, we discuss a fixed point theorem for mappings derived by a pair of mappings satisfying weak(k, k/) contractive type condition on the tensor product spaces. Let X and Y be Banach spaces and T_1 : X γ Y → X and T_2: X γ Y → Y be two operators which satisfy weak(k, k/) contractive type condition. Using T_1 and T_2, we construct an operator T on X γ Y and show that T has a unique fixed point in a closed and bounded subset of X γ Y.We derive an iteration scheme converging to this unique fixed point of T. Conversely, using a weakly contractive mapping T, we construct a pair of mappings(T_1, T_2) satisfying weak(k, k/)contractive type condition on X γ Y and from this pair, we also obtain two self mappings S_1 and S_2 on X and Y respectively with unique fixed points.     

图中相互独立的4圈和含4个点的路

设k是一个正整数，G是一个顶点数为|G|=4k的图. 假设σ\-2(G)≥4k-1, 则G有一个支撑子图含k-1个4圈和一条顶点数为4的路，使得所有这些圈和路都是相互独立的. 设G=(V\-1,V \-2;E)是一个二分图使得|V\-1|=|V\-2|=2k. 如果对G中每一对满足x∈V\-1和y∈V\-2的不 相邻的顶点x和y 都有d(x)+d(y)≥2k+1, 则G包含k-1个相互独立的4圈和一条顶点数为4的路，使得所有这些圈和路都是相互独立的，并且此度条件是最好的.     

The Rainbow Vertex-disconnection in Graphs

Let G be a nontrivial connected and vertex-colored graph. A subset X of the vertex set of G is called rainbow if any two vertices in X have distinct colors. The graph G is called rainbow vertex-disconnected if for any two vertices x and y of G, there exists a vertex subset S of G such that when x and y are nonadjacent, S is rainbow and x and y belong to different components of G-S; whereas when x and y are adjacent, S + x or S + y is rainbow and x and y belong to different components of(G-xy)-S. For a connected graph G, the rainbow vertex-disconnection number of G, denoted by rvd(G), is the minimum number of colors that are needed to make G rainbow vertexdisconnected. In this paper, we characterize all graphs of order n with rainbow vertex-disconnection number k for k ∈ {1, 2, n}, and determine the rainbow vertex-disconnection numbers of some special graphs. Moreover, we study the extremal problems on the number of edges of a connected graph G with order n and rvd(G) = k for given integers k and n with 1 ≤ k ≤ n.     

Characterization of L2(16) by Τe(L2(16))

Let G be a group and πe(G) the set of element orders of G.Let k∈πe(G) and m k be the number of elements of order k in G.Letτe(G)={mk|k∈πe(G)}.In this paper,we prove that L2(16) is recognizable byτe (L2(16)).In other words,we prove that if G is a group such that τe(G)=τe(L2(16))={1,255,272,544,1088,1920},then G is isomorphic to L2(16).     

The quasi-isometry classification of rank one lattices

Let X be a symmetric space—other than the hyperbolic plane—of strictly negative sectional curvature. Let G be the isometry group of X. We show that any quasi-isometry between non-uniform lattices in G is equivalent to (the restriction of) a group element of G which commensurates one lattice to the other. This result has the following corollaries:

1. Two non-uniform lattices in G are quasi-isometric if and only if they are commensurable.
2. Let Γ be a finitely generated group which is quasi-isometric to a non-uniform lattice in G. Then Γ is a finite extension of a non-uniform lattice in G.
3. A non-uniform lattice in G is arithmetic if and only if it has infinite index in its quasi-isometry group.

     

An existence theory for loopy graph decompositions

Let v≥k≥1 and λ≥0 be integers. Recall that a (v, k, λ) block design is a collection ??of k‐subsets of a v‐set X in which every unordered pair of elements in X is contained in exactly λ of the subsets in ??. Now let G be a graph with no multiple edges. A (v, G, λ) graph design is a collection ??of subgraphs, each isomoprhic to G, of the complete graph K_v such that each edge of K_v appears in exactly λof the subgraphs in ??. A famous result of Wilson states that for a fixed simple graph G and integer λ, there exists a (v, G, λ) graph design for all sufficiently large integers v satisfying certain necessary conditions. Here, we extend this result to include the case of loops in G. As a consequence, we obtain the asymptotic existence of equireplicate graph designs. Applications of the equireplicate condition are given. Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 19:280‐289, 2011     

点可迁图中的正则因子

设图G是一个K-正则连通点可迁图.如果G不是极大限制性边连通的,那么G含有一个(k-1)-因子,它的所有分支都同构于同一个阶价于k和2k-3之间的点可迁图.此结果在某种程度上加强了Watkins的相应命题:如果k正则点可迁图G不是k连通的,那么G有一个因子,它的每一个分支都同构于同一个点可迁图.     

一类随机徘徊的等待时间

以一种随机徘徊为例,说明由独立增量点过程的等待时间生成的两类随机量——点间间距、给定时刻前后两次事件出现的时间差——之间的关系.