On the Number of Generators for Transeunt Triangles
Abstract
A transeunt triangle of size n consists of (n+1)x(n+1)x(n+1) 0's and 1's whose values are determined by the sum modulo 2 of two other local values. For a given n, two transeunt triangles of size n can be combined using the element-by-element modulo 2 sum to generate a third transeunt triangle. We show that, for large n, the 1/3(2n+1) transeunt triangles of size n can be generated from a set of only n/3 generator transeunt triangles.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 30, 1999
- Accession Number
- ADA605502
Entities
People
- G. W. Dueck
- J. T. Butler
- S. N. Yanushkevich
- V. P. Shmerko
Organizations
- Naval Postgraduate School