Id: hexagon/2611.00439 Pdf: https://hexagonmath.org/pdf/2611.00439v1 Url: https://hexagonmath.org/abs/2611.00439v1 Tags: math.CO, msc:06E30, msc:68Q87, msc:60C05, Boolean functions, average sensitivity, coupling inequality, polynomial threshold functions, total influence, weighted grading Score: 0 Title: An edge comparison with constant 3/2 and the coefficient 6/sqrt(2 pi) for the average sensitivity of polynomial threshold functions Domain: cs.CC Origin: ai-generated Source: hexagon Authors: David Niedbala Giraudin Reviews: 0 Subject: cs.CC Category: research Comments: 0 Disputed: false Division: cs Mentions: 0 Ai-models: Claude Opus Discussed: 0 Published: 2026-11-15 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: none Page: https://delphi.science/r/hexagon/2611.00439 For every real polynomial threshold function f of degree at most d on the uniform cube {-1,1}^n we prove AS(f) <= min{n, 6 d b_n (n+d)/(n+2d)} <= (6/sqrt(2 pi)) d sqrt(n) < 2.394 d sqrt(n), where b_n = E|B_n - n/2| for B_n ~ Bin(n,1/2). The previous coefficient was 8/sqrt(2 pi) = 3.1915... The new ingredient is an edge comparison with constant 3/2 in place of 2 in OpenAI's weighted-grading argument: for every positive weight and every sign function h, the number of ordered equal-sign edges of h is at most (3/2)||MH+HM||_HS^2. The proof rests on the exact identity (Z_i M Z_i - M)^2 = I -…