arXiv subjects
Publications and source records attributed to Gábor P. Nagy.
The aim of this paper is twofold: First we classify all abstract light dual multinets of order $6$ which have a unique line of length at least two. Then we classify the weak projective embeddings of these objects in projective planes over fields of characteristic zero. For the latter we present a computational algebraic method for the study of weak projective embeddings of finite point-line incidence structures.
The existence of ovals and hyperovals is an old question in the theory of non-Desarguesian planes. The aim of this paper is to describe when a conic of ${\rm PG}(2,q)$ remains an arc in the Hall plane obtained by derivation. Some combinatorial properties of the inherited conics are obtained also in those cases when it is not an arc. The key ingredient of the proof is an old lemma by Segre-Korchmáros on Desargues configurations with perspective triangles inscribed in a conic.
We present a new method for the study of hemisystems of the Hermitian surface $\mathcal{U}_3$ of $PG(3,q^2)$. The basic idea is to represent generator-sets of $\mathcal{U}_3$ by means of a maximal curve naturally embedded in $\mathcal{U}_3$ so that a sufficient condition for the existence of hemisystems may follow from results about maximal curves and their automorphism groups. In this paper we obtain a hemisystem in $\ PG(3,p^2)$ for each $p$ prime of the form $p=1+16n^2$ with an integer $n$. Since the famous Landau's conjecture dating back to 1904 is still to be proved (or disproved), it is unknown whether there exists an infinite sequence of such primes. What is known so far is that just $18$ primes up to $51000$ with this property exist, namely $17,257,401,577, 1297,1601, 3137, 7057,13457,14401,15377,24337,25601,30977,$ $ 32401,33857,41617,50177.$ The scarcity of such primes seems to confirm that hemisystems of $\mathcal{U}_3$ are rare objects.
In this paper we investigate light dual multinets labeled by a finite group in the projective plane $PG(2,\mathbb{K})$ defined over a field $\mathbb{K}$. We present two classes of new examples. Moreover, under some conditions on the characteristic $\mathbb{K}$, we classify group-labeled light dual multinets with lines of length least $9$.
Right Bol loops are loops satisfying the identity $((zx)y)x = z((xy)x)$, and right Bruck loops are right Bol loops satisfying the identity $(xy)^{-1} = x^{-1}y^{-1}$. Let $p$ and $q$ be odd primes such that $p>q$. Advancing the research program of Niederreiter and Robinson from $1981$, we classify right Bol loops of order $pq$. When $q$ does not divide $p^2-1$, the only right Bol loop of order $pq$ is the cyclic group of order $pq$. When $q$ divides $p^2-1$, there are precisely $(p-q+4)/2$ right Bol loops of order $pq$ up to isomorphism, including a unique nonassociative right Bruck loop $B_{p,q}$ of order $pq$. Let $Q$ be a nonassociative right Bol loop of order $pq$. We prove that the right nucleus of $Q$ is trivial, the left nucleus of $Q$ is normal and is equal to the unique subloop of order $p$ in $Q$, and the right multiplication group of $Q$ has order $p^2q$ or $p^3q$. When $Q=B_{p,q}$, the right multiplication group of $Q$ is isomorphic to the semidirect product of $\mathbb{Z}_p\times \mathbb{Z}_p$ with $\mathbb{Z}_q$. Finally, we offer computational results as to the number of right Bol loops of order $pq$ up to isotopy.
A \textit{$3$-net} of order $n$ is a finite incidence structure consisting of points and three pairwise disjoint classes of lines, each of size $n$, such that every point incident with two lines from distinct classes is incident with exactly one line from each of the three classes. The current interest around $3$-nets (embedded) in a projective plane $PG(2,K)$, defined over a field $K$ of characteristic $p$, arose from algebraic geometry. It is not difficult to find $3$-nets in $PG(2,K)$ as far as $0 n$. Under this condition, the known families are characterized as the only $3$-nets in $PG(2,K)$ which can be coordinatized by a group. In this paper we deal with $3$-nets in $PG(2,K)$ which can be coordinatized by a diassociative loop $G$ but not by a group. We prove two structural theorems on $G$. As a corollary, if $G$ is commutative then every non-trivial element of $G$ has the same order, and $G$ has exponent $2$ or $3$. We also discuss the existence problem for such $3$-nets.
We classify Moufang loops of order 64 and 81 up to isomorphism, using a linear algebraic approach to central loop extensions. In addition to the 267 groups of order 64, there are 4262 nonassociative Moufang loops of order 64. In addition to the $15$ groups of order $81$, there are $5$ nonassociative Moufang loops of order $81$, $2$ of which are commutative.
We investigate the relation between the structure of a Moufang loop and its inner mapping group. Moufang loops of odd order with commuting inner mappings have nilpotency class at most two. $6$-divisible Moufang loops with commuting inner mappings have nilpotency class at most two. There is a Moufang loop of order $2^{14}$ with commuting inner mappings and of nilpotency class three.
This is a companion to our lectures GAP and loops, to be delivered at the Workshops Loops 2007, Prague, Czech Republic. In the lectures we introduce the GAP package LOOPS, describe its capabilities, and explain in detail how to use it. In this paper we first outline the philosophy behind the package and its main features, and then we focus on three particular computational problems: construction of loop isomorphisms, classification of small Frattini Moufang loops of order 64, and the search for loops of nilpotency class higher than two with an abelian inner mapping group. In particular, this is not a user's manual for LOOPS, which can be downloaded from the distribution website of LOOPS.
In this short paper, we survey the results on commutative automorphic loops and give a new construction method. Using this method, we present new classes of commutative automorphic loops of exponent 2 with trivial center.
The intrinsic structure of binary fields poses a challenging complexity problem from both hardware and software point of view. Motivated by applications to modern cryptography, we describe some simple techniques aimed at performing computations over binary fields using systems with limited resources. This is particularly important when such computations must be carried out by means of very small and simple machines. The algorithms described in the present paper provide an increased efficiency in computations, when compared to the previously known algorithms for the arithmetic over prime fields.
For quasifields, the concept of parastrophy is slightly weaker than isotopy. Parastrophic quasifields yield isomorphic translation planes but not conversely. We investigate the right multiplication groups of finite quasifields. We classify all quasifields having an exceptional finite transitive linear group as right multiplication group. The classification is up to parastrophy, which turns out to be the same as up to the isomorphism of the corresponding translation planes.
Matthews and Michel investigated the minimum distances in certain algebraic-geometry codes arising from a higher degree place $P$. In terms of the Weierstrass gap sequence at $P$, they proved a bound that gives an improvement on the designed minimum distance. In this paper, we consider those of such codes which are constructed from the Hermitian function field. We determine the Weierstrass gap sequence $G(P)$ where $P$ is a degree 3 place, and compute the Matthews and Michel bound with the corresponding improvement. We show more improvements using a different approach based on geometry. We also compare our results with the true values of the minimum distances of Hermitian 1-point codes, as well as with estimates due Xing and Chen.
Nonassociative finite simple Moufang loops are exactly the loops constructed by Paige from Zorn vector matrix algebras. We prove this result anew, using geometric loop theory. In order to make the paper accessible to a broader audience, we carefully discuss the connections between composition algebras, simple Moufang loops, simple Moufang 3-nets, $S$-simple groups and groups with triality. Related results on multiplication groups, automorphisms groups and generators of Paige loops are provided.
Let $F$ be a perfect field and $M^*(F)$ the nonassociative simple Moufang loop consisting of the units in the (unique) split octonion algebra $O(F)$ modulo the center. Then $Aut(M^*(F))$ is equal to $G_2(F) \rtimes Aut(F)$. In particular, every automorphism of $M^*(F)$ is induced by a semilinear automorphism of $O(F)$. The proof combines results and methods from geometrical loop theory, groups of Lie type and composition algebras; its gist being an identification of the automorphism group of a Moufang loop with a subgroup of the automorphism group of the associated group with triality.