اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTropical Implicitization and Mixed Fiber Polytopes
61
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The software TrIm offers implementations of tropical implicitization and tropical elimination, as developed by Tevelev and the authors. Given a polynomial map with generic coefficients, TrIm computes the tropical variety of the image. When the image is a hypersurface, the output is the Newton polytope of the defining polynomial. TrIm can thus be used to compute mixed fiber polytopes, including secondary polytopes.
قيم البحث
اقرأ أيضاً
We address the description of the tropicalization of families of rational varieties under parametrizations with prescribed support, via curve valuations. We recover and extend results by Sturmfels, Tevelev and Yu for generic coefficients, considering
rational parametrizations with non-trivial denominator. The advantage of our point of view is that it can be generalized to deal with non-generic parametrizations. We provide a detailed analysis of the degree of the closed image, based on combinatorial conditions on the relative positions of the supports of the polynomials defining the parametrization. We obtain a new formula and finer bounds on the degree, when the supports of the polynomials are different. We also present a new formula and bounds for the order at the origin in case the closed image is a hypersurface.
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.
We explicate the combinatorial/geometric ingredients of Arthurs proof of the convergence and polynomiality, in a truncation parameter, of his non-invariant trace formula. Starting with a fan in a real, finite dimensional, vector space and a collectio
n of functions, one for each cone in the fan, we introduce a combinatorial truncated function with respect to a polytope normal to the fan and prove the analogues of Arthurs results on the convergence and polynomiality of the integral of this truncated function over the vector space. The convergence statements clarify the important role of certain combinatorial subsets that appear in Arthurs work and provide a crucial partition that amounts to a so-called nearest face partition. The polynomiality statements can be thought of as far reaching extensions of the Ehrhart polynomial. Our proof of polynomiality relies on the Lawrence-Varchenko conical decomposition and readily implies an extension of the well-known combinatorial lemma of Langlands. The Khovanskii-Pukhlikov virtual polytopes are an important ingredient here. Finally, we give some geometric interpretations of our combinatorial truncation on toric varieties as a measure and a Lefschetz number.
Let $K$ be a field equipped with a valuation. Tropical varieties over $K$ can be defined with a theory of Gr{o}bner bases taking into account the valuation of $K$.Because of the use of the valuation, the theory of tropical Gr{o}bner bases has proved
to provide settings for computations over polynomial rings over a $p$-adic field that are more stable than that of classical Gr{o}bner bases.Beforehand, these strategies were only available for homogeneous polynomials. In this article, we extend the F5 strategy to a new definition of tropical Gr{o}bner bases in an affine setting.We provide numerical examples to illustrate time-complexity and $p$-adic stability of this tropical F5 algorithm.We also illustrate its merits as a first step before an FGLM algorithm to compute (classical) lex bases over $p$-adics.
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 codime
nsion 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
