Solvable <Emphasis Type="Italic">D</Emphasis><Subscript>2</Subscript>-groups

Let G be a finite group, Irr¹(G) be the set of nonlinear irreducible characters of G and cd¹(G) the set of degrees of the characters in Irr¹(G). A group G is said to be a D₂-group if|cd¹(G)|=|Irr¹(G)|-2. In this paper, we give a complete classification of solvable D₂-groups.     

Solvable D_2-Groups

Let G be a finite group, Irr_1(G) be the set of nonlinear irreducible characters of G and cd_1(G) the set of degrees of the characters in Irr_1(G). A group G is said to be a D_2-group if |cd_1(G)| =|Irr_1(G)|-2. In this paper, we give a complete classification of solvable D_2-groups.     

A new characterization of L 2(r) by their Sylow numbers

Let G be a finite centerless group, let π(G) be the set of prime divisors of the order of G, and let np(G) be the number of Sylow p-subgroups of G, that is, n_p(G) = |Sylp(G)|. Set NS(G) := {n_p(G)| p ∈π(G)}. In this paper, we are investigating whether L_2(r) is determined up to isomorphism by NS(L_2(r)) when r is prime.     

Nonsolvable groups whose irreducible character degrees have special 2-parts

Let G be a nonsolvable group and Irr(G) the set of irreducible complex characters of G. We consider the nonsolvable groups whose character degrees have special 2-parts and prove that if χ(1)₂ = 1 or |G|₂ for every χ ∈ Irr(G), then there exists a minimal normal subgroup N of G such that N ≅ PSL(2, 2ⁿ) and G/N is an odd order group.     

U(4,Z)的自同构群(英文)

In this paper,the automorphism group of G is determined,where G is a 4 × 4 upper unitriangular matrix group over Z.Let K be the subgroup of AutG consisting of all elements of AutG which act trivially on G/G,G /ζG and ζG,then （i） InnG ■ K ■ AutG;（ii） AutG/K≌=G₁×D₈×Z₂,where G₁=(a,b,c|a⁴=b²=c²=1,a^b=a^-1,[a,c]= [b,c]=1 ;（iii） K/Inn G≌=Z×Z×Z.     

有向笛卡尔积图的有向度量维数(英文)

设D是一个有向图,w={w_1,w_2,…,w_k}是D的一个有序点子集,v是D中任意一点。我们把有序k元素组r(v|w)=(d(v,w_1),d(v,w_2),…,d(v,w_k))称为点v对于W的(有向距离)表示。如果在D中,任意两个不同的点u和v对W的(有向距离)表示都不相同,则称W是有向图D的一个分解集。我们把D的最小分解集的基数称为有向图D的有向度量维数,并用dim(D)来表示。本文研究了有向笛卡尔积图D_1×D_2的有向度量维数。设P_m和C_m分别是长为m的有向路和有向圈。在文中我们分别给出了dim(D_1×D_2)的一个下界与dim(D×P_m)和dim(D×C_m)的上界,并通过确定dim(P_m×P_n),dim(C_m×P_n)和dim(C_m×C_n)的精确值说明了我们给出的上界是紧的。     

The fractional metric dimension of permutation graphs

Let G =(V(G), E(G)) be a graph with vertex set V(G) and edge set E(G). For two distinct vertices x and y of a graph G, let RG{x, y} denote the set of vertices z such that the distance from x to z is not equa l to the distance from y to z in G. For a function g defined on V(G) and for U■V(G), let g(U) =∑s∈Ug(s). A real-valued function g : V(G) → [0, 1] is a resolving function of G if g(RG{x, y}) ≥ 1 for any two distinct vertices x, y ∈ V(G). The fractional metric dimension dimf(G)of a graph G is min{g(V(G)) : g is a resolving function of G}. Let G1 and G2 be disjoint copies of a graph G, and let σ : V(G1) → V(G2) be a bijection. Then, a permutation graph Gσ =(V, E) has the vertex set V = V(G1) ∪ V(G2) and the edge set E = E(G1) ∪ E(G2) ∪ {uv | v = σ(u)}. First,we determine dimf(T) for any tree T. We show that 1 dimf(Gσ) ≤1/2(|V(G)| + |S(G)|) for any connected graph G of order at least 3, where S(G) denotes the set of support vertices of G. We also show that, for any ε 0, there exists a permutation graph Gσ such that dimf(Gσ)- 1 ε. We give examples showing that neither is there a function h1 such that dimf(G) h1(dimf(Gσ)) for all pairs(G, σ), nor is there a function h2 such that h2(dimf(G)) dimf(Gσ) for all pairs(G, σ). Furthermore,we investigate dimf(Gσ) when G is a complete k-partite graph or a cycle.     

一类数字限制集的上、下Assouad维数

设b≥2,D_1,D_2■{0,1,...,b-1},S_1,S_2■N且S_1,S_2不交.记E是由下面(1.1)所确定的数字限制集.本文讨论了E的各种分形维数,主要证明了E的上、下Assouad维数公式.     

The extreme set condition of a graph

Let G be a simple graph. The size of any largest matching in G is called the matching number of G and is denoted by ν(G). Define the deficiency of G, def(G), by the equation def(G)=|V(G)|−2ν(G). A set of points X in G is called an extreme set if def(G−X)=def(G)+|X|. Let c₀(G) denote the number of the odd components of G. A set of points X in G is called a barrier if c₀(G−X)=def(G)+|X|. In this paper, we obtain the following:

(1) Let G be a simple graph containing an independent set of size i, where i2. If X is extreme in G for every independent set X of size i in G, then there exists a perfect matching in G.

(2) Let G be a connected simple graph containing an independent set of size i, where i2. Then X is extreme in G for every independent set X of size i in G if and only if G=(U,W) is a bipartite graph with |U|=|W|i, and |Γ(Y)||U|−i+m+1 for any Y U, |Y|=m (1mi−1).

(3) Let G be a connected simple graph containing an independent set of size i, where i2. Then X is a barrier in G for every independent set X of size i in G if and only if G=(U,W) is a bipartite graph with |U|=|W|=i, and |Γ(Y)|m+1 for any Y U, |Y|=m (1mi−1).     

Frattini子群是无限循环群的有限生成幂零群

完整地确定了Frattini子群是无限循环群的有限生成幂零群的结构,证明了下面的定理.设G是有限生成幂零群,则G的Frattini子群是无限循环群当且仅当G可以分解为G=S×F×T,其中F是秩为s的自由Abel群,T=Z_m_1⊕Zm_2⊕…⊕Z_m_u,m_1,m_2,…,m_u都是大于1的没有平方因子的自然数,m_1|m_2|…|m_u,■式中d_1,d_2,…,d_r都是正整数,d_1|d_2|…|d_r.进一步,(d_1,d2,…,d_r;s;m_1…,m_2,…,m_u)是群G的同构不变量,即若群H也是Frattini子群是无限循环群的有限生成幂零群,那么G同构于H的充要条件是它们有相同的不变量.     

与Murty-Simon猜想相关的一个重要引理的推广

一个图G的无公共邻点的点对集定义为disj(G)={(u,v):N_G(u)∩N_G(v)=Φ}.Füredi在那篇对Murty-Simon猜想取得重大进展的文章中证明了一个重要的引理:对任意具有n个顶点的图G,|E(G)|+|disj(G)|≤「n~2/2」.本文对引理中的和|E(G)|+|disj(G)|做了一些更加深入的研究并对这个引理做了一些推广.     

Neighborhood unions and cyclability of graphs

A graph G is said to be cyclable if for each orientation of G, there exists a set S of vertices such that reversing all the arcs of with one end in S results in a hamiltonian digraph. Let G be a 3-connected graph of order n36. In this paper, we show that if for any three independent vertices x₁, x₂ and x₃, |N(x₁)N(x₂)|+|N(x₂)N(x₃)|+|N(x₃)N(x₁)|2n+1, then G is cyclable.     

Bandwidth of the composition of two graphs

The bandwidth B(G) of a graph G is the minimum of the quantity max{|f(x)−f(y)| : xyE(G)} taken over all proper numberings f of G. The composition of two graphs G and H, written as G[H], is the graph with vertex set V(G)×V(H) and with (u₁,v₁) is adjacent to (u₂,v₂) if either u₁ is adjacent to u₂ in G or u₁=u₂ and v₁ is adjacent to v₂ in H. In this paper, we investigate the bandwidth of the composition of two graphs. Let G be a connected graph. We denote the diameter of G by D(G). For two distinct vertices x,yV(G), we define w_G(x,y) as the maximum number of internally vertex-disjoint (x,y)-paths whose lengths are the distance between x and y. We define w(G) as the minimum of w_G(x,y) over all pairs of vertices x,y of G with the distance between x and y is equal to D(G). Let G be a non-complete connected graph and let H be any graph. Among other results, we prove that if |V(G)|=B(G)D(G)−w(G)+2, then B(G[H])=(B(G)+1)|V(H)|−1. Moreover, we show that this result determines the bandwidth of the composition of some classes of graphs composed with any graph.     

广义超特殊p-群的自同构群(Ⅱ)

重新确定了广义超特殊p-群G的自同构群的结构.设|G|=p~(2n+m),|ζG|=p~m,其中n≥1,m≥2,Aut_cG是AutG中平凡地作用在ζG上的元素形成的正规子群,则(i)若p是奇素数,则AutG=〈θ〉×Aut_cG,其中θ的阶是(p-1)p~(m-1);若p=2,则AutG=〈θ_1,θ_2〉×Aut_cG,其中〈θ_1,θ_2〉=〈θ_1〉×〈θ_2〉≌Z_(2m-2)×Z_2.(ii)如果G的幂指数是p~m,那么Aut_cG/InnG≌Sp(2n,p).(iii)如果G的幂指数是p~(m+1),那么Aut_cG/InnG≌K×Sp(2n-2,p),其中K是p~(2n-1)阶超特殊p-群(若p是奇素数)或者初等Abel 2-群.特别地,当n=1时,Aut_cG/InnG≌Z_p.     

关于拟k-连通图的一个注释

G是一个k-连通图,T是G的一个k-点割,若G-T可被划分成两个子图G1,G2,且|G1 |≥2,|G2 |≥2,则称T是G的一个非平凡点割.假定G是一个不含非平凡(k-1)点割的(k-1)-连通图,则称G是一个拟k-连通图.证明了对任意一个k≥5且t＞k/2的整数,若G是一个不含(K2+tK1)的k-连通图,且G中任...     

图有[a,b]因子的邻域条件

不含有图K1，R的图称为K1,r-free图，设G是一个具有顶点集V（G）的图，设n(≥3),a和b是整数，使得b≥a≥1，若b是奇数，设b≥n-1。我们证明了每个连通的K1,r-free图G在b|V(G)|为偶数，它的最小度至少是a n-1,|V(G）≥ （2(a b)-1)(a b-1)/b，以及|NG(x）∪NG（y)|≥a|V(G)|a b对V的任意两个不邻接的点x和y都成立时，G有一个[a,b]因子。     

关于图是(r,n)-临界图的一个邻域条件

设n，m和r是满足r≥2，n≥0，m≥3的整数，且当r是奇数时，假设r≥m-1．称一个图为K1,m-free，如果它不包含以Kt,m为导出的子图．称一个图G为一个（r,n）-临界图，如果在删去G的任意n个点后，剩下G的子图都有一个r-因子,设G是一个Kl,m-free的（n＋1）-连通图，且阶为｜G｜以及r（｜G｜≥n）是偶数,证明了：如果G的最小度至少是r＋n＋m-1，阶｜G｜≥8r5＋n，并且对V（G）的任意独立点集{x1，x2}都有｜NG（x1）∪NG（x2）｜≥（｜G｜＋n）／2，那么G是一个（r,n）-临界图．关于G的最小度和｜NG（x1）∪NG（X2）｜的下界是紧的。     

Zygmund空间上的微分复合算子

讨论Zygmund空间E={f∈H(D):sup_(z∈D)(l-|z|~2)|f″(z)|∞}上的微分复合算子DC_φ,这里C_φ是复合算子,D是微分算子.得到了DC_φ在Zygmund空间E和小Zygmund空间E_0上是有界算子与紧算子的充分必要条件.     

单位上三角矩阵群的注记(Ⅲ)

设k_(ij)(1≤ij≤n)是给定的正整数,分别记G={ (1 k12a12…k1na1n 0 1…k2na2n…… 0 0…1 )|aij∈Z},R={ (0 k12a12…k1na1n……0 0…k2na2n 0 0…1 )|aij∈Z},本文证明:当G成群且G的上、下中心群列重合时,其相伴Lie环L(G)与Lie环R同构,其中R的Lie积定义为[A,B]=AB-BA.即得到了此时L(G)的矩阵表示.     

On neighborhood condition for graphs to have [a,b]-factors

Let G be a graph of order n, and let a and b be integers such that 1a<b. Let δ(G) be the minimum degree of G. Then we prove that if δ(G)(k−1)a, n(a+b)(k(a+b)−2)/b, and |N_G(x₁)N_G(x₂)N_G(x_k)|an/(a+b) for any independent subset {x₁,x₂,…,x_k} of V(G), where k2, then G has an [a,b]-factor. This result is best possible in some sense.