Rectangular Hardinian Arrays

We resolve some open conjectures from the OEIS about Hardinian arrays (see A253217). In particular, we show via the transfer matrix method that H r ( n, k ), the number of n × k Hardinian arrays with parameter r is a polynomial in n of degree r when r and k are fixed and n is sufficiently large. Our implementation of the main result in Maple and Python involves computing with large, sparse matrices, both numeric and symbolic.

Authors

Institutions

Publication Details

Journal
ACM communications in computer algebra
Published
2024-09-01
DOI
https://doi.org/10.1145/3717582.3717589
Primary Topic
Cellular Automata and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Rectangular Hardinian Arrays

Robert Dougherty-Bliss, George Spahn
ACM communications in computer algebra
Cellular Automata and Applications
article

Rectangular Hardinian Arrays

Robert Dougherty-Bliss, George Spahn
article en

Abstract

We resolve some open conjectures from the OEIS about Hardinian arrays (see A253217). In particular, we show via the transfer matrix method that H r ( n, k ), the number of n × k Hardinian arrays with parameter r is a polynomial in n of degree r when r and k are fixed and n is sufficiently large. Our implementation of the main result in Maple and Python involves computing with large, sparse matrices, both numeric and symbolic.

ACM communications in computer algebraVol. 58(3)
Rutgers, The State University of New Jersey (US)
Openalex Percentile: Top 69%
Cellular Automata and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Rectangular Hardinian Arrays — Robert Dougherty-Bliss, George Spahn · ACM communications in computer algebra (2024) | TGRS Research Map | TGRS