Related papers: Numbers
For every natural number $n$, there exist finitely presented groups with residual finiteness depths $\omega\cdot n$ and $\omega\cdot n + 1$. The ordinals that arise as the residual finiteness depth of a finitely generated group…
We provide mutual elementary recursive order isomorphisms between classical ordinal notations, based on Skolem hulling, and notations from pure elementary patterns of resemblance of order $2$, showing that the latter characterize the…
Using a family of graded algebra structures on a planar algebra and a family of traces coming from random matrix theory, we obtain a tower of non-commutative probability spaces, naturally associated to a given planar algebra. The associated…
In traditional rewriting theory, one studies a set of terms up to a set of rewriting relations. In algebraic rewriting, one instead studies a vector space of terms, up to a vector space of relations. Strikingly, although both theories are…
We present a detailed and elementary construction of the real numbers from the rational numbers a la Bourbaki. The real numbers are defined to be the set of all minimal Cauchy filters in $\mathbb{Q}$ (where the Cauchy condition is defined…
In the context of the integration over algebras introduced in a previous paper, we obtain several results for a particular class of associative algebras with identity. The algebras of this class are called self-conjugated, and they include,…
In the former article "Formal mathematical systems including a structural induction principle" we have presented a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the…
The Ackermann function is a famous total recursive binary function on the natural numbers. It is the archetypal example of such a function that is not primitive recursive, in the sense of classical recursion theory. However, and in seeming…
For x,y in R (where R denotes the real numbers) and f in L^2(R), define (x,y)f(t) = e^{2 pi i yt}f(t+x) and if L is a subset of R^2, define S(f,L) = {(x,y)f | (x,y) in L}. It has been conjectured that if f is not 0, then S(f,L) is linearly…
Free independence is an important tool for studying the structure of operator algebras. It is natural to ask from the model-theoretic standpoint whether free independence is captured well in first-order model theory via the notion of a…
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…
Given a von Neumann algebra $M$ denote by $S(M)$ and $LS(M)$ respectively the algebras of all measurable and locally measurable operators affiliated with $M.$ For a faithful normal semi-finite trace $\tau$ on $M$ let $S(M, \tau)$ (resp.…
We consider a notion of "numerosity" for sets of tuples of natural numbers, that satisfies the five common notions of Euclid's Elements, so it can agree with cardinality only for finite sets. By suitably axiomatizing such a notion, we show…
In introductory books about natural numbers, a common kind of assertion - often left as exercise to the reader - is that certain forms of induction on $\mathbb{N}$ (regular/ordinary, complete/strong) are equivalent one to each other and to…
Let S be a symbol algebra. The trace form of S is computed and it is shown how this form can be used to determine whether S is a division algebra or not. In addition, the exterior powers of the trace form of S are computed.
It has been more than twenty years since Moshe Newman, based on work by Neil Calkin and Herbert Wilf, introduced an explicit bijection between the rational and natural numbers. Interestingly, this bijection is dynamic in nature. Indeed,…
This paper examines the completion of an w-ordered sequence of recursive definitions which on the one hand defines an increasing sequence of nested set and on the other redefines successively a numeric variable as the cardinal of the…
We provide an efficient encoding of the natural numbers {0,1,2,3,...} as strings of nested parentheses {(),(()),(()()),((())),...}, or considered inversely, an efficient enumeration of such strings. The technique is based on the recursive…
We define reflective numbers and their iterative summations. We provide classification of reflective numbers based on their iterative cyclical limits.
The author advocates two specific mathematical notations from his popular course and joint textbook, "Concrete Mathematics". The first of these, extending an idea of Iverson, is the notation "[P]" for the function which is 1 when the…