Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNumerical Software to Compute Newton Polytopes and Tropical Membership
81
0
0.0
(
0
)
Authors
Taylor Brysiewicz
Ask ChatGPT about the research
No Arabic abstract
We present our implementation of an algorithm which functions as a numerical oracle for the Newton polytope of a hypersurface in the Macaulay2 package NumericalNP.m2. We propose a tropical membership test, relying on this algorithm, for higher codimension varieties based on ideas from Hept and Theobald. To showcase this software, we investigate the Newton polytope of both a hypersurface coming from algebraic vision and the Luroth invariant.
rate research
Read More
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on ideas of Hauenstein and Sottile. Additionally, we construct a numerical tropical membership algorithm which uses the former algorithm as a subroutine. Based on recent results of Esterov, we give an algorithm which recursively solves a sparse polynomial system when the support of that system is either lacunary or triangular. Prior to explaining these results, we give necessary background on polytopes, algebraic geometry, monodromy groups of branched covers, and numerical algebraic geometry.
A biconvex polytope is a convex polytope that is also tropically convex. It is well known that every bounded cell of a tropical linear space is a biconvex polytope, but its converse has been a conjecture. We classify biconvex polytopes, and prove the conjecture by constructing a matroid subdivision dual to a biconvex polytope. In particular, we construct matroids from bipartite graphs, and establish the relationship between bipartite graphs and faces of a biconvex polytope. We also show that there is a bijection between monomials and a maximal set of vertices of a biconvex polytope.
A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection product of cycles corresponds to the set-theoretic intersection of faces (whenever the latter are transverse). We explain the general framework and survey particular realizations of this approach in types A, B and C.
We compute the Newton--Okounkov bodies of line bundles on the complete flag variety of GL_n for a geometric valuation coming from a flag of translated Schubert subvarieties. The Schubert subvarieties correspond to the terminal subwords in the decomposition (s_1)(s_2s_1)(s_3s_2s_1)(...)(s_{n-1}...s_1) of the longest element in the Weyl group. The resulting Newton--Okounkov bodies coincide with the Feigin--Fourier--Littelmann--Vinberg polytopes in type A.
Tropical geometry and the theory of Newton-Okounkov bodies are two methods which produce toric degenerations of an irreducible complex projective variety. Kaveh-Manon showed that the two are related. We give geometric maps between the Newton-Okounkov bodies corresponding to two adjacent maximal-dimensional prime cones in the tropicalization of $X$. Under a technical condition, we produce a natural algebraic wall-crossing map on the underlying value semigroups (of the corresponding valuations). In the case of the tropical Grassmannian $Gr(2,m)$, we prove that the algebraic wall-crossing map is the restriction of a geometric map. In an Appendix by Nathan Ilten, he explains how the geometric wall-crossing phenomenon can also be derived from the perspective of complexity-one $T$-varieties; Ilten also explains the connection to the combinatorial mutations studied by Akhtar-Coates-Galkin-Kasprzyk.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
