Invariants of free Lie algebras

Let k be a principal ideal domain with identity and characteristic zero. For a positive integer n, with n \geqq 2n \geqq 2, let H(n) be the group of all n x n matrices having determinant ±1\pm 1. Further, we write SL(n) for the special linear group. Let L be a free Lie algebra (over k) of finite rank n. We prove that the algebra of invariants L^B(n) of B(n), with B(n) ? { H(n), SL(n)}B(n) \in \{ H(n), {\rm SL}(n)\} , is not a finitely generated free Lie algebra. Let us assume that k is a field of characteristic zero and let áSem(n) ?\langle {\rm Sem}(n) \rangle be the Lie subalgebra of L generated by the semi-invariants (or Lie invariants) Sem(n). We prove that áSem(n) ?\langle {\rm Sem}(n) \rangle is not a finitely generated free Lie algebra which gives a positive answer to a question posed by M. Burrow [4].     

Hall polynomials and the fixed space of an automorphism of a finite abelian p-group

Recent work on Hall polynomials is used to study the fixed space of a random automorphism of a finite abelian p-group. An expression is found for the chance that an automorphism of an abelian p-group of type l\lambda fixes only the identity. A formula is obtained for the chance that a given subgroup H of type n\nu is the fixed space of an automorphism of an abelian p-group of type (k^l). There results generalize work of Rudvalis and Shinoda on the fixed space of an element of GL (n, q).     

Gorenstein injective dimension and Tor-depth of modules

The main aim of this paper is to obtain a dual result to the now well known Auslander-Bridger formula for G-dimension. We will show that if R is a complete Cohen-Macaulay ring with residue field k, and M is a non-injective h-divisible Ext-finite R-module of finite Gorenstein injective dimension such that for each i 3 1i \geq 1 Extⁱ (E,M) = 0 for all indecomposable injective R-modules E 1 E(k)E \neq E(k), then the depth of the ring is equal to the sum of the Gorenstein injective dimension and Tor-depth of M. As a consequence, we get that this formula holds over a d-dimensional Gorenstein local ring for every nonzero cosyzygy of a finitely generated R-module and thus in particular each such n^th cosyzygy has its Tor-depth equal to the depth of the ring whenever n 3 dn \geq d.     

The automorphism groups of Reed-Solomon codes

A class of maximum distance separable codes is introduced which includes Reed Solomon codes; extended Reed-Solomon codes, and other cyclic or pseudocyclie MDS codes studied recently. This class of codes, which we call “Cauchy codes” because of the special form of their generator matrices, forms a closed submanifold of dimension 2n - 4 in the k × (n - k)-dimensional algebraic manifold of all MDS codes of length n and dimension k. For every Cauchy code we determine the automorphism group and its underlying permutation group. Far doubly-extended Reed-Solomon codes over GF(q) the permutation group is the semilinear fractional group PΛL(2, q).     

The Problem of Freeness for Euler Monoids and Möbius Groups

The Euler monoid E_n = {(a,b,t) epsilon Z³ : a² + b² = tⁿ, n S 1, is free if and only if n is odd (Theorem 1). We extend the results of Lyndon and Ullman, and Beardon concerning the set of those rational numbers mu epsilon (-2,2) for which the matrix Möbius group G_mu generated by A= and B = is not free (Theorems 2, 3, 4).     

Factorization of Q(h(T)(x)) over a finite field where Q(x) is irreducible and h(T)(x) is linear—I

Let GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(q)(x), and let h(T)(x) be a linear polynomial in GF(q)[x], where T:x→x^q. We use properties of the linear operator h(T) to give conditions for Q(h(T)(x)) to have a root of arbitrary degree k over GF(q), and we describe how to count the irreducible factors of Q(h(T)(x)) of degree k over GF(q). In addition we compare our results with those Ore which count the number of irreducible factors belonging to a linear polynomial having index k.     

Homology of the double loop space of the homogeneous space SU(n)/SO(n)

We study the mod 2 homology of the double loop space of SU(n)/SO(n) using the Serre spectral sequence along with the Eilenberg-Moore spectral sequence. Then we also get the homology of the double loop space of the set of all Lagrangian subspaces of the symplectic vector space R²ⁿ.     

On Ricci curvature of isotropic and Lagrangian submanifolds in complex space forms

Let M ⁿ be a Riemannian n-manifold. Denote by S(p) and [`(Ric)](p)\overline {Ric}(p) the Ricci tensor and the maximum Ricci curvature on M <sup>n</sup> at a point p ? M<sup>n</sup>p\in M^n, respectively. First we show that every isotropic submanifold of a complex space form [(M)\tilde]<sup>m</sup>(4 c)\widetilde M^m(4\,c) satisfies S ￡ ((n-1)c+ [(n<sup>2</sup>)/4] H<sup>2</sup>)gS\leq ((n-1)c+ {n^2 \over 4} H^2)g, where H<sup>2</sup> and g are the squared mean curvature function and the metric tensor on M <sup>n</sup>, respectively. The equality case of the above inequality holds identically if and only if either M <sup>n</sup> is totally geodesic submanifold or n = 2 and M <sup>n</sup> is a totally umbilical submanifold. Then we prove that if a Lagrangian submanifold of a complex space form [(M)\tilde]<sup>m</sup>(4 c)\widetilde M^m(4\,c) satisfies [`(Ric)] = (n-1)c+ [(n²)/4] H²\overline {Ric}= (n-1)c+ {n^2 \over 4} H^2 identically, then it is a minimal submanifold. Finally, we describe the geometry of Lagrangian submanifolds which satisfy the equality under the condition that the dimension of the kernel of second fundamental form is constant.     

Local calibration of mass and systolic geometry

We prove the simultaneous (k, n -- k)-systolic freedom, for a pair of adjacent integers k < n/2, of a simply connected n-manifold X. Our construction, related to recent results of I. Babenko, is concentrated in a neighborhood of suitable k-dimensional submanifolds of X. We employ calibration by differential forms supported in such neighborhoods, to provide lower bounds for the (n -- k)-systoles. Meanwhile, the k-systoles are controlled from below by the monotonicity formula combined with the bounded geometry of the construction in a neighborhood of suitable (n -- k + 1)-dimensional submanifolds, in spite of the vanishing of the global injectivity radius. The construction is geometric, with the algebraic topology ingredient reduced to Poincaré duality and Thom's theorem on representing multiples of homology classes by submanifolds. The present result is di.erent from the proof, in collaboration with A. Suciu, and relying on rational homotopy theory, of the k-systolic freedom of X. Our results concerning systolic freedom contrast with the existence of stable systolic inequalities, studied in joint work with V. Bangert.     

On the k-error linear complexity of sequences with period 2pn over GF(q)

In this paper, we first optimize the structure of the Wei–Xiao–Chen algorithm for the linear complexity of sequences over GF(q) with period N =  2p ⁿ , where p and q are odd primes, and q is a primitive root modulo p ². The second, an union cost is proposed, so that an efficient algorithm for computing the k-error linear complexity of a sequence with period 2p ⁿ over GF(q) is derived, where p and q are odd primes, and q is a primitive root modulo p ². The third, we give a validity of the proposed algorithm, and also prove that there exists an error sequence e ^N , where the Hamming weight of e ^N is not greater than k, such that the linear complexity of (s + e) ^N reaches the k-error linear complexity c. We also present a numerical example to illustrate the algorithm. Finally, we present the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.     

On q-Olivier Functions

We consider words w₁· · · w_n with letters w_i ? {1, 2, 3, ?} w_i \in \{1, 2, 3, \ldots\} satisfying an up-up-down pattern like a₁ h a₂ h a₃ S a₄ h a₅ h a₆ S · · · . Attaching the (geometric) probability pq^i-1 to the letter i (with p = 1 -- q), every word gets a probability by assuming independence of letters. We are interested in the probability that a random word of length n satisfies the up-up-down condition. It turns out that one has to consider the 3 residue classes (mod 3) separately; then one can compute the associated probability generating function. They turn out to be q-analogues of so called Olivier functions.     

On the classification of semifield flocks

A classical lemma of Weil is used to characterise quadratic polynomials f with coefficients GF(qⁿ), q odd, with the property that f(x) is a non-zero square for all x∈GF(q). This characterisation is used to prove the main theorem which states that there are no subplanes of order q contained in the set of internal points of a conic in PG(2,qⁿ) for q?4n²−8n+2. As a corollary to this theorem it then follows that the only semifield flocks of the quadratic cone of PG(3,qⁿ) for those q exceeding this bound are the linear flocks and the Kantor-Knuth semifield flocks.     

Helly-type theorems for appropriate colorings of visibility sets

Summary. For positive integers q and n, think of P as the vertex set of a (qn + r)-gon, 0 ￡ r ￡ q - 1 0 \leq r \leq q - 1 . For 1 ￡ i ￡ qn + r 1 \leq i \leq qn + r , define V(i) to be a set of q consecutive points of P, starting at p(i), and let S be a subset of {V(i) : 1 ￡ i ￡ qn + r } \lbrace V(i) : 1 \leq i \leq qn + r \rbrace . A q-coloring of P = P(q) such that each member of S contains all q colors is called appropriate for S, and when 1 ￡ j ￡ q 1 \leq j \leq q , the definition may be extended to suitable subsets P(j) of P. If for every 1 ￡ j ￡ q 1 \leq j \leq q and every corresponding P(j), P(j) has a j-coloring appropriate for S, then we say P = P(q) has all colorings appropriate for S. With this terminology, the following Helly-type result is established: Set P = P(q) has all colorings appropriate for S if and only if for every (2n + 1)-member subset T of S, P has all colorings appropriate for T. The number 2n + 1 is best possible for every r 3 1 r \geq 1 . Intermediate results for q-colorings are obtained as well.     

Existence of (q, 7, 1) difference families with q a prime power

The existence of a (q,k, 1) difference family in GF(q) has been completely solved for k = 3,4,5,6. For k = 7 only partial results have been given. In this article, we continue the investigation and use Weil's theorem on character sums to show that the necessary condition for the existence of a (q,7,1) difference family in GF(q), i.e. q ≡ 1; (mod 42) is also sufficient except for q = 43 and possibly except for q = 127, q = 211, q = 31⁶ and primes q∈ [261239791, 1.236597 × 10¹³] such that in GF(q). © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 126–138, 2002; DOI 10.1002/jcd.998     

On the diophantine equation y2 = 4qn + 4q + 1

It is known that a certain class of [n, k] codes over GF(q) is related to the diophantine equation y² = 4qⁿ + 4q + 1 (1). In Parts I and II of this paper, two different, and in a certain sense complementary, methods of approach to (1) are discussed and some results concerning (1) are given as applications. A typical result is that the only solutions to (1) are (y, n) = (5, 1), (7, 2), (11, 3) when q = 3 and (y, n) = (2q + 1, 2) when q = 3^f, f >- 2.     

Efficient parallel exponentiation in using normal basis representations

Von zur Gathen proposed an efficient parallel exponentiation algorithm in finite fields using normal basis representations. In this paper we present a processor-efficient parallel exponentiation algorithm in GF(qⁿ) which improves upon von zur Gathen's algorithm. We also show that exponentiation in GF(qⁿ) can be done in O((log₂n)²/log_qn) time using n/(log₂n)² processors. Hence we get a processor-time bound of O(n/log_qn), which matches the best known sequential algorithm. Finally, we present an efficient on-line processor assignment scheme which was missing in von zur Gathen's algorithm.     

Finding Large p-Colored Diameter Two Subgraphs

Given a coloring of the edges of the complete graph K on n vertices in k colors, a p-colored subgraph of K_n is any subgraph whose edges only use colors from some p element set. We show for k̿ and k\2hphk that there is always a p-colored diameter two subgraph of K_n containing at least [((k+p)n)/(2k)]\displaystyle{(k+p)n \over 2k} vertices and that this is best possible up to an additive constant l satisfying 0hl<k\2.     

The nonexistence of ternary [105,6,68] and [230,6,152] codes

Let [n,k,d]_q-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). In this paper, the nonexistence of [105,6,68]₃ and [230,6,152]₃ codes is proved.     

On generalized Hadamard matrices of minimum rank

Generalized Hadamard matrices of order qⁿ⁻¹ (q—a prime power, n2) over GF(q) are related to symmetric nets in affine 2-(qⁿ,qⁿ⁻¹,(qⁿ⁻¹−1)/(q−1)) designs invariant under an elementary abelian group of order q acting semi-regularly on points and blocks. The rank of any such matrix over GF(q) is greater than or equal to n−1. It is proved that a matrix of minimum q-rank is unique up to a monomial equivalence, and the related symmetric net is a classical net in the n-dimensional affine geometry AG(n,q).