On the Generation of Rank 3 Simple Matroids with an Application to Terao's Freeness Conjecture
DOI10.1137/19M1296744zbMath1465.05025arXiv1907.01073WikidataQ123190732 ScholiaQ123190732MaRDI QIDQ4992840
Mohamed Barakat, Christopher Jefferson, Reimer Behrends, Lukas Kühne, Martin Leuner
Publication date: 10 June 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.01073
priority queue; NoSQL database; ArangoDB; integrally splitting characteristic polynomial; iterator of leaves of rooted tree; leaf-iterator; parallel evaluation of recursive iterator; rank 3 simple matroids; recursive iterator; Terao's freeness conjecture; tree-iterator
52B40: Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.)
68R05: Combinatorics in computer science
68W10: Parallel algorithms in computer science
32S22: Relations with arrangements of hyperplanes
52C35: Arrangements of points, flats, hyperplanes (aspects of discrete geometry)
05B35: Combinatorial aspects of matroids and geometric lattices
Uses Software
