Hadamard-product fibre bounds for uniform matroids
Hadamard-product fibre bounds for uniform matroids
For positive integers , set . Let denote the number of pairs of matroids of ranks and on the ground set , counted up to permutations, whose flip product is ; let denote the uniform matroid of rank on , and let denote the Hadamard product. Hadamard-product fibre conjecture. For every such pair , one has
for all when , and, when ,
if and only if . The conjecture concerns the possible fibre sizes of the flip-product map; the reverse implication in the second assertion follows from an nbc-basis count, and the first assertion has been verified computationally for the listed small cases, but the general statements remain open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Oliver Clarke, Sean Dewar, Matteo Gallet, Georg Grasegger, Daniel Green Tripp and Ben Smith, “Counting fibres of the Hadamard product using Bergman fans”, arXiv:2511.22646 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.