Critical problem for a \(q\)-analogue of polymatroids

DOI10.1016/j.disc.2024.113924OpenAlexW4391918586MaRDI QIDQ6204341

Shiromoto, Keisuke, Koji Imamura

Publication date: 27 March 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2024.113924

zbMATH Keywords

critical exponentblockscritical problemcritical theorem\(q\)-analogue of polymatroids

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Linear codes (general theory) (94B05) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rank-metric codes and their duality theory
• Theory of codes with maximum rank distance
• On a covering problem of Mullin and Stanton for binary matroids
• Tangential 1-blocks over GF(3)
• A geometric theory of hypergraph colouring
• Defining the \(q\)-analogue of a matroid
• Codes with the rank metric and matroids
• \(q\)-polymatroids and their relation to rank-metric codes
• Rank-metric codes and \(q\)-polymatroids
• Extensions of the critical theorem
• On the non-trivial minimal blocking sets in binary projective spaces
• THE CRITICAL PROBLEM FOR POLYMATROIDS
• Handbook of the Tutte Polynomial and Related Topics
• Code Enumerators and Tutte Polynomials
• On the algebraic theory of graph colorings
• Weighted subspace designs from \(q\)-polymatroids

This page was built for publication: Critical problem for a \(q\)-analogue of polymatroids