๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Almost all quasigroups have rank 2

โœ Scribed by Peter J. Cameron

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
316 KB
Volume
106-107
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Almost all steinhaus graphs have diamete
Almost all steinhaus graphs have diameter 2
โœ Neal Brand ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 300 KB ๐Ÿ‘ 1 views

## Abstract A Steinhaus graph is a graph with __n__ vertices whose adjacency matrix (__a__~i, j~) satisfies the condition that __a__~i, j~ ๏ฃฝ __a__~aโ€โ€1, jโ€โ€1~ + __a__ ~iโ€โ€1, j~ (mod 2) for each 1 < __i__ < __j__ โ‰ค __n__. It is clear that a Steinhaus graph is determined by its first row. In [3] Brin

Almost all trees have tribe number 2 or
Almost all trees have tribe number 2 or 3
โœ J. Komlรณs; W.O.J. Moser ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 301 KB

Let T be a tree on n vertices, and let E <$ be a small fixed positive number. The tribe number t&) of T is the smallest integer r such that when any vertex is deleted, some r or fewer subtrees in the resulting forest together contain more than (1-e)n vertices. We prove the following, theorem: Almost

Almost all digraphs have a kernel
Almost all digraphs have a kernel
โœ Ioan Tomescu ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 561 KB
Almost all one-rule thue systems have de
Almost all one-rule thue systems have decidable word problems
โœ Ronald V Book; Craig C Squier ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 167 KB

The decidability of the word problem for one-rule Thue systems is an open cluestion. In the case of one-rule special Thue systems, i.e., those of the form {(w, 1)} where 1 is the identity, it is known [1] that the word problem is decidable. Here we show that 'almost all' one-rule Thue systems have