Frame cellular automata: Configurations, generating sets and related matroids

DOI10.1016/j.disc.2008.01.046zbMath1229.05059OpenAlexW1969271696MaRDI QIDQ1024429

Fritz von Haeseler, André M. Barbé

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.046

zbMATH Keywords

submodularitymatroidscombinatorial geometryindependent sets\(n\)-ary quasigroupscovers of finite setsgeneralized cellular automatonmultary quasigroupsquasigroup defined cellular automaton

Mathematics Subject Classification ID

Other designs, configurations (05B30) Cellular automata (computational aspects) (68Q80) Combinatorial aspects of matroids and geometric lattices (05B35) Loops, quasigroups (20N05)

Related Items (1)

Symmetric binary Steinhaus triangles and parity-regular Steinhaus graphs

Cites Work

• Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups
• Minimal covers of finite sets
• Covers of a Finite Set
• SYMMETRIC SELF-ORGANIZATION IN A CELLULAR AUTOMATON REQUIRING AN ESSENTIALLY RANDOM FEEDBACK: OBSERVATIONS, CONJECTURES, QUESTIONS
• Cellular automata, quasigroups and symmetries
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Frame cellular automata: Configurations, generating sets and related matroids