Tightness of the Weight-Distribution Bound for Strongly Regular Polar Graphs

IF 0.8 4区数学 Q3 MATHEMATICS

Journal of Combinatorial Designs Pub Date : 2025-08-04 DOI:10.1002/jcd.22001

Rhys J. Evans, Sergey Goryainov, Leonid Shalaginov

引用次数: 0

Abstract

In this paper, we show the tightness of the weight-distribution bound for the positive nonprincipal eigenvalue of strongly regular (affine) polar graphs and characterise the optimal eigenfunctions. Additionally, we show the tightness of the weight-distribution bound for the negative nonprincipal eigenvalue of some unitary polar graphs.

Abstract Image

查看原文本刊更多论文

强正则极图权分布界的紧性

本文给出了强正则（仿射）极图的正非主特征值权分布界的紧性，并给出了最优特征函数的性质。此外，我们还证明了一些酉极图的负非主特征值的权分布界的紧性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Combinatorial Designs 数学-数学

CiteScore

1.60

自引率

14.30%

发文量

审稿时长

>12 weeks

期刊介绍： The Journal of Combinatorial Designs is an international journal devoted to the timely publication of the most influential papers in the area of combinatorial design theory. All topics in design theory, and in which design theory has important applications, are covered, including: block designs, t-designs, pairwise balanced designs and group divisible designs Latin squares, quasigroups, and related algebras computational methods in design theory construction methods applications in computer science, experimental design theory, and coding theory graph decompositions, factorizations, and design-theoretic techniques in graph theory and extremal combinatorics finite geometry and its relation with design theory. algebraic aspects of design theory. Researchers and scientists can depend on the Journal of Combinatorial Designs for the most recent developments in this rapidly growing field, and to provide a forum for both theoretical research and applications. All papers appearing in the Journal of Combinatorial Designs are carefully peer refereed.