Recognition: unknown
On a Graph Connecting Hyperbinary Expansions
classification
🧮 math.CO
keywords
hyperbinarygraphabelianconnectingedge-colouredexpansionexpansionsfundamental
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.