Some class 1 graphs on <Emphasis Type="Italic">g</Emphasis><Subscript><Emphasis Type="Italic">c</Emphasis></Subscript>-colorings

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\}\).     

Quasirecognition by prime graph of <Emphasis Type="Italic">L</Emphasis><Subscript>10</Subscript>(2)

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 ₁₀(2)) then G/O ₂(G) is isomorphic to L ₁₀(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 ₁₀(2) is uniquely determined by the set of its element orders.     

Periodic Groups Saturated with the Groups <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

Given an indexing set I and a finite field K_α for each α ∈ I, let ? = {L₂(K_α) | α ∈ I} and \(\mathfrak{N} = \{ SL_2 (K_\alpha )|\alpha \in I\}\). We prove that each periodic group G saturated with groups in \(\Re (\mathfrak{N})\) is isomorphic to L₂(P) (respectively SL₂(P)) for a suitable locally finite field P.     

On <Emphasis Type="Italic">g</Emphasis><Subscript><Emphasis Type="Italic">c</Emphasis></Subscript>-colorings of nearly bipartite graphs

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 v ∈ V (G). A g _c -coloring of G is an edge coloring such that for each vertex v ∈ V (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 u ∈ V (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.     

Neighbor sum distinguishing total chromatic number of <Emphasis Type="Italic">K</Emphasis><Subscript>4</Subscript>-minor free graph

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 uv ∈ E(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 ₄-minor free graph G with Δ(G) > 5; χ _Σ ^″ = Δ(G) + 1 if G contains no two adjacent Δ-vertices, otherwise, χ _Σ ^″ (G) = Δ(G) + 2.     

The complete reducibility of some <Emphasis Type="Italic">GF</Emphasis>(2)<Emphasis Type="Italic">A</Emphasis><Subscript>7</Subscript>-modules

It is proved that, if G is a finite group with a nontrivial normal 2-subgroup Q such that G/Q ～= A ₇ 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 ₇-modules that are conjugate with respect to an outer automorphism of the group A ₇.     

Real elements in groups of type <Emphasis Type="Italic">F</Emphasis><Subscript>4</Subscript>

Let G be a group. An element x ∈ G 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 ₄ and algebraic groups of type F ₄ defined over an arbitrary field.     

Quasirecognition by prime graph of the simple group <Superscript>2</Superscript><Emphasis Type="Italic">G</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

Let G be a finite group. The main result of this paper is as follows: If G is a finite group, such that Γ(G) = Γ(²G₂(q)), where q = 3²ⁿ⁺¹ for some n ≥ 1, then G has a (unique) nonabelian composition factor isomorphic to ² G ₂(q). We infer that if G is a finite group satisfying |G| = |² G ₂(q)| and Γ(G) = Γ (² G ₂(q)) then G ? = ² G ₂(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.     

Distance-Regular Shilla Graphs with <Emphasis Type="Italic">b</Emphasis><Subscript>2</Subscript> = <Emphasis Type="Italic">c</Emphasis><Subscript>2</Subscript>

A Shilla graph is defined as a distance-regular graph of diameter 3 with second eigen-value θ₁ equal to a₃. For a Shilla graph, let us put a = a₃ and b = k/a. It is proved in this paper that a Shilla graph with b₂ = c₂ and noninteger eigenvalues has the following intersection array:

$$\left\{ {\frac{{{b^2}\left( {b - 1} \right)}}{2},\frac{{\left( {b - 1} \right)\left( {{b^2} - b + 2} \right)}}{2},\frac{{b\left( {b - 1} \right)}}{4};1,\frac{{b\left( {b - 1} \right)}}{4},\frac{{b{{\left( {b - 1} \right)}^2}}}{2}} \right\}$$

If Γ is a Q-polynomial Shilla graph with b₂ = c₂ and b = 2r, then the graph Γ has intersection array

$$\left\{ {2tr\left( {2r + 1} \right),\left( {2r + 1} \right)\left( {2rt + t + 1} \right),r\left( {r + t} \right);1,r\left( {r + t} \right),t\left( {4{r^2} - 1} \right)} \right\}$$

and, for any vertex u in Γ, the subgraph Γ₃(u) is an antipodal distance-regular graph with intersection array

$$\left\{ {t\left( {2r + 1} \right),\left( {2r - 1} \right)\left( {t + 1} \right),1;1,t + 1,t\left( {2r + 1} \right)} \right\}$$

The Shilla graphs with b₂ = c₂ and b = 4 are also classified in the paper.

     

On a new property of <Emphasis Type="Italic">n</Emphasis>-poised and <Emphasis Type="Italic">G</Emphasis><Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> sets

In this paper we consider n-poised planar node sets, as well as more special ones, called G C _n sets. For the latter sets each n-fundamental polynomial is a product of n linear factors as it always holds in the univariate case. A line ? is called k-node line for a node set \(\mathcal X\) if it passes through exactly k nodes. An (n + 1)-node line is called maximal line. In 1982 M. Gasca and J. I. Maeztu conjectured that every G C _n set possesses necessarily a maximal line. Till now the conjecture is confirmed to be true for n ≤ 5. It is well-known that any maximal line M of \(\mathcal X\) is used by each node in \(\mathcal X\setminus M, \)meaning that it is a factor of the fundamental polynomial. In this paper we prove, in particular, that if the Gasca-Maeztu conjecture is true then any n-node line of G C _n set \(\mathcal {X}\) is used either by exactly \(\binom {n}{2}\) nodes or by exactly \(\binom {n-1}{2}\) nodes. We prove also similar statements concerning n-node or (n ? 1)-node lines in more general n-poised sets. This is a new phenomenon in n-poised and G C _n sets. At the end we present a conjecture concerning any k-node line.     

Characterizing projective general unitary groups PGU<Subscript>3</Subscript>(<Emphasis Type="Italic">q</Emphasis><Superscript>2</Superscript>) by their complex group algebras

Let G be a finite group. Let X ₁(G) be the first column of the ordinary character table of G. We will show that if X ₁(G) = X1(PGU₃(q ²)), then G ? PGU₃(q ²). As a consequence, we show that the projective general unitary groups PGU₃(q ²) are uniquely determined by the structure of their complex group algebras.     

<Emphasis Type="Italic">M</Emphasis> <Subscript> <Emphasis Type="Italic">p</Emphasis> </Subscript>-supplemented subgroups of finite groups

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^α. 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 D_p ≠ 1 and |H: D| = p_α. Then G is p-nilpotent if and only if every subgroup T of H with |T| = |D| is M_p-supplemented in G and N_G(T_p)/C_G(T_p) is a p-group.     

New characterization of <Emphasis Type="Italic">S</Emphasis><Subscript>4</Subscript>(<Emphasis Type="Italic">q</Emphasis>) by its noncommuting graph

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 ₄(q) be the projective symplectic simple group, where q is a prime power. We prove that if G is a group with ?(G) ? ?(S ₄(q)) then G ? S ₄(q).     

On <Emphasis Type="Italic">r</Emphasis>-recognition by prime graph of <Emphasis Type="Italic">B</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(3) where <Emphasis Type="Italic">p</Emphasis> is an odd prime

Let G be a finite group. The prime graph Γ(G) of G is defined as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p and p′ are joined by an edge if there is an element in G of order pp′. We denote by k(Γ(G)) the number of isomorphism classes of finite groups H satisfying Γ(G) = Γ(H). Given a natural number r, a finite group G is called r-recognizable by prime graph if k(Γ(G)) =  r. In Shen et al. (Sib. Math. J. 51(2):244–254, 2010), it is proved that if p is an odd prime, then B _p (3) is recognizable by element orders. In this paper as the main result, we show that if G is a finite group such that Γ(G) = Γ(B _p (3)), where p > 3 is an odd prime, then \({G\cong B_p(3)}\) or C _p (3). Also if Γ(G) = Γ(B ₃(3)), then \({G\cong B_3(3), C_3(3), D_4(3)}\), or \({G/O_2(G)\cong {\rm Aut}(^2B_2(8))}\). As a corollary, the main result of the above paper is obtained.     

Degree sum of a pair of independent edges and <Emphasis Type="Italic">Z</Emphasis><Subscript>3</Subscript>-connectivity

Let G be a 2-edge-connected simple graph on n vertices. For an edge e = uv ∈ E(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 G ∈ F 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 G ∈ F, G is not Z ₃-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].     

Influence of <Emphasis Type="Italic">M</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-supplemented subgroups on the structure of <Emphasis Type="Italic">p</Emphasis>-modular subgroups

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.     

Recognition by spectrum of simple groups <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(2)

It is proved that, if G is a finite group that has the same set of element orders as the simple group C _p (2) for prime p > 3, then G/O ₂(G) is isomorphic to C _p (2).     

A REALIZATION OF CERTAIN MODULES FOR THE <Emphasis Type="Italic">N</Emphasis> = 4 SUPERCONFORMAL ALGEBRA AND THE AFFINE LIE ALGEBRA <Emphasis Type="Italic">A</Emphasis><Stack><Subscript>2</Subscript><Superscript>(1)</Superscript></Stack>

We shall first present an explicit realization of the simple N = 4 superconformal vertex algebra L _c ^N?=?4 with central charge c = ?9. This vertex superalgebra is realized inside of the bcβγ system and contains a subalgebra isomorphic to the simple affine vertex algebra L _A1 \( \left(-\frac{3}{2}{\varLambda}_0\right) \). Then we construct a functor from the category of L _c ^N?=?4 -modules with c = ?9 to the category of modules for the admissible affine vertex algebra L _A1 \( \left(-\frac{3}{2}{\varLambda}_0\right) \). By using this construction we construct a family of weight and logarithmic modules for L _c ^N?=?4 and L _A1 \( \left(-\frac{3}{2}{\varLambda}_0\right) \). We also show that a coset subalgebra L _A1 \( \left(-\frac{3}{2}{\varLambda}_0\right) \) is a logarithmic extension of the W(2; 3)-algebra with c = ?10. We discuss some generalizations of our construction based on the extension of affine vertex algebra L _A1 (kΛ ₀) such that k + 2 = 1/p and p is a positive integer.     

Regularity for weakly (K<Subscript>1</Subscript>, K<Subscript>2</Subscript>)-quasiregular mappings

In this paper, we first give the definition of weakly (K₁,K₂-quasiregular mappings, and then by using the Hodge decomposition and the weakly reverse Hölder inequality, we obtain their regularity property: For anyq ₁ that satisfies\(0< K_1 n^{(n + 4)/2} 2^{n + 1} \times 100^{n^2 } [2^{3n/2} (2^{5n} + 1)](n - q_1 )< 1\), there existsp ₁=p ₁(n,q ₁,K ₁,K ₂)>n, such that any (K₁, K₂)-quasiregular mapping\(f \in W_{loc}^{1,q_1 } (\Omega ,R^n )\) is in fact in\(W_{loc}^{1,p_1 } (\Omega , R^n )\). That is, f is (K₁,K₂)-quasiregular in the usual sense.     

Irreducible <Emphasis Type="Italic">A</Emphasis><Stack><Subscript>1</Subscript><Superscript>(1)</Superscript></Stack>-modules from modules over two-dimensional non-abelian Lie algebra

For any module V over the two-dimensional non-abelian Lie algebra b and scalar α ∈ C, we define a class of weight modules F ^α (V) with zero central charge over the affine Lie algebra A ₁ ⁽¹⁾ . These weight modules have infinitedimensional weight spaces if and only if V is infinite dimensional. In this paper, we will determine necessary and sufficient conditions for these modules F ^α(V) to be irreducible. In this way, we obtain a lot of irreducible weight A ₁ ⁽¹⁾ -modules with infinite-dimensional weight spaces.