Publications

• Optimal Bounds for the Number of Pieces of Near-Circuit Hypersurfaces
  by Weixun Deng, J. Maurice Rojas, and Cordelia Russell, accepted, in Proceedings of ISSAC 2025 (International Symposium on Symbolic and Algebraic Computation), ACM Press. (Arxiv)

• Viro’s Patchworking and the signed reduced A-discriminant
  by Weixun Deng, J. Maurice Rojas, and Mate Telek, Journal of Symbolic Computation, (Arxiv), (doi)

• Feasibility of Circuit Polynomials without Purple Swans
  by Weixun Deng, Alperen Ergur, Grigoris Paouris, and J. Maurice Rojas, in Proceedings of ISSAC 2024 (International Symposium on Symbolic and Algebraic Computation, July 16-19, Raleigh, NC, USA), pp. 429-436, (doi)

• Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract)
  by Frederic Bihan, Erika Croy, Weixun Deng, Kaitlyn Phillipson, Robert J. Rennie, and J. Maurice Rojas, ACM Communications in Computer Algebra, Volume 57, Issue 3, pp. 152-155, (doi)

Preprints

• Trinomials and Deterministic Complexity Limits for Real Solving
  by Erick Boniface, Weixun Deng, and J. Maurice Rojas, (Arxiv)