Decompositions of \(q\)-Matroids Using Cyclic Flats

We study the direct sum of \(q\)-matroids by way of their cyclic flats. Using that the rank function of a \(q\)-matroid is fully determined by the cyclic flats and their ranks, we show that the cyclic flats of the direct sum of two \(q\)-matroids are exactly all the direct sums of the cyclic flats of the two summands. This simplifies the rank function of the direct sum significantly. A \(q\)-matroid is called irreducible if it cannot be written as a (nontrivial) direct sum. We provide a characterization of irreducibility in terms of the cyclic flats and show that every \(q\)-matroid can be decomposed into a direct sum of irreducible \(q\)-matroids, which are unique up to equivalence.<p/>

Authors

Institutions

Publication Details

Journal
SIAM Journal on Discrete Mathematics
Published
2024-12-03
DOI
https://doi.org/10.1137/23m156358x
Citations
2
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decompositions of \(q\)-Matroids Using Cyclic Flats

Benjamin Jany, Heide Gluesing-Luerssen
2 citations
SIAM Journal on Discrete Mathematics
Coding theory and cryptography
0.35
article

Decompositions of \(q\)-Matroids Using Cyclic Flats

Benjamin Jany, Heide Gluesing-Luerssen
article en
2 citations

Abstract

We study the direct sum of \(q\)-matroids by way of their cyclic flats. Using that the rank function of a \(q\)-matroid is fully determined by the cyclic flats and their ranks, we show that the cyclic flats of the direct sum of two \(q\)-matroids are exactly all the direct sums of the cyclic flats of the two summands. This simplifies the rank function of the direct sum significantly. A \(q\)-matroid is called irreducible if it cannot be written as a (nontrivial) direct sum. We provide a characterization of irreducibility in terms of the cyclic flats and show that every \(q\)-matroid can be decomposed into a direct sum of irreducible \(q\)-matroids, which are unique up to equivalence.<p/>

SIAM Journal on Discrete MathematicsVol. 38(4)
University of Kentucky (US), Eindhoven University of Technology (NL)
Simons Foundation
Openalex Percentile: Top 31%
Coding theory and cryptography
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.