منابع مشابه
Random Generators of Given Orders and the Smallest Simple Moufang Loop
The probability that m randomly chosen elements of a finite power associative loop C have prescribed orders and generate C is calculated in terms of certain constants Γ related to the action of Aut(C) on the subloop lattice of C. As an illustration, all meaningful probabilities of random generation by elements of given orders are found for the smallest nonassociative simple Moufang loop. 1. Ran...
متن کاملThe Smallest Grammar Problem Revisited
In a seminal paper of Charikar et al. on the smallest grammar problem, the authors derive upper and lower bounds on the approximation ratios for several grammar-based compressors, but in all cases there is a gap between the lower and upper bound. Here we close the gaps for LZ78 and BISECTION by showing that the approximation ratio of LZ78 is Θ((n/ logn)), whereas the approximation ratio of BISE...
متن کاملEvery Diassociative A-loop Is Moufang
An A-loop is a loop in which every inner mapping is an automorphism. A problem which had been open since 1956 is settled by showing that every diassociative A-loop is Moufang.
متن کاملOn the smallest simple, unipotent Bol loop
Finite simple, unipotent Bol loops have recently been identified and constructed using group theory. However, the purely group-theoretical constructions of the actual loops are indirect, somewhat arbitrary in places, and rely on computer calculations to a certain extent. In the spirit of revisionism, this paper is intended to give a more explicit combinatorial specification of the smallest simp...
متن کاملCoverings of the smallest Paige loop
By investigating the construction of the split Cayley generalized hexagon, H(2), we get that there do not exist five distinct hexagon lines each a distance two apart from each other. From this we prove that the smallest Paige loop has a covering number of seven and that its automorphism group permutes these coverings transitively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Results in Mathematics
سال: 2003
ISSN: 0378-6218,1420-9012
DOI: 10.1007/bf03322924