Given a prime p in binary and positive n,s in unary, one deterministic polynomial-bit-time machine outputs a tuple of matrices over F_p of dimension O(n³s⁶) that detects every nonzero division-free noncommutative formula of size at most s in n variables over every field of characteristic p.
Given a prime p in binary and positive n,s in unary, one deterministic polynomial-bit-time machine outputs a tuple of matrices over F_p of dimension O(n³s⁶) that detects every nonzero division-free noncommutative formula of size at most s in n variables over every field of characteristic p.
Given a prime p in binary and positive n,s in unary, one deterministic polynomial-bit-time machine outputs a tuple of matrices over F_p of dimension O(n³s⁶) that detects every nonzero division-free noncommutative formula of size at most s in n variables over every field of characteristic p.
If correct, supplies a polynomial-size universal black-box matrix test across every positive characteristic, including two.
Can one universal polynomial-size matrix tuple detect all bounded-size noncommutative formulas in any prescribed positive characteristic?
Publication dates and editorial changes.
OpenAI reports one matrix hitting point in every positive characteristic
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
