The partition characterization of relaxed SLMFs
The partition characterization of relaxed SLMFs
Let , let , and write
where each . For , set
For positive integers and , call a relaxed -SLMF if
for every with , with equality when . Let be the bipartite graph associated with .
The partition characterization of relaxed SLMFs. Suppose and every vertex of has degree at least . Then is a relaxed -SLMF if and only if there is a partition
with a relaxed -SLMF for every .
The conjecture would give a purely combinatorial characterization of the relaxed SLMFs that occur in the algebraic matroid of the determinantal variety. Together with the stated sufficient and necessary conditions for a set to be a matroid base, it would complete the characterization of that algebraic matroid.
Sources & referencesView supporting material
Primary source
Manolis C. Tsakiris, “Results on the algebraic matroid of the determinantal variety”, arXiv:2002.05082 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.