Iterated exponentials of two numbers (Q804610)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Iterated exponentials of two numbers |
scientific article; zbMATH DE number 4202323
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterated exponentials of two numbers |
scientific article; zbMATH DE number 4202323 |
Statements
Iterated exponentials of two numbers (English)
0 references
1991
0 references
Let \(x_ i\) \((i=1,2,...,n)\) be reals, \(0\leq x_ i\) for each \(x_ i\). Denote \[ T(x_1 x_2 \dots x_ n) = \left| \begin{matrix} &&&x_ n \\ &&\vdots& \\ &x_2&& \\ x_1&&& \end{matrix}\right. \] Next let c be a real, \(c\geq 0\); let \(A_ n(c)\) be the system of all words of length n in a and b. If we consider the variables a and b as reals, \(a\geq 0\) and \(b\geq 0\), then for \(w\in A_ n(c)\) the symbol T(w) has the obvious meaning. We define a relation \(\leq\) in \(A_ n(c)\) as follows: For w and \(w'\) in \(A_ n(c)\) we put \(w\leq w'\) if, whenever \(b\geq a\geq c\), then \(T(w)\leq T(w')\). The relation \(\leq\) is a partial order in \(A_ n(c)\). In the paper there are given complete descriptions of \(A_ n(c)\) for the following cases: (i) \(c=e\) and n arbitrary; (ii) \(c=3.6\) and n arbitrary; (iii) \(n\leq 3\) and \(c\geq 0\). Some conjectures on \(A_ n(c)\) are proposed.
0 references
iterated exponentials
0 references
tower order
0 references
0.7922888398170471
0 references
0.7220636606216431
0 references
0.6993299126625061
0 references
0.6958746910095215
0 references