Related papers: A recurrence relation for the odd order moments of…
Results of research of possibility of transformation of a difference equation into a system of the first-order difference equation are presented. In contrast to the method used previously, an unknown grid function is split into two new…
We study the inverse problem for the fractional Laplace equation with multiple nonlinear lower order terms. We show that the direct problem is well-posed and the inverse problem is uniquely solvable. More specifically, the unknown…
We consider an inverse problem of determining coefficient matrices in an $N$-system of second-order elliptic equations in a bounded two dimensional domain by a set of Cauchy data on arbitrary subboundary. The main result of the article is…
In this work we study the solutions to some fractional higher-order equations. Special cases in which time-fractional derivatives take integer values are also examined and the explicit solutions are presented. Such solutions can be…
We present a closed-form solution for n-th term of a general three-term recurrence relation with arbitrary given n-dependent coefficients. The derivation and corresponding proof are based on two approaches, which we develop and describe in…
This paper analyzes the convergence of fixed-point iterations of the form u = f(u) and the properties of the inverse of the related pentadiagonal matrices, associated with the fourth-order nonlinear beam equation. This nonlinear problem is…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
We construct a monadic second-order sentence that characterizes the ternary relations that are the betweenness relations of finite or infinite partial orders. We prove that no first-order sentence can do that. We characterize the partial…
We find an explicit formula for the generating function for the squaring the terms of an $\ell^{th}$ order linear recurrence.
In this paper, we develop a numerical algorithm for an inverse problem on determining fractional orders of time derivatives simultaneously in a coupled subdiffusion system. Following the theoretical uniqueness, we reformulate the order…
The history of linear differential equations is over 350 years. By using Frobenius method and putting the power series expansion into linear differential equations, the recursive relation of coefficients starts to appear. There can be…
It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…
In this paper the approach to obtaining nonrecurrent formulas for some recursively defined sequences is illustrated. The most interesting result in the paper is the formula for the solution of quadratic map-like recurrence. Also, some…
We begin by showing that any $n \times n$ matrix can be decomposed into a sum of $n$ circulant matrices with periodic relaxations on the unit circle. This decomposition is orthogonal with respect to a Frobenius inner product, allowing…
For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
As it is known various dynamical processes can be modeled through the systems of time-fractional order pseudo-differential equations. In the modeling process one frequently faces with determining the adequate orders of time-fractional…
A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…
We compute the divisor of the modular equation on the modular curve $\Gamma_0(N) \backslash \mathbb H^*$ and then find recurrence relations satisfied by the modular traces of the Hauptmodul for any congruence subgroup $\Gamma_0(N)$ of genus…