A dissertation compiling five prior papers: GPU-accelerated persistent homology (HYPHA, Ripser++), near-linear-time approximated Wasserstein distance for persistence diagrams (PDoptFlow), and topology-based graph and hypergraph learning (GEFL, symmetry breaking).
Proof of bijection for combinatorial number system
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Combinatorial number system represents a non-negative natural numbers as sum of binomial coefficients. This paper presents an induction proof that there exists unique representation of every non-negative natural number $m$ as sum of $r$ binomial coefficients.
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Computing and Learning on Combinatorial Data
A dissertation compiling five prior papers: GPU-accelerated persistent homology (HYPHA, Ripser++), near-linear-time approximated Wasserstein distance for persistence diagrams (PDoptFlow), and topology-based graph and hypergraph learning (GEFL, symmetry breaking).