Linear (q+1)-fold Blocking Sets in PG(2, q)

A (q+1)-fold blocking set of size (q+1)(q⁴+q²+1) in PG(2, q⁴) which is not the union of q+1 disjoint Baer subplanes, is constructed     

Mixed partitions of PG(3,q)

A mixed partition of PG(2n−1,q²) is a partition of the points of PG(2n−1,q²) into (n−1)-spaces and Baer subspaces of dimension 2n−1. In (Bruck and Bose, J. Algebra 1 (1964) 85) it is shown that such a mixed partition of PG(2n−1,q²) can be used to construct a (2n−1)-spread of PG(4n−1,q) and hence a translation plane of order q²ⁿ. In this paper, we provide several new examples of such mixed partitions in the case when n=2.     

Matroids with No (q+2)-Point-Line Minors

It is known that a geometry with rankrand no minor isomorphic to the (q+2)-point line has at most (q^r−1)/(q−1) points, with strictly fewer points ifr>3 andqis not a prime power. Forqnot a prime power andr>3, we show thatq^r−1−1 is an upper bound. Forqa prime power andr>3, we show that any rank-rgeometry with at leastq^r−1points and no (q+2)-point-line minor is representable overGF(q). We strengthen these bounds toq^r−1−(q^r−2−1)/(q−1)−1 andq^r−1−(q^r−2−1)/(q−1) respectively whenqis odd. We give an application to unique representability and a new proof of Tutte's theorem: A matroid is binary if and only if the 4-point line is not a minor.     

关于square-full数上的函数q_k~((e))(n)的均值估计

本文研究了指数k-free数的特征函数q_k~((e))(n)(k≥3)在square-full数集中的均值估计问题.利用黎曼Zeta函数的性质以及留数定理,获得了该均值的渐近公式,推广了q_k~((e))(n)在整数集中的均值估计相关结果.     

Cyclotomic numbers and primitive idempotents in the ring GF(q)[x]/(x−1)

Let q be an odd prime power and p be an odd prime with gcd(p,q)=1. Let order of q modulo p be f, and q^f=1+pλ. Here expressions for all the primitive idempotents in the ring R_pⁿ=GF(q)[x]/(x^pn−1), for any positive integer n, are obtained in terms of cyclotomic numbers, provided p does not divide λ if n2. The dimension, generating polynomials and minimum distances of minimal cyclic codes of length pⁿ over GF(q) are also discussed.     

Analysis on the minimal representation of O(p,q): III. Ultrahyperbolic equations on

For the group O(p,q) we give a new construction of its minimal unitary representation via Euclidean Fourier analysis. This is an extension of the q=2 case, where the representation is the mass zero, spin zero representation realized in a Hilbert space of solutions to the wave equation. The group O(p,q) acts as the Möbius group of conformal transformations on , and preserves a space of solutions of the ultrahyperbolic Laplace equation on . We construct in an intrinsic and natural way a Hilbert space of solutions so that O(p,q) becomes a continuous irreducible unitary representation in this Hilbert space. We also prove that this representation is unitarily equivalent to the representation on L²(C), where C is the conical subvariety of the nilradical of a maximal parabolic subalgebra obtained by intersecting with the minimal nilpotent orbit in the Lie algebra of O(p,q).     

On difference between the spectra of the simple groups Bn(q) and Cn(q)

We prove that the nonisomorphic simple groups B _n (q) and C _n (q) have different sets of element orders. Original Russian Text Copyright ? 2007 Grechkoseeva M. A. __________ Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 48, No. 1, pp. 89–92, January–February, 2007.     

Quasi-permutation Representations of the Groups SU (3, q2) and PSU (3, q2)

A square matrix over the complex field with non-negative integral trace is called a quasi-permutation matrix. For a finite group G the minimal degree of a faithful permutation representation of G is denoted by p(G). The minimal degree of a faithful representation of G by quasi-permutation matrices over the rational and the complex numbers are denoted by q(G) and c(G) respectively. Finally r(G) denotes the minimal degree of a faithful rational valued complex character of G. In this paper p(G), q(G), c(G) and r(G) are calculated for the groups PSU (3, q²) and SU (3, q²).AMS Subject Classification (2000): 20C15     

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.