**Problem of the Week**

**Math Club**

**BUGCAT**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

**BingAWM**

seminars:comb:abstract.200401zas

A path in the 1-skeleton of a topological cell complex (with endpoints in the 0-skeleton) is a sequence P = v_{0}, e_{1}, v_{1}, e_{2}, …, v_{k}. An elementary homotopy of P consists of replacing a subpath P' by another path Q', with the same endpoints, so that P' union Q' is contractible. One can require that P' union Q' is a circle, i.e., homeomorphic to a 1-sphere. Call this *topological homotopy*.

If we replace the 1-skeleton by an arbitrary graph and the condition of contractibility by a list of allowed circles in the graph, we have *combinatorial homotopy*. This is the sort of homotopy involved in my recent characterization of associative multary quasigroups. Here the list of allowed circles has to satisfy a “linearity” condition; the combination of the graph and the linear class of allowed circles is called a “biased graph”. A particular lemma in the proof of the quasigroup theorem displays clearly the operation of combinatorial homotopy.

The questions are: what does a topologist know (or want to know) about combinatorial homotopy, and how similar and how different are topological and combinatorial homotopy?

seminars/comb/abstract.200401zas.txt · Last modified: 2020/01/29 14:03 (external edit)

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported