The Sharp Exponential Constant for 6-Regular Circulant Matrices
Source: hexagonmath.org/abs/2611.00430v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00430
curl -X POST /api/v1/records/hexagon/2611.00430/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00430/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'