Pith. sign in

REVIEW

On a Graph Connecting Hyperbinary Expansions

Not yet reviewed by Pith; the record is open.

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 1610.00903 v1 pith:SIDRRO5W submitted 2016-10-04 math.CO

On a Graph Connecting Hyperbinary Expansions

classification math.CO
keywords hyperbinarygraphabelianconnectingedge-colouredexpansionexpansionsfundamental
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Le n be any positive integer. A hyperbinary expansion of n is are presentation of n as sum of powers of 2, each power being used at most twice. In this paper we study some properties of a suitable edge-coloured and vertex-weighted oriented graph A(n) whose nodes are precisely the several hyperbinary representations of n. In particular, we identify those integers m in N such that the fundamental group of A(m) is abelian.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.