Counting toroidal binary arrays

MaRDI QIDQ5404313zbMATH OpenFDO

Authors Stewart N. Ethier

Publication date 24 March 2014

Full work available at URL https://arxiv.org/abs/1301.2352, http://www.emis.de/journals/JIS/VOL16/Ethier/ethier2.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

necklacegroup actiondihedral groupcyclic groupEuler's phi functionPólya's enumeration theorem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: A formula for the number of toroidal m x n binary arrays, allowing rotation of the rows and/or the columns but not reflection, is known. Here we find a formula for the number of toroidal m x n binary arrays, allowing rotation and/or reflection of the rows and/or the columns.

Recommendations

• Counting toroidal binary arrays. II.
• scientific article; zbMATH DE number 3841867
• scientific article; zbMATH DE number 3884166
• scientific article; zbMATH DE number 3908332
• A note on binary arrays with a certain window property (Corresp.)

Cited in

(5)

• Counting toroidal binary arrays. II.
• Counting tilings of the \(n \times m\) grid, cylinder, and torus
• Shift-symmetric configurations in two-dimensional cellular automata: irreversibility, insolvability, and enumeration
• scientific article; zbMATH DE number 3884166 (Why is no real title available?)
• scientific article; zbMATH DE number 3841867 (Why is no real title available?)

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Counting toroidal binary arrays

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