Closure correlations in paving and low-corank matroids

Sample an independent set after deleting two marked elements of a finite matroid, with probability proportional to the product of its element weights. This is the closure-correlation conjecture of Çiçeksiz and Ravichandran. We prove that the two events that the sampled set spans the marked elements are positively correlated for every paving matroid and for every matroid of corank at most three. In both cases the covariance numerator has nonnegative coefficients in the individual weights. The paving result follows from a monomial-preserving circuit exchange and extends to a condition on circuits through just one mark. The low-corank result uses complementary spanning sets in the dual and a coefficient inequality for two pencils of lines. Exact minor and series and parallel extension identities give further closure properties, and the proofs yield strictness criteria for positive weights. We also give a portable integer certificate for the binary rank-four consequence of earlier reported computations, including its forest-connectivity specialization.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24407843
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Closure correlations in paving and low-corank matroids

Scott Schubr
1 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Closure correlations in paving and low-corank matroids

Scott Schubr
preprint en

Abstract

Sample an independent set after deleting two marked elements of a finite matroid, with probability proportional to the product of its element weights. This is the closure-correlation conjecture of Çiçeksiz and Ravichandran. We prove that the two events that the sampled set spans the marked elements are positively correlated for every paving matroid and for every matroid of corank at most three. In both cases the covariance numerator has nonnegative coefficients in the individual weights. The paving result follows from a monomial-preserving circuit exchange and extends to a condition on circuits through just one mark. The low-corank result uses complementary spanning sets in the dual and a coefficient inequality for two pencils of lines. Exact minor and series and parallel extension identities give further closure properties, and the proofs yield strictness criteria for positive weights. We also give a portable integer certificate for the binary rank-four consequence of earlier reported computations, including its forest-connectivity specialization.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
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.

Laika access coming soon