Related papers: On certain rational recursive sequences of order f…
A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…
Given a linear recurrence of the form $c_n=a_1c_{n-1}+\cdots+a_j c_{n-j}$, it is well-known that $c_n=\sum_{r}p_r(n)r^n$, where the sum is taken over the set of characteristic roots and each $p_r(n)$ is some polynomial. We give a closed…
In this paper, we completely classify the raional solutions of the Noumi and Yamada system of type A_4^{(1)}, which is a generalization of the forth Painlev\'e equation. The rational solutions are classified to three types by the B\"acklund…
The behaviour of solutions to fourth order problems is studied through the decomposition into a system of second order ones, which leads to relaxed formulations with the introduction of measure terms. This allows to solve a shape…
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…
A method based on order completion for solving general equations is presented. In particular, this method can be used for solving large classes of nonlinear systems of PDEs, with possibly associated initial and/or boundary value problems.
We evaluate in closed form series of the type $\sum u(n) R(n)$, where $(u(n))_n$ is a strongly $B$-multiplicative sequence and $R(n)$ a (well-chosen) rational function. A typical example is: $$ \sum_{n \geq 1} (-1)^{s_2(n)}…
In this paper we present a recurrent relation for counting meaningful compositions of the higher-order differential operations on the space $R^{n}$ (n=3,4,...) and extract the non-trivial compositions of order higher than two.
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…
We propose a recursive algorithm for identifying all finite sequences of positive integers whose product equals their sum. Our method uses solutions of strictly shorter length that are iteratively extended in pursuit of a valid solution.…
The quaternion equation X^n=A is solved for any integer number n > 1. A is a given quaternion with komplex numbers as its elements. We use the isomorphism between quaternions and (4,4)-matrices to solve this equation.
This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such…
Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…
A numerical approach to compute tensor integrals in one-loop calculations is presented. The algorithm is based on a recursion relation which allows to express high rank tensor integrals as a function of lower rank ones. At each level of…
In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…
We study the growth behaviour of rational linear recurrence sequences. We show that for low-order sequences, divergence is decidable in polynomial time. We also exhibit a polynomial-time algorithm which takes as input a divergent rational…
Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…
We consider $u_t=u^{\alpha} u_{xxx}+n(u)u_xu_{xx}+m(u)u_x^3+ r(u)u_{xx} +p(u)u_x^2 + q(u)u_x+s(u)$ with $\alpha=0$ and $\alpha=3$, for those functional forms of $m, n, p, q, r, s$ for which the equation is integrable in the sense of an…
Iteration methods based on barycentric rational interpolation are derived that exhibit accelerating orders of convergence. For univariate root search, the derivative-free methods approach quadratic convergence and the first-derivative…
In this paper the local order of convergence used in iterative methods to solve nonlinear systems of equations is revisited, where shorter alternative analytic proofs of the order based on developments of multilineal functions are shown.…