Exact finite cases of two sign-matrix permanent problems

Explicit integer certificates are supplied for two finite-parameter statements
about permanents of sign matrices. For every order $1\le n\le35$, a matrix with
permanent $2^{n-\lfloor\log_2(n+1)\rfloor}$ is given; the universal
divisibility bound therefore identifies the least positive permanent for each
of these orders. For every $1\le n\le10$, an explicit catalogue and an
exhaustive inclusion check show that every sign-matrix permanent is attained by
a sign matrix whose entries below the diagonal are all $+1$. The range checks
combine exact minor recurrences, symmetry reduction, and a proved completion
bound; sampled witnesses alone are not used as evidence of completeness.
Separate full-matrix checks use two coprime moduli and a deterministic
uniqueness bound. Neither statement is proved for all orders.