Pith. sign in

REVIEW 1 cited by

Betti numbers of unordered configuration spaces of small graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1906.00692 v2 pith:G7UPZXC4 submitted 2019-06-03 math.AT cs.CGmath.CO

Gabriel C. Drummond-Cole This is my paper
classification math.ATcs.CGmath.CO
keywords betticonfigurationgraphsnumberssmallspacesunorderedavoid
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The purpose of this document is to provide data about known Betti numbers of unordered configuration spaces of small graphs in order to guide research and avoid duplicated effort. It contains information for connected multigraphs having at most nine edges which contain no loops, no bivalent vertices, and no internal (i.e., non-leaf) bridges.

Discussion (0). Sign in 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. Hilbert polynomials of configuration spaces over graphs of circumference at most 1

    math.GT 2025-05 conditional novelty 7.0 of 10

    The i-th Betti number of configuration spaces of 'bunch of grapes' graphs is exactly a polynomial in k for all k, given by a convolution of local first Betti polynomials.

Pith tools