Skip to content

README.md

Latest commit

 

History

History
33 lines (29 loc) · 6.42 KB

README.md

File metadata and controls

33 lines (29 loc) · 6.42 KB

Jupyter notebooks

  • Demo.ipynb Demo.ipynb - demonstration of the sage-drg package
  • DRG-104-70-25-1-7-80.ipynb DRG-104-70-25-1-7-80.ipynb - proof of nonexistence of a distance-regular graph with intersection array {104, 70, 25; 1, 7, 80} with 1470 vertices
  • DRG-135-128-16-1-16-120.ipynb DRG-135-128-16-1-16-120.ipynb - proof of nonexistence of a distance-regular graph with intersection array {135, 128, 16; 1, 16, 120} with 1360 vertices
  • DRG-234-165-12-1-30-198.ipynb DRG-234-165-12-1-30-198.ipynb - proof of nonexistence of a distance-regular graph with intersection array {234, 165, 12; 1, 30, 198} with 1600 vertices
  • DRG-55-54-50-35-10-bipartite.ipynb DRG-55-54-50-35-10-bipartite.ipynb - proof of nonexistence of a bipartite distance-regular graph with intersection array {55, 54, 50, 35, 10; 1, 5, 20, 45, 55} with 3500 vertices
  • DRG-d3-2param.ipynb DRG-d3-2param.ipynb - proof of nonexistence of a family of distance-regular graphs with intersection arrays {(2r+1)(4r+1)(4t-1), 8r(4rt-r+2t), (r+t)(4r+1); 1, (r+t)(4r+1), 4r(2r+1)(4t-1)} (r, t ≥ 1)
  • QPoly-24-20-36_11-1-30_11-24.ipynb QPoly-24-20-36_11-1-30_11-24.ipynb - proof of nonexistence of a Q-polynomial association scheme with Krein array {24, 20, 36/11; 30/11, 24} with 225 vertices
  • QPoly-d3-1param-odd.ipynb QPoly-d3-1param-odd.ipynb - proof of nonexistence of a Q-polynomial association scheme with Krein array {2r2-1, 2r2-2, r2+1; 1, 2, r2-1} and r odd
  • QPoly-d4-LS-odd.ipynb QPoly-d4-LS-odd.ipynb - proof of nonexistence of a Q-polynomial association scheme with Krein array {m, m-1, m(r2-1)/r2, m-r2+1; 1, m/r2, r2-1, m} and m odd
  • QPoly-d4-tight4design.ipynb QPoly-d4-tight4design.ipynb - proof of nonexistence of a Q-polynomial association scheme with Krein array {r2-4, r2-9, 12(s-1)/s, 1; 1, 12/s, r2-9, r2-4} (s ≥ 4)
  • QPoly-d5-1param-3mod4.ipynb QPoly-d5-1param-3mod4.ipynb - proof of nonexistence of a Q-polynomial association scheme with Krein array {(r2+1)/2, (r2-1)/2, (r2+1)2/(2r(r+1)), (r-1)(r2+1)/(4r), (r2+1)/(2r); 1, (r-1)(r2+1)/(2r(r+1)), (r+1)(r2+1)/(4r), (r-1)(r2+1)/(2r), (r2+1)/2} and r ≡ 3 (mod 4)

RISE presentations

  • 2019-07-04-fpsac/FPSAC-sage-drg.ipynb 2019-07-04-fpsac - Computing distance-regular graph and association scheme parameters in SageMath with sage-drg software presentation at FPSAC 2019, Ljubljana, Slovenia
  • 2021-06-14-agtsem/AGTSem-sage-drg.ipynb 2021-06-14-agtsem - Computing distance-regular graph and association scheme parameters in SageMath with sage-drg talk at the Algebraic Graph Theory Seminar, University of Waterloo, Ontario, Canada
  • 2021-06-22-8ecm/8ECM-sage-drg.ipynb 2021-06-22-8ecm - Computing distance-regular graph and association scheme parameters in SageMath with sage-drg talk at the 8th European Congress of Mathematics, Graphs and Groups, Geometries and GAP - G2G2 minisymposium

Note: notebooks containing LaTeX output and may not render correctly on GitHub. You can use the Jupyter Notebook Viewer to render the notebooks correctly.