Elements of Prescribed Order,Prescribed Traces and Systems of Rational Functions Over Finite Fields

Let k 1 and be a system of rational functions forming a strongly linearly independent set over a finite field . Let be arbitrarily prescribed elements. We prove that for all sufficiently large extensions , there is an element of prescribed order such that is the relative trace map from onto We give some applications to BCH codes, finite field arithmetic and ordered orthogonal arrays. We also solve a question of Helleseth et~al. (Hypercubic 4 and 5-designs from Double-Error-Correcting codes, Des. Codes. Cryptgr. 28(2003). pp. 265–282) completely.classification 11T30, 11G20, 05B15     

Block Primitive 2-(<Emphasis Type="Italic">v</Emphasis>,<Emphasis Type="Italic">k</Emphasis>,1) Designs Admitting a Ree Group of Characteristic Two

Let be a 2-(v,k,1) design, and let G be a group of automorphisms of . We show that if G is block primitive, then G does not admit a Ree group as its socle.     

Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free Order

A complete classification is given of finite primitive permutation groups which contain a regular subgroup of square-free order. Then a collection of square-free numbers n is obtained such that there exists a vertex-primitive non-Cayley graph on n vertices if and only if n is a member of .     

Blocking Sets of Certain Line Sets Related to a Conic

In this paper we classify point sets of minimum size of two types (1) point sets meeting all secants to an irreducible conic of the desarguesian projective plane PG(2,q), q odd; (2) point sets meeting all external lines and tangents to a given irreducible conic of the desarguesian projective plane PG(2,q), q even.     

Local Schur’s Lemma and Commutative Semifields

A set of linear maps , V a finite vector space over a field K, is regular if to each there corresponds a unique element such that R(x)=y. In this context, Schur’s lemma implies that is a field if (and only if) it consists of pairwise commuting elements. We consider when is locally commutative: at some μ ∈V*, AB(μ)=BA(μ) for all , and has been normalized to contain the identity. We show that such locally commutative are equivalent to commutative semifields, generalizing a result of Ganley, and hence characterizing commutative semifield spreads within the class of translation planes. This enables the determination of the orders |V| for which all locally commutative on V are (globally) commutative. Similarly, we determine a sharp upperbound for the maximum size of the Schur kernel associated with strictly locally commutative . We apply our main result to demonstrate the existence of a partial spread of degree 5, with nominated shears axis, that cannot be extend to a commutative semifield spread. Finally, we note that although local commutativity for a regular linear set implies that the set of Lie products consists entirely of singular maps, the converse is false.     

On a More General Characterisation of Steiner Systems

We introduce [k,d]-sparse geometries of cardinality n, which are natural generalizations of partial Steiner systems PS(t,k;n), with d=2(k−t+1). We will verify whether Steiner systems are characterised in the following way. (*) Let be a [k,2(k−t+1)]-sparse geometry of cardinality n, with k \> t \> 1$$" align="middle" border="0"> . If , then Γ is a S(t,k;n). If (*) holds for fixed parameters t, k and n, then we say S(t,k;n) satisfies, or has, characterisation (*). We could not prove (*) in general, but we prove the Theorems 1, 2, 3 and 4, which state conditions under which (*) is satisfied. Moreover, we verify characterisation (*) for every Steiner system appearing in list of the sporadic Steiner systems of small cardinality, and the list of infinite series of Steiner systems, both mentioned in the latest edition of the book ‘Design Theory’ by T. Beth, D. Jungnickel and H. Lenz. As an interesting application, one can use these results to build (almost) maximal binary codes in the following way. Every [k,d]-sparse geometry is associated with a [k,d]-sparse binary code of the same size (let and link every block with the code word where c_i=1 if and only if the point p_i is a member of B), so one can construct maximal [k,d]-sparse binary codes using (partial) Steiner systems. These [k,d]-sparse codes can then be used as building bricks for binary codes having a bigger variety of weights (the weight of a code word is the sum of its entries).     

Elliptic Curves Suitable for Pairing Based Cryptography

For pairing based cryptography we need elliptic curves defined over finite fields whose group order is divisible by some prime with where k is relatively small. In Barreto et al. and Dupont et al. [Proceedings of the Third Workshop on Security in Communication Networks (SCN 2002), LNCS, 2576, 2003; Building curves with arbitrary small Mov degree over finite fields, Preprint, 2002], algorithms for the construction of ordinary elliptic curves over prime fields with arbitrary embedding degree k are given. Unfortunately, p is of size .We give a method to generate ordinary elliptic curves over prime fields with p significantly less than which also works for arbitrary k. For a fixed embedding degree k, the new algorithm yields curves with where or depending on k. For special values of k even better results are obtained.We present several examples. In particular, we found some curves where is a prime of small Hamming weight resp. with a small addition chain.AMS classification: 14H52, 14G50     

Fq-linear Cyclic Codes over $$ F{_q^m}$$ : D FT Approach

Codes over that are closed under addition, and multiplication with elements from F_q are called F_q-linear codes over . For m 1, this class of codes is a subclass of nonlinear codes. Among F_q-linear codes, we consider only cyclic codes and call them F_q-linear cyclic codes (F_q LC codes) over The class of F_q LC codes includes as special cases (i) group cyclic codes over elementary abelian groups (q=p, a prime), (ii) subspace subcodes of Reed–Solomon codes (n=q^m–1) studied by Hattori, McEliece and Solomon, (iii) linear cyclic codes over F_q (m=1) and (iv) twisted BCH codes. Moreover, with respect to any particular F_q-basis of , any F_qLC code over can be viewed as an m-quasi-cyclic code of length mn over F_q. In this correspondence, we obtain transform domain characterization of F_q LC codes, using Discrete Fourier Transform (DFT) over an extension field of The characterization is in terms of any decomposition of the code into certain subcodes and linearized polynomials over . We show how one can use this transform domain characterization to obtain a minimum distance bound for the corresponding quasi-cyclic code. We also prove nonexistence of self dual F_q LC codes and self dual quasi-cyclic codes of certain parameters using the transform domain characterization.AMS classification 94B05     

On the number of rational points of a plane algebraic curve

The number of F_q -rational points of a plane non-singular algebraic curve defined over a finite field F_q is computed, provided that the generic point of is not an inflexion and that is Frobenius non-classical with respect to conics. Received: 18 March 2003     

Matrix Groups Related to the Quaternion Group and Spherical Orbit Codes

We consider a finite matrix group with 3⁴· 2¹⁶ elements, which is a subgroup of the infinite group , where is the regular representation of the quaternion group and C is a matrix that transforms the regular representation Q to its cellwise-diagonal form. There is a number of ways to define the matrix C. Our aim is to make the group similar in a certain sense to a finite group. The eventual choice of an appropriate matrix C done heuristically. We study the structure of the group and use this group to construct spherical orbit codes on the unit Euclidean sphere in R⁸. These codes have code distance less than 1. One of them has 3²· 2⁸ = 2304 elements and its squared Euclidean code distance is 0.293. Communicated by: V. A. Zinoviev     

Structure of Degenerate Block Algebras

Given a non-trivial torsion-free abelian group (A,+,Q), a field F of characteristic 0, and a non-degenerate bi-additive skew-symmetric map : A A F, we define a Lie algebra = (A, ) over F with basis {e_x | x A/{0}} and Lie product [e_x,e_y] = (x,y)e_x+y. We show that is endowed uniquely with a non-degenerate symmetric invariant bilinear form and the derivation algebra Der of is a complete Lie algebra. We describe the double extension D( , T) of by T, where T is spanned by the locally finite derivations of , and determine the second cohomology group H²(D( , T),F) using anti-derivations related to the form on D( , T). Finally, we compute the second Leibniz cohomology groups HL²( , F) and HL²(D( , T), F).2000 Mathematics Subject Classification: 17B05, 17B30This work was supported by the NNSF of China (19971044), the Doctoral Programme Foundation of Institution of Higher Education (97005511), and the Foundation of Jiangsu Educational Committee.     

The Automorphism Group of Plane Algebraic Curves with Singer Automorphisms

The main result in Cossidente and Siciliano (J. Number Theory, Vol. 99 (2003) pp. 373–382) states that if a Singer subgroup of PGL(3,q) is an automorphism group of a projective, geometric irreducible, non-singular plane algebraic curve then either or . In the former case is projectively equivalent to the curve with equation X^q+1Y+Y^q+1+X=0 studied by Pellikaan. Furthermore, the curve has a very nice property from Finite Geometry point of view: apart from the three distinguished points fixed by the Singer subgroup, the set of its -rational points can be partitioned into finite projective planes . In this paper, the full automorphism group of such curves is determined. It turns out that is the normalizer of a Singer group in .     

On Some Sets with Even Valued Partition Function

Let IN be the set of positive integers, = {b₁ < ⋅s < b_h}⊂IN, N∊IN and N≥ b_h. = ₀( ,N) is the set (introduced by J.-L. Nicolas, I.Z. Ruzsa and A. Sárközy) such that {1,..., N} = and p( ,n)≡ 0 (mod 2) for n∊IN and n > N, where p( ,n) denotes the number of partitions of n with parts in . Let us denote by σ ( ,n) the sum of the divisors of n belonging to . In a paper jointly written with J.-L. Nicolas, we have recently proved that, for all k≥ 0, the sequence (σ( ,2^k n))_{n≥ 1}mod 2^k+1 is periodic with an odd period q_k. In this paper, we will characterize for any fixed odd positive integer q, the sets and the integers N such that q₀ = q, and those for which q_k = q for all k≥ 0. Moreover, a set = ₀( ,N) is constructed with the property that its period, i.e. the period of (σ( ,n))_{n≥ 1}mod 2, is 217, and for which the counting function is asymptotically equal to that of ₀({1,2,3,4,5},5) which is a set of period 31.Dedicated to Professor J.-L. Nicolas on the occasion of his 60th birthday2000 Mathematics Subject Classification: Primary—11P81, 11P83Research supported by MIRA 2002 program n^o 0203012701, Number Theory, Lyon-Monastir.     

The polynomial degree of the Grassmannian G(1,n,q) of lines in finite projective space PG(n, q)

Let G: = G(1,n,q) denote the Grassmannian of lines in PG(n,q), embedded as a point-set in PG(N, q) with For n = 2 or 3 the characteristic function of the complement of G is contained in the linear code generated by characteristic functions of complements of n-flats in PG(N, q). In this paper we prove this to be true for all cases (n, q) with q = 2 and we conjecture this to be true for all remaining cases (n, q). We show that the exact polynomial degree of is for δ: = δ(n, q) = 0 or 1, and that the possibility δ = 1 is ruled out if the above conjecture is true. The result deg( for the binary cases (n,2) can be used to construct quantum codes by intersecting G with subspaces of dimension at least      

Some Characterizations of Finite Hermitian Veroneseans

We characterize the finite Veronesean of all Hermitian varieties of PG(n,q²) as the unique representation of PG(n,q²) in PG(d,q), d n(n+2), where points and lines of PG(n,q²) are represented by points and ovoids of solids, respectively, of PG(d,q), with the only condition that the point set of PG(d,q) corresponding to the point set of PG(n,q²) generates PG(d,q). Using this result for n=2, we show that is characterized by the following properties: (1) ; (2) each hyperplane of PG(8,q) meets in q²+1, q³+1 or q³+q²+1 points; (3) each solid of PG(8,q) having at least q+3 points in common with shares exactly q²+1 points with it.51E24     

Type II Codes over $$\mathbb{Z}/2k\mathbb{Z}$$, Invariant Rings and Theta Series

We consider type II codes over finite rings . It is well-known that their gth complete weight enumerator polynomials are invariant under the action of a certain finite subgroup of , which we denote H_k,g. We show that the invariant ring with respect to H_k,g is generated by such polynomials. This is carried out by using some closely related results concerning theta series and Siegel modular forms with respect to .     

Forbidden (0,1)-vectors in Hyperplanes of $$\mathbb{R}^{n}$$: The unrestricted case

In this paper, we continue our investigation on “Extremal problems under dimension constraints” introduced [1]. The general problem we deal with in this paper can be formulated as follows. Let be an affine plane of dimension k in . Given determine or estimate .Here we consider and solve the problem in the special case where is a hyperplane in and the “forbidden set” . The same problem is considered for the case, where is a hyperplane passing through the origin, which surprisingly turns out to be more difficult. For this case we have only partial results.AMS Classification: 05C35, 05B30, 52C99     

Weierstrass Semigroups and Codes from a Quotient of the Hermitian Curve

We consider the quotient of the Hermitian curve defined by the equation y^q + y = x^m over where m > 2 is a divisor of q+1. For 2≤ r ≤ q+1, we determine the Weierstrass semigroup of any r-tuple of -rational points on this curve. Using these semigroups, we construct algebraic geometry codes with minimum distance exceeding the designed distance. In addition, we prove that there are r-point codes, that is codes of the form where r ≥ 2, with better parameters than any comparable one-point code on the same curve. Some of these codes have better parameters than comparable one-point Hermitian codes over the same field. All of our results apply to the Hermitian curve itself which is obtained by taking m=q +1 in the above equation Communicated by: J.W.P. Hirschfeld     

The Invariance Principle for the Total Length of the Nearest-Neighbor Graph

Let be the Poisson point process with intensity 1 in R^d and let be . We obtain a strong invariance principle for the total length of the nearest-neighbor graph on .     

Generalized quadrangles with an ovoid that is translation with respect to opposite flags

The article [6] contains the result that if a finite generalized quadrangle of order s has an ovoid that is translation with respect to two opposite flags, but not with respect to any two non-opposite flags, then is self-polar and is the set of absolute points of a polarity. In particular, if is the classical generalized quadrangle Q(4, q) then is a Suzuki-Tits ovoid. In this article, we remove the need to assume that is Q(4, q) in order to conclude that is a Suzuki-Tits ovoid by showing that the initial assumptions in fact imply that is Q(4, q). At the same time, we also relax the requirement that have order s.Received: 14 May 2004