New strongly regular graphs found via local search for partial difference sets
The electronic journal of combinatorics, Tome 32 (2025) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Strongly regular graphs (SRGs) are highly symmetric combinatorial objects, with connections to many areas of mathematics including finite fields, finite geometries, and number theory. One can construct an SRG via the Cayley Graph of a regular partial difference set (PDS). Local search is a common class of search algorithm that iteratively adjusts a state to (locally) minimize an error function. In this work, we use local search to find PDSs. We found PDSs with 62 different parameter values in 1254 nonisomorphic groups of orders at most 147. Many of these PDSs replicate known results. In two cases, (144,52,16,20) and (147,66,25,33), the PDSs found give the first known construction of SRGs with these parameters. In some other cases, the SRG was already known but a PDS in that group was unknown. This work also corroborates the existence of $(64,18,2,6)$ PDSs in precisely 73 groups of order 64.
DOI : 10.37236/13296
Classification : 05E30, 05B10, 05C25
Mots-clés : partial difference set, strongly regular graph, local search

Andrew Brady  1

1 Carnegie Mellon University
@article{10_37236_13296,
     author = {Andrew Brady},
     title = {New strongly regular graphs found via local search for partial difference sets},
     journal = {The electronic journal of combinatorics},
     year = {2025},
     volume = {32},
     number = {1},
     doi = {10.37236/13296},
     zbl = {1559.05191},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/13296/}
}
TY  - JOUR
AU  - Andrew Brady
TI  - New strongly regular graphs found via local search for partial difference sets
JO  - The electronic journal of combinatorics
PY  - 2025
VL  - 32
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/13296/
DO  - 10.37236/13296
ID  - 10_37236_13296
ER  - 
%0 Journal Article
%A Andrew Brady
%T New strongly regular graphs found via local search for partial difference sets
%J The electronic journal of combinatorics
%D 2025
%V 32
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/13296/
%R 10.37236/13296
%F 10_37236_13296
Andrew Brady. New strongly regular graphs found via local search for partial difference sets. The electronic journal of combinatorics, Tome 32 (2025) no. 1. doi: 10.37236/13296

Cité par Sources :