Related papers: Computing a Solution of Feigenbaum's Functional Eq…

In this paper we present a fast and accurate numerical algorithm for the computation of hyperspherical Bessel functions of large order and real arguments. For the hyperspherical Bessel functions of closed type, no stable algorithm existed…

We address the question of the bi-Lipschitz local triviality of a complex polynomial function over a complex value. Our main result state that a non constant complex polynomial admits a locally bi-Lipschitz trivial value if and only if it…

Motivated by results on generic-case complexity in group theory, we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are "fractionally computable" by a partial…

In view of the usefulness and importance of the kinetic equation in certain physical problems, the authors derive the explicit solution of a fractional kinetic equation of general character, that unifies and extends earlier results.…

We show that for any given norm ball or proper cone, weak membership in its dual ball or dual cone is polynomial-time reducible to weak membership in the given ball or cone. A consequence is that the weak membership or membership problem…

We compute the spectrum of the Feigenbaum period-doubling operator in the space of bounded analytical functions in an ellipse. The spectral properties of the period-doubling operator in this space are not the same as in the space of even…

We study a class of projective transformations of spectraplexes associated with self-dual cones and, on this basis, propose a polynomial-time algorithm for convex feasibility problems with positive definite constraints. At each iteration of…

It is known due to the work of Van den Broeck et al [KR, 2014] that weighted first-order model counting (WFOMC) in the two-variable fragment of first-order logic can be solved in time polynomial in the number of domain elements. In this…

Consider an $L^1$-continuous functional $\ell$ on the vector space of polynomials of Brownian motion at given times, suppose $\ell $ commutes with the quadratic variation in a natural sense, and consider a finite set of polynomials of…

In this paper, the solution of the multi-order differential equations, by using Mellin Transform, is proposed. It is shown that the problem related to the shift of the real part of the argument of the transformed function, arising when the…

A consistent functional calculus approach to the spectral theorem for strongly commuting normal operators on Hilbert spaces is presented. In contrast to the common approaches using projection-valued measures or multiplication operators,…

The following work is written in easy language for college level students. It shows how the first digit probabilities of a group of continuous real-valued functions can be calculated. Thus, examples explaining how the probabilities are…

For a root system R, a field K and a "choice of coefficients in K" we define a category of graded spaces with operators and study some of its properties. Then we assume that the coefficients are given by quantum binomials. We use basic…

We introduce the notion of numerical functors to generalise Eilenberg & MacLane's polynomial functors to modules over a binomial base ring. After shewing how these functors are encoded by modules over a certain ring, we record a precise…

We here first study the state space realization of a tensor-product of a pair of rational functions. At the expense of "inflating" the dimensions, we recover the classical expressions for realization of a regular product of rational…

In analogy to the definition of the lambda-determinant, we define a one-parameter deformation of the Dodgson condensation formula for Pfaffians. We prove that the resulting rational function is a polynomial with weights given by the…

In this article, we give evidence that computing Fourier coefficients of the Hecke eigenforms for composite indices is no easier than factoring integers. In particular, we show that the existence of a polynomial time algorithm that, given…

"Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional classical or intuitionistic logics.…

A recent development in the theory of fractional differential equations with variable coefficients has been a method for obtaining an exact solution in the form of an infinite series involving nested fractional integral operators. This…

In the lambda calculus a term is solvable iff it is operationally relevant. Solvable terms are a superset of the terms that convert to a final result called normal form. Unsolvable terms are operationally irrelevant and can be equated…