Related papers: Recursive definitions on surreal numbers
Contrary to popular misconception, the question in the title is far from simple. It involves sets of numbers on the first level, sets of sets of numbers on the second level, and so on, endlessly. The infinite hierarchy of the levels…
We construct several new classes of transcendental entire functions, f, such that both the escaping set, I(f), and the fast escaping set, A(f), have a structure known as a spider's web. We show that some of these classes have a degree of…
In this article, we study some new characterizations of primitive recursive functions based on restricted forms of primitive recursion, improving the pioneering work of R. M. Robinson and M. D. Gladstone in this area. We reduce certain…
Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate…
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…
We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…
A function in a class $\mathcal{F}(X)$ is said to be subdifferentially determined in $\mathcal{F}(X)$ if it is equal up to an additive constant to any function in $\mathcal{F}(X)$ with the same subdifferential. A function is said to be…
Rewriting systems are often defined as binary relations over a given set of objects. This simple definition is used to describe various properties of rewriting such as termination, confluence, normal forms etc. In this paper, we introduce a…
Natural numbers satisfying an unusual property are mentioned by the author in [5], in which their infinitude is also proved. In this paper, we start with an arbitrary natural number which is not a multiple of 10 and non-palindromic, form…
In this paper, we construct two classes of permutation polynomials over $\mathbb{F}_{q^2}$ with odd characteristic from rational R\'{e}dei functions. A complete characterization of their compositional inverses is also given. These…
For a transcendental entire function, a partial affirmative answer to Baker's question on the boundedness of its Fatou components is given. In addition, we have addressed Wang's question on Fej\'er gaps. Certain results about functions with…
Using coalgebraic methods, we extend Conway's theory of games to possibly non-terminating, i.e. non-wellfounded games (hypergames). We take the view that a play which goes on forever is a draw, and hence rather than focussing on winning…
We establish the \emph{inverse conjecture for the Gowers norm over finite fields}, which asserts (roughly speaking) that if a bounded function $f: V \to \C$ on a finite-dimensional vector space $V$ over a finite field $\F$ has large Gowers…
A countable group is residually finite if every nontrivial element can act nontrivially on a finite set. When a group fails to be residually finite, we might want to measure how drastically it fails - it could be that only finitely many…
Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in…
In this article we treat a notion of continuity for a multi-valued function F and we compute the descriptive set-theoretic complexity of the set of all x for which F is continuous at x. We give conditions under which the latter set is…
We consider series of the form $$ \frac{p}{q} +\sum_{j=2}^\infty \frac{1}{x_j}, $$ where $x_1=q$ and the integer sequence $(x_n)$ satisfies a certain non-autonomous recurrence of second order, which entails that $x_n|x_{n+1}$ for $n\geq 1$.…
Some considerations showing that renormalizable theories with consistent perturbative theries can not be nonperturbatively finite (in terms of bare parameters) are provided. Accordingly any fundamental unified theory has to be either non…
Let $\mathbf{x}$ be a (non-empty) sequence of positive real numbers. Its achievement set $\mathcal{\mathbf{x}}$ is the set of all the possible sums of the elements of $\mathbf{x}$. The cardinal function of $\mathbf{x}$ is the function…
We provide sharp and explicit characterizations of the normal cone to sublevel sets of suprema of arbitrary functions, expressed exclusively in terms of subdifferentials of the data functions. In the convex case, the resulting formulas…