Robertson’s conjecture and universal finite generation in the homology of graph braid groups

• Ben Knudsen ^[1] ; Eric Ramos ^[2]
  1. [1] Northeastern University

     Northeastern University

     City of Boston, Estados Unidos

     
  2. [2] Stevens Institute of Technology

     Stevens Institute of Technology

     City of Hoboken, Estados Unidos

     
• Localización: Selecta Mathematica, New Series, ISSN 1022-1824, Vol. 30, Nº. 5, 2024
• Idioma: inglés
• DOI: 10.1007/s00029-024-00971-1
• Enlaces
  • Texto completo
• Resumen

  • We formulate a categorification of Robertson’s conjecture analogous to the categorical graph minor conjecture of Miyata–Proudfoot–Ramos. We show that these conjectures imply the existence of a finite list of atomic graphs generating the homology of configuration spaces of graphs—in fixed degree, with a fixed number of particles, under topological embeddings. We explain how the simplest case of our conjecture follows from work of Barter and Proudfoot–Ramos, implying that the category of cographs is Noetherian, a result of potential independent interest.

• Referencias bibliográficas
  • Abrams, A.D.: Configuration spaces and braid groups of graphs, Thesis (Ph.D.)—University of California, Berkeley (2000)
  • An, B.H., Drummond-Cole, G.C., Knudsen, B.: Subdivisional spaces and graph braid groups. Doc. Math. 24, 1513–1583 (2019)
  • An, B.H., Drummond-Cole, G.C., Knudsen, B.: Edge stabilization in the homology of graph braid groups. Geom. Topol. 24(1), 421–469 (2020)
  • An, B.H., Knudsen, B.: On the second homology of planar graph braid groups. J. Topol. 15, 666–691 (2022)
  • Barter, D.: Noetherianity and rooted trees. arXiv:1509.04228
  • Chettih, S., Lütgehetmann, D.: The homology of configuration spaces of trees with loops. Algebr. Geom. Topol. 18, 2443–2469 (2018)
  • Corneil, D.G., Lerchs, H., Burlingham, L.S.: Complement reducible graphs. Discrete Appl. Math. 3(3), 163–174 (1981)
  • Damaschke, P.: Induced subgraphs and well-quasi-ordering. J. Graph Theory 14(4), 427–435 (1990)
  • Draisma, J.: Noetherianity up to symmetry. In: Combinatorial Algebraic Geometry, Lecture Notes in Mathematics, vol. 2108, pp. 33–61. Springer,...
  • Ko, K.H., Park, H.W.: Characteristics of graph braid groups. Discrete Comput. Geom. 48(4), 915–963 (2012)
  • Liu, C.-H., Thomas, R.: Robertson’s conjecture I. Well-quasi-ordering bounded tree-width graphs by the topological minor relation. arXiv preprint...
  • Mac Lane, S.: Categories for the Working Mathematician, Graduate Texts in Mathematics. Springer (1998)
  • Miyata, D., Proudfoot, N., Ramos, E.: The categorical graph minor theorem. arXiv preprint arXiv:2004.05544 (2020)
  • Miyata, D., Ramos, E.: The graph minor theorem in topological combinatorics. Adv. Math. 430, 109203 (2023)
  • Maciażek, T., Sawicki, A.: Non-abelian quantum statistics on graphs. Commun. Math. Phys. 371(3), 921–973 (2019)
  • Proudfoot, N., Ramos, E.: The contraction category of graphs. Represent. Theory Am. Math. Soc. 26(23), 673–697 (2022)
  • Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner’s conjecture. J. Combin. Theory Ser. B 92(2), 325–357 (2004)
  • Świątkowski, J.: Estimates for homological dimension of configuration spaces of graphs. Colloq. Mathematicum 89, 69–79 (2001)
  • Sam, S.V., Snowden, A.: Gröbner methods for representations of combinatorial categories. J. Am. Math. Soc. 30(1), 159–203 (2017)