首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 453 毫秒
1.
Let G be a finite group. Let X 1(G) be the first column of the ordinary character table of G. We will show that if X 1(G) = X1(PGU3(q 2)), then G ? PGU3(q 2). As a consequence, we show that the projective general unitary groups PGU3(q 2) are uniquely determined by the structure of their complex group algebras.  相似文献   

2.
A k-total coloring of a graph G is a mapping ?: V (G) ? E(G) → {1; 2,..., k} such that no two adjacent or incident elements in V (G) ? E(G) receive the same color. Let f(v) denote the sum of the color on the vertex v and the colors on all edges incident with v: We say that ? is a k-neighbor sum distinguishing total coloring of G if f(u) 6 ≠ f(v) for each edge uvE(G): Denote χ Σ (G) the smallest value k in such a coloring of G: Pil?niak and Wo?niak conjectured that for any simple graph with maximum degree Δ(G), χ Σ ≤ Δ(G)+3. In this paper, by using the famous Combinatorial Nullstellensatz, we prove that for K 4-minor free graph G with Δ(G) > 5; χ Σ = Δ(G) + 1 if G contains no two adjacent Δ-vertices, otherwise, χ Σ (G) = Δ(G) + 2.  相似文献   

3.
For X, YMn,m it is said that X is gut-majorized by Y, and we write X ?gutY, if there exists an n-by-n upper triangular g-row stochastic matrix R such that X = RY. Define the relation ~gut as follows. X ~gutY if X is gut-majorized by Y and Y is gut-majorized by X. The (strong) linear preservers of ?gut on ?n and strong linear preservers of this relation on Mn,m have been characterized before. This paper characterizes all (strong) linear preservers and strong linear preservers of ~gut on ?n and Mn,m.  相似文献   

4.
A subgroup K of G is Mp-supplemented in G if there exists a subgroup B of G such that G = KB and TB < G for every maximal subgroup T of K with |K: T| = pα. In this paper we prove the following: Let p be a prime divisor of |G| and let H be ap-nilpotent subgroup having a Sylow p-subgroup of G. Suppose that H has a subgroup D with Dp ≠ 1 and |H: D| = pα. Then G is p-nilpotent if and only if every subgroup T of H with |T| = |D| is Mp-supplemented in G and NG(Tp)/CG(Tp) is a p-group.  相似文献   

5.
An edge-coloring of a graph G is an assignment of colors to all the edges of G. A g c -coloring of a graph G is an edge-coloring of G such that each color appears at each vertex at least g(v) times. The maximum integer k such that G has a g c -coloring with k colors is called the g c -chromatic index of G and denoted by \(\chi\prime_{g_{c}}\)(G). In this paper, we extend a result on edge-covering coloring of Zhang and Liu in 2011, and give a new sufficient condition for a simple graph G to satisfy \(\chi\prime_{g_{c}}\)(G) = δ g (G), where \(\delta_{g}\left(G\right) = min_{v\epsilon V (G)}\left\{\lfloor\frac{d\left(v\right)}{g\left(v\right)}\rfloor\right\}\).  相似文献   

6.
Let G be a finite group. The prime graph of G is denoted by Γ(G). The main result we prove is as follows: If G is a finite group such that Γ(G) = Γ(L 10(2)) then G/O 2(G) is isomorphic to L 10(2). In fact we obtain the first example of a finite group with the connected prime graph which is quasirecognizable by its prime graph. As a consequence of this result we can give a new proof for the fact that the simple group L 10(2) is uniquely determined by the set of its element orders.  相似文献   

7.
Let G be a group. An element xG is called real if x is conjugate to x ?1 in G. In this paper we study the structure of real elements in the compact connected Lie group of type F 4 and algebraic groups of type F 4 defined over an arbitrary field.  相似文献   

8.
Let G be a simple graph, let d(v) denote the degree of a vertex v and let g be a nonnegative integer function on V (G) with 0 ≤ g(v) ≤ d(v) for each vertex vV (G). A g c -coloring of G is an edge coloring such that for each vertex vV (G) and each color c, there are at least g(v) edges colored c incident with v. The g c -chromatic index of G, denoted by χ′g c (G), is the maximum number of colors such that a gc-coloring of G exists. Any simple graph G has the g c -chromatic index equal to δ g (G) or δ g (G) ? 1, where \({\delta _g}\left( G \right) = \mathop {\min }\limits_{v \in V\left( G \right)} \left\lfloor {d\left( v \right)/g\left( v \right)} \right\rfloor \). A graph G is nearly bipartite, if G is not bipartite, but there is a vertex uV (G) such that G ? u is a bipartite graph. We give some new sufficient conditions for a nearly bipartite graph G to have χ′g c (G) = δ g (G). Our results generalize some previous results due to Wang et al. in 2006 and Li and Liu in 2011.  相似文献   

9.
Let G be a nonabelian group, and associate the noncommuting graph ?(G) with G as follows: the vertex set of ?(G) is G\Z(G) with two vertices x and y joined by an edge whenever the commutator of x and y is not the identity. Let S 4(q) be the projective symplectic simple group, where q is a prime power. We prove that if G is a group with ?(G) ? ?(S 4(q)) then G ? S 4(q).  相似文献   

10.
Let G be a 2-edge-connected simple graph on n vertices. For an edge e = uvE(G), define d(e) = d(u) + d(v). Let F denote the set of all simple 2-edge-connected graphs on n ≥ 4 vertices such that GF if and only if d(e) + d(e’) ≥ 2n for every pair of independent edges e, e’ of G. We prove in this paper that for each GF, G is not Z 3-connected if and only if G is one of K 2,n?2, K 3,n?3, K 2,n?2 + , K 3,n?3 + or one of the 16 specified graphs, which generalizes the results of X. Zhang et al. [Discrete Math., 2010, 310: 3390–3397] and G. Fan and X. Zhou [Discrete Math., 2008, 308: 6233–6240].  相似文献   

11.
Let G be a finite group. The main result of this paper is as follows: If G is a finite group, such that Γ(G) = Γ(2G2(q)), where q = 32n+1 for some n ≥ 1, then G has a (unique) nonabelian composition factor isomorphic to 2 G 2(q). We infer that if G is a finite group satisfying |G| = |2 G 2(q)| and Γ(G) = Γ (2 G 2(q)) then G ? = 2 G 2(q). This enables us to give new proofs for some theorems; e.g., a conjecture of W. Shi and J. Bi. Some applications of this result are also considered to the problem of recognition by element orders of finite groups.  相似文献   

12.
For a prime p, a cyclic-by-p group G and a G-extension L|K of complete discrete valuation fields of characteristic p with algebraically closed residue field, the local lifting problem asks whether the extension L|K lifts to characteristic zero. In this paper, we characterize D4-extensions of fields of characteristic two, determine the ramification breaks of (suitable) D4- extensions of complete discrete valuation fields of characteristic two, and solve the local lifting problem in the affirmative for every D4-extension of complete discrete valuation fields of characteristic two with algebraically closed residue field; that is, we show that D4 is a local Oort group for the prime 2.  相似文献   

13.
Given a finite group G with socle isomorphic to L 2(q), q ≥ 4, we describe, up to conjugacy, all pairs of nilpotent subgroups A and B of G such that AB g ≠ 1 for all gG.  相似文献   

14.
The field \(K = \mathbb{Q}\left( {\sqrt { - 7} } \right)\) is the only imaginary quadratic field with class number 1, in which the prime 2 splits, and we fix one of the primes p of K lying above 2. The modular elliptic curve X 0(49) has complex multiplication by the maximal order O of K, and we let E be the twist of X 0(49) by the quadratic extension \(KK(\sqrt M )/K\), where M is any square free element of O with M ≡ 1 mod 4 and (M,7) = 1. In the present note, we use surprisingly simple algebraic arguments to prove a sharp estimate for the rank of the Mordell-Weil group modulo torsion of E over the field F = K(E p∞), where E p∞ denotes the group of p-division points on E. Moreover, writing B for the twist of X 0(49) by \(K(\sqrt[4]{{ - 7}})/K\), our Iwasawa-theoretic arguments also show that the weak form of the conjecture of Birch and Swinnerton-Dyer implies the non-vanishing at s = 1 of the complex L-series of B over every finite layer of the unique Z2-extension of K unramified outside p. We hope to give a proof of this last non-vanishing assertion in a subsequent paper.  相似文献   

15.
Given a finite group G with socle isomorphic to L n (2 m ), we describe (up to conjugacy) all ordered pairs of primary subgroups A and B in G such that AB g ≠ 1 for all gg.  相似文献   

16.
It is proved that, if G is a finite group with a nontrivial normal 2-subgroup Q such that G/Q ~= A 7 and an element of order 5 from G acts freely on Q, then the extension G over Q is splittable, Q is an elementary abelian group, and Q is the direct product of minimal normal subgroups of G each of which is isomorphic, as a G/Q-module, to one of the two 4-dimensional irreducible GF(2)A 7-modules that are conjugate with respect to an outer automorphism of the group A 7.  相似文献   

17.
A subgroup K of G is M p -supplemented in G if there exists a subgroup B of G such that G = KB and TB < G for every maximal subgroup T of K with |K: T| = p α. We study the structure of the chief factor of G by using M p -supplemented subgroups and generalize the results of Monakhov and Shnyparkov by involving the relevant results about the p-modular subgroup O p (G) of G.  相似文献   

18.
Let G be a finite group. If Mn< Mn?1< · · · < M1< M0 = G with Mi a maximal subgroup of Mi?1 for all i = 1,..., n, then Mn (n > 0) is an n-maximal subgroup of G. A subgroup M of G is called modular provided that (i) 〈X,MZ〉 = 〈X,M〉 ∩ Z for all XG and ZG such that XZ, and (ii) 〈M,YZ〉 = 〈M,Y 〉 ∩ Z for all YG and ZG such that MZ. In this paper, we study finite groups whose n-maximal subgroups are modular.  相似文献   

19.
Let T t : XX be a C 0-semigroup with generator A. We prove that if the abscissa of uniform boundedness of the resolvent s 0(A) is greater than zero then for each nondecreasing function h(s): ?+R + there are x′X′ and xX satisfying ∫ 0 h(|〈x′, T x x〉|)dt = ∞. If i? ∩ Sp(A) ≠ Ø then such x may be taken in D(A ).  相似文献   

20.
Consider the set of all proper edge-colourings of a graph G with n colours. Among all such colourings, the minimum length of a longest two-coloured cycle is denoted L(n, G). The problem of understanding L(n, G) was posed by Häggkvist in 1978 and, specifically, L(n, K n,n ) has received recent attention. Here we construct, for each prime power q ≥ 8, an edge-colouring of K n,n with n colours having all two-coloured cycles of length ≤ 2q 2, for integers n in a set of density 1 ? 3/(q ? 1). One consequence is that L(n, K n,n ) is bounded above by a polylogarithmic function of n, whereas the best known general upper bound was previously 2n ? 4.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号