Characterization of 3-Rewritable Finite Nilpotent Groups

Let n be an integer greater than 1. A group G is said to be “ n-rewritable” whenever for every n elements x ₁,…,x _n of G, there exist distinct permutations τ, σ on the set {1,2,…, n} such that x _τ(1) ··· x _τ(n) = x _{σ (1)} ··· x _{σ (n)}. In this article, we complete the classification of 3-rewritable finite nilpotent groups and prove that a finite nilpotent group G is 3-rewritable if and only if G has an abelian subgroup of index 2 or the derived subgroup has order < 6.     

Groups with Many Rewritable Products

For any integer n ≥ 2, a group G is said to have the n-rewritable property R _n if every infinite subset X of G contains n elements x ₁,…, x _n such that the product x ₁…x _n  = x _σ(1)…x _σ(n) for some permutation σ ≠ 1. We show here that if G satisfies R _n , then G has a subgroup N of finite index with a finite central subgroup A of N such that the exponent of (N/A)/Z(N/A) is finite and has size bounded by (n ? 1)!. This extends the main result in [4 Curzio , M. , Longobardi , P. , Maj , M. , Rhemtulla , A. ( 1992 ). Groups with many rewritable products . Proc. AMS. 115 ( 4 ): 931 – 934 .[Crossref], [Web of Science ®] , [Google Scholar]] which asserts that a group G is an R _n group for some integer n if and only if G has a normal subgroup F such that G/F is finite, F is an FC-group, and the exponent of F/Z(F) is finite.     

Symmetric words in metabelian groups

An n-ary word w(x₁,…,x_n) is called n-symmetric for a group G if w(g₁,…,g_n) = w(g_{σ 1},…,g_{σ n}) for all g₁,…,g_n in G and all permu¬tations a in the symmetric group S_n. In this note we describe 2 and 3-symmetric words in free metabelian groups and metabelian groups of nilpotency class c, for arbitrary c.     

A new class of multiset Wilf equivalent pairs

We say the pair of patterns (σ,τ) is multiset Wilf equivalent if, for any multiset M, the number of permutations of M that avoid σ is equal to the number of permutations of M that avoid τ. In this paper, we find a large new class of multiset Wilf equivalent pairs, namely, the pair (σ_n-2(n-1)n, σ_n-2n(n-1)), for n?3 and σ_n-2 a permutation of {1^x₁,2^x₂,…,(n-2)^x_n-2}. It is the most general multiset Wilf equivalence result to date.     

Krull Dimension and Deviation in Certain Parafree Groups

Hanna Neumann asked whether it was possible for two non-isomorphic residually nilpotent finitely generated (fg) groups, one of them free, to share the lower central sequence. Baumslag answered the question in the affirmative and thus gave rise to parafree groups. A group G is termed parafree of rank n if it is residually nilpotent and shares the same lower central sequence with a free group of rank n. The deviation of a fg parafree group G of rank n is the difference μ(G) ? n, where μ(G) is the minimum possible number of generators of G.

Let G be fg; then Hom(G, SL ₂?) inherits the structure of an algebraic variety, denoted by R(G). If G is an n generated parafree group, then the deviation of G is 0 iff Dim(R(G)) = 3n. It is known that for n ≥ 2 there exist infinitely many parafree groups of rank n and deviation 1 with non-isomorphic representation varieties of dimension 3n. In this paper it is shown that given integers n ≥ 2 and k ≥ 1, there exists infinitely many parafree groups of rank n and deviation k with non-isomorphic representation varieties of dimension different from 3n; in particular, there exist infinitely many parafree groups G of rank n with Dim(R(G)) > q, where q ≥ 3n is an arbitrary integer.     

Some Results on p-Nilpotence and Supersolvability of Finite Groups

Let G be a finite group. A subgroup K of a group G is called an ?-subgroup of G if N _G (K) ∩ K ^x  ≦ K for all x ? G. The set of all ?-subgroups of G will be denoted by ?(G). Let P be a nontrivial p-group. A chain of subgroups 1 = P ₀ ? P ₁ ? ··· ? P _n  = P is called a maximal chain of P provided that |P _i : P _i?1| = p, i = 1, 2, ···, n. A nontrivial p-subgroup P of G is called weakly supersolvably embedded in G if P has a maximal chain 1 = P ₀ ? P ₁ ? ··· ? P _i  ? ··· ? P _n  = P such that P _i  ? ?(G) for i = 1, 2, ···, n. Using the concept of weakly supersolvably embedded, we obtain new characterizations of p-nilpotent and supersolvable finite groups.     

Relatively Free Nilpotent Torsion-Free Groups and Their Lie Algebras

Let K be a field of characteristic zero. For a torsion-free finitely generated nilpotent group G, we naturally associate four finite dimensional nilpotent Lie algebras over K, ? _K (G), grad^(?)(? _K (G)), grad^(g)(exp ? _K (G)), and L _K (G). Let 𝔗 _c be a torsion-free variety of nilpotent groups of class at most c. For a positive integer n, with n ≥ 2, let F _n (𝔗 _c ) be the relatively free group of rank n in 𝔗 _c . We prove that ? _K (F _n (𝔗 _c )) is relatively free in some variety of nilpotent Lie algebras, and ? _K (F _n (𝔗 _c )) ? L _K (F _n (𝔗 _c )) ? grad^(?)(? _K (F _n (𝔗 _c ))) ? grad^(g)(exp ? _K (F _n (𝔗 _c ))) as Lie algebras in a natural way. Furthermore, F _n (𝔗 _c ) is a Magnus nilpotent group. Let G ₁ and G ₂ be torsion-free finitely generated nilpotent groups which are quasi-isometric. We prove that if G ₁ and G ₂ are relatively free of finite rank, then they are isomorphic. Let L be a relatively free nilpotent Lie algebra over ? of finite rank freely generated by a set X. Give on L the structure of a group R, say, by means of the Baker–Campbell–Hausdorff formula, and let H be the subgroup of R generated by the set X. We show that H is relatively free in some variety of nilpotent groups; freely generated by the set X, H is Magnus and L ? ?_?(H) ? L _?(H) as Lie algebras. For relatively free residually torsion-free nilpotent groups, we prove that ? _K and L _K are isomorphic as Lie algebras. We also give an example of a finitely generated Magnus nilpotent group G, not relatively free, such that ?_?(G) is not isomorphic to L _?(G) as Lie algebras.     

A Symmetric Presentation for J 1

Abstract

We give a computer-free proof that the sporadic simple group J ₁ is a isomorphic to the progenitor 2*⁵ : A ₅ factorized over a single relation. Precisely, we prove that J ₁ is defined by the presentation ?x, y, t ∣ x ⁵ = y ³ = (xy)² = 1 = t ² = [y, t] = [y, t ^{x 3} ] = (xt)⁷?.     

Definability in algebraically closed groups

Let K be an abstract class of groups such that a countable group U exists possessing the following properties: 1) an arbitrary finitely generated subgroup of U belongs to K; 2) an arbitrary finitely generated subgroup from K is imbedded in U; 3) a recursive representaion of the group U exists with a solvable word identity problem. Then for arbitrary n ≥ 1 there exists ??-equation Ψ_n(v₀...v_n?1) such that for an arbitrary algebraically closed group G and for arbitrary x₀...x_n?1 ε G Classes of finite free nilpotent groups satisfy the conditions of the theorem.     

Some Properties of Bell Groups

For any integer n ≠ 0,1, a group G is said to be “n-Bell” if it satisfies the identity [x ⁿ ,y] = [x,y ⁿ ]. It is known that if G is an n-Bell group, then the factor group G/Z ₂(G) has finite exponent dividing 12n ⁵(n ? 1)⁵. In this article we show that this bound can be improved. Moreover, we prove that every n-Bell group is n-nilpotent; consequently, using results of Baer on finite n-nilpotent groups, we give the structure of locally finite n-Bell groups. Finally, we are concerned with locally graded n-Bell groups for special values of n.     

Prophet Regions for Independent [0, 1]-Valued Random Variables with Random Discounting

Abstract

Let X ₁, X ₂… and B ₁, B ₂… be mutually independent [0, 1]-valued random variables, with EB _j  = β > 0 for all j. Let Y _j  = B ₁ … sB _j?1 X _j for j ≥ 1. A complete comparison is made between the optimal stopping value V(Y ₁,…,Y _n ):=sup{EY _τ:τ is a stopping rule for Y ₁,…,Y _n } and E(max _1≤j≤n Y _j ). It is shown that the set of ordered pairs {(x, y):x = V(Y ₁,…,Y _n ), y = E(max _1≤j≤n Y _j ) for some sequence Y ₁,…,Y _n obtained as described} is precisely the set {(x, y):0 ≤ x ≤ 1, x ≤ y ≤ Ψ _{n, β}(x)}, where Ψ _{n, β}(x) = [(1 ? β)n + 2β]x ? β^?(n?2) x ² if x ≤ β ^n?1, and Ψ _{n, β}(x) = min _j≥1{(1 ? β)jx + β ^j } otherwise. Sharp difference and ratio prophet inequalities are derived from this result, and an analogous comparison for infinite sequences is obtained.     

Random and Deterministic Triangle Generation of Three-Dimensional Classical Groups III

Let p₁, p₂, p₃ be primes. This is the final paper in a series of three on the (p₁, p₂, p₃)-generation of the finite projective special unitary and linear groups PSU ₃(pⁿ), PSL ₃(pⁿ), where we say a noncyclic group is (p₁, p₂, p₃)-generated if it is a homomorphic image of the triangle group T_{p1, p2, p3} . This article is concerned with the case where p₁ = 2 and p₂ ≠ p₃. We determine for any primes p₂ ≠ p₃ the prime powers pⁿ such that PSU ₃(pⁿ) (respectively, PSL ₃(pⁿ)) is a quotient of T = T_{2, p2, p3} . We also derive the limit of the probability that a randomly chosen homomorphism in Hom(T, PSU ₃(pⁿ)) (respectively, Hom(T, PSL ₃(pⁿ))) is surjective as pⁿ tends to infinity.     

Automorphisms of Relatively Free Nilpotent Lie Algebras

Let L be a relatively free nilpotent Lie algebra over ? of rank n and class c, with n ≥ 2; freely generated by a set 𝒵. Give L the structure of a group, denoted by R, by means of the Baker–Campbell–Hausdorff formula. Let G be the subgroup of R generated by the set 𝒵 and N _Aut(L)(G) the normalizer in Aut(L) of the set G. We prove that the automorphism group of L is generated by GL _n (?) and N _Aut(L)(G). Let H be a subgroup of finite index in Aut(G) generated by the tame automorphisms and a finite subset X of IA-automorphisms with cardinal s. We construct a set Y consisting of s + 1 IA-automorphisms of L such that Aut(L) is generated by GL _n (?) and Y. We apply this particular method to construct generating sets for the automorphism groups of certain relatively free nilpotent Lie algebras.     

Prime and composite integers close to powers of a number

We prove that, for any real numbers ξ ≠ 0 and ν, the sequence of integer parts [ξ2 ⁿ  + ν], n = 0, 1, 2, . . . , contains infinitely many composite numbers. Moreover, if the number ξ is irrational, then the above sequence contains infinitely many elements divisible by 2 or 3. The same holds for the sequence [ξ( ? 2) ⁿ  + ν _n ], n = 0, 1, 2, . . . , where ν ₀, ν ₁, ν ₂, . . . all lie in a half open real interval of length 1/3. For this, we show that if a sequence of integers x ₁, x ₂, x ₃, . . . satisfies the recurrence relation x _n+d  = cx _n  + F(x _n+1, . . . , x _n+d-1) for each n  ≥  1, where c ≠ 0 is an integer, \({F(z_1,\dots,z_{d-1}) \in \mathbb {Z}[z_1,\dots,z_{d-1}],}\) and lim _{n→ ∞}|x _n | = ∞, then the number |x _n | is composite for infinitely many positive integers n. The proofs involve techniques from number theory, linear algebra, combinatorics on words and some kind of symbolic computation modulo 3.     

Minimal Blocking Sets in PG(n, 2) and Covering Groups by Subgroups

In this article we prove that a set of points B of PG(n, 2) is a minimal blocking set if and only if ?B? = PG(d, 2) with d odd and B is a set of d + 2 points of PG(d, 2) no d + 1 of them in the same hyperplane. As a corollary to the latter result we show that if G is a finite 2-group and n is a positive integer, then G admits a ? _n+1-cover if and only if n is even and G? (C ₂) ⁿ , where by a ? _m -cover for a group H we mean a set 𝒞 of size m of maximal subgroups of H whose set-theoretic union is the whole H and no proper subset of 𝒞 has the latter property and the intersection of the maximal subgroups is core-free. Also for all n < 10 we find all pairs (m,p) (m > 0 an integer and p a prime number) for which there is a blocking set B of size n in PG(m,p) such that ?B? = PG(m,p).     

On Groups with a CC(n)-Subgroup

A subgroup H of G is a CC(n)-subgroup of G if |G: H| >n and |C_G(x): C_H(x)| ≤n for each element x ∈ H ? {1}. In this article, we study the finite p-groups with a nontrivial CC(p)-subgroup, and the locally nilpotent groups with a nontrivial CC(n)-subgroup.