Counting toroidal binary arrays. II.

MaRDI QIDQ5502229zbMATH OpenFDO

Authors Stewart N. Ethier, Jiyeon Lee

Publication date 18 August 2015

Full work available at URL https://arxiv.org/abs/1502.03792, http://www.emis.de/journals/JIS/VOL18/Lee/lee6.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Euler's phi functiongroup actionorbitPólya's enumeration theoremtoroidal array

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: We derive formulas for $(i)$ the number of toroidal $nimesn$ binary arrays, allowing rotation of rows and/or columns as well as matrix transposition, and $(ii)$ the number of toroidal $nimesn$ binary arrays, allowing rotation and/or reflection of rows and/or columns as well as matrix transposition.

Recommendations

• Counting toroidal binary arrays
• scientific article; zbMATH DE number 3841867
• A note on binary arrays with a certain window property (Corresp.)
• Symmetrically inequivalent partitions of a square array
• scientific article; zbMATH DE number 3884166

Cited in

(5)

• Symmetrically inequivalent partitions of a square array
• scientific article; zbMATH DE number 896255 (Why is no real title available?)
• Counting toroidal binary arrays
• Counting tilings of the n m grid, cylinder, and torus
• Tiling of toroidal arrays with pictures: uniqueness, shift-equivalence and undecidability

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Counting toroidal binary arrays. II.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502229)