Related papers: The Aurellion Function: A Recursive Fast-Growing H…
Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…
Caucal hierarchy is a well-known class of graphs with decidable monadic theories. It were proved by L. Braud and A. Carayol that well-orderings in the hierarchy are the well-orderings with order types less than $\varepsilon_0$. Naturally,…
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…
We study a fixed-window counting system in which integers are represented by words of constant length while the alphabet grows as needed. This viewpoint arises from De Bruijn sequences: for fixed order $n$, the reverse prefer-max sequence…
There are two well known systems formalizing total recursion beyond primitive recursion (\textbf{PR}), system \textbf{T} by G\"odel and system \textbf{F} by Girard and Reynolds. system \textbf{T} defines recursion on typed objects and can…
We develop a simplified method for obtaining higher orders in the perturbative expansion of the singular term A(\alpha_s)/[1-x]_+ of non-singlet partonic splitting functions. Our method is based on the calculation of eikonal diagrams. The…
We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…
In this paper, we consider the formal power series whose n-th coefficient is the number of copies of a given finite graph in the ball of radius n centred at the identity element in the Cayley graph of a finitely generated group and call it…
Observing the existing relationships between the elementary operations of addition, multiplication (iteration of additions) and exponentiation (iteration of multiplications), a new operation (named incrementation) is defined, consistently…
Inspired by Leivant's work on absolute predicativism, Bellantoni and Cook in 1992 introduced a structurally restricted form of recursion called predicative recursion. Using this recursion scheme on the inductive structures of natural…
While much work has been done to characterize the Turing degrees computing members of various collections of fast growing functions, much less has been done to characterize the rate of growth necessary to compute particular degrees. Prior…
We present calculations of structure functions using a renormalization scheme consistent expansion which is leading order in both ln(1/x) and \alpha_s(Q^2). There is no factorization scheme dependence, and the ``physical anomalous…
A class of subharmonic functions represented by the modified kernels are proved to have the growth estimates u(x) =o(x_{n}^{1-alpha}|x|^{m+alpha})at infinity in the upper half space of Rn, which generalizes the growth properties of analytic…
For an indeterminate moment problem we denote the orthonormal polynomials by P_n. We study the relation between the growth of the function P(z)=(\sum_{n=0}^\infty|P_n(z)|^2)^{1/2} and summability properties of the sequence (P_n(z)). Under…
Given an abstract group $G$, we study the function $ab_n(G) := \sup_{|G:H| \leq n} |H/[H,H]|$. If $G$ has no abelian composition factors, then $ab_n(G)$ is bounded by a polynomial: as a consequence, we find a sharp upper bound for the…
This is a summation of research done in the author's second and third year of undergraduate mathematics at The University of Toronto. As the previous details were largely scattered and disorganized; the author decided to rewrite the…
In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…
We present consistently ordered calculations of the structure functions F_2(x,Q^2) and F_L(x,Q^2), in different expansion schemes. After discussing the standard expansion in powers of alpha_s(Q^2) we consider a leading-order expansion in…
A notion of central importance in categorical topology is that of topological functor. A faithful functor E -> B is called topological if it admits cartesian liftings of all (possibly large) families of arrows; the basic example is the…
Erickson defined the fusible numbers as a set $\mathcal F$ of reals generated by repeated application of the function $\frac{x+y+1}{2}$. Erickson, Nivasch, and Xu showed that $\mathcal F$ is well ordered, with order type $\varepsilon_0$.…