Abstract | ||
---|---|---|
We introduce the notion of a near-inverse of a non-decreasing sequence of positive integers; near-inverses are intended to assume the role of inverses in cases when the latter cannot exist. We prove that the near-inverse of such a sequence is unique; moreover, the relation of being near-inverses of each other is symmetric, i.e. if sequence g is the near-inverse of sequence f, then f is the near-inverse of g. There is a connection, by approximations, between near-inverses of sequences and inverses of continuous strictly increasing real-valued functions which can be exploited to derive simple expressions for near-inverses. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1080/00207160500537801 | INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS |
Keywords | Field | DocType |
integer sequence, inverse function, solid code | Integer,Discrete mathematics,Combinatorics,Complete sequence,Limit of a sequence,Expression (mathematics),Mathematical analysis,Inverse function,Mathematics,Integer sequence | Journal |
Volume | Issue | ISSN |
83 | 2 | 0020-7160 |
Citations | PageRank | References |
1 | 0.43 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Helmut Jürgensen | 1 | 208 | 43.68 |
Stavros Konstantinidis | 2 | 283 | 31.10 |