cs.SC · 2026-06-07 · No. 16

Symbolic Computation, 2026-06-07.

1 new papers in cs.SC. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

    A Finite Certificate for the Positive $n=9$ Vasc Inequality

    Dakai Guo, Ruichen Qiu, Yichuan Cao, Ruyong Feng

    cs.SC · cs.AI

    We prove the positive-real $n=9$ case of the Vasc cyclic inequality. The proof was obtained with human-guided assistance from the AI agent MechMath Agent Team: the human-readable part reduces the rational inequality to a homogeneous polynomial inequality, fixes a cyclic maximum, and parametrizes each sorted fixed-maximum cone by cumulative gaps; the finite part is a certificate covering all $8!=40320$ sorted cones. MechMath Agent Team...

    arxiv.org/abs/2606.06136 · PDF

This edition is part of The Daily Abstract — cs.SC archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.