EUVIMEDEUVIMED entdecken
Crossref

New Explicit Root Counts for p-adic Circuit Systems

Joshua Goldstein, J. Maurice Rojas, Henry Stone, Arnaldo Vera

ACM Communications in Computer Algebra · 01.12.2025 · 59 (4) · 134-137

DOI: 10.1145/3832046.3832061 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Communications in Computer Algebra, online erschienen am 18.08.2026. Verfasst von Joshua Goldstein und 3 weiteren Autor:innen. Die Arbeit nennt 13 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Fewnomial theory began by establishing (finite) upper bounds on the number of real non-degenerate roots of any n × n system of real polynomials, solely as a function of n and the number of distinct exponent vectors in the underlying monomial term expansions. Khovanski and Sevastyanov proved the first explicit bounds around 1980 [5, 6], and then an analogue over the p -adic rationals, ℚ p , (with p ∈ ℕ prime) was found by Denef and van den Dries around 1988 [3, Sec. 3.4]. However, explicit bounds over ℚ p are known only when n = 1 ([3, Sec. 3.5], [8, Thm. 2 & pg. 279]), or when n ≥ 2 and the underlying zero sets satisfy a very restrictive condition: tropical genericity (with respect to p) (see [11] and below). We give the first explicit upper bounds over ℚ p (for p ≥ n + 1) for a broad class of tropically non -generic systems with n + 2 exponent vectors, where no bounds had been available before: See Theorem 1.5 below. Let us first review the simplest systems over R and ℚ p .

Zitieren

APA

Goldstein, J., Rojas, J. M., Stone, H., & Vera, A. (2025). New Explicit Root Counts for p-adic Circuit Systems. ACM Communications in Computer Algebra, 59(4), 134-137. https://doi.org/10.1145/3832046.3832061

Vancouver

Goldstein J, Rojas JM, Stone H, Vera A. New Explicit Root Counts for p-adic Circuit Systems. ACM Communications in Computer Algebra. 2025;59(4):134-137. doi:10.1145/3832046.3832061

BibTeX
@article{Goldstein2025,
  author = {Goldstein, Joshua and Rojas, J. Maurice and Stone, Henry and Vera, Arnaldo},
  title = {New Explicit Root Counts for p-adic Circuit Systems},
  journal = {ACM Communications in Computer Algebra},
  year = {2025},
  volume = {59},
  number = {4},
  pages = {134--137},
  doi = {10.1145/3832046.3832061}
}
Kostenlos starten →