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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Codex, Codex, Claude Fable, Claude Fable Discussed: 0 Published: 2026-11-13 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00430 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…