Related papers: Systems of several first-order quadratic recursion…
We consider a linear recursion of the form $$R^{(k+1)}\stackrel{\mathcal D}{=}\sum_{i=1}^{N}C_iR^{(k)}_i+Q,$$ where $(Q,N,C_1,C_2,\dots)$ is a real-valued random vector with $N\in\mathbb{N}=\{0, 1, 2, \dots\}$,…
This thesis is concerned with formulations of the Einstein equations in axisymmetric spacetimes which are suitable for numerical evolutions. We develop two evolution systems based on the (2+1)+1 formalism. The first is a (partially)…
We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…
The aim of our paper is to formulate and solve problems concerning multitime multiple recurrence equations. We discuss in detail the generic properties and the existence and uniqueness of solutions. Among the general things, we discuss in…
Each scheme of state reconstruction comes down to parametrize the state of a quantum system by expectation values or probabilities directly measurable in an experiment. It is argued that the time evolution of these quantities provides an…
We present a model of discrete quantum evolution based on quantum correlations between the evolving system and a reference quantum clock system. A quantum circuit for the model is provided, which in the case of a constant Hamiltonian is…
The structural constants of an evolution algebra is given by a quadratic matrix $A$. In this work we establish equivalence between nil, right nilpotent evolution algebras and evolution algebras, which are defined by upper triangular matrix…
We show how to approximate a solution of the first order linear evolution equation, together with its possible analytic continuation, using a solution of the time-fractional equation of order $\delta >1$, where $\delta \to 1+0$.
In this paper we identify certain peculiar systems of 2 discrete-time evolution equations,x~n = F^(n)(x1; x2) , n = 1, 2 , which are algebraically solvable. Here l is the "discrete-time" independent variable taking integer values (l = 0, 1,…
Recently new solvable systems of nonlinear evolution equations -- including ODEs, PDEs and systems with discrete time -- have been introduced. These findings are based on certain convenient formulas expressing the $k$-th time-derivative of…
We investigate the non-equilibrium properties of an N-component scalar field theory. The time evolution of the correlation functions for an arbitrary ensemble of initial conditions is described by an exact functional differential equation.…
Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…
It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…
Discrete time evolution of one-dimensional maps is embedded in continuous time by truncating the Taylor series expansion of the time evolution operator to a finite order N. Truncations with N > 4 leads to unconditional instability.…
We present easily verifiable sufficient conditions of time-independence and commutativity for local and nonlocal symmetries for a large class of homogeneous (1+1)-dimensional evolution systems. In contrast with the majority of known…
We report a class of symmetry-intergable third-order evolution equations in 1+1 dimensions under the condition that the equations admit a second-order recursion operator that contains an adjoint symmetry (integrating factor) of order six.…
Using quantum theory operator methods we discuss the general reversible reactions $A_1+A_2+... A_r \leftrightarrow B_1+B_2+... +B_s$, where $r$ and $s$ are arbitrary natural positive numbers. We show that if either direction of the reaction…
An \emph{indexing} of a finite set $S$ is a bijection $D : \{1,...,|S|\} \rightarrow S$. We present an indexing for the set of quadratic residues modulo $N$ that is decodable in polynomial time on the size of $N$, given the factorization of…
Linear functions play a key role in the runtime analysis of evolutionary algorithms and studies have provided a wide range of new insights and techniques for analyzing evolutionary computation methods. Motivated by studies on separable…
An extensive number of numerical computations of energy 1/$N$ series using a recursive Taylor series method are presented in this paper. The series are computed to a high order of approximation and their behaviour on increasing the order of…