Pith. sign in

REVIEW 1 cited by

Proof of bijection for combinatorial number system

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 1601.05794 v1 pith:CCOTK2WZ submitted 2016-01-21 math.CO

Abu Bakar Siddique , Saadia Farid , Muhammad Tahir This is my paper · ORCID
classification math.CO
keywords numberbinomialcoefficientscombinatorialnaturalnon-negativeproofsystem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

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. Computing and Learning on Combinatorial Data

    cs.AI 2025-02 conditional novelty 4.0 of 10

    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 ...

Pith tools