Characterization of some sparse binary sequential arrays (Q795836)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterization of some sparse binary sequential arrays |
scientific article; zbMATH DE number 3863211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterization of some sparse binary sequential arrays |
scientific article; zbMATH DE number 3863211 |
Statements
Characterization of some sparse binary sequential arrays (English)
0 references
1983
0 references
A matrix of 0's and 1's is called sequential if the same periodic sequence of 0's and 1's (or its cyclic shifts or reversals) occurs in every row and column. Two matrices are equivalent if one can be obtained from the other by interchanging 0's with 1's, by rotation, by reflection or by some finite sequence of these operations. The authors find the two or three types of matrices to which all sequential matrices on some sequences are equivalent. The sequences considered have periods with either two 1's or three consecutive 1's.
0 references
periodic sequences
0 references
periodic matrices
0 references
(0,1)-matrices
0 references
binary sequences
0 references
0.7461465001106262
0 references