Equal degree and type do not determine a code-loop representation

Myeongjin Kang

Abstract

Two actual rank-seven full-support reduced doubly-even binary subspaces on Fin50, each with sorted type fifteen ones/seven fives, represent the SAME explicitly nonassociative Moufang loop by genuine source-sign multiplicative bijections, but no arbitrary Fin50 coordinate permutation carries one code to the other. Refutes the broad printed2019Conjecture1, with all factor, weight, quotient-type, sign, rank and transport bridges included.

AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.

1

Supplementary files

  • proof-sources.json148.4 KBOpen
  • extract_sources.py601 BOpen

Comments

Related problem 343790. Proof sources supplied as gzip+base64 proof-sources.json, extract_sources.py, and supporting.zip. No worldwide-priority certification.

Version history

Discussion 0