DavidLapous/multipers

Compute euler characteristic of clique complexes, without expanding simplicial complex

Open

#3 opened on Jan 26, 2023

View on GitHub
 (0 comments) (0 reactions) (0 assignees)C++ (8 forks)auto 404
enhancementhelp wanted

Repository metrics

Stars
 (43 stars)
PR merge metrics
 (PR metrics pending)

Description

Currently the euler_char method only sums the simplices in the simplextree; for clique complexes such as Rips, on which the dimension is pruned, the computation is not exact.

Contributor guide

Research direction
Implement computation using only the vertex set and edge information to avoid expanding the full clique complex. Refer to known formulas for Euler characteristic of clique complexes.
Tech stack
cpppython
Domain
backend
Issue type
Bug
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
C++Pythonsimplicial homology
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
40