Discovery followed by verification

Zhiwei Chen and Yannan Chen report a result about recursive-line Zarankiewicz numbers, a specialized combinatorial counting problem. Their September 10 preprint combines AI-assisted discovery, exact certificates and mathematical arguments.

For four columns, the authors give an exact formula for every row count of at least 15. Among row counts from 2 through 20, they leave only the 14-row case unresolved, bounded between 37 and 38.

The result uses a strengthened recursive definition. It is a preprint claim; MathsAI has not independently checked the certificates.

References

• Paper and abstract
• Full paper