Graph subshifts of finite type are defined via forbidden local patterns; those with only infinite graphs are either aperiodic or their period groups are not residually finite.
Down with hierarchy !
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Graph subshifts
Graph subshifts of finite type are defined via forbidden local patterns; those with only infinite graphs are either aperiodic or their period groups are not residually finite.