The non-projective part of the Lie module for the symmetric group

The Lie module of the group algebra F\mathfrakS_n{{F\mathfrak{S}_n}} of the symmetric group is known to be not projective if and only if the characteristic p of F divides n. We show that in this case its non-projective summands belong to the principal block of F\mathfrakS_n{{F\mathfrak{S}_n}} . Let V be a vector space of dimension m over F, and let L ⁿ (V) be the n-th homogeneous part of the free Lie algebra on V; this is a polynomial representation of GL _m (F) of degree n, or equivalently, a module of the Schur algebra S(m, n). Our result implies that, when m ≥ n, every summand of L ⁿ (V) which is not a tilting module belongs to the principal block of S(m, n), by which we mean the block containing the n-th symmetric power of V.     

Test rank of an abelian product of a free Lie algebra and a free abelian Lie algebra

Let F be a free Lie algebra of rank n ≥ 2 and A be a free abelian Lie algebra of rank m ≥ 2. We prove that the test rank of the abelian product F ×A is m. Morever we compute the test rank of the algebra F/g_k( F) ^￠F/\gamma _{k}\left( F\right) ^{^{\prime }}.     

More on the generalized macaulay theorem — II

Let k₁ ? k₂? ? ? k_n be given positive integers and let S denote the set of vectors x = (x₁, x₂, … ,x_n) with integer components satisfying 0 ? x₁ ? k_ni = 1, 2, …, n. Let X be a subset of S (l)X denotes the subset of X consisting of vectors with component sum l; F(m, X) denotes the lexicographically first m vectors of X; ?X denotes the set of vectors in S obtainable by subtracting 1 from a component of a vector in X; |X| is the number of vectors in X. In this paper it is shown that |?F(e, (l)S)| is an increasing function of l for fixed e and is a subadditive function of e for fixed l.     

On the chromatic number of the general Kneser-graph

Given integers k, n, 2 < k < n, let us define a graph with vertex set V = {F ?{1, 2, …, n}: ∩F = k}, and (F, F') is an edge if |F ∩ F′| ≤ 1. We show that for n > n₀(k) the chromatic number of this graph is (k - 1)() + rs, where n = (k - 1)s + r, 0 ≤ r < k - 1.     

Generalized cartan type k lie algebras in characteristic 0

The Lie algebra of Cartan type K which occurs as a subalgebra of the Lie algebra of derivations of the polynomial algebra F[x₀, x₁,…, x_n,x_n?1,…,x_?n], where F is a field of characteristic 0, was generalized by the first author to a class which included a subalgebra of the derivations of the Laurent polynomials F[x₀,x₁,…, x_n,x_?1,…,x_?n,X₀ ^?1x₁ ^-1,…,x_n ^?1,…,x_?1 ^?1…,x_?n ^?1]A further generalization of these algebras is the main topic of this paper. We show when these algebras are simple, determine all possible     

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.     

The proof of a conjecture concerning the intersection of k-generalized Fibonacci sequences

For k ≥ 2, the k-generalized Fibonacci sequence (F _n ^(k) ) _n is defined by the initial values 0, 0, …, 0,1 (k terms) and such that each term afterwards is the sum of the k preceding terms. In 2005, Noe and Post conjectured that the only solutions of Diophantine equation F _m ^(k) = F _n ^(?) , with ? > k > 1, n > ? + 1, m > k + 1 are $(m,n,\ell ,k) = (7,6,3,2)and(12,11,7,3)$ . In this paper, we confirm this conjecture.     

Cyclic homology and the Macdonald conjectures

Summary LetA+(k) denote the ring [t]/t ^k+1 and letG be a reductive complex Lie algebra with exponentsm ₁, ...,m n. This paper concerns the Lie algebra cohomology ofGA ₊(k) considered as a bigraded algebra (here one of the gradings is homological degree and the other, which we callweight, is inherited from the obvious grading ofGA ₊(k)). We conjecture that this Lie algebra cohomology is an exterior algebra withk+1 generators of homological degree 2m _s +1 fors=1,2, ...,n. Of thesek+1 generators of degree 2m _s +1, one has weight 0 and the others have weights (k+1)m _s +t fort=1,2, ...,k.It is shown that this conjecture about the Lie algebra cohomology of A ₊(k) implies the Macdonald root system conjectures. Next we consider the case thatG is a classical Lie algebra with root systemA _n ,B _n ,C _n , orD _n. It is shown that our conjecture holds in the limit onn asn approaches infinity which amounts to the computation of the cyclic and dihedral cohomologies ofA+(k). Lastly we discuss the relevance of this limiting case to the case of finiten in this situation.Partially supported by NSF grant number MCS-8401718 and a Bantrell Fellowship     

Edge disjoint cycles in graphs

Ore proved in 1960 that if G is a graph of order n and the sum of the degrees of any pair of nonadjacent vertices is at least n, then G has a hamiltonian cycle. In 1986, Li Hao and Zhu Yongjin showed that if n ? 20 and the minimum degree δ is at least 5, then the graph G above contains at least two edge disjoint hamiltonian cycles. The result of this paper is that if n ? 2δ², then for any 3 ? l₁ ? l₂ ? ? ? l_k ? n, 1 = k = [(δ - 1)/2], such graph has K edge disjoint cycles with lengths l₁, l₂…l_k, respectively. In particular, when l₁ = l₂ = ? = l_k = n and k = [(δ - 1)/2], the graph contains [(δ - 1)/2] edge disjoint hamiltonian cycles.     

On the average number of records for sequences of not identically distributed random variables

The scheme of n series of independent random variables X ₁₁, X ₂₁, …, X _k1, X ₁₂, X ₂₂, …, X _k2, …, X _1n , X _2n , …, X _kn is considered. Each of these successive series X _1m , X _2m , …, X _km , m = 1, 2, …, n consists of k variables with continuous distribution functions F ₁, F ₂, …, F _k , which are the same for all series. Let N(nk) be the number of upper records of the given nk random variables, and EN(nk) be the corresponding expected value. For EN(nk) exact upper and lower estimates are obtained. Examples are given of the sets of distribution functions for which these estimates are attained.     

Mixed ramsey numbers: Chromatic numbers versus graphs

For positive integers n₁, n₂, …, n_I and graphs G_I+1, G_I+2, …, G_k, 1 ≤ / < k, the mixed Ramsey number _χ(n₁, …, n₁, G_I+1, …, G_k) is define as the least positive integer p such that for each factorization K_p = F₁⊕ … ⊕ F_⊕ F_I+1⊕ … ⊕ F_k, it it follows that χ(F_i) ≥ n_i for some i, 1 ? i ? l, or G_i is a subgraph of F_i for some i, l < i ? k. Formulas are presented for maxed Ramsey numbers in which the graphs G_I+1, G_I+2, …, G_k are connected, and in which k = I+1 and G_I+1 is arbitray.     

Disjoint skolem sequences and related disjoint structures

A Skolem sequence of order n is a sequence S = (s₁, s₂…, s²ⁿ) of 2n integers satisfying the following conditions: (1) for every k ∈ {1, 2,… n} there exist exactly two elements s_i,S_j such that S_i = S_j = k; (2) If s_i = s_j = k,i < j then j ? i = k. In this article we show the existence of disjoint Skolem, disjoint hooked Skolem, and disjoint near-Skolem sequences. Then we apply these concepts to the existence problems of disjoint cyclic Steiner and Mendelsohn triple systems and the existence of disjoint 1-covering designs. © 1993 John Wiley & Sons, Inc.     

Asymptotics for the standard and the Capelli identities

Let {c _n (St _k )} and {c _n (C _k )} be the sequences of codimensions of the T-ideals generated by the standard polynomial of degreek and by thek-th Capelli polynomial, respectively. We study the asymptotic behaviour of these two sequences over a fieldF of characteristic zero. For the standard polynomial, among other results, we show that the following asymptotic equalities hold:

A generalization of the ray-chaudhuri-wilson theorem

Let K = {k₁,…,k_r} and L = {l₁,…,l_s} be two sets of non-negative integers and assume k_i > l_j for every i,j. Let F be an L-intersecting family of subsets of a set of n elements. Assume the size of every set in F is a number from K. We conjecture that |F| ? (ⁿ_s). We prove that our conjecturer is true for any K. (with min k_i ? s) when L = {0,1,…,s ? 1}. We also show that for any K and any L, (with min k_i > max l_j) CALLING STATEMENT : © 1995 John Wiley & Sons, Inc.     

An existence theorem for antichains

Let k₁, k₂,…, k_n be given integers, 1 ? k₁ ? k₂ ? … ? k_n, and let S be the set of vectors x = (x₁,…, x_n) with integral coefficients satisfying 0 ? x_i ? k_i, i = 1, 2, 3,…, n. A subset H of S is an antichain (or Sperner family or clutter) if and only if for each pair of distinct vectors x and y in H the inequalities x_i ? y_i, i = 1, 2,…, n, do not all hold. Let |H| denote the number of vectors in H, let K = k₁ + k₂ + … + k_n and for 0 ? l ? K let (l)H denote the subset of H consisting of vectors h = (h₁, h₂,…, h_n) which satisfy h₁ + h₂ + … + h_n = l. In this paper we show that if H is an antichain in S, then there exists an antichain H′ in S for which |(l)H′| = 0 if $\text{l <}\text{K}\text{2}$, $\text{|(}\text{K}\text{2}\text{)H′| = |(}\text{K}\text{2}\text{)H|}$ if K is even and |(l)H′| = |(l)H| + |(K ? l)H| if $\text{l>}\text{K}\text{2}$.     

Deformations of filiform Lie algebras and symplectic structures

We study symplectic structures on filiform Lie algebras, which are niplotent Lie algebras with the maximal length of the descending central sequence. Let g be a symplectic filiform Lie algebra and dim g = 2k ≥ 12. Then g is isomorphic to some ℕ-filtered deformation either of m₀(2k) (defined by the structure relations [e ₁, e _i ] = e _i+1, i = 2,…, 2k − 1) or of V _2k , the quotient of the positive part of the Witt algebra W ₊ by the ideal of elements of degree greater than 2k. We classify ℕ-filtered deformations of V _n : [e _i , e _j ] = (j − i)e _i+1 + Σ _l≥1 c _ij ^l e _i+j+l . For dim g = n ≥ 16, the moduli space ℳ_n of these deformations is the weighted projective space . For even n, the subspace of symplectic Lie algebras is determined by a single linear equation. Published in Russian in Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2006, Vol. 252, pp. 194–216.     

GENERALISED MAXIMAL INDEPENDENCE AND CLIQUE NUMBERS OF GRAPHS

Abstract

A set B of vertices of a graph G = (V,E) is a k-maximal independent set (kMIS) if B is independent but for all ?-subsets X of B, where ? ? k—1, and all (? + 1)-subsets Y of V—B, the set (B—X) u Y is dependent. A set S of vertices of C is a k-maximal clique (kMc) of G iff S is a kMIS of [Gbar]. Let β_k, (G) (w_k(G) respectively) denote the smallest cardinality of a kMIS (kMC) of G—obviously β_k(G) = w_k([Gbar]). For the sequence m₁ ? m₂ ?…? m_n = r of positive integers, necessary and sufficient conditions are found for a graph G to exist such that w_k(G) = m_k for k = 1,2,…,n and w(G) = r (equivalently, β_k(G) = m_k for k = 1,2,…,n and β(G) = r). Define s_k(?,m) to be the largest integer such that for every graph G with at most s_k(?,m) vertices, β_k(G) ? ? or w_k(G) ? m. Exact values for s_k(?,m) if k ≥ 2 and upper and lower bounds for s₁(?,m) are de termined.     

Finite-dimensional Perron effect of change of all values of characteristic exponents of differential systems

We obtain a finite-dimensional Perron effect of change of values λ ₁ ≤ … ≤ λ _n < 0 of all arbitrarily specified negative characteristic exponents of the n-dimensional system of linear approximation with infinitely differentiable bounded coefficients to arbitrarily specified, arranged in ascending order, values β _k ≥ λ _k , k = 1, …, n, of characteristic exponents of all nontrivial solutions of an n-dimensional nonlinear differential system with an infinitely differentiable perturbation of arbitrary order m > 1 of smallness in a neighborhood of the origin and growth outside it. Each value β _k is realized by all nontrivial solutions of the perturbed system issuing from the difference R ^k |R ^k?1 of embedded subspaces R ¹ ? R ² ? … ? R ⁿ .     

Monomial modules and graded Betti numbers

Let K be a field, S = K[x ₁,…, x _n ], the polynomial ring over K, and let F be a finitely generated graded free S-module with homogeneous basis. Certain invariants, such as the Castelnuovo-Mumford regularity and the graded Betti numbers of submodules of F, are studied; in particular, the componentwise linear submodules of F are characterized in terms of their graded Betti numbers.