Abstract
Finite quasigroups in the form of Latin squares have been extensively studied in design theory. Some quasigroups satisfy constraints in the form of equations, called quasigroup identities. In this note, we propose some questions concerning quasigroup identities that can sometimes be answered by the rewriting techniques.
Partially supported by the National Science Foundation under Grant CCR-8922330.
Partially supported by the National Science Foundation under Grants CCR-9202838 and CCR-9357851.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bennett, F.: The spectra of a variety of quasigroups and related combinatorial designs. Discrete Math. 34 (1987): 43–64.
Bennett, F., Zhu, L.: Conjugate-orthogonal Latin squares and related structures, J. Dinitz & D. Stinson (eds), Contemporary Design Theory: A Collection of Surveys. John Wiley & Sons, 1992.
Evans, T.: Algebraic structures associated with Latin squares and orthogonal arrays. Proc. of Conf. on Algebraic Aspects of Combinatorics. Congr. Numer. 13 (1975): 31–52.
Fujita, M., Slaney, J., Bennett, F.: Automatic generation of some results in finite algebra, Proc. International Joint Conference on Artificial Intelligence, 1993.
McCune, W.: A Davis-Putnam program and its application to finite first-order model search: quasigroup existence problems. Preprint, Division of MCS, Argonne National Laboratory, 1994.
Slaney, J., Fujita, M., Stickel, M.: Automated reasoning and exhaustive search: Quasigroup existence problems. To appear in Computers and Mathematics with Applications, 1994.
Zhang, H., Bonacina, M. P.: Cumulating search in a distributed computing environment: a case study in parallel satisfiability. Proc. of the First International Symposium on Parallel Symbolic Computation. Sept. 26–28, 1994, Linz, Austria.
Zhang, H., Hsiang, J.: Solving open quasigroup problems by propositional reasoning. Proc. of International Computer Symposium, Taiwan, December 1994.
Zhang, H., Stickel, M.: Implementing the Davis-Putnam algorithm by tries. Technical Report, Dept. of Computer Science, The University of Iowa, 1994.
Zhang, J.: Search for idempotent models of quasigroup identities, Typescript, Institute of Software, Academia Sinica, Beijing, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stickel, M.E., Zhang, H. (1995). Studying quasigroup identities by rewriting techniques: Problems and first results. In: Hsiang, J. (eds) Rewriting Techniques and Applications. RTA 1995. Lecture Notes in Computer Science, vol 914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59200-8_81
Download citation
DOI: https://doi.org/10.1007/3-540-59200-8_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59200-6
Online ISBN: 978-3-540-49223-8
eBook Packages: Springer Book Archive