On the generation of rank 3 simple matroids with an application to Terao's freeness conjecture

DOI10.1137/19M1296744MaRDI QIDQ4992840zbMATH OpenWikidataFDO

Authors Mohamed Barakat, Reimer Behrends, Christopher Jefferson, 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

zbMATH Keywords

ArangoDBintegrally splitting characteristic polynomialiterator of leaves of rooted treeleaf-iteratorNoSQL databaseparallel evaluation of recursive iteratorpriority queuerank 3 simple matroidsrecursive iteratorTerao's freeness conjecturetree-iterator

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Relations with arrangements of hyperplanes (32S22) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)

Abstract: In this paper we describe a parallel algorithm for generating all non-isomorphic rank $3$ simple matroids with a given multiplicity vector. We apply our implementation in the HPC version of GAP to generate all rank $3$ simple matroids with at most $14$ atoms and a splitting characteristic polynomial. We have stored the resulting matroids alongside with various useful invariants in a publicly available, ArangoDB-powered database. As a byproduct we show that the smallest divisionally free rank $3$ arrangement which is not inductively free has $14$ hyperplanes and exists in all characteristics distinct from $2$ and $5$. Another database query proves that Terao's freeness conjecture is true for rank $3$ arrangements with $14$ hyperplanes in any characteristic.

Recommendations

• Computing the nonfree locus of the moduli space of arrangements and Terao’s freeness conjecture
• Matroid Representations and free Arrangements
• Representations of torsion-free arithmetic matroids
• Equivalence-free exhaustive generation of matroid representations
• Combinatorial generation of matroid representations: theory and practice

Cites work

• A Decomposition for Combinatorial Geometries
• An axiomatic setup for algorithmic homological algebra and an alternative approach to localization
• Computing the nonfree locus of the moduli space of arrangements and Terao’s freeness conjecture
• Divisionally free arrangements of hyperplanes
• Free arrangements of hyperplanes and supersolvable lattices
• Freeness for 13 lines arrangements is combinatorial
• Generalized exponents of a free arrangement of hyperplanes and Shepherd- Todd-Brieskorn formula
• Geometric algebra for combinatorial geometries
• Graphs whose flow polynomials have only integral roots
• scientific article; zbMATH DE number 1274886 (Why is no real title available?)
• scientific article; zbMATH DE number 1123787 (Why is no real title available?)
• scientific article; zbMATH DE number 3803606 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3049937 (Why is no real title available?)
• Logarithmic bundles and line arrangements, an approach via the standard construction
• Matroid enumeration for incidence geometry
• Minimal and canonical images
• Minimal fields of definition for simplicial arrangements in the real projective plane
• New refiners for permutation group search
• Non-recursive freeness and non-rigidity
• On inductively free reflection arrangements.
• On matroids determined by their Tutte polynomials
• Permutation group algorithms based on partitions. I: Theory and algorithms
• Recursively free reflection arrangements
• Restrictions of free arrangements and the division theorem
• Roots of characteristic polynomials and intersection points of line arrangements
• Supersolvable lattices

Cited in

(8)

• Logarithmic vector fields and freeness of divisors and arrangements: new perspectives and applications. Abstracts from the workshop held January 24--30, 2021 (online meeting)
• The toric ideal of a matroid of rank 3 is generated by quadrics
• Computing the nonfree locus of the moduli space of arrangements and Terao’s freeness conjecture
• On the geometry of flag Hilbert-Poincaré series for matroids
• On the geometry of flag Hilbert-Poincaré series for matroids
• On nearly free arrangements of lines with nodes and triple points
• Unexpected curves in \(\mathbb{P}^2\), line arrangements, and minimal degree of Jacobian relations
• Free line arrangements with low maximal multiplicity

Describes a project that uses

Uses Software

• ModulePresentationsForCAP
• LinearAlgebraForCAP
• GeneralizedMorphismsForCAP
• ZariskiFrames
• ArangoDB
• CAP
• SINGULAR
• GAP
• homalg
• GitHub

This page was built for publication: On the generation of rank 3 simple matroids with an application to Terao's freeness conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4992840)