Related papers: The Aurellion Function: A Recursive Fast-Growing H…

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

The polynomial relationship between elementary symmetric functions (Cauchy enumeration formula) is formulated via a ``raising operator" and Fock space construction. A simple graphical proof of this relation is proposed. The new operator…

The most general operator product expansion in conformal field theory is obtained using the embedding space formalism and a new uplift for general quasi-primary operators. The uplift introduced here, based on quasi-primary operators with…

For every positive integer h, the representation function of order h associated to a subset A of the integers or, more generally, of any group or semigroup X, counts the number of ways an element of X can be written as the sum (or product,…

We study a new class of functions that arise naturally in quaternionic analysis, we call them "quasi regular functions". Like the well-known quaternionic regular functions, these functions provide representations of the quaternionic…

We study a recursion that generates real sequences depending on a parameter $x$. Given a negative $x$ the growth of the sequence is very difficult to estimate due to canceling terms. We reduce the study of the recursion to a problem about a…

In this paper, we give a singular function on a unit interval derived from the dynamic of the one-dimensional elementary cellular automaton Rule 150. We describe properties of the resulting function, that is strictly increasing, uniformly…

We investigate the conjugate indicator diagram or, equivalently, the indicator function of (frequently) hypercyclic functions of exponential type for differential operators. This gives insights into growth conditions of these functions on…

We study the possible growth of $PF_r$ g.f.'s analytic in the unit disk and describe the proximate orders of growth of these functions. Some classical function theory results concerning orders of growth are generalized to the case of…

Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…

A leading-twist factorization formula is derived for the longitudinal structure function in the x -->1 limit of deeply inelastic scattering. This is achieved by defining a new jet function which is gauge independent and probes the…

This paper introduces Farey Recursive Functions and investigates their basic properties. Farey Recursive Functions are a special type of recursive function from the rationals to a commutative ring. The recursion of these functions is…

Let $f$ be a transcendental entire function and let $A(f)$ denote the set of points that escape to infinity `as fast as possible' under iteration. By writing $A(f)$ as a countable union of closed sets, called `levels' of $A(f)$, we obtain a…

In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…

Our main result is a generalized Dillon-type theorem, giving graph-theoretic conditions which guarantee that a $p$-ary function in an even number of variables is bent, for $p$ a prime number greater than 2. The key condition is that the…

We study two kinds of random Fibonacci sequences defined by $F_1=F_2=1$ and for $n\ge 1$, $F_{n+2} = F_{n+1} \pm F_{n}$ (linear case) or $F_{n+2} = |F_{n+1} \pm F_{n}|$ (non-linear case), where each sign is independent and either + with…

We examine the growth behaviour of the entries occurring in $n$-periodic tame friezes of real numbers. Extending \cite{T}, we prove that generalised recursive relations exist between all entries of such friezes. These recursions are…

Given an increasing process $(A_t)_{t\geq 0}$, we characterize the right-continuous non-decreasing functions $f: \R_+\to \R_+$ that map $A$ to a pure-jump process. As an example of application, we show for instance that functions with…

We characterize the equality between ultradifferentiable function classes defined in terms of abstractly given weight matrices and in terms of the corresponding matrix of associated weight functions by using new growth indices. These…

We study the computability-theoretic complexity and proof-theoretic strength of the following statements: (1) "If X is a well-ordering, then so is epsilon_X", and (2) "If X is a well-ordering, then so is phi(alpha,X)", where alpha is a…