Zobrazeno 1 - 10
of 33
pro vyhledávání: '"A. D. Keedwell"'
Autor:
A. D. Keedwell
This volume contains the invited papers presented at the British Combinatorial Conference, held at the University of Surrey in July 1991. As in previous years, the speakers were mathematicians of the highest quality who spanned the subject area, and
Autor:
A. D. Keedwell
Publikováno v:
The Mathematical Gazette. 95:454-468
It is well known that G. Tarry [1] was the first to publish a proof that the famous thirty-six officers problem posed by L. Euler [2] in 1779 has no solution but it appears to be less well known that he was the first to devise a systematic method of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbcbd700b328c8d01c1b4e405d84a8a2
https://doi.org/10.1017/s0025557200003557
https://doi.org/10.1017/s0025557200003557
Autor:
A. D. Keedwell
Publikováno v:
European Journal of Combinatorics. 30(5):1382-1385
We show that a Buchsteiner quasigroup is necessarily a loop but that there exist proper conjugacy-closed quasigroups. This completes the investigation of quasigroups which satisfy identities corresponding to ones for loops obtainable by nuclear amalg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83fdb1a15432e358cd50a4bed3dfeb3b
Autor:
A. D. Keedwell
Publikováno v:
The Mathematical Gazette. 90:425-430
Smallest defining setsA standard Sudoku square is a 9 × 9 latin square in which each of the nine 3 × 3 subsquares into which it can be separated contains each of the integers 1 to 9 exactly once.A current problem is to complete such a square when o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c67c2158bd46a906c95f4f448512cd2
https://doi.org/10.1017/s0025557200180234
https://doi.org/10.1017/s0025557200180234
Autor:
A. D. Keedwell
Publikováno v:
The Mathematical Gazette. 90:417-424
A topic of current interest is that of finding defining sets (preferably smallest defining sets) for various combinatorial structures such as latin squares and block designs, so it seemed interesting (though of no practical use) to try to solve the s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fce76c8ddc941e4ff9a37d92abd28c21
https://doi.org/10.1017/s0025557200180222
https://doi.org/10.1017/s0025557200180222
Autor:
A. D. Keedwell
Publikováno v:
European Journal of Combinatorics. 26:111-116
We give a new and simple criterion for a Latin square to be group-based and we provide easy-to-implement tests for whether a given element of a loop lies in any one of its three nuclei.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::029bea89ae543884bb404dcf4f834d0f
https://doi.org/10.1016/j.ejc.2004.01.005
https://doi.org/10.1016/j.ejc.2004.01.005
Autor:
A. D. Keedwell, Gary L. Mullen
Publikováno v:
Discrete Mathematics. 288:49-60
We investigate the construction of sets of t latin squares of a given non-prime-power order q which are as close as possible to being a mutually orthogonal set. The total number of ordered pairs which do not occur when the squares are juxtaposed in p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aee80cf91aba755fa371dab0409efa61
https://doi.org/10.1016/j.disc.2004.04.014
https://doi.org/10.1016/j.disc.2004.04.014
Autor:
A. D. Keedwell
Publikováno v:
Discrete Mathematics. 231:295-302
We determine the special properties which an orthomorphism or near orthomorphism of a cyclic group must have if it is to define a finite field instead of a (non-associative) cyclic neofield.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06ef71687eee924ad2371c945037a6b4
https://doi.org/10.1016/s0012-365x(00)00326-5
https://doi.org/10.1016/s0012-365x(00)00326-5
Autor:
A. D. Keedwell
Publikováno v:
The Mathematical Gazette. 92:259-261
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f02b48fafb12e30fa8f7a374363ed73
https://doi.org/10.1017/s002555720018310x
https://doi.org/10.1017/s002555720018310x
Autor:
J. Dénes, A. D. Keedwell
Publikováno v:
Discrete Mathematics. :157-161
We propose a simple and flexible authentication scheme applicable for use with both binary and nonbinary messages and we show that, among the set of all possible messages of assigned length, all possible signatures occur with equal probability: that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::323bdd5091cb3b514d1b0f25d1f645c2