Related papers: Recursive definitions on surreal numbers
The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…
This paper sets the groundwork for the consideration of families of recursively defined polynomials and rational functions capable of describing the Bernoulli numbers. These families of functions arise from various recursive definitions of…
Bosons and fermions are often written by elements of other algebras. M. Abe gave a recursive realization of the boson by formal infinite sums of the canonical generators of the Cuntz algebra ${\cal O}_{\infty}$. We show that such formal…
Every function over the natural numbers has an infinite subdomain on which the function is non-decreasing. Motivated by a question of Dzhafarov and Schweber, we study the reverse mathematics of variants of this statement. It turns out that…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
This work provides calculus for the Fr\'echet and limiting subdifferential of the pointwise supremum given by an arbitrary family of lower semicontinuous functions. We start our study showing fuzzy results about the Fr\'echet…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We study the possibility to reconstruct the primordial function for some periodic function. The procedure includes an analytical continuation of a discrete function for Fourier coefficients computation, that introduces an ambiguity. To…
A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…
Different questions lead to the same class of functions from natural integers to integers: those which have integral difference ratios, i.e. verifying $f(a)-f(b)\equiv0 \pmod {(a-b)}$ for all $a>b$. We characterize this class of functions…
Let's fix a reasonable subsystem $T$ of arithmetic; why are natural extensions of $T$ pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. The goal of this work was to classify the recursive…
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 define a very general notion of regularity for functions taking values in an alternative real $*$-algebra. Over Clifford numbers, this notion subsumes the well-established notions of monogenic function and slice-monogenic function. Over…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
In this paper, we introduce and investigate a class P of continuous and periodic functions on R. The class P is defined so that second-order central differences of a function satisfy some concavity-type estimate. Although this definition…
We study a new type of sequences whose elements are defined in terms of the position, sign and magnitude of another element of the sequence. The name ultra-recursive comes from the fact that these sequences possess terms that are generated…
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer. Over finite words, it is a classical result that any rational function is regular, i.e. it can be computed by a deterministic two-way…
Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework…
This paper catalogues a variety of examples concerning a type of function of a $p$-adic integer variable defined by a formal series expression we have dubbed "$\mathcal{F}$-series". These series exhibit a new, previously undocumented form…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…