Benjamin Schröter

dblp:75/7543 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0003-3153-5211ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 2 since 2021Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
YearPublicationVenuePosition
2024 Massively parallel computation of tropical varieties, their positive part, and tropical Grassmannians
abstract
We present a massively parallel framework for computing tropicalizations of algebraic varieties which can make use of symmetries using the workflow management system GPI-Space and the computer algebra system Singular. We determine the tropical Grassmannian TGr0(3,8). Our implementation works efficiently on up to 840 cores, computing the 14763 orbits of maximal cones under the canonical S8-action in about 20 minutes. Relying on our result, we show that the Gröbner structure of TGr0(3,8) refines the 16-dimensional skeleton of the coarsest fan structure of the Dressian Dr(3,8), except for 23 orbits of special cones, for which we construct explicit obstructions to the realizability of their tropical linear spaces. Moreover, we propose algorithms for identifying maximal-dimensional cones which belong to positive tropicalizations of algebraic varieties. We compute the positive Grassmannian TGr+(3,8) and compare it to the cluster complex of the classical Grassmannian Gr(3,8).
Dominik Bendle, Janko Böhm, Benjamin Schröter
J. Symb. Comput.4
2022 Reconstructibility of Matroid Polytopes
abstract
We specify what is meant for a polytope to be reconstructible from its graph or dual graph, and we introduce the problem of class reconstructibility; i.e., the face lattice of the polytope can be determined from the (dual) graph within a given class. We provide examples of cubical polytopes that are not reconstructible from their dual graphs. Furthermore, we show that matroid (base) polytopes are not reconstructible from their graphs and not class reconstructible from their dual graphs; our counterexamples include hypersimplices. Additionally, we prove that matroid polytopes are class reconstructible from their graphs, and we present an $O(n^3)$ algorithm that computes the vertices of a matroid polytope from its $n$-vertex graph. Moreover, our proof includes a characterization of all matroids with isomorphic basis exchange graphs.
Guillermo Pineda-Villavicencio, Benjamin Schröter
SIAM J. Discret. Math.2
2019 Multi-splits and Tropical Linear Spaces from Nested Matroids
Benjamin Schröter
Discret. Comput. Geom.1
2019 Algorithms for tight spans and tropical linear spaces
Simon Hampe, Michael Joswig, Benjamin Schröter
J. Symb. Comput.3
2009 Prototyping a software factory for wireless sensor networks
abstract
Wireless sensor networks (WSNs) are often advertised with high sensing accuracy, long lifetime, and easy deployment. However, they are still not widely used in environmental research due to of poor tool support and high complexity. A wider use of WSNs in field science would enable researchers to address scientific questions that are infeasible today.
Tomasz Naumowicz, Benjamin Schröter, Jochen H. Schiller
SenSys2