arXiv:2606.27170v1

On automorphisms of B\mathscr{B}-admissible and related subshifts

Aurelia Dymek, Nazrul Haque, Stanisław Kasjan

math.DSmath.NT37A4437B10

Abstract

We adapt ideas of Kim and Roush [15], originally developed in the study of automorphisms of sofic subshifts, to obtain sufficient conditions under which a subshift has a huge automorphism group. We apply this approach to non-sofic subshifts defined by sets of multiples. In particular, we establish a dichotomy for the B\mathscr{B}-admissible subshift: its automorphism group is either trivial or contains an embedded copy of the automorphism group of the full shift {0,1}Z\{0,1\}^{\mathbb Z}. In the latter case, we say that the automorphism group is huge. We further show that the automorphism group of the hereditary closure of the B\mathscr{B}-free subshift is huge whenever BN\mathscr{B}\subset \mathbb N is infinite and contains no infinite pairwise coprime subset.

AI-generated audit

Audit summary

Audited against arXiv v1

Not a correctness certificate. A “Correct” result may include yellow typos or minor formal corrections that do not affect substantive soundness. It means this audit found no unresolved substantive error under the stated criteria; it does not replace expert scrutiny or formal verification.

Current report

Detailed mathematical audit

Generated August 18, 2026
01Statements2 reported findingsCorrect

The embedding theorem for hereditary closures and the trivial-versus-huge dichotomy for automorphism groups of B\mathscr B-admissible subshifts are correct.

Theorems A–B and Corollaries 1.1–1.2Correct

Exchangeable marker blocks yield the full-shift automorphism embedding

Pages 2–3 and Sections 2–4 · arXiv:2606.27170v1

Proposition 2.1 encodes each full-shift symbol by one of four mutually exchangeable blocks separated by a nonoverlapping marker; conjugating a block code through this encoding is an injective homomorphism. Finite covering sets of multiples produce such blocks when B\mathscr B has no infinite pairwise-coprime subset. For the admissible shift, a nontrivial block code forces a finite minimal contour, and conversely a contour supplies the marker configuration, proving the equivalence and dichotomy.

Full paper, version 1
Theorem B and Corollaries 1.1–1.2Correct

The arithmetic dichotomy for automorphism groups has the stated scope

Introduction and Section 4 · arXiv:2606.27170v1

When the relevant finite subsets admit controlled contours, marker automorphisms embed the full-shift automorphism group. The alternative taut/arithmetic regime is handled separately, and the corollaries retain the hypotheses needed to pass from the modified admissible system to the stated B\mathcal B-free subshift.

02Proofs2 reported findingsCorrect

The marker-code, arithmetic-residue, contour, and nonsoficity arguments are correct and complete.

Sections 2–5Correct and complete

The encoded automorphisms stay inside the target subshift

Pages 3–23 · Sections 2–5 · arXiv:2606.27170v1

Nonoverlap of the marker makes decoding local and unique, exchangeability proves that every substituted block remains admissible, and applying the construction to a nonfixed encoded point proves injectivity. Dirichlet's theorem and periodic finite approximants realize every needed nonzero residue, while minimality of contours gives the converse obstruction to nontrivial automorphisms.

Sections 3–4Correct and complete

Marker codes and residue-class contours prove injectivity and the dichotomy

Pages 13–33 · arXiv:2606.27170v1

Chinese-remainder choices isolate marker windows whose translated supports do not interfere. Local replacement maps preserve admissibility, compositions reproduce the desired full-shift automorphisms, and distinguished marker configurations prove injectivity. The contour proposition verifies these conditions exactly in the non-pairwise-coprime regime.

03Novelty0 reported findingsNo non-novelty findings

No non-novelty findings.

Detailed audit reportFull reasoning, manuscript locations, and references.
Open report PDF ↗

Author response

Challenge an audit finding

Local workflow preview

A listed author may submit formal evidence that an audit is inaccurate. The response would be considered in a fresh AI re-evaluation; it would not edit the audit automatically.

Paper
arXiv:2606.27170v1
Authors listed
Aurelia Dymek, Nazrul Haque, Stanisław Kasjan
Audit date
August 18, 2026
  1. 01Establish identityMatch an authenticated scholarly identity to this paper.
  2. 02Submit evidenceIdentify the finding and give a formal mathematical response.
  3. 03Re-evaluateA separate agent checks the response and records a disposition.
Recommended production method

Authenticate with ORCID, then require an exact arXiv match

MathAudit should accept the identity only when ORCID OAuth authenticates the claimant's iD and this exact arXiv paper appears in arXiv's public authority feed for that iD. A matching name alone is not sufficient.

ORCID OAuth and arXiv authority-record lookup are not connected in this local prototype.

Email fallback for papers without a linked ORCID

A production fallback could send a one-time link only when the submitted address matches an independently maintained author-contact allowlist for this paper. MathAudit must return the same message for every address so the form cannot reveal which contacts are on that list.

This demonstration does not send, store, or compare the address.

Structured response preview

This form remains unavailable until production identity verification succeeds. Nothing entered here is submitted.

This panel never establishes authorship in the local prototype. A production result should be described narrowly as an authenticated ORCID match or control of a separately allowlisted author-contact mailbox.