Related papers: A recursive function coding number theoretic funct…
Any (measurable) function $K$ from $\mathbb{R}^n$ to $\mathbb{R}$ defines an operator $\mathbf{K}$ acting on random variables $X$ by $\mathbf{K}(X)=K(X_1, \ldots, X_n)$, where the $X_j$ are independent copies of $X$. The main result of this…
We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…
The $L^p$-cosine transform of an even, continuous function $f\in C_e(\Sn)$ is defined by: $$H(x)=\int_{\Sn}|\ip{x}{\xi}|^pf(\xi) d\xi,\quad x\in {\R}^n.$$ It is shown that if $p$ is not an even integer then all partial derivatives of even…
cryptographic hash function is a deterministic procedure that compresses an arbitrary block of numerical data and returns a fixed-size bit string. There exist many hash functions: MD5, HAVAL, SHA, ... It was reported that these hash…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
Consider a sequence of real-valued functions of a real variable given by a homogeneous linear recursion with differentiable coefficients. We show that if the functions in the sequence are differentiable, then the sequence of derivatives…
We prove that a function, which is defined on a union of lines $\mathbb{C} E$ through the origin in $\mathbb{C}^n$ with direction vectors in $E\subset \mathbb{C}^n$ and is holomorphic of fixed finite order and finite type along each line,…
Let $(C(t))\_{t \in R}$ be a cosine function in a unital Banach algebra. We show that if $sup\_{t\in R}\Vert C(t)-cos(t)\Vert \textless{} 2$ for some continuous scalar bounded cosine function $(c(t))\_{t\in \R},$ then the closed subalgebra…
We introduce and characterize a particularly tractable class of unital type 1 C*-algebras with bounded dimension of irreducible representations. Algebras in this class are called recursive subhomogeneous algebras, and they have an inductive…
Recursive formulas are derived for the number of solutions of linear and quadratic Diophantine equations with positive coefficients. This result is further extended to general non-linear additive Diophantine equations. It is shown that all…
The evolution, as functions of the "ticking time" $\ell =0,1,2,...$, of the solutions of the system of $N$ quadratic recursions \begin{eqnarray*} x_{n}\left( \ell +1\right) =c_{n}+\sum_{m=1}^{N}\left[ C_{nm}x_{m}\left( \ell \right) \right]…
Imposing some conditions on derivatives of the known functions, using the Fiber Contraction Theorem we prove the existence of $C^1$ solutions of a class of iterative functional equations which involves iterates of the unknown functions and…
We discuss properties of recursive schemas related to McCarthy's ``91 function'' and to Takeuchi's triple recursion. Several theorems are proposed as interesting candidates for machine verification, and some intriguing open questions are…
Let $N$ be a positive integer. We say a non-constant rational function $U(x)\in{\mathbb C}(x)$ is $N$-\emph{unital} if all the zeros and poles of both $U(x)$ and $1-U(x)$ are either 0 or $N$-th roots of unity. These functions are called…
We investigate the existence of a class of ZFC-provably total recursive unary functions, given certain constraints, and apply some of those results to show that, for $\Sigma_1$-sound set theory, ZFC$\not\vdash P<NP$.
We develop a recursive approach to computing Neveu-Schwarz conformal blocks associated with n-punctured Riemann surfaces. This work generalizes the results of [1] obtained recently for the Virasoro algebra. The method is based on the…
The paper discusses several extensions of the recursive representation of the flow shop scheduling problem. It is shown that recursive functions make it possible to describe multiple extensions in a single problem. The paper considers…
Most modern (classical) programming languages support recursion. Recursion has also been successfully applied to the design of several quantum algorithms and introduced in a couple of quantum programming languages. So, it can be expected…
Causal functions of sequences occur throughout computer science, from theory to hardware to machine learning. Mealy machines, synchronous digital circuits, signal flow graphs, and recurrent neural networks all have behaviour that can be…
The principal aim of this article is to establish an iteration method on the space of resurgent functions. We discuss endless continuability of iterated convolution products of resurgent functions and derive their estimates developing the…