Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A Note on Power Sets of Latin Squares

Jezsef Denes1, Gary L. Mulien2, Stephan J. Suchower3
1Csaba Utca 10 v 42 Budapest 1122, Hungary
2Mathematics Department Pennsylvania State University University Park, PA 16802, U.S.A.
3Daniel H. Wagner, Associates Station Square Two Paoli, PA 19301, U.S.A.
  • Published: 31/10/1994

Abstract

In this note, we study a group operation on the set of all row-Latin squares of order \(n\) and, as a result, are able to provide a short disproof of the Euler conjecture for infinitely many values of \(n\). We also discuss several related conjectures.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Jezsef Denes, Gary L. Mulien, Stephan J. Suchower. A Note on Power Sets of Latin Squares[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 016. 27-31. DOI: .