Pith. sign in

REVIEW 1 cited by

Computing Homotopy Types of Directed Flag Complexes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2006.05333 v1 pith:YPSGJOUK submitted 2020-06-09 math.AT

classification math.AT
keywords flaghomotopycomplexesdirectedcomplexspheresbrainconsider
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Combinatorially and stochastically defined simplicial complexes often have the homotopy type of a wedge of spheres. A prominent conjecture of Kahle quantifies this precisely for the case of random flag complexes. We explore whether such properties might extend to graphs arising from nature. We consider the brain network (as reconstructed by Varshney & al.) of the Caenorhabditis elegans nematode, an important model organism in biology. Using an iterative computational procedure based on elementary methods of algebraic topology, namely homology, simplicial collapses and coning operations, we show that its directed flag complex is homotopy equivalent to a wedge of spheres, completely determining, for the first time, the homotopy type of a flag complex corresponding to a brain network. We also consider the corresponding flag tournaplex and show that torsion can be found in the homology of its local directionality filtration. As a toy example, directed flag complexes of tournaments from McKay's collection are classified up to homotopy. Moore spaces other than spheres occur in this classification. As a tool, we prove that the fundamental group of the directed flag complex of any tournament is free by considering its cell structure.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Representing Higher-Order Networks: A Survey of Graph-Based Frameworks

    cs.SI 2026-03 unverdicted novelty 4.0 of 10

    A survey organizing higher-order network formalisms into four families with a master comparison table, plus ~17 new superhypergraph-style definitions whose only supporting theorems are well-definedness checks.

Pith tools