Search arXivSearch

arXiv · 2602.08664

Three lectures on tropical algebra

Abstract

This document is a slightly expanded version of a series of talks given by J. Giansiracusa at the workshop `Geometry over semirings' at Universitat Autònoma de Barcelona in July 2025. In the first lecture we introduce tropical polynomials, ideals, congruences, and how the connection with tropical geometry is made via congruences of bend relations. Tropical geometry and matroid theory are telling us that we should focus attention on a narrow slice of the world of tropical algebra, and this leads to the theory of tropical ideals (as developed by Maclagan and Rincón) and an abundance of interesting open questions. In the second lecture we examine the relationship between Berkovich analytification and tropicalization from the perspective of bend relations, giving a refinement of Payne's influential limit theorem. In the third lecture we set aside geometry and focus on tropicalization via bend relations as a construction in commutative and non-commutative algebra. Constructions such as symmetric algebras, exterior algebras, matrix algebras, and Clifford algebras can be tropicalized. In the case of exterior algebras, the resulting tropical notion beautifully completes the picture of the Plücker embedding and gives a new perspective on the tropical Plücker relations. For matrix algebras and Clifford algebras, Morita theory becomes an interesting topic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeffrey Giansiracusa, Kevin Kuehn, Stefano Mereta, Eduardo Vital. 2026-02-10. Three lectures on tropical algebra. https://arxiv.org/abs/2602.08664

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO