Characterizations of Translation Generalized Quadrangles

If x is a regular point of the generalizedquadrangle of order (s,t), s 1 t, then x defines a dual net . If contains a line L of regularpoints and if for at least one point x on Lthe automorphism group of the dual net satisfies certain transitivityproperties, then is a translation generalized quadrangle. Thisresult has many applications. We give one example. Ifs=t 1, then is a dual affine plane. Let be a generalizedquadrangle of orders,s odd and s 1, which contains a lineL of regular points. If for at least one pointx on L the plane is Desarguesian, then is isomorphic to the classical generalizedquadrangleW(s).     

A Necessary and Sufficient Condition for the Existence of Some Ternary [n, k, d] Codes Meeting the Greismer Bound

Let k and d be any integers such that k 4 and . Then there exist two integers and in {0,1,2} such that . The purpose of this paper is to prove that (1) in the case k 5 and (,) = (0,1), there exists a ternary code meeting the Griesmer bound if and only if and (2) in the case k 4 and (,) = (0,2) or (1,1), there is no ternary code meeting the Griesmer bound for any integers k and d and (3) in the case k 5 and , there is no projective ternary code for any integers k and such that 1k-3, where and for any integer i 0. In the special case k=6, it follows from (1) that there is no ternary linear code with parameters [233,6,154] , [234,6,155] or [237,6,157] which are new results.     

The Invariants of the Clifford Groups

The automorphism group of the Barnes-Wall lattice L _m in dimension 2 ^m (m ; 3) is a subgroup of index 2 in a certain Clifford group of structure 2 ₊ ^1+2m . O ⁺(2m,2). This group and its complex analogue of structure .Sp(2m, 2) have arisen in recent years in connection with the construction of orthogonal spreads, Kerdock sets, packings in Grassmannian spaces, quantum codes, Siegel modular forms and spherical designs. In this paper we give a simpler proof of Runge@apos;s 1996 result that the space of invariants for of degree 2k is spanned by the complete weight enumerators of the codes , where C ranges over all binary self-dual codes of length 2k; these are a basis if m k - 1. We also give new constructions for L _m and : let M be the -lattice with Gram matrix . Then L _m is the rational part of M ^m, and = Aut(M^m). Also, if C is a binary self-dual code not generated by vectors of weight 2, then is precisely the automorphism group of the complete weight enumerator of . There are analogues of all these results for the complex group , with doubly-even self-dual code instead of self-dual code.     

On the Nonexistence of q-ary Linear Codes of Dimension Five

There do not exist codes over the Galois field GF attaining the Griesmer bound for for andfor for .     

On Sparse Parity Check Matrices

We consider the extremal problem to determine the maximal number of columns of a 0-1 matrix with rows and at most ones in each column such that each columns are linearly independent modulo . For fixed integers and , we shall prove the probabilistic lower bound = ; for a power of , we prove the upper bound which matches the lower bound for infinitely many values of . We give some explicit constructions.     

On Complete Arcs Arising from Plane Curves

We point out an interplay between -Frobenius non-classical plane curves and complete -arcs in . A typical example that shows how this works is the one concerning an Hermitian curve. We present some other examples here which give rise to the existence of new complete -arcs with parameters and being a power of the characteristic. In addition, for q a square, new complete -arcs with either and or and are constructed by using certain reducible plane curves.     

(C_k \oplus G,k,\lambda ) Difference Families

Let G be an additive group and C _k be the additive group of the ring Z _k of residues modulo k. If there exist a (G, k, ) difference family and a (G, k, ) perfect Mendelsohn difference family, then there also exists a difference family. If the (G, k, ) difference family and the (G, k, ) perfect Mendelsohn difference family are further compatible, then the resultant difference family is elementary resolvable. By first constructing several series of perfect Mendelsohn difference families, many difference families and elementary resolvable difference families are thus obtained.     

Designs in Additive Codes over GF(4)

In this paper we discuss the security of digital signature schemes based on error-correcting codes. Several attacks to the Xinmei scheme are surveyed, and some reasons given to explain why the Xinmei scheme failed, such as the linearity of the signature and the redundancy of public keys. Another weakness is found in the Alabbadi-Wicker scheme, which results in a universal forgery attack against it. This attack shows that the Alabbadi-Wicker scheme fails to implement the necessary property of a digital signature scheme: it is infeasible to find a false signature algorithm D from the public verification algorithm E such that E(D ( )) = for all messages . Further analysis shows that this new weakness also applies to the Xinmei scheme.     

Eine Variante des Fano-Axioms fü angeordnete Ebenen

An ordered plane is an incidence structure ( ) with an order function , which satisfies the axioms (G), (V) and (S), but no continuation--axiom is required. Points a, b E are said to be in distinct sides of a line iff and in the same side if , respectively. For any lines , and we prove that if b,c are in the same side of line A and a,c are in the same side of B , then a and b are in distinct sides of C. As conclusions we deduce that is harmonic and that in each complete quadrangle the intersection points of the diagonals are never collinear, which is known as the axiom of Fano. So the Fano-axiom holds in each ordered plane, and also in those with boundary points.     

Spin Models and Strongly Hyper-Self-Dual Bose-Mesner Algebras

We introduce the notion of hyper-self-duality for Bose-Mesner algebras as a strengthening of formal self-duality. Let denote a Bose-Mesner algebra on a finite nonempty set X. Fix p X, and let and denote respectively the dual Bose-Mesner algebra and the Terwilliger algebra of with respect to p. By a hyper-duality of , we mean an automorphism of such that for all ; and is a duality of . is said to be hyper-self-dual whenever there exists a hyper-duality of . We say that is strongly hyper-self-dual whenever there exists a hyper-duality of which can be expressed as conjugation by an invertible element of . We show that Bose-Mesner algebras which support a spin model are strongly hyper-self-dual, and we characterize strong hyper-self-duality via the module structure of the associated Terwilliger algebra.     

Generalized Harish-Chandra Modules: A New Direction in the Structure Theory of Representations

Let be a reductive Lie algebra over C. We say that a -module M is a generalized Harish-Chandra module if, for some subalgebra , M is locally -finite and has finite -multiplicities. We believe that the problem of classifying all irreducible generalized Harish-Chandra modules could be tractable. In this paper, we review the recent success with the case when is a Cartan subalgebra. We also review the recent determination of which reductive in subalgebras are essential to a classification. Finally, we present in detail the emerging picture for the case when is a principal 3-dimensional subalgebra.     

On the Characterisation of AG(n,q) by its Parameters asa Nearly Triply Regular Design

We show that a non-symmetric nearly triply regular designD with and in which every line has at least q points is AG(n,q) for prime power q > 2 and positiveinteger n 3.     

On Codes Identifying Sets of Vertices in Hamming Spaces

A code is called (t, 2)-identifying if for all the words x, y(x y) and the sets (B _t (x) B _t (y)) C and are nonempty and different. Constructions of such codes and a lower bound on the cardinality of these codes are given. The lower bound is shown to be sharp in some cases. We also discuss a more general notion of -identifying codes and introduce weakly identifying codes.     

Lexicographic Order and Linearity

Let be a list of all words of , lexicographically ordered with respect to some basis. Lexicodes are codes constructed from by applying a greedy algorithm. A short proof, only based on simple principles from linear algebra, is given for the linearity of these codes. The proof holds for any ordered basis, and for any selection criterion, thus generalizing the results of several authors. An extension of the applied technique shows that lexicodes over are linear for a wide choice of bases and for a large class of selection criteria. This result generalizes a property of Conway and Sloane.     

Majorants and Extreme Points of Unit Balls in Bernstein Spaces

The Bernstein space B ^p () (1 $$ " align="middle" border="0"> 0) is the set of functions from L ^p( ) having Fourier transforms (in the sense of generalized functions) with supports in the compact segment [- , ]. Every function f has an analytic continuation onto the complex plane, which is an entire function of exponential type . The spaces B ^p ()\, are conjugate Banach spaces. Therefore, the closed unit ball in B ^p () has a rich set of extreme (boundary) points: coincides with the weakly ^* closed convex hull of its extreme points. Since, for 1< p< , B ^p () is a uniformly convex space, only the balls and have nontrivially arranged sets of extreme points. In this paper, in terms of zeros of entire functions, we obtain necessary and sufficient conditions of extremeness for functions from .     

Optimal Subcodes of Second Order Reed-Muller Codes andMaximal Linear Spaces of Bivectors of Maximal Rank

There are exactlytwo non-equivalent [32,11,12]-codes in the binaryReed-Muller code which contain and have the weight set {0,12,16,20,32}. Alternatively,the 4-spaces in the projective space over the vector space for which all points have rank 4 fall into exactlytwo orbits under the natural action of PGL(5) on .     

An Optimal Way of Moving a Sequence of Points onto a Curve in Two Dimensions

Let (t), 0 t T, be a smooth curve and let _i , i = 1, 2, , n, be a sequence of points in two dimensions. An algorithm is given that calculates the parameters t_i, i = 1, 2, , n, that minimize the function max{ _i – (t_i) ₂ : i = 1, 2, , n } subject to the constraints 0 t₁ t₂ t_n T. Further, the final value of the objective function is best lexicographically, when the distances _i – (t_i)₂, i = 1, 2, , n, are sorted into decreasing order. The algorithm finds the global solution to this calculation. Usually the magnitude of the total work is only about n when the number of data points is large. The efficiency comes from techniques that use bounds on the final values of the parameters to split the original problem into calculations that have fewer variables. The splitting techniques are analysed, the algorithm is described, and some numerical results are presented and discussed.     

On Characteristic Polynomials of Geometric Frobenius Associated to Drinfeld Modules

Let K be a function field over finite field and let be a ring consisting of elements of K regular away from a fixed place of K. Let be a Drinfeld -module defined over an -field L. In the case where L is a finite -field, we study the characteristic polynomial of the geometric Frobenius. A formula for the sign of the constant term of in terms of leading coefficient of is given. General formula to determine signs of other coefficients of is also derived. In the case where L is a global -field of generic characteristic, we apply these formulae to compute the Dirichlet density of places where the Frobenius traces have the maximal possible degree permitted by the Riemann hypothesis.     

Two Splittings of a Square Matrix

In this note it is shown that any square matrix AC ^n×n can be represented as the sum A= , where is complex symmetric and rank . The corresponding persymmetric result can be used in finding the terms of a small rank perturbed Toeplitz matrix via an O(n ²) computation. This allows one to perform fast matrix–vector products in case n is large.     

Commutants and derivation ranges

In this paper we obtain some results concerning the set , where is the closure in the norm topology of the range of the inner derivation _A defined by _A (X) = AX – XA. Here stands for a Hilbert space and we prove that every compact operator in is quasinilpotent if A is dominant, where is the closure of the range of _A in the weak topology.