On sharply 2-transitive groups with generalized finite elements

We prove Jordan’s Theorem for infinite sharply 2-transitive groups satisfying the finiteness (a, b)-condition, with |a| · |b| even.     

Decomposing Hitting Times of Walks on Graphs into Simpler Ones

Using the electric approach, we derive a formula that expresses an expected hitting time of a random walk between two vertices a and b of a graph G as a convex linear combination of expected hitting times of walks between a and b on subgraphs of G, provided certain condition on a and b is satisfied. Then we use this formula in several applications.     

On finite simple images of triangle groups

For a simple algebraic group G in characteristic p, a triple (a, b, c) of positive integers is said to be rigid for G if the dimensions of the subvarieties of G of elements of order dividing a, b, c sum to 2 dim G. In this paper we complete the proof of a conjecture of the third author, that for a rigid triple (a, b, c) for G with p > 0, the triangle group T_a,b,c has only finitely many simple images of the form G(p^r). We also obtain further results on the more general form of the conjecture, where the images G(p^r) can be arbitrary quasisimple groups of type G.     

On a classical theorem on the diameter and minimum degree of a graph

In this work, we obtain good upper bounds for the diameter of any graph in terms of its minimum degree and its order, improving a classical theorem due to Erd¨os, Pach, Pollack and Tuza.We use these bounds in order to study hyperbolic graphs(in the Gromov sense). To compute the hyperbolicity constant is an almost intractable problem, thus it is natural to try to bound it in terms of some parameters of the graph. Let H(n, δ_0) be the set of graphs G with n vertices and minimum degree δ_0, and J(n, Δ) be the set of graphs G with n vertices and maximum degree Δ. We study the four following extremal problems on graphs: a(n, δ_0) = min{δ(G) | G ∈ H(n, δ_0)}, b(n, δ_0) = max{δ(G) |G ∈ H(n, δ_0)}, α(n, Δ) = min{δ(G) | G ∈ J(n, Δ)} and β(n, Δ) = max{δ(G) | G ∈ J(n, Δ)}. In particular, we obtain bounds for b(n, δ_0) and we compute the precise value of a(n, δ_0), α(n, Δ) andβ(n, Δ) for all values of n, δ_0 and Δ, respectively.     

Groups Satisfying the Two-Prime Hypothesis with a Composition Factor Isomorphic to PSL<Subscript>2</Subscript>(<Emphasis Type="Italic">q</Emphasis>) for <Emphasis Type="Italic">q</Emphasis> ⩾ 7

Let G be a finite group and write cd(G) for the degree set of the complex irreducible characters of G. The group G is said to satisfy the two-prime hypothesis if for any distinct degrees a, b 2 cd(G), the total number of (not necessarily different) primes of the greatest common divisor gcd(a, b) is at most 2. We prove an upper bound on the number of irreducible character degrees of a nonsolvable group that has a composition factor isomorphic to PSL₂(q) for q ? 7.     

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

Free Choosability of Outerplanar Graphs

A graph G is free (a, b)-choosable if for any vertex v with b colors assigned and for any list of colors of size a associated with each vertex \(u\ne v\), the coloring can be completed by choosing for u a subset of b colors such that adjacent vertices are colored with disjoint color sets. In this note, a necessary and sufficient condition for a cycle to be free (a, b)-choosable is given. As a corollary, we obtain almost optimal results about the free (a, b)-choosability of outerplanar graphs.     

Generation of a finite group with Hall maximal subgroups by a pair of conjugate elements

For a finite group G, the set of all prime divisors of |G| is denoted by π(G). P. Shumyatsky introduced the following conjecture, which was included in the “Kourovka Notebook” as Question 17.125: a finite group G always contains a pair of conjugate elements a and b such that π(G) = π(〈a, b〉). Denote by \(\mathfrak{Y}\) the class of all finite groups G such that π(H) ≠ π(G) for every maximal subgroup H in G. Shumyatsky’s conjecture is equivalent to the following conjecture: every group from \(\mathfrak{Y}\) is generated by two conjugate elements. Let \(\mathfrak{V}\) be the class of all finite groups in which every maximal subgroup is a Hall subgroup. It is clear that \(\mathfrak{V} \subseteq \mathfrak{Y}\). We prove that every group from \(\mathfrak{V}\) is generated by two conjugate elements. Thus, Shumyatsky’s conjecture is partially supported. In addition, we study some properties of a smallest order counterexample to Shumyatsky’s conjecture.     

Solution of the Cameron-Erdös problem for groups of prime order

A subset A of a group G is sum-free if a + b does not belong to A for any a, b ∈ A. Asymptotics of the number of sum-free sets in groups of prime order are proved.     

Finite groups with <Emphasis Type="Italic">C</Emphasis>-quasinormal subgroups

Consider some finite group G and a finite subgroup H of G. Say that H is c-quasinormal in G if G has a quasinormal subgroup T such that HT = G and T ∩ H is quasinormal in G. Given a noncyclic Sylow subgroup P of G, we fix some subgroup D such that 1 < |D| < | P| and study the structure of G under the assumption that all subgroups H of P of the same order as D, having no supersolvable supplement in G, are c-quasinormal in G.     

On an inverse problem to Frobenius’ theorem

Let G be a finite group and e a positive integer dividing |G|, the order of G. Denoting \({L_e(G)=\{x\in G|\,x^e=1\}}\) , Frobenius proved that |L _e (G)| = ke for a positive integer k ≥ 1. In this paper, we give a complete classification of finite groups G with |L _e (G)| ≤ 2e for every e dividing |G|.     

Small prime solutions to cubic equations

Let a_1,..., a_9 be nonzero integers not of the same sign, and let b be an integer. Suppose that a_1,..., a_9 are pairwise coprime and a_1 + + a_9 ≡ b(mod 2). We apply the p-adic method of Davenport to find an explicit P = P(a_1,..., a_9, n) such that the cubic equation a_1p_1~3+ + a9p_9~3= b is solvable with p_j 《 P for all 1 ≤ j ≤ 9. It is proved that one can take P = max{|a_1|,..., |a_9|}~c+ |b|~(1/3) with c = 2. This improves upon the earlier result with c = 14 due to Liu(2013).     

Strictly Deza line graphs

For a given graph G, its line graph L(G) is defined as the graph with vertex set equal to the edge set of G in which two vertices are adjacent if and only if the corresponding edges of G have exactly one common vertex. A k-regular graph of diameter 2 on υ vertices is called a strictly Deza graph with parameters (υ, k, b, a) if it is not strongly regular and any two vertices have a or b common neighbors. We give a classification of strictly Deza line graphs.     

On Ditsman’s lemma

Let H be a subgroup of a group G generated by a finite G-invariant subset X = tU _i=1 ^k C _i that consists of elements of finite order, where C _i is a class of conjugate elements of G with representative a _i . We prove that

$$|H| \leqslant \prod\limits_{i = 1}^k {o(a_i )^{|C_i |} } ,$$

where o(a _i ) is the order of the element a _i ∈ C _i . Best estimates are obtained for some important special cases.

     

When does the zero-one <Emphasis Type="Italic">k</Emphasis>-law fail?

The limit probabilities of the first-order properties of a random graph in the Erd?s–Rényi model G(n, n^?α), α ∈ (0, 1), are studied. A random graph G(n, n^?α) is said to obey the zero-one k-law if, given any property expressed by a formula of quantifier depth at most k, the probability of this property tends to either 0 or 1. As is known, for α = 1? 1/(2^k?1 + a/b), where a > 2^k?1, the zero-one k-law holds. Moreover, this law does not hold for b = 1 and a ≤ 2^k?1 ? 2. It is proved that the k-law also fails for b > 1 and a ≤ 2^k?1 ? (b + 1)².     

Expanding curves in T1(Hn) under geodesic flow and equidistribution in homogeneous spaces

Let H = SO(n, 1) and A = {a(t): t ∈ R} be a maximal R-split Cartan subgroup of H. Let G be a Lie group containing H and Γ be a lattice of G. Let φ = gΓ ∈ G/Γ be a point of G/Γ such that its H-orbit Hx is dense in G/Γ. Let φ: I = [a, b] → H be an analytic curve. Then φ(I)x gives an analytic curve in G/Γ. In this article, we will prove the following result: if φ(I) satisfies some explicit geometric condition, then a(t)φ(I)x tends to be equidistributed in G/Γ as t → ∞. It answers the first question asked by Shah in [Sha09c] and generalizes the main result of that paper.     

Super (<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-edge-antimagic total labelings of complete bipartite graphs

An (a, d)-edge-antimagic total labeling of a graph G is a bijection f from V(G) ∪ E(G) onto {1, 2,…,|V(G)| + |E(G)|} with the property that the edge-weight set {f(x) + f(xy) + f(y) | xy ∈ E(G)} is equal to {a, a + d, a + 2d,...,a + (|E(G)| ? 1)d} for two integers a > 0 and d ? 0. An (a, d)-edge-antimagic total labeling is called super if the smallest possible labels appear on the vertices. In this paper, we completely settle the problem of the super (a, d)-edge-antimagic total labeling of the complete bipartite graph K_m,n and obtain the following results: the graph K_m,n has a super (a, d)-edge-antimagic total labeling if and only if either (i) m = 1, n = 1, and d ? 0, or (ii) m = 1, n ? 2 (or n = 1 and m ? 2), and d ∈ {0, 1, 2}, or (iii) m = 1, n = 2 (or n = 1 and m = 2), and d = 3, or (iv) m, n ? 2, and d = 1.     

Erratum to: The generalized strong recurrence for non-zero rational parameters

In the present paper, we prove that self-approximation of \({\log \zeta (s)}\) with d = 0 is equivalent to the Riemann Hypothesis. Next, we show self-approximation of \({\log \zeta (s)}\) with respect to all nonzero real numbers d. Moreover, we partially filled a gap existing in “The strong recurrence for non-zero rational parameters” and prove self-approximation of \({\zeta(s)}\) for 0 ≠ d = a/b with |a?b| ≠ 1 and gcd(a,b) = 1.     

Finite groups with some non-Abelian subgroups of non-prime-power order

Let G be a finite group and NA(G) denote the number of conjugacy classes of all nonabelian subgroups of non-prime-power order of G. The Symbol π(G) denote the set of the prime divisors of |G|. In this paper we establish lower bounds on NA(G). In fact, we show that if G is a finite solvable group, then NA(G) = 0 or NA(G) ≥ 2^|π(G)|?2, and if G is non-solvable, then NA(G) ≥ |π(G)| + 1. Both lower bounds are best possible.     

Abelian quotients and orbit sizes of solvable linear groups

Let G be a finite group, and let V be a completely reducible faithful Gmodule. It has been known for a long time that if G is abelian, then G has a regular orbit on V. In this paper we generalize this result as follows. Assuming G to be solvable, we show that G has an orbit of size at least |G/G′| on V. This also strengthens a result of Aschbacher and Guralnick in that situation. Additionally, we prove a similar generalization of the well-known result that if G is nilpotent, then G has an orbit of size at least \(\sqrt {\left| G \right|} \) on V.