The frequency conjecture for Bézout coefficients of random integer polynomials

For positive integers m,n,Hm,n,H, let

Sm,n(H)={(f,g)Z[x]2:deg(f)=m, deg(g)=n, L(f)>0, L(g)>0, f and g are coprime, H(f)H, H(g)H},S_{m,n}(H)=\{(f,g)\in\mathbb{Z}[x]^2:\deg(f)=m,\ \deg(g)=n,\ L(f)>0,\ L(g)>0,\ f\text{ and }g\text{ are coprime},\ \mathrm{H}(f)\leq H,\ \mathrm{H}(g)\leq H\},

where H(h)\mathrm{H}(h) is the maximum of the absolute values of the coefficients of hh and L(h)L(h) is its leading coefficient. For coprime integer polynomials f,gf,g, let B(f,g)B(f,g) and r(f,g)r(f,g) denote the integers defined in the paper. Frequency conjecture. For any positive integers mm and nn, we have

limH{(f,g)Sm,n(H):B(f,g)=r(f,g)}Sm,n(H)910.\lim_{H \to \infty}\frac{|\{(f,g)\in S_{m,n}(H): \, B(f,g) = r(f,g)\}|}{|S_{m,n}(H)|} \geq \frac{9}{10}.

The conjecture formalizes the observed frequency with which the Bézout-related integers B(f,g)B(f,g) and r(f,g)r(f,g) coincide for randomly chosen coprime integer polynomials; the numerical data in the paper suggest frequencies above 90%90\%, while no proof of the asserted lower bound is given.

Sources & referencesView supporting material

Primary source

Zhiqian Liu, Xiaoting Li, Wenheng Liu and Min Sha, “Three integers arising from Bézout's identity and resultants of integer polynomials”, arXiv:2506.10838 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.