arXiv subjects
Publications and source records attributed to Petr Vojtěchovský.
We study a generalization of the classical correspondence between homogeneous quadratic polynomials, quadratic forms, and symmetric/alternating bilinear forms to forms in $n$ variables. The main tool is combinatorial polarization, and the approach is applicable even when $n!$ is not invertible in the underlying field.
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.
The isomorphism problem for centrally nilpotent loops can be tackled by methods of cohomology. We develop tools based on cohomology and linear algebra that either lend themselves to direct count of the isomorphism classes (notably in the case of nilpotent loops of order $2q$, $q$ a prime), or lead to efficient classification computer programs. This allows us to enumerate all nilpotent loops of order less than $24$.
Groups with commuting inner mappings are of nilpotency class at most two, but there exist loops with commuting inner mappings and of nilpotency class higher than two, called loops of Csörgő type. In order to obtain small loops of Csörgő type, we expand our programme from `Explicit constructions of loops with commuting inner mappings', European J. Combin. 29 (2008), 1662-1681, and analyze the following setup in groups: Let $G$ be a group, $Z\le Z(G)$, and suppose that $δ:G/Z\times G/Z\to Z$ satisfies $δ(x,x)=1$, $δ(x,y)=δ(y,x)^{-1}$, $z^{yx}δ([z,y],x) = z^{xy}δ([z,x],y)$ for every $x$, $y$, $z\in G$, and $δ(xy,z) = δ(x,z)δ(y,z)$ whenever $\{x,y,z\}\cap G'$ is not empty. Then there is $μ:G/Z\times G/Z\to Z$ with $δ(x,y) = μ(x,y)μ(y,x)^{-1}$ such that the multiplication $x*y=xyμ(x,y)$ defines a loop with commuting inner mappings, and this loop is of Csörgő type (of nilpotency class three) if and only if $g(x,y,z) = δ([x,y],z)δ([y,z],x)δ([z,x],y)$ is nontrivial. Moreover, $G$ has nilpotency class at most three, and if $g$ is nontrivial then $|G|\ge 128$, $|G|$ is even, and $g$ induces a trilinear alternating form. We describe all nontrivial setups $(G,Z,δ)$ with $|G|=128$. This allows us to construct for the first time a loop of Csörgő type with an inner mapping group that is not elementary abelian.
A loop is said to be automorphic if its inner mappings are automorphisms. For a prime $p$, denote by $\mathcal A_p$ the class of all $2$-generated commutative automorphic loops $Q$ possessing a central subloop $Z\cong \mathbb Z_p$ such that $Q/Z\cong\mathbb Z_p\times\mathbb Z_p$. Upon describing the free $2$-generated nilpotent class two commutative automorphic loop and the free $2$-generated nilpotent class two commutative automorphic $p$-loop $F_p$ in the variety of loops whose elements have order dividing $p^2$ and whose associators have order dividing $p$, we show that every loop of $\mathcal A_p$ is a quotient of $F_p$ by a central subloop of order $p^3$. The automorphism group of $F_p$ induces an action of $GL_2(p)$ on the three-dimensional subspaces of $Z(F_p)\cong (\mathbb Z_p)^4$. The orbits of this action are in one-to-one correspondence with the isomorphism classes of loops from $\mathcal A_p$. We describe the orbits, and hence we classify the loops of $\mathcal A_p$ up to isomorphism. It is known that every commutative automorphic $p$-loop is nilpotent when $p$ is odd, and that there is a unique commutative automorphic loop of order $8$ with trivial center. Knowing $\mathcal A_p$ up to isomorphism, we easily obtain a classification of commutative automorphic loops of order $p^3$. There are precisely $7$ commutative automorphic loops of order $p^3$ for every prime $p$, including the $3$ abelian groups of order $p^3$.
Using the Freese-McKenzie commutator theory for congruence modular varieties as the starting point, we develop commutator theory for the variety of loops. The fundamental theorem of congruence commutators for loops relates generators of the congruence commutator to generators of the total inner mapping group. We specialize the fundamental theorem into several varieties of loops, and also discuss the commutator of two normal subloops. Consequently, we argue that some standard definitions of loop theory, such as elementwise commutators and associators, should be revised and linked more closely to inner mappings. Using the new definitions, we prove several natural properties of loops that could not be so elegantly stated with the standard definitions of loop theory. For instance, we show that the subloop generated by the new associators defined here is automatically normal. We conclude with a preliminary discussion of abelianess and solvability in loops.
Based on the recent development of commutator theory for loops, we provide both syntactic and semantic characterization of abelian normal subloops. We highlight the analogies between well known central extensions and central nilpotence on one hand, and abelian extensions and congruence solvability on the other hand. In particular, we show that a loop is congruence solvable (that is, an iterated abelian extension of commutative groups) if and only if it is not Boolean complete, reaffirming the connection between computational complexity and solvability. Finally, we briefly discuss relations between nilpotence and solvability for loops and the associated multiplication groups and inner mapping groups.
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.
Groups are usually axiomatized as algebras with an associative binary operation, a two-sided neutral element, and with two-sided inverses. We show in this note that the same simplicity of axioms can be achieved for some of the most important varieties of loops. In particular, we investigate loops of Bol-Moufang type in the underlying variety of magmas with two-sided inverses, and obtain "group-like" equational bases for Moufang, Bol and C-loops. We also discuss the case when the inverses are only one-sided and/or the neutral element is only one-sided.
A loop is automorphic if all its inner mappings are automorphisms. We construct the free commutative automorphic $2$-generated loop of nilpotency class $3$. It has dimension $8$ over the integers.
We describe a large-scale project in applied automated deduction concerned with the following problem of considerable interest in loop theory: If $Q$ is a loop with commuting inner mappings, does it follow that $Q$ modulo its center is a group and $Q$ modulo its nucleus is an abelian group? This problem has been answered affirmatively in several varieties of loops. The solution usually involves sophisticated techniques of automated deduction, and the resulting derivations are very long, often with no higher-level human proofs available.
These notes accompany a series of three lectures on automorphic loops to be delivered by the author at Workshops Loops '15 (Ohrid, Macedonia, 2015). Automorphic loops are loops in which all inner mappings are automorphisms. The first paper on automorphic loops appeared in 1956 and there has been a surge of interest in the topic since 2010. The purpose of these notes is to introduce the methods used in the study of automorphic loops to a wider audience of researchers working in nonassociative mathematics. In the first lecture we establish basic properties of automorphic loops (flexibility, power-associativity and the antiautomorphic inverse property) and discuss relations of automorphic loops to Moufang loops. In the second lecture we expand on ideas of Glauberman and investigate the associated operation $(x^{-1}\backslash (y^2x))^{1/2}$ and similar concepts, using a more modern approach of twisted subgroups. We establish many structural results for commutative and general automorphic loops, including the Odd Order Theorem. In the last lecture we look at enumeration and constructions of automorphic loops. We show that there are no nonassociative simple automorphic loops of order less than $4096$, we study commutative automorphic loops of order $pq$ and $p^3$, and introduce two general constructions of automorphic loops. The material is newly organized and sometimes new, shorter proofs are given.
We establish a canonical correspondence between connected quandles and certain configurations in transitive groups, called quandle envelopes. This correspondence allows us to efficiently enumerate connected quandles of small orders, and present new proofs concerning connected quandles of order p and 2p. We also present a new characterization of connected quandles that are affine.
The existence and uniqueness (up to equivalence) of code loops was first established by R. Griess. Nevertheless, the explicit construction of code loops remained open until T. Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E. Goodaire. Within this paper, we focus on their combinatorial construction and prove a more general result using the language of derived forms.
We present an elementary proof that the nonassociative simple Moufang loops over finite prime fields are generated by three elements. In the last section, we conclude that integral Cayley numbers of unit norm are generated multiplicatively by three elements.
For most (and possibly all) non-associative finite simple Moufang loops, three generators of order 3 can be chosen so that each two of them generate a group isomorphic to $(3, 3 | 3, p)$. The subgroup structure of $(3, 3 | 3, p)$ depends on the solvability of a certain quadratic congruence, and it is described here in terms of generators.
For $n>3$, every $n\times n$ partial Cayley matrix with at most $n-1$ holes can be reconstructed by quadrangle criterion. Moreover, the holes can be filled in given order. Without additional assumptions, this is the best possible result. Reconstruction of other types of multiplication tables is discussed.
Let $M^*(q)$ be the unique nonassociative finite simple Moufang loop constructed over $GF(q)$. We prove that $Aut(M^*(2))$ is the Chevalley group $G_2(2)$, by extending multiplicative automorphism of $M^*(2)$ into linear automorphisms of the unique split octonion algebra over GF(2). Many of our auxiliary results apply in the general case. In the course of the proof we show that every element of a split octonion algebra can be written as a sum of two elements of norm one.