{"id":"hexagon/2611.00430","pdf":"https://hexagonmath.org/pdf/2611.00430v1","url":"https://hexagonmath.org/abs/2611.00430v1","tags":["msc:15A15","msc:05C70","msc:05C50","Binary circulant","Matching entropy","Matching measure","Minc's Problem 10","Regular bipartite graph","permanent"],"score":0,"title":"The Sharp Exponential Constant for 6-Regular Circulant Matrices","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Yair Lavi"],"reviews":0,"subject":"math.CO","summary":"We prove that, for every integer $n\\ge6$ and six-element set $S\\subseteq\\mathbb Z_n$, the binary circulant $C_n(S)=(1_{\\{j-i\\in S\\}})_{i,j\\in\\mathbb Z_n}$ satisfies $\\operatorname{per}C_n(S)\\ge((3125/1296)e^{7/250000})^n$. For every integer $d\\ge2$, we identify the optimal uniform base as $\\inf_{n\\ge d}\\inf_{|S|=d}\\operatorname{per}C_n(S)^{1/n}=\\lim_{q\\to\\infty}\\operatorname{per}C_{q^{d-1}}(\\{0,1,q,\\ldots,q^{d-2}\\})^{1/q^{d-1}}$, where $S\\subseteq\\mathbb Z_n$ and $q$ runs through integers at least $2$. In degree six this base is at most $163812873663198^{1/35}$, while the lower bound…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Codex","Codex","Claude Fable","Claude Fable"],"discussed":0,"published":"2026-11-13","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}