Related papers: An applicative theory for FPH
Motivated by the effective impact of the Pascal functional and the Wronskian matrices, we investigate several identities and differential equation for the Sheffer-Appell polynomial sequence by using matrix algebra. The matrix approach,…
This expository text is an invitation to the relation between quantum field theory Feynman integrals and periods. We first describe the relation between the Feynman parametrization of loop amplitudes and world-line methods, by explaining…
A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be…
I would like to consider the Beginning of space-time in this paper. First of all, we do consideration historical thought. A lot of philosophers have considered the relation between this real phenomenal world and the basic world in which the…
The nature of cosmic time is illuminated using Hamilton-Jacobi theory for general relativity. For problems of interest to cosmology, one may solve for the phase of the wavefunctional by using a line integral in superspace. Each contour of…
We apply matrix methods to arithmetic functions by associating matrices to the functions in a manner drawn from the theory of symmetric functions. Then we study the characteristic polynomials of the associated matrices.
In this paper I discuss the concept of time in physics. I consider the thermal time hypothesis and I claim that thermal clocks and atomic clocks measure different physical times, whereby thermal time and relativistic time are not compatible…
The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of…
This brief note presents two adaptive heap data structures and conjectures on running times.
This paper discusses discrete-time maps of the form $x(k + 1) = F(x(k))$, focussing on equilibrium points of such maps. Under some circumstances, Lefschetz fixed-point theory can be used to establish the existence of a single locally…
We propose one possible generalization of the KP hierarchy, which possesses multi bi--hamiltonian structures, and can be viewed as several KP hierarchies coupled together.
The paper introduces a one dimensional analogy of Poincare's "section" method. Its application to numerical study of sequences of fractional parts is considered. As a result, the possibility of Cantorian structure of time flow is deduced. A…
Spacetime foam is analyzed within the simplistic model of a set of scalar fields on a flat background. We suggest the formula for the path integral which allows to account for the all possible topologies of spacetime. We show that the…
Complexity theory can be viewed as the study of the relationship between computation and applications, understood the former as complexity classes and the latter as problems. Completeness results are clearly central to that view. Many…
This article develops a periodic version of a time varying parameter fractional process in the stationary region. It is a partial extension of Hosking (1981)'s article which dealt with the case where the coefficients are invariant in time.…
The outcomes of this paper are twofold. Implicit complexity. We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class PTIME of languages computable in…
We consider prediction theory for stationary stochastic processes in continuous time. We discuss prediction using the whole (infinite) past, and using only a finite section of the past. The solutions to both these classical problems have…
In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute…
In the present paper, we deal with Fourier-transformation of Frobenius-Euler polynomials. We shall give its applications by using infinite series. Our applications possess interesting properties which we state in this paper.
The problem of high-dimensional path-dependent optimal stopping (OS) is important to multiple academic communities and applications. Modern OS tasks often have a large number of decision epochs, and complicated non-Markovian dynamics,…