Building Extremal Fewnomial Lower Bounds Over Local Fields, and the Adelic Tau Conjecture

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 4 figures, submitted to refereed conference proceedings. Fixes various typos, expands main proofs, and includes (a)

Scientific paper

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 upper and lower bounds on the maximal number of non-degenerate roots F can have over L, with all coordinates having fixed sign or fixed first digit, as a function of n and k only. For non-Archimedean L we give the first non-trivial lower bounds in the case $k-1 \leq n$; and for general L we give new explicit extremal systems when k=2 and $n \geq 1$. We also briefly review the background behind such bounds, and their application, including connections to 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Building Extremal Fewnomial Lower Bounds Over Local Fields, and the Adelic Tau Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Building Extremal Fewnomial Lower Bounds Over Local Fields, and the Adelic Tau Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Building Extremal Fewnomial Lower Bounds Over Local Fields, and the Adelic Tau Conjecture will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-536341

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.