In an earlier note (arXiv:2606.11090) I showed that the border determinantal complexity of the power sum x_1^d + ... + x_N^d is ?(Nd). The proof counted the simple solutions of an explicit polynomial system and compared that number with what a small determinant can produce. This left two questions. Does ... more >>>

The rational identity testing problem, RIT, asks whether an input \emph{rational circuit}, i.e.\ a noncommutative arithmetic circuit that has inversion gates, computes the zero element of the free skew field. For rational \emph{formulas} the problem is known to be in deterministic polynomial time \cite{GGOW20}, \cite{IQS18}. For rational circuits of ... more >>>

Bhangale, Khot, and Minzer (TheoretiCS 2026) proposed a hybrid approximation algorithm for certain satisfiable CSPs to exploit their abelian embeddings. We propose BasicSDP $\wedge$ CSinglAIP to simplify and generalize their hybrid algorithm. We do so by introducing two concepts:
(1) universal embedding, which simplifies and generalizes their master embedding, and
more >>>