Signed Admission Geometry — Computational Census

Read full text
Authors: Kuppusamy Ravindran
Cited by: 2

Abstract

Exact-arithmetic computational supplement for the finite census results in Part V of the book "The Landscape Is the Meaning" and in the preprint "Variable Elimination for Prime-Implicate 0-1 Relaxations of Boolean Constraints". Every count is produced by exact rational arithmetic with no floating point. The three-port census (240 signed-ideal of 256 regimes, 22 signed-shuffle orbits, the sixteen non-ideal regimes in two orbits of eight, fractional vertex (1/2,1/2,1/2)) is reproducible from the Python standard library alone, with no third-party dependency and no network; an independent third-party reimplementation and its recorded output are included. The four- and five-port material, the recorded certificates and the n=5 orbit census are also here, the certificate verifier requiring pycddlib.

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
18 September 2026