Back to search

Georgia Institute of Technology

Can Gangsters Travel Along Matroid Basis Graphs?

Abstract

dc:description.abstract

Combinatorial homotopy theory, or $A$-theory, is a homotopy theory of simplicial complexes which is known to have far-reaching applications. In the graph case, it coincides with a notion of homotopy first introduced by Maurer to study matroid basis graphs. In the language of $A$-theory, Maurer's celebrated homotopy theorem states that matroid basis graphs have trivial fundamental group. We ask whether this result can be strengthened and make progress toward showing that matroid basis graphs are $A$-contractible. We look at this problem through the lens of Malle's ``gangster problem," which formulates $A$-contractibility of graphs in terms of gangsters traveling between towns.

Degree

thesis:*
Name thesis:degree_name
Mathematics, MS
Department thesis:degree_department
Mathematics
Grantor
Georgia Institute of Technology
Year dc:date.issued
2026

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Seabold, Jasper Giles Elston
Advisor dc:contributor.advisor
  • Baker, Matthew
Committee members dc:contributor.committeemember
  • McCarty, Rose
  • Kim, Donggyu
ORCID person:identifier.orcid

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/1853/82118

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Seabold, Jasper Giles Elston. Can Gangsters Travel Along Matroid Basis Graphs?. Georgia Institute of Technology, 2026. https://hdl.handle.net/1853/82118