Examples of computer experimentation in algebraic combinatorics
From MaRDI portal
Publication:3085031
DOI10.26493/1855-3974.119.60bzbMath1227.05274OpenAlexW1935451745WikidataQ129352552 ScholiaQ129352552MaRDI QIDQ3085031
Sven Reichard, Andrew J. Woldar, Christian Pech, Matan Ziv-Av, Mikhail H. Klin
Publication date: 28 March 2011
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.119.60b
Symbolic computation and algebraic computation (68W30) Association schemes, strongly regular graphs (05E30) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (8)
A non-Schurian coherent configuration on 14 points exists ⋮ Implementing Brouwer's database of strongly regular graphs ⋮ Unnamed Item ⋮ Links between two semisymmetric graphs on 112 vertices via association schemes ⋮ The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures ⋮ On the existence of self-complementary and non-self-complementary strongly regular graphs with Paley parameters ⋮ Using symbolic computation to prove nonexistence of distance-regular graphs ⋮ Unnamed Item
Uses Software
This page was built for publication: Examples of computer experimentation in algebraic combinatorics
