The Sharp Exponential Constant for 6-Regular Circulant Matrices
Version 1 / Nov 13, 2026 / CC BY 4.0
Abstract
We prove that, for every integer and six-element set , the binary circulant satisfies . For every integer , we identify the optimal uniform base as , where and runs through integers at least . In degree six this base is at most , while the lower bound strictly exceeds the sharp unrestricted base . This resolves the surviving circulant lower-bound question in Minc's Problem 10; its proposed full upper bound fails even for circulants.
Tools used
- OpenAI
- CodexVersion GPT-5.6 Sol
- OpenAI
- CodexVersion Astra
- Anthropic
- Claude FableVersion 5
- Anthropic
- Claude FableVersion 5.1
References
- H. Minc, ``Permanents of -circulants,'' Canadian Mathematical Bulletin 7 (1964), 253--263. doi:10.4153/CMB-1964-023-3 (https://doi.org/10.4153/CMB-1964-023-3)DOI
- H. Minc, ``On permanents of circulants,'' Pacific Journal of Mathematics 42 (1972), 477--484. doi:10.2140/pjm.1972.42.477 (https://doi.org/10.2140/pjm.1972.42.477)DOI
- A. Schrijver, ``A short proof of Minc's conjecture,'' Journal of Combinatorial Theory, Series A 25 (1978), 80--83. doi:10.1016/0097-3165(78)90036-5 (https://doi.org/10.1016/0097-3165(78)90036-5)DOI
- A. Schrijver and W. G. Valiant, ``On lower bounds for permanents,'' Indagationes Mathematicae (Proceedings) 83 (1980), 425--427. doi:10.1016/1385-7258(80)90043-8 (https://doi.org/10.1016/1385-7258(80)90043-8)DOI
- A. Schrijver, ``Counting -factors in regular bipartite graphs,'' Journal of Combinatorial Theory, Series B 72 (1998), 122--135. doi:10.1006/jctb.1997.1798 (https://doi.org/10.1006/jctb.1997.1798)DOI
- G.-S. Cheon and I. M. Wanless, ``An update on Minc's survey of open problems involving permanents,'' Linear Algebra and its Applications 403 (2005), 314--342. doi:10.1016/j.laa.2005.02.030 (https://doi.org/10.1016/j.laa.2005.02.030)DOI
- M. Abért, P. Csikvári and T. Hubai, ``Matching measure, Benjamini--Schramm convergence and the monomer--dimer free energy,'' Journal of Statistical Physics 161 (2015), 16--34. doi:10.1007/s10955-015-1309-7 (https://doi.org/10.1007/s10955-015-1309-7) arXiv:1405.6740 (https://arxiv.org/abs/1405.6740)arXivDOI
- P. Csikvári, ``Matchings in vertex-transitive bipartite graphs,'' Israel Journal of Mathematics 215 (2016), 99--134. doi:10.1007/s11856-016-1375-9 (https://doi.org/10.1007/s11856-016-1375-9)DOI
- P. Csikvári, ``Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems,'' Journal of the European Mathematical Society 19 (2017), 1811--1844. doi:10.4171/JEMS/706 (https://doi.org/10.4171/JEMS/706)DOI
- O. J. Heilmann and E. H. Lieb, ``Theory of monomer-dimer systems,'' Communications in Mathematical Physics 25 (1972), 190--232.
Show all 15 referencesShow fewer references
- D. G. Glynn, ``The permanent of a square matrix,'' European Journal of Combinatorics 31 (2010), 1887--1891.
- H. J. Ryser, Combinatorial Mathematics , Carus Mathematical Monographs 14, Mathematical Association of America, 1963.
- L. M. Brègman, ``Some properties of nonnegative matrices and their permanents,'' Soviet Mathematics Doklady 14 (1973), 945--949.
- H. Minc, ``Theory of permanents 1978--1981,'' Linear and Multilinear Algebra 12 (1983), 227--263. doi:10.1080/03081088308817488 (https://doi.org/10.1080/03081088308817488)DOI
- H. Minc, Permanents , Encyclopedia of Mathematics and its Applications, vol. 6, Addison-Wesley, Reading, Massachusetts, 1978.