Maximal matroids in weak order posets

DOI10.1016/J.JCTB.2023.10.012MaRDI QIDQ6187341zbMATH OpenOpenAlexFDO

Authors Bill Jackson, Shin-Ichi Tanigawa

Publication date 15 January 2024

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2102.09901

zbMATH Keywords

combinatorial rigiditymatroid erectionmatroid on a graphmatroid weak orderrank functionsubmodularityunique maximal matroidweakly saturated sequence

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)

Abstract: Let $cX$ be a family of subsets of a finite set $E$. A matroid on $E$ is called an $cX$-matroid if each set in $cX$ is a circuit. We consider the problem of determining when there exists a unique maximal $cX$-matroid in the weak order poset of all $cX$-matroids on $E$, and characterizing its rank function when it exists.

Recommendations

• scientific article; zbMATH DE number 1808171
• scientific article; zbMATH DE number 2067317
• Matroids on partially ordered sets
• Global rank axioms for poset matroids
• On chains of matroids in the weak order

Cites work

• A matroid on hypergraphs, with applications in scene analysis and geometry
• Abstract 3-Rigidity and Bivariate $C_2^1$-Splines I: Whiteley's Maximality Conjecture
• Abstract 3-Rigidity and Bivariate C₂¹-Splines II: Combinatorial Characterization
• An extremal problem for sets with applications to graph theory
• Bipartite rigidity
• Combinatorial conditions for the unique completability of low-rank matrices
• Completion of tree metrics and rank 2 matrices
• Count matroids of group-labeled graphs
• Exact bounds for some hypergraph saturation problems
• scientific article; zbMATH DE number 3959442 (Why is no real title available?)
• scientific article; zbMATH DE number 501471 (Why is no real title available?)
• scientific article; zbMATH DE number 952952 (Why is no real title available?)
• scientific article; zbMATH DE number 3275275 (Why is no real title available?)
• scientific article; zbMATH DE number 3422398 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• Hyperconnectivity of graphs
• Matroid erection and duality
• On Abstract Rigidity Matroids
• On graphs and rigidity of plane skeletal structures
• Rigidity Matroids
• Uniform families and count matroids
• Uniqueness of low-rank matrix completion by rigidity theory
• Weakly P-saturated graphs
• Weakly saturated hypergraphs and exterior algebra
• When is a bipartite graph a rigid framework?

Cited in

(3)

• Rigidity and reconstruction in matroids of highly connected graphs
• Efficient algorithms for maximal matroid degenerations and irreducible decompositions of circuit varieties
• Identifiability of points and rigidity of hypergraphs under algebraic constraints

This page was built for publication: Maximal matroids in weak order posets

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