Parallel Computation of tropical varieties, their positive part, and tropical Grassmannians

03/30/2020
by   Dominik Bendle, et al.
0

In this article, we present a massively parallel framework for computing tropicalizations of algebraic varieties which can make use of finite symmetries. We compute the tropical Grassmannian TGr_0(3,8), and show that it refines the 15-dimensional skeleton of the Dressian Dr(3,8) with the exception of 23 special cones for which we construct explicit obstructions to the realizability of their tropical linear spaces. Moreover, we propose algorithms for identifying maximal-dimensional tropical cones which belong to the positive tropicalization. These algorithms exploit symmetries of the tropical variety even though the positive tropicalization need not be symmetric. We compute the maximal-dimensional cones of the positive Grassmannian TGr^+(3,8) and compare them to the cluster complex of the classical Grassmannian Gr(3,8).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2020

Algorithms in Linear Algebraic Groups

This paper presents some algorithms in linear algebraic groups. These al...
research
11/30/2020

Linear Spaces of Symmetric Matrices with Non-Maximal Maximum Likelihood Degree

We study the maximum likelihood degree of linear concentration models in...
research
05/10/2022

Dimension Walks on Generalized Spaces

Let d,k be positive integers. We call generalized spaces the cartesian p...
research
08/22/2020

BSF-skeleton: A Template for Parallelization of Iterative Numerical Algorithms on Cluster Computing Systems

This article describes a method for creating applications for cluster co...
research
04/21/2023

Solid angle measure of polyhedral cones

This paper addresses the computation of normalized solid angle measure o...
research
05/22/2023

A Multiple Parameter Linear Scale-Space for one dimensional Signal Classification

In this article we construct a maximal set of kernels for a multi-parame...
research
04/06/2022

Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening

Given a graph, finding the distance-2 maximal independent set (MIS-2) of...

Please sign up or login with your details

Forgot password? Click here to reset