Generalized golden ratios over integer alphabets

From MaRDI portal



Abstract: It is a well known result that for and there exists uncountably many (epsiloni)i=1inftyin0,1mathbbN such that When there exists for which there exists a unique (epsiloni)i=1inftyin0,1mathbbN such that In this paper we consider the more general case when our sequences are elements of 0,...,mmathbbN. We show that an analogue of the golden ratio exists and give an explicit formula for it.




Cited in
(48)








This page was built for publication: Generalized golden ratios over integer alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408181)