On strongly walk regular graphs, triple sum sets and their codes

DOI10.1007/S10623-022-01118-ZarXiv2012.06160WikidataQ122781707 ScholiaQ122781707MaRDI QIDQ6355804FDOQ6355804

Authors: Michael Kiermaier, Sascha Kurz, Patrick Solé, Michael Stoll, Alfred Wassermann 

Publication date: 11 December 2020

Abstract: Strongly walk regular graphs (SWRGs or $s$-SWRGs) form a natural generalization of strongly regular graphs (SRGs) where paths of length~2 are replaced by paths of length~$s$. They can be constructed as coset graphs of the duals of projective three-weight codes whose weights satisfy a certain equation. We provide classifications of the feasible parameters of these codes in the binary and ternary case for medium size code lengths. For the binary case, the divisibility of the weights of these codes is investigated and several general results are shown. It is known that an $s$-SWRG has at most 4 distinct eigenvalues $k>het{a}_1>het{a}_2>het{a}_3$, and that the triple $(het{a}_1,het{a}_2,het{a}_3)$ satisfies a certain homogeneous polynomial equation of degree $s-2$ (Van Dam, Omidi, 2013). This equation defines a plane algebraic curve; we use methods from algorithmic arithmetic geometry to show that for $s=5$ and $s=7$, there are only the obvious solutions, and we conjecture this to remain true for all (odd) $sge9$.

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Linear codes (general theory) (94B05) Higher degree equations; Fermat's equation (11D41)

This page was built for publication: On strongly walk regular graphs, triple sum sets and their codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355804)