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.     

Properties of element orders in covers for L<Subscript>n</Subscript>(<Emphasis Type="Italic">q</Emphasis>) and U<Subscript>n</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

We show that if a finite simple group G, isomorphic to PSL_n(q) or PSU_n(q) where either n ≠ 4 or q is prime or even, acts on a vector space over a field of the defining characteristic of G; then the corresponding semidirect product contains an element whose order is distinct from every element order of G. We infer that the group PSL_n(q), n ≠ 4 or q prime or even, is recognizable by spectrum from its covers thus giving a partial positive answer to Problem 14.60 from the Kourovka Notebook.     

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.     

Note edge-colourings of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n,n</Emphasis></Subscript> with no long two-coloured cycles

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 ², 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.     

On the centers of quantum groups of <Emphasis Type="Italic">A</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>-type

Let g be the finite dimensional simple Lie algebra of type An, and let U? = U _q (g,Λ) and U = U _q (g,Q) be the quantum groups defined over the weight lattice and over the root lattice, respectively. In this paper, we find two algebraically independent central elements in U? for all n ≥ 2 and give an explicit formula of the Casimir elements for the quantum group U? = U _q (g,Λ), which corresponds to the Casimir element of the enveloping algebra U(g). Moreover, for n = 2 we give explicitly generators of the center subalgebras of the quantum groups U? = U _q (g,Λ) and U = U _q (g,Q).     

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.     

Inverse problem with nonlocal observation of finding the coefficient multiplying <Emphasis Type="Italic">u</Emphasis> <Subscript> <Emphasis Type="Italic">t</Emphasis> </Subscript> in the parabolic equation

We study the inverse problem of the reconstruction of the coefficient ?(x, t) = ?⁰(x, t) + r(x) multiplying u_t in a nonstationary parabolic equation. Here ?⁰(x, t) ≥ ?⁰ > 0 is a given function, and r(x) ≥ 0 is an unknown function of the class L_∞(Ω). In addition to the initial and boundary conditions (the data of the direct problem), we pose the problem of nonlocal observation in the form ∫₀^Tu(x, t) dμ(t) = χ(x) with a known measure dμ(t) and a function χ(x). We separately consider the case dμ(t) = ω(t)dt of integral observation with a smooth function ω(t). We obtain sufficient conditions for the existence and uniqueness of the solution of the inverse problem, which have the form of ready-to-verify inequalities. We suggest an iterative procedure for finding the solution and prove its convergence. Examples of particular inverse problems for which the assumptions of our theorems hold are presented.     

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.     

Some Existence Theorems on All Fractional (<Emphasis Type="Italic">g</Emphasis>, <Emphasis Type="Italic">f</Emphasis>)-factors with Prescribed Properties

Let G be a graph, and g, f: V (G) → Z⁺ with g(x) ≤ f(x) for each x ∈ V (G). We say that G admits all fractional (g, f)-factors if G contains an fractional r-factor for every r: V (G) → Z⁺ with g(x) ≤ r(x) ≤ f(x) for any x ∈ V (G). Let H be a subgraph of G. We say that G has all fractional (g, f)-factors excluding H if for every r: V (G) → Z⁺ with g(x) ≤ r(x) ≤ f(x) for all x ∈ V (G), G has a fractional r-factor F _h such that E(H) ∩ E(F _h ) = θ, where h: E(G) → [0, 1] is a function. In this paper, we show a characterization for the existence of all fractional (g, f)-factors excluding H and obtain two sufficient conditions for a graph to have all fractional (g, f)-factors excluding H.     

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.     

Intersections of two nilpotent subgroups in finite groups with socle <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

Given a finite group G with socle isomorphic to L ₂(q), q ≥ 4, we describe, up to conjugacy, all pairs of nilpotent subgroups A and B of G such that A ∩ B ^g ≠ 1 for all g ∈ G.     

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.     

Planar Graded Lattices and the <Emphasis Type="Bold">c</Emphasis><Subscript>1</Subscript>-Median Property

Let L be a lattice of finite length, ξ = (x ₁,…, x _k )∈L ^k , and y ∈ L. The remoteness r(y, ξ) of y from ξ is d(y, x ₁)+?+d(y, x _k ), where d stands for the minimum path length distance in the covering graph of L. Assume, in addition, that L is a graded planar lattice. We prove that whenever r(y, ξ) ≤ r(z, ξ) for all z ∈ L, then y ≤ x ₁∨?∨x _k . In other words, L satisfies the so-called c ₁ -median property.     

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">k</Emphasis>- critical 2<Emphasis Type="Italic">k</Emphasis>- connected graphs

A graph G is called an (n,k)-graph if κ(G-S)=n-|S| for any S ? V(G) with |S| ≤ k, where ?(G) denotes the connectivity of G. Mader conjectured that for k ≥ 3 the graph K_2k+2?(1-factor) is the unique (2k, k)-graph. Kriesell has settled two special cases for k = 3,4. We prove the conjecture for the general case k ≥ 5.     

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.     

Blow-up of <Emphasis Type="Italic">p</Emphasis>-Laplacian evolution equations with variable source power

We study the blow-up and/or global existence of the following p-Laplacian evolution equation with variable source power

$${s_j} = {\beta _j} + \overline {{\beta _{n - j}}}p$$

where Ω is either a bounded domain or the whole space ? ^N , q(x) is a positive and continuous function defined in Ω with 0 < q _? = inf q(x) ? q(x) ? sup q(x) = q+ < ∞. It is demonstrated that the equation with variable source power has much richer dynamics with interesting phenomena which depends on the interplay of q(x) and the structure of spatial domain Ω, compared with the case of constant source power. For the case that Ω is a bounded domain, the exponent p ? 1 plays a crucial role. If q+ > p ? 1, there exist blow-up solutions, while if q ₊ < p ? 1, all the solutions are global. If q _? > p ? 1, there exist global solutions, while for given q _? < p ? 1 < q ₊, there exist some function q(x) and Ω such that all nontrivial solutions will blow up, which is called the Fujita phenomenon. For the case Ω = ? ^N , the Fujita phenomenon occurs if 1 < q _? ? q ₊ ? p ? 1 + p/N, while if q _? > p ? 1 + p/N, there exist global solutions.

     

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

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

<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.