Some New Maximal Sets of Mutually Orthogonal Latin Squares

Two ways of constructing maximal sets of mutually orthogonal Latin squares are presented. The first construction uses maximal partial spreads in PG(3, 4) \ PG(3, 2) with r lines, where r ∈ {6, 7}, to construct transversal-free translation nets of order 16 and degree r + 3 and hence maximal sets of r + 1 mutually orthogonal Latin squares of order 16. Thus sets of t MAXMOLS(16) are obtained for two previously open cases, namely for t = 7 and t = 8. The second one uses the (non)existence of spreads and ovoids of hyperbolic quadrics Q ⁺ (2m + 1, q), and yields infinite classes of q ^{2n ? 1} ? 1 MAXMOLS(q ²ⁿ ), for n ≥ 2 and q a power of two, and for n = 2 and q a power of three.     

Properties of element orders in covers for L<Subscript>n</Subscript>(<Emphasis Type="Italic">q</Emphasis>) and U<Subscript>n</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

We show that if a finite simple group G, isomorphic to PSL_n(q) or PSU_n(q) where either n ≠ 4 or q is prime or even, acts on a vector space over a field of the defining characteristic of G; then the corresponding semidirect product contains an element whose order is distinct from every element order of G. We infer that the group PSL_n(q), n ≠ 4 or q prime or even, is recognizable by spectrum from its covers thus giving a partial positive answer to Problem 14.60 from the Kourovka Notebook.     

The Existence of Complete Mappings of SL(2, q), q≡1 Modulo 4

In 1955, Hall and Paige conjectured that any finite group with a noncyclic Sylow 2-subgroup admits complete mappings. For the groups GL(2, q), SL(2, q), PSL(2, q), and PGL(2, q) this conjecture has been proved except for SL(2, q), q odd. We prove that SL(2, q), q≡1 modulo 4 admits complete mappings.     

A remark on doubly diagonalized orthogonal Latin squares

A lower and an upper bound for D(n), the maximum number of mutually orthogonal and doubly diagonalized Latin squares of order n, are given.     

On the maximality of a set of mutually orthogonal Sudoku Latin Squares

The maximum number of mutually orthogonal Sudoku Latin squares (MOSLS) of order \(n=m^2\) is \(n-m\). In this paper, we construct for \(n=q^2\), q a prime power, a set of \(q^2-q-1\) MOSLS of order \(q^2\) that cannot be extended to a set of \(q^2-q\) MOSLS. This contrasts to the theory of ordinary Latin squares of order n, where each set of \(n-2\) mutually orthogonal Latin Squares (MOLS) can be extended to a set of \(n-1\) MOLS (which is best possible). For this proof, we construct a particular maximal partial spread of size \(q^2-q+1\) in \(\mathrm {PG}(3,q)\) and use a connection between Sudoku Latin squares and projective geometry, established by Bailey, Cameron and Connelly.     

Sets of elements that pairwise generate a linear group

Let G be any of the groups (P)GL(n,q), (P)SL(n,q). Define a (simple) graph Γ=Γ(G) on the set of elements of G by connecting two vertices by an edge if and only if they generate G. Suppose that n is at least 12. Then the maximum size of a complete subgraph in Γ is equal to the chromatic number of Γ if , or if , q is odd and G=(P)SL(n,q). This work was motivated by a question of Blackburn.     

Characterization of G 2(q), where 2 < q ≡ −1(mod 3), by order components

We prove that the simple group G ₂(q), where 2 < q ≡ ?1(mod 3), is recognizable by the set of its order components. In other words, we prove that if G is a finite group with OC(G) = OC(G ₂(q)), then G ≌ G ₂(q).     

On Huppert’s Conjecture for 3 D 4(q), q ≥ 3

Let G be a finite group and cd(G) be the set of all complex irreducible character degrees of G. Bertram Huppert conjectured that if H is a finite nonabelian simple group such that cd(G) = cd(H), then G???H × A, where A is an abelian group. In this paper, we verify the conjecture for the family of simple exceptional groups of Lie type ³ D ₄(q), when q?≥?3.     

Construction of translation planes from t-spread sets

A t-spread set [1] is a set $\text{C}$ of (t + 1) × (t + 1) matrices over GF(q) such that ∥C∥ = q^t+1, 0 ? C, I?C, and det(X ? Y) ≠ 0 if X and Y are distinct elements of $\text{C}$. The amount of computation involved in constructing t-spread sets is considerable, and the following construction technique reduces somewhat this computation. Construction: Let $\text{G}$ be a subgroup of GL(t + 1, q), (the non-singular (t + 1) × (t + 1) matrices over GF(q)), such that ∥G∥|a^t+1, and det (G ? H) ≠ 0 if G and H are distinct elements of $\text{G}$. Let A₁, A₂, …, A_n?GL(t + 1, q) such that det(A_i ? G) ≠ 0 for i = 1, …, n and all G?G, and det(A_i ? A_jG) ≠ 0 for i > j and all G?G. Let $\text{C = \&{0\&} ∪ G ∪ A}{}_1\text{G ∪ … ∪ A}{}_{\mathrm{n}}\text{G}$, and ∥C∥ = q^t+1. Then $\text{C}$ is a t-spread set. A t-spread set can be used to define a left V ? W system over V(t + 1, q) as follows: x + y is the vector sum; let e?V(t + 1, q), then xoy = yM(x) where M(x) is the unique element of $\text{C}$ with x = eM(x). Theorem: Let$\text{C}$be a t-spread set and F the associatedV ? Wsystem; the left nucleus = {y | CM(y) = C}, and the middle nucleus = }y | M(y)C = C}. Theorem: For$\text{C}$constructed as aboveG ? {M(x) | x?N_λ}. This construction technique has been applied to construct a V ? W system of order 25 with ∥N_λ∥ = 6, and ∥N_μ∥ = 4. This system coordinatizes a new projective plane.     

A Family of Finite Simple Groups Which Are 2-Recognizable by Their Elements Order

Abstract

Let G be a finite group and ω(G) the set of all orders of elements in G. Denote by h(ω(G)) the number of isomorphism classes of finite groups H satisfying ω(H) = ω(G), and put h(G) = h(ω(G)). A group G is called k-recognizable if h(G) = k < ∞ , otherwise G is called non-recognizable. In the present article we will show that the simple groups PSL(3, q), where q ≡ ±2(mod 5) and (6, (q ? 1)/2) = 2, are 2-recognizable. Therefore if q is a prime power and q ≡ 17, 33, 53 or 57 (mod 60), then the groups PSL(3, q) are 2-recognizable. Hence proving the existing of an infinite families of 2-recognizable simple groups.     

Nilpotent Injectors in General Linear Groups

In a recent paper, A. Bialostocki (Israel J. Math.41 (1982), 261-273) has defined a nilpotent injector in an arbitrary finite group G to be a maximal nilpotent subgroup of G, containing a subgroup H of G of maximal order satisfying class (H) ≤2. In the present paper, the author determines the nilpotent injectors of GL(n, q) and shows that they form a unique conjugacy class of subgroups of GL(n, q). It is also proved that if n ≠ 2 or n = 2 and q ≠ 9 is not a Fermat prime >3, then the nilpotent injectors of GL(n, q) are the nilpotent subgroups of maximal order.     

Construction of the mutually orthogonal extraordinary supersquares

Our purpose is to determine the complete set of mutually orthogonal squares of order d, which are not necessary Latin. In this article, we introduce the concept of supersquare of order d, which is defined with the help of its generating subgroup in $\mathbb{F}_d \times \mathbb{F}_d$ . We present a method of construction of the mutually orthogonal supersquares. Further, we investigate the orthogonality of extraordinary supersquares, a special family of squares, whose generating subgroups are extraordinary. The extraordinary subgroups in $\mathbb{F}_d \times \mathbb{F}_d$ are of great importance in the field of quantum information processing, especially for the study of mutually unbiased bases. We determine the most general complete sets of mutually orthogonal extraordinary supersquares of order 4, which consist in the so-called Type I and Type II. The well-known case of d ? 1 mutually orthogonal Latin squares is only a special case, namely Type I.     

On the Action of the Groups GL(n+1, q), PGL(n + 1, q), SL(n + 1, q) and PSL(n + 1, q) on PG(n, q t)

Let q be a prime power and let n ≥ 0, t ≥ 1 be integers. We determine the sizes of the point orbits of each of the groups GL(n + 1, q), PGL(n + 1, q), SL(n + 1, q) and PSL(n + 1, q) acting on PG(n, q ^t) and for each of these sizes (and groups) we determine the exact number of point orbits of this size.     

On recognition by spectrum of the simple groups B 3(q), C 3(q), and D 4(q)

The spectrum of a finite group is the set of its element orders. Two groups are isospectral whenever they have the same spectra. We consider the classes of finite groups isospectral to the simple symplectic and orthogonal groups B ₃(q), C ₃(q), and D ₄(q). We prove that in the case of even characteristic and q > 2 these groups can be reconstructed from their spectra up to isomorphisms. In the case of odd characteristic we obtain a restriction on the composition structure of groups of this class.     

Unipotent Conjugacy in General Linear Groups

Let U(n,q) be the group of upper uni-triangular matrices in GL(n,q), the n-dimensional general linear group over the field of q elements. The number of U(n,q)-conjugacy classes in GL(n,q) is, as a function of q, for fixed n, a polynomial in q with integral coefficients.     

A note on quasi-permutation representations of groups with two character degrees

In Behravesh (J. Lond. Math. Soc. (2) 55:251–260, 1997), we gave algorithms to calculate c(G), q(G) and p(G) for a finite group G. In this paper we will show that in groups with two character degrees we may have c(G)=q(G)≠p(G).     

Difference Covering Arrays and Pseudo-Orthogonal Latin Squares

A pair of Latin squares, A and B, of order n, is said to be pseudo-orthogonal if each symbol in A is paired with every symbol in B precisely once, except for one symbol with which it is paired twice and one symbol with which it is not paired at all. A set of t Latin squares, of order n, are said to be mutually pseudo-orthogonal if they are pairwise pseudo-orthogonal. A special class of pseudo-orthogonal Latin squares are the mutually nearly orthogonal Latin squares (MNOLS) first discussed in 2002, with general constructions given in 2007. In this paper we develop row complete MNOLS from difference covering arrays. We will use this connection to settle the spectrum question for sets of 3 mutually pseudo-orthogonal Latin squares of even order, for all but the order 146.     

Thompson’s conjecture for Lie type groups E 7(q)

In this article, we prove a conjecture of Thompson for an infinite class of simple groups of Lie type E ₇(q). More precisely, we show that every finite group G with the properties Z(G) = 1 and cs(G) = cs(E ₇(q)) is necessarily isomorphic to E ₇(q), where cs(G) and Z(G) are the set of lengths of conjugacy classes of G and the center of G respectively.     

On recognizability of some finite simple orthogonal groups by spectrum

It is proved that, if G is a finite group that has the same set of element orders as the simple group D _p (q), where p is prime, p ≥ 5 and q ∈ {2, 3, 5}, then the commutator group of G/F(G) is isomorphic to D _p (q), the subgroup F(G) is equal to 1 for q = 5 and to O _q (G) for q ∈ {2, 3}, F(G) ≤ G′, and |G/G′| ≤ 2.