Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
124 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fewnomial Systems with Many Roots, and an Adelic Tau Conjecture (1011.4128v5)

Published 18 Nov 2010 in math.AG, cs.CC, and math.NT

Abstract: Consider a system F of n polynomials in n variables, with a total of n+k distinct exponent vectors, over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all coordinates having fixed phase, as a function of n, k, and L only. In particular, we give new explicit systems with number of roots approaching the best known upper bounds. We also briefly review the background behind such bounds, and their application, including connections to computational number theory and variants of the Shub-Smale tau-Conjecture and the P vs. NP Problem. One of our key tools is the construction of combinatorially constrained tropical varieties with maximally many intersections.

Citations (22)

Summary

We haven't generated a summary for this paper yet.