Asymptotic growth of averaged Dehn functions for nilpotent groups

It is proved that in any finite representation of any finitely generated nilpotent group of nilpotency class l ⩾ 1, the averaged Dehn function σ(n) is subasymptotic w.r.t. the function n^l+1. As a consequence it is stated that in every finite representation of a free nilpotent group of nilpotency class l of finite rank r ⩾ 2, the Dehn function σ(n) is Gromov subasymptotic. Supported by RFBR grant No. 04-01-00489. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 60–74, January–February, 2007.     

Recognizability of finite simple groups <Emphasis Type="Italic">L</Emphasis><Subscript>4</Subscript>(2<Superscript>m</Superscript>) and <Emphasis Type="Italic">U</Emphasis><Subscript>4</Subscript>(2<Superscript>m</Superscript>) by spectrum

It is proved that finite simple groups L₄(2^m), m ⩾ 2, and U₄(2^m), m ⩾ 2, are, up to isomorphism, recognized by spectra, i.e., sets of their element orders, in the class of finite groups. As a consequence the question on recognizability by spectrum is settled for all finite simple groups without elements of order 8. Supported by RFBR (grant Nos. 05-01-00797 and 06-01-39001), by SB RAS (Complex Integration project No. 1.2), and by the Ministry of Education of China (Project for Retaining Foreign Expert). Supported by NSF of Chongqing (CSTC: 2005BB8096). __________ Translated from Algebra i Logika, Vol. 47, No. 1, pp. 83–93, January–February, 2008.     

The property of being equationally Noetherian for some soluble groups

Let B be a class of groups A which are soluble, equationally Noetherian, and have a central series A = A₁ ⩾ A₂ ⩾ … A_n ⩾ … such that ⋂A_n = 1 and all factors A_n/A_n+1 are torsion-free groups; D is a direct product of finitely many cyclic groups of infinite or prime orders. We prove that the wreath product D ≀ A is an equationally Noetherian group. As a consequence we show that free soluble groups of arbitrary derived lengths and ranks are equationally Noetherian. Supported by RFBR grant No. 05-01-00292. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 46–59, January–February, 2007.     

Computing commutator length in free groups

We study commutator length in free groups. (By a commutator lengthcl(g) of an element g in a derived subgroup G′ of a group G we mean the least natural number k such that g is a product of k commutators.) A purely algebraic algorithm is constructed for computing commutator length in a free group F₂ (Thm. 1). Moreover, for every element z ε F′₂ and for any natural m, the following estimate derives:cl(z^m) ≥ (ms(z) + 6)/12, where s(z) is a nonnegative number defined by an element z (Thm. 2). This estimate is used to compute commutator length of some particular elements. By analogy with the concept of width of a derived subgroup known in group theory, we define the concept of width of a derived subalgebra. The width of a derived subalgebra is computed for an algebra P of pairs, and also for its corresponding Lie algebra P_L. The algebra of pairs arises naturally in proving Theorem 2 and enjoys a number of interesting properties. We state that in a free group F_2k with free generators a₁, b₁, ..., a_k, b_k, k εN, every natural m satisfiescl(([a₁, b₁] ... [a_k, b_k])^m)=[(2 − m)/2] + mk. For k=1, this entails a known result of Culler. The notion of a growth function as applied to a finitely generated group G is well known. Associated with a derived subgroup of F₂ is some series depending on two variables which bears information not only on the number of elements of prescribed length but also on the number of elements of prescribed commutator length. A number of open questions are formulated. Supported by RFFR grant No. 98-01-00699. Translated fromAlgebra i Logika, Vol. 39, No. 4, pp. 395–440, July–August, 2000.     

Partitioning Posets

Given a poset P = (X, ≺ ), a partition X ₁, ..., X _k of X is called an ordered partition of P if, whenever x ∈ X _i and y ∈ X _j with x ≺ y, then i ≤ j. In this paper, we show that for every poset P = (X, ≺ ) and every integer k ≥ 2, there exists an ordered partition of P into k parts such that the total number of comparable pairs within the parts is at most (m − 1)/k, where m ≥ 1 is the total number of edges in the comparability graph of P. We show that this bound is best possible for k = 2, but we give an improved bound, , for k ≥ 3, where c(k) is a constant depending only on k. We also show that, given a poset P = (X, ≺ ) and an integer 2 ≤ k ≤ |X|, we can find an ordered partition of P into k parts that minimises the total number of comparable pairs within parts in time polynomial in the size of P. We prove more general, weighted versions of these results. Supported by an EPSRC doctoral training grant.     

Topological Model Categories Generated by Finite Complexes

 Our main result states that for each finite complex L the category TOP of topological spaces possesses a model category structure (in the sense of Quillen) whose weak equivalences are precisely maps which induce isomorphisms of all [L]-homotopy groups. The concept of [L]-homotopy has earlier been introduced by the first author and is based on Dranishnikov’s notion of extension dimension. As a corollary we obtain an algebraic characterization of [L]-homotopy equivalences between [L]-complexes. This result extends two classical theorems of J. H. C. Whitehead. One of them – describing homotopy equivalences between CW-complexes as maps inducing isomorphisms of all homotopy groups – is obtained by letting L = {point}. The other – describing n-homotopy equivalences between at most (n+1)-dimensional CW-complexes as maps inducing isomorphisms of k-dimensional homotopy groups with k ⩽ n – by letting L = S ⁿ⁺¹ , n ⩾ 0. The first author was partially supported by NSERC research grant. Received December 12, 2001; in revised form September 7, 2002 Published online February 28, 2003     

Equational Noetherianness of rigid soluble groups

A group G is said to be rigid if it contains a normal series of the form G = G ₁ > G ₂ > … > G _m  > G _m + 1 = 1, whose quotients G _i /G _i + 1 are Abelian and are torsion free as right Z[G/G _i ]-modules. In studying properties of such groups, it was shown, in particular, that the above series is defined by the group uniquely. It is known that finitely generated rigid groups are equationally Noetherian: i.e., for any n, every system of equations in x ₁, …, x _n over a given group is equivalent to some of its finite subsystems. This fact is equivalent to the Zariski topology being Noetherian on G ⁿ , which allowed the dimension theory in algebraic geometry over finitely generated rigid groups to have been constructed. It is proved that every rigid group is equationally Noetherian. Supported by RFBR (project No. 09-01-00099) and by the Russian Ministry of Education through the Analytical Departmental Target Program (ADTP) “Development of Scientific Potential of the Higher School of Learning” (project No. 2.1.1.419). Translated from Algebra i Logika, Vol. 48, No. 2, pp. 258–279, March–April, 2009.     

The number of powers of 2 in a representation of large even integers (I)

Under the Generalized Riemann Hypothesis, it is proved that for any integer k⩾770 there is N_k>0 depending onk only such that every even integer ⩾N_k is a sum of two odd prime numbers andk powers of 2. The research is partially supported by RGC research grant (HKU 518/96P). The first author is supported by Post-Doctoral Fellowship of The University of Hong Kong.     

Simple Filippov superalgebras of type B(m, n)

This account is a first step toward a classification of finite-dimensional simple Filippov superalgebras over an algebraically closed field of characteristic 0. Here, n-ary Filippov superalgebras with nonzero even and odd parts are treated for the case n ⩾ 3. Supported by RFBR (grant No. 05-01-00230) and by SB RAS (Integration project No. 1.9 and Young Researchers Support grant No. 29). __________ Translated from Algebra i Logika, Vol. 47, No. 2, pp. 240–261, March–April, 2008.     

A note on the Multiplier Conjecture

In order to identify multipliers of abelian (υ, k, λ)-difference sets the First and the Second Multiplier Theorem of Hall, Ryser and Chowla, resp. of Hall and Menon, need a divisor m of n = k − λ that is coprime to υ. Moreover, both theorems require that m > λ. The famous Multiplier Conjecture asserts that the restriction m > λ is not necessary. We present a generalization of the Second Multiplier Theorem where m is not necessarily coprime to υ. Here the requirement that m > λ generalizes to the condition m/(υ, m) > λ. This gives rise to a generalized Multiplier Conjecture which asserts that this condition is not necessary. We disprove this conjecture by showing that there exist counterexamples.     

Recognition of finite simple groupsL 3(2 m ) ANDU 3(2 m ) by their element orders

It is proved that a finite group isomorphic to a simple non-Abelian group L₃(2^m) or U₃(2^m) is, up to isomorphism, recognizable by a set of its element orders. On the other hand, for every simple group S=S₄(2^m), there exist infinitely many pairwise non-isomorphic groups G with w(G)=w(S). As a consequence, we present a list of all recognizable finite simple groups G, for which 4t ∉ ω(G) with t>1. Supported by RFFR grant No. 99-01-00550, by the National Natural Science Foundation of China (grant No. 19871066), and by the State Education Ministry of China (grant No. 98083). Translated fromAlgebra i Logika, Vol. 39, No. 5, pp. 567–585, September–October, 2000.     

À propos de l’indice de composition des nombres

 We define the index of composition λ(n) of an integer n ⩾ 2 as λ(n) = log n/log γ(n), where γ(n) stands for the product of the primes dividing n, and first establish that λ and 1/λ both have asymptotic mean value 1. We then establish that, given any ɛ > 0 and any integer k ⩾ 2, there exist infinitely many positive integers n such that . Considering the distribution function F(z,x) := #{n < x : λ(n) > z}, we prove that, given 1 < z < 2 and ɛ > 0, then, if x is sufficiently large,

A characterization of alternating groups. II

Let G be a group. A subset X of G is called an A-subset if X consists of elements of order 3, X is invariant in G, and every two non-commuting members of X generate a subgroup isomorphic to A₄ or to A₅. Let X be the A-subset of G. Define a non-oriented graph Γ(X) with vertex set X in which two vertices are adjacent iff they generate a subgroup isomorphic to A₄. Theorem 1 states the following. Let X be a non-empty A-subset of G. (1) Suppose that C is a connected component of Γ(X) and H = 〈C〉. If H ∩ X does not contain a pair of elements generating a subgroup isomorphic to A₅ then H contains a normal elementary Abelian 2-subgroup of index 3 and a subgroup of order 3 which coincides with its centralizer in H. In the opposite case, H is isomorphic to the alternating group A(I) for some (possibly infinite) set I, |I| ≥ 5. (2) The subgroup 〈X^G〉 is a direct product of subgroups 〈C _α〉-generated by some connected components C _α of Γ(X). Theorem 2 asserts the following. Let G be a group and X⊆G be a non-empty G-invariant set of elements of order 5 such that every two non-commuting members of X generate a subgroup isomorphic to A₅. Then 〈XG〉 is a direct product of groups each of which either is isomorphic to A₅ or is cyclic of order 5. Supported by RFBR grant No. 05-01-00797; FP “Universities of Russia,” grant No. UR.04.01.028; RF Ministry of Education Developmental Program for Scientific Potential of the Higher School of Learning, project No. 511; Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-2069.2003.1. __________ Translated from Algebra i Logika, Vol. 45, No. 2, pp. 203–214, March–April, 2006.     

Examples of associative algebras for which the <Emphasis Type="Italic">T</Emphasis>-space of central polynomials is not finitely based

In 1988 (see [7]), S. V. Okhitin proved that for any field k of characteristic zero, the T-space CP(M ₂(k)) is finitely based, and he raised the question as to whether CP(A) is finitely based for every (unitary) associative algebra A for which 0 ≠ T(A) ⊊ CP(A). V. V. Shchigolev (see [9], 2001) showed that for any field of characteristic zero, every T-space of k ₀〈X〉 is finitely based, and it follows from this that every T-space of k ₁〈X〉 is also finitely based. This more than answers Okhitin’s question (in the affirmative) for fields of characteristic zero.     

On nondecomposable positive definite Hermitian forms over imaginary quadratic fields

Methods are presented for the construction of nondecomposable positive definite integral Hermitian forms over the ring of integers R_m of an imaginary quadratic field ℚ(√−m). Using our methods, one can construct explicitly an n-ary nondecomposable positive definite Hermitian R_m-lattice ( L, h) with given discriminant 2 for every n⩾2 (resp. n⩾13 or odd n⩾3) and square-free m = 12 k + t with k⩾1 and t∈ (1,7) (resp. k⩾1 and t = 2 or k⩾0 and t∈ 5,10,11). We study also the case for discriminant different from 2.     

Topological Model Categories Generated by Finite Complexes

 Our main result states that for each finite complex L the category TOP of topological spaces possesses a model category structure (in the sense of Quillen) whose weak equivalences are precisely maps which induce isomorphisms of all [L]-homotopy groups. The concept of [L]-homotopy has earlier been introduced by the first author and is based on Dranishnikov’s notion of extension dimension. As a corollary we obtain an algebraic characterization of [L]-homotopy equivalences between [L]-complexes. This result extends two classical theorems of J. H. C. Whitehead. One of them – describing homotopy equivalences between CW-complexes as maps inducing isomorphisms of all homotopy groups – is obtained by letting L = {point}. The other – describing n-homotopy equivalences between at most (n+1)-dimensional CW-complexes as maps inducing isomorphisms of k-dimensional homotopy groups with k ⩽ n – by letting L = S ⁿ⁺¹ , n ⩾ 0.     

（g, f）-Factorizations Randomly Orthogonal to a Subgraph in Graphs

Let G be a graph with vertex set V(G) and edge set E(G) and let g and f be two integervalued functions defined on V(G) such that 2k - 2 ≤g(x)≤f(x) for all x∈V(G). Let H be a subgraph of G with mk edges. In this paper, it is proved that every (mg m-1,mf-m 1)-graph G has (g, f)-factorizations randomly k-orthogonal to H under some special conditions.     

On automorphisms of finite Abelian <Emphasis Type="Italic">p</Emphasis>-groups

Let A be a finitely generated abelian group. We describe the automorphism group Aut(A) using the rank of A and its torsion part p-part A _p . For a finite abelian p-group A of type (k ₁, ..., k _n ), simple necessary and sufficient conditions for an n × n-matrix over integers to be associated with an automorphism of A are presented. Then, the automorphism group Aut(A) for a finite p-group A of type (k ₁, k ₂) is analyzed. This work has begin during the visit of the second author to the Faculty of Mathematics and Computer Science, Nicolaus Copernicus University during the period July 31–August 13, 2005. This visit was supported by the Nicolaus Copernicus University and a grant from Cnpq.     

Equienergetic self-complementary graphs

In this paper equienergetic self-complementary graphs on p vertices for every p = 4k, k ⩾ 2 and p = 24t + 1, t ⩾ 3 are constructed.     

Contractible Cliques in k-Connected Graphs

Kawarabayashi proved that for any integer k≥4, every k-connected graph contains two triangles sharing an edge, or admits a k-contractible edge, or admits a k-contractible triangle. This implies Thomassen's result that every triangle-free k-connected graph contains a k-contractible edge. In this paper, we extend Kawarabayashi's technique and prove a more general result concerning k-contractible cliques. Xingxing Yu was partially supported by NSF grant DMS-0245530 and NSA grant MDA-904-03-1-0052.