2003
DOI: 10.36045/bbms/1074791323
|View full text |Cite
|
Sign up to set email alerts
|

Arithmetics on number systems with irrational bases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
25
0

Year Published

2005
2005
2019
2019

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 15 publications
(26 citation statements)
references
References 8 publications
1
25
0
Order By: Relevance
“…Notice that in the case of the s-adic representation there exists countable set of numbers having two different s-adic representations. These numbers are numbers of the form 1) , α n = 0, and are called s-adic rational. The other numbers in [0, 1] are called s-adic irrational.…”
Section: One Example Of the Pseudo-ternary Representationmentioning
confidence: 99%
“…Notice that in the case of the s-adic representation there exists countable set of numbers having two different s-adic representations. These numbers are numbers of the form 1) , α n = 0, and are called s-adic rational. The other numbers in [0, 1] are called s-adic irrational.…”
Section: One Example Of the Pseudo-ternary Representationmentioning
confidence: 99%
“…Here, the estimate on L ⊕ (β) will be improved. In [14] and in [4], it is shown that if d β (1) = t 1 t 2 · · · t m (t m+1 ) ω and t 1 ≥ t 2 ≥ · · · ≥ t m > t m+1 , then F in(β) is closed under addition of positive elements. This fact implies that if a number x has a certain finite β-representation, then x has as well finite β-expansion.…”
Section: Infinite Words Associated With β-Integersmentioning
confidence: 99%
“…For given b find the value, or at least some good estimate, of the quantities The second, much more widely used method for estimation of L Å ( ) b , L Ä ( ) b is based on the following theorem. Several version of this method are employed in [6,8,9,10,11,12].…”
Section: Number Of Fractional Digitsmentioning
confidence: 99%
“…Moreover, there is a lot of work to be done while looking for the number of fractional digits arising under arithmetic operations. Finally, there is an open question [6] of finding arithmetic algorithms working with infinite, but periodic b-expansions. A partial answer to the last question was recently given by the author in [18].…”
Section: Finiteness Conditionmentioning
confidence: 99%
See 1 more Smart Citation