2025/01/07 by Minjia Shi, Lu Wang, Shi, Minjia +3
Computer Science · #Combinatorics (math.CO) #Cryptography and Security (cs.CR) #Digital Image Processing Techniques #FOS: Computer and information sciences #FOS: Mathematics #Image Retrieval and Classification Techniques
paper · pdf · doi:10.48550/arxiv.2501.03709
openalex publication_date 2025/01/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show that the large Cartesian powers of any graph have log-concave valencies with respect to a ffxed vertex. We show that the series of valencies of distance regular graphs is log-concave, thus improving on a result of (Taylor, Levingston, 1978). Consequences for strongly regular graphs, two-weight codes, and completely regular codes are derived. By P-Q duality of association schemes the series of multiplicities of Q-polynomial association schemes is shown, under some assumption, to be log-concave.