On the number of generators for transeunt triangles

Thumbnail Image
Files
But_Due_Yan_Shm2001.pdf (153.83 KB)
Authors
Dueck, Gerhard W.
Shmerko, Vlad P.
Butler, Jon T.
Yanushkevich, S. N.
Subjects
Symmetric functions
Reed-Muller expansion
transeunt triangle
Advisors
Date of Issue
1999-11
Date
November 30, 1999
Publisher
Language
Abstract
A transeunt triangle for 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 ...
Type
Article
Description
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.
Discrete Applied Mathematics, 108, 2001, pp. 309-316
URI
https://hdl.handle.net/10945/35741
Series/Report No
Department
Department of Electrical and Computer Engineering
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
On the number of generators for transeunt triangles,” Discrete Applied Mathematics, 108, 2001, pp. 309-316
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections
Publications