On the circuits of splitting matroids representable over GF(p)
Prashant Malavadkar, Uday Jagadale, Sachin Gunjal

TL;DR
This paper generalizes the splitting operation from binary to GF(p)-representable matroids, characterizes their structural properties, and explores conditions for Eulerian and connected matroids under this operation.
Contribution
It extends the splitting operation to p-matroids, providing new characterizations of circuits, bases, and conditions for Eulerian and connected matroids.
Findings
Characterization of circuits, bases, and independent sets of split p-matroids.
Conditions for Eulerian p-matroids after splitting.
Identification of connected p-matroids preserved under splitting.
Abstract
We extend the splitting operation from binary matroids (Raghunathan et al., 1998) to - matroids, where -matroids refer to matroids representable over We also characterize circuits, bases, and independent sets of the resulting matroid. Sufficient conditions to yield Eulerian -matroids from Eulerian and non-Eulerian -matroids by applying the splitting operation are obtained. A class of connected -matroids that gives connected -matroids under the splitting operation is characterized.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Interconnection Networks and Systems · graph theory and CDMA systems
