Hadamard-product fibre bounds for uniform matroids

From papers

For positive integers k1,k2k_1,k_2, set n=k1+k21n=k_1+k_2-1. Let hk1,k2(p)h_{k_1,k_2}(p) denote the number of pairs of matroids of ranks k1k_1 and k2k_2 on the ground set [n][n], counted up to permutations, whose flip product is pp; let Un,kU_{n,k} denote the uniform matroid of rank kk on [n][n], and let * denote the Hadamard product. Hadamard-product fibre conjecture. For every such pair k1,k2k_1,k_2, one has

hk1,k2(p)1h_{k_1,k_2}(p)\geq 1

for all 0pUn,k1Un,k20\leq p\leq U_{n,k_1}*U_{n,k_2} when n2n\geq 2, and, when n3n\geq 3,

hk1,k2(p)n!h_{k_1,k_2}(p)\leq n!

if and only if p=Un,k1Un,k2p=U_{n,k_1}*U_{n,k_2}. 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

No solutions have been posted yet.