Diameters of finite upper half plane graphs

Let GF(q) be a finite field of q elements. Let G denote the group of matrices M(x, y) = (^{y x}_{0 1}) over GF(q) with y ≠ 0. Fix an irreducible polynomial For each a ϵ GF(q), let X_a be the graph whose vertices are the q² − q elements of G, with two vertices M(x, y), M(v, w) joined by an edge if and only if The graphs X_a with a ϵ/ {0, t² − 4n} are (q + 1)-regular connected graphs which have received recent attention, as they've been shown to be Ramanujan graphs. We determine the diameter of these graphs X_a. © 1996 John Wiley & Sons, Inc.     

Reed-Muller codes and Barnes-Wall lattices: Generalized multilevel constructions and representation over GF(2<Superscript><Emphasis Type="Italic">q</Emphasis></Superscript>)

Generalized multilevel constructions for binary RM(r,m) codes using projections onto GF(2 ^q ) are presented. These constructions exploit component codes over GF(2), GF(4),..., GF(2 ^q ) that are based on shorter Reed-Muller codes and set partitioning using partition chains of length-2 ^l codes. Using these constructions we derive multilevel constructions for the Barnes-Wall Λ(r,m) family of lattices which also use component codes over GF(2), GF(4),..., GF(2 ^q ) and set partitioning based on partition chains of length-2 ^l lattices. These constructions of Reed-Muller codes and Barnes-Wall lattices are readily applicable for their efficient decoding.      

On an Isomorphism Problem of Some Dual Hyperovals in PG(2d + 1, q) with q even

Let q = 2^l with l≥ 1 and d ≥ 2. We prove that any automorphism of the d-dimensional dual hyperoval over GF(q), constructed in [3] for any (d + 1)-dimensional GF(q)-vector subspace V in GF(qⁿ) with n≥ d + 1 and for any generator σ of the Galois group of GF(qⁿ) over GF(q), always fixes the special member X(∞). Moreover, we prove that, in case V = GF(q^d+1), two dual hyperovals and in PG(2d + 1,q), where σ and τ are generators of the Galois group of GF(q^d+1) over GF(q), are isomorphic if and only if (1) σ = τ or (2) σ τ = id. Therefore, we have proved that, even in the case q > 2, there exist non isomorphic d-dimensional dual hyperovals in PG(2d + 1,q) for d ≥ 3.     

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.     

A new characterization of L 2(q) by its noncommuting graph

Let G be a non-abelian group and associate a non-commuting graph ∇(G) with G as follows: the vertex set of ∇(G) is G\Z(G) with two vertices x and y joined by an edge whenever the commutator of x and y is not the identity. In this short paper we prove that if G is a finite group with ∇(G) ≅ ∇(M), where M = L ₂(q) (q = p ⁿ , p is a prime), then G ≅ M.      

On the distribution of points in orbits of PGL(2,q) acting on GF(q)

We prove results on the distribution of points in an orbit of PGL(2,q) acting on an element of GF(qⁿ). These results support a conjecture of Klapper. More precisely, we show that the points in an orbit are uniformly distributed if n is small with respect to q.     

Order of elements in the groups related to the general linear group

For a natural number n and a prime power q the general, special, projective general and projective special linear groups are denoted by GL_n(q), SL_n(q), PGL_n(q) and PSL_n(q), respectively. Using conjugacy classes of elements in GL_n(q) in terms of irreducible polynomials over the finite field GF(q) we demonstrate how the set of order elements in GL_n(q) can be obtained. This will help to find the order of elements in the groups SL_n(q), PGL_n(q) and PSL_n(q). We also show an upper bound for the order of elements in SL_n(q).     

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     

Parabolic permutation representations of the groups2 F 4(q) and3 D 4(q 3)

In the paper, the ranks, degrees, subdegrees, and double centralizers of permutation representations of the bounded groups² F ₄(q) and³ D ₄(q ³) with respect to parabolic maximal subgroups of nonminimal index are found. Translated fromMatematicheskie Zametki, Vol. 67, No. 1, pp. 69–76, January, 2000.     

On the Geometry of Hermitian Matrices of Order Three Over Finite Fields

Some geometry of Hermitian matrices of order three over GF(q²) is studied. The variety coming from rank 2 matrices is a cubic hypersurface M₇³of PG(8,q ) whose singular points form a variety H corresponding to all rank 1 Hermitian matrices. BesideM₇³ turns out to be the secant variety of H. We also define the Hermitian embedding of the point-set of PG(2, q²) whose image is exactly the variety H. It is a cap and it is proved that PGL(3, q²) is a subgroup of all linear automorphisms of H. Further, the Hermitian lifting of a collineation of PG(2, q²) is defined. By looking at the point orbits of such lifting of a Singer cycle of PG(2, q²) new mixed partitions of PG(8,q ) into caps and linear subspaces are given.     

On arcs sharing the maximum number of points with ovals in cyclic affine planes of odd order

The sporadic complete 12‐arc in PG(2, 13) contains eight points from a conic. In PG(2,q) with q>13 odd, all known complete k‐arcs sharing exactly ½(q+3) points with a conic 𝒞 have size at most ½(q+3)+2, with only two exceptions, both due to Pellegrino, which are complete (½(q+3)+3) arcs, one in PG(2, 19) and another in PG(2, 43). Here, three further exceptions are exhibited, namely a complete (½(q+3)+4)‐arc in PG(2, 17), and two complete (½(q+3)+3)‐arcs, one in PG(2, 27) and another in PG(2, 59). The main result is Theorem 6.1 which shows the existence of a (½(q^r+3)+3)‐arc in PG(2,q^r) with r odd and q≡3 (mod 4) sharing ½(q^r+3) points with a conic, whenever PG(2,q) has a (½(q^r+3)+3)‐arc sharing ½(q^r+3) points with a conic. A survey of results for smaller q obtained with the use of the MAGMA package is also presented. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 25–47, 2010     

Quasirecognition by the set of element orders of the groups E 6( q ) and 2 E 6( q )

We prove that if L is one of the simple groups E ₆(q) and ² E ₆(q) and G is some finite group with the same spectrum as L, then the commutant of G/F(G) is isomorphic to L and the quotient G/G′ is a cyclic {2,3}-group. Original Russian Text Copyright ? 2007 Kondrat’ev A. S. The author was supported by the Russian Foundation for Basic Research (Grant 04-01-00463) and the RFBR-NSFC (Grant 05-01-39000). __________ Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 48, No. 6, pp. 1250–1271, November–December, 2007.     

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).     

Recursive constructions of -polynomials over

This paper presents procedures for constructing irreducible polynomials over GF(2^s) with linearly independent roots (or normal polynomials or N-polynomials). For a suitably chosen initial N-polynomial F₀(x)GF(2^s) of degree n, polynomials F_k(x)GF(2^s) of degrees n2^k are constructed by iteratively applying the transformation x→x+x^-1, and their roots are shown to form a normal basis of GF(2^sn2k) over GF(2^s). In addition, the sequences are shown to be trace compatible, i.e., the trace map T_{GF(2^sn2k+1)/GF(2^sn2k)} fromGF(2^sn2k+1) onto GF(2^sn2k) maps the roots of F_k+1(x) onto those of F_k(x).     

The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q)

A twofold blocking set (double blocking set) in a finite projective plane Π is a set of points, intersecting every line in at least two points. The minimum number of points in a double blocking set of Π is denoted by τ₂(Π). Let PG(2,q) be the Desarguesian projective plane over GF(q), the finite field of q elements. We show that if q is odd, not a prime, and r is the order of the largest proper subfield of GF(q), then τ₂PG(2,q))≤ 2(q+(q‐1)/(r‐1)). For a finite projective plane Π, let denote the maximum number of classes in a partition of the point‐set, such that each line has at least two points in some partition class. It can easily be seen that (?) for every plane Π on v points. Let , p prime. We prove that for , equality holds in (?) if q and p are large enough.     

Maximal Subgroups of Finite Orthogonal Groups Stabilizing Spreads of Lines

We prove that, for q odd and n ≥ 3, the group G = O _n (q ²) · 2 is maximal in either the orthogonal group O _2n (q) or the special orthogonal group SO _2n (q). The group G corresponds to the stabilizer of a spread of lines of PG(2n ? 1, q) in which some lines lie on a quadric, some are secant to the quadric, and others are external to the quadric.     

On the Validity of Thompson's Conjecture for Finite Simple Groups

In this article, we prove a conjecture of J. G. Thompson for the finite simple group ² D _n (q). More precisely, we show that every finite group G with the property Z(G) = 1 and N(G) = N(² D _n (q)) is necessarily isomorphic to ² D _n (q). Note that N(G) is the set of lengths of conjugacy classes of G.     

Character tables of the association schemes coming from the action of G 2(q) on hyperplanes of type O 6 ε (q)

The character tables of the commutative association schemes coming from the action of the Chevalley group G ₂(q) on the set Ω _ε of hyperplanes of type O ₆ ^ε (q) in the seven dimensional orthogonal geometry over GF(q) related to the orthogonal group O ₇(q) are constructed by modifying the character tables of the association schemes obtained from the action of O ₇(q) on Ω _ε .     

Pure quantitative characterization of finite simple groups

Let G be a finite group, and let π _e (G) be the set of all element orders of G. In this short paper we prove that π _e (B _n (q)) ≠ π _e (C _n (q)) for all odd q.