اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the rank of a tropical matrix
249
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This is a foundational paper in tropical linear algebra, which is linear algebra over the min-plus semiring. We introduce and compare three natural definitions of the rank of a matrix, called the Barvinok rank, the Kapranov rank and the tropical rank. We demonstrate how these notions arise naturally in polyhedral and algebraic geometry, and we show that they differ in general. Realizability of matroids plays a crucial role here. Connections to optimization are also discussed.
قيم البحث
اقرأ أيضاً
Let $Gamma$ be a compact tropical curve (or metric graph) of genus $g$. Using the theory of tropical theta functions, Mikhalkin and Zharkov proved that there is a canonical effective representative (called a break divisor) for each linear equivalence
class of divisors of degree $g$ on $Gamma$. We present a new combinatorial proof of the fact that there is a unique break divisor in each equivalence class, establishing in the process an integral version of this result which is of independent interest. As an application, we provide a geometric proof of (a dual version of) Kirchhoffs celebrated Matrix-Tree Theorem. Indeed, we show that each weighted graph model $G$ for $Gamma$ gives rise to a canonical polyhedral decomposition of the $g$-dimensional real torus ${rm Pic}^g(Gamma)$ into parallelotopes $C_T$, one for each spanning tree $T$ of $G$, and the dual Kirchhoff theorem becomes the statement that the volume of ${rm Pic}^g(Gamma)$ is the sum of the volumes of the cells in the decomposition.
We show that the number of combinatorial types of clusters of type $D_4$ modulo reflection-rotation is exactly equal to the number of combinatorial types of tropical planes in $mathbb{TP}^5$. This follows from a result of Sturmfels and Speyer which c
lassifies these tropical planes into seven combinatorial classes using a detailed study of the tropical Grassmannian $operatorname{Gr}(3,6)$. Speyer and Williams show that the positive part $operatorname{Gr}^+(3,6)$ of this tropical Grassmannian is combinatorially equivalent to a small coarsening of the cluster fan of type $D_4$. We provide a structural bijection between the rays of $operatorname{Gr}^+(3,6)$ and the almost positive roots of type $D_4$ which makes this connection more precise. This bijection allows us to use the pseudotriangulations model of the cluster algebra of type $D_4$ to describe the equivalence of positive tropical planes in $mathbb{TP}^5$, giving a combinatorial model which characterizes the combinatorial types of tropical planes using automorphisms of pseudotriangulations of the octogon.
We investigate geometric embeddings among several classes of stacky fans and algorithms, e.g., to compute their homology. Interesting cases arise from moduli spaces of tropical curves. Specifically, we study the embedding of the moduli of tropical ho
neycomb curves into the moduli of all tropical $K_4$-curves.
We study the combinatorics of tropical hyperplane arrangements, and their relationship to (classical) hyperplane face monoids. We show that the refinement operation on the faces of a tropical hyperplane arrangement, introduced by Ardila and Develin i
n their definition of a tropical oriented matroid, induces an action of the hyperplane face monoid of the classical braid arrangement on the arrangement, and hence on a number of interesting related structures. Along the way, we introduce a new characterization of the types (in the sense of Develin and Sturmfels) of points with respect to a tropical hyperplane arrangement, in terms of partial bijections which attain permanents of submatrices of a matrix which naturally encodes the arrangement.
We report on a recent implementation of patchworking and real tropical hypersurfaces in $texttt{polymake}$. As a new mathematical contribution we provide a census of Betti numbers of real tropical surfaces.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
