Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Newton polygon of a recurrence sequence of polynomials and its role in TQFT

Published 7 Feb 2011 in math.GT and math.CO | (1102.1346v3)

Abstract: The paper contains a combinatorial theorem (the sequence of Newton polygons of a reccurent sequence of polynomials is quasi-linear) and two applications of it in classical and quantum topology, namely in the behavior of the $A$-polynomial and a fixed quantum invariant (such as the Jones polynomial) under filling. Our combinatorial theorem, which complements results of Calegari-Walker \cite{CW} and the author \cite{Ga4}, occupies the bulk of the paper and its proof requires the Lech-Mahler-Skolem theorem of $p$-adic analytic number theory combined with basic principles in polyhedral and tropical geometry.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.