Integer complexity: the integer defect

DOI10.2140/MOSCOW.2019.8.193zbMath1448.11020arXiv1804.07446OpenAlexW2798602608WikidataQ127405107 ScholiaQ127405107MaRDI QIDQ2319502

Harry Altman

Publication date: 19 August 2019

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.07446

zbMATH Keywords

integer complexityarithmetic formulaswell-ordering

Mathematics Subject Classification ID

Other number representations (11A67)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integer complexity: representing numbers of bounded defect
• Integer complexity and well-ordering
• The Scholz-Brauer problem in addition chains
• Internal structure of addition chains: well-ordering
• On a generalization of addition chains: addition-multiplication chains
• Characterizing Arithmetic Read-Once Formulae
• Numbers with Integer Complexity Close to the Lower Bound
• Robin's inequality for new families of integers
• Arithmetic of ordinals with applications to the theory of ordered Abelian groups

This page was built for publication: Integer complexity: the integer defect