Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Compute euler characteristic of clique complexes, without expanding simplicial complex #3

Open
DavidLapous opened this issue Jan 26, 2023 · 0 comments
Open

Compute euler characteristic of clique complexes, without expanding simplicial complex #3

DavidLapous opened this issue Jan 26, 2023 · 0 comments
Labels
enhancement New feature or request help wanted Extra attention is needed

Comments

@DavidLapous
Copy link
Owner

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.
@DavidLapous DavidLapous added enhancement New feature or request help wanted Extra attention is needed labels Jan 26, 2023
@DavidLapous DavidLapous changed the title Compute euler characteristic of clique complexes, without computing persistence Compute euler characteristic of clique complexes, without expanding simplicial complex Feb 21, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request help wanted Extra attention is needed
Projects
Roadmap for multipers
Status: Todo
Milestone
No milestone
Development

No branches or pull requests
1 participant
@DavidLapous