相关论文: A solution to Open Problem 3.137 by O. Furdui on m…

We study the number of solutions $N(B,F)$ of the diophantine equation $n_1n_2=n_3n_4$, where $1\le n_1\le B$, $1\le n_3\le B$, $n_2, n_4\in F$ and $F\subset [1,B]$ is a factor closed set. We study more particularly the case when $F=…

We give an algorithm to compute the series expansion for the inverse of a given function. The algorithm is extremely easy to implement and gives the first $N$ terms of the series. We show several examples of its application in calculating…

In this paper, we establish multiple closed-form solutions for all the variables in the Lucas-Uzawa model with externalities for the case with no parameter restrictions as well as for cases with specific parameter restrictions. These…

We give a closed formula for the derivative of arbitrary order of the function $\ds g(x)=\exp(f(x))$.

In this sequel to our recent note it is shown, in a unified manner, by making use of some basic properties of certain special functions, such as the Hurwitz zeta function, Lerch zeta function and Legendre chi function, that the values of…

We construct an analytic approach to evaluate odd Euler sums, multiple zeta value $\zeta(3,2,\ldots,2)$ and multiple $t$-value $t\left(3,2,\ldots,2\right)$. Moreover, we also conjecture a closed expression for multiple $t$-value…

Spectral decomposition of matrices is a recurring and important task in applied mathematics, physics and engineering. Many application problems require the consideration of matrices of size three with spectral decomposition over the real…

In this paper, we establish the irrationality of some open problems in mathematics based on using a recursive formula that generate the complete sequence of numbers. see [1] But before getting into that we begin with some Ramanujan notable…

This paper addresses an investigation on a factorization method for difference equations. It is proved that some classes of second order linear difference operators, acting in Hilbert spaces, can be factorized using a pair of mutually…

An algorithm for matrix factorization of polynomials was proposed in \cite{fomatati2022tensor} and it was shown that this algorithm produces better results than the standard method for factoring polynomials on the class of summand-reducible…

Let $\mathcal{A}$ be an abelian category and let $F$ be a subbifunctor of the additive bifunctor $\text{Ext}_{\mathcal{A}}^{1}(-,-)\colon \mathcal{A}^{\text{op}}\times \mathcal{A}\to \mathsf{Ab}$. Buan proved in [4] that $F$ is closed if,…

In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in…

In this paper, we obtain a general expression for the entries of the r. (r is integer) power of a certain n-square complex tridiagonal matrix. In addition, we get the complex factorizations of Fibonacci polynomials, Fibonacci and Pell…

In this paper, we show that there is a large class of fermionic systems for which it is possible to find, for any dimension, a finite closed set of eigenoperators and eigenvalues of the Hamiltonian. Then, the hierarchy of the equations of…

Given an algebraic ordinary differential equation (AODE), we propose a computational method to determine when a truncated power series can be extended to a formal power series solution. If a certain regularity condition on the given AODE or…

Consider a $2\times n$ rectangular grid composed of $1\times 1$ squares. Cutting only along the edges between squares, how many ways are there to divide the board into $k$ pieces? Building off the work of Durham and Richmond, who found the…

We study inverse factorial series and their relation to Stirling numbers of the first kind. We prove a special representation of the polylogarithm function in terms of series with such numbers. Using various identities for Stirling numbers…

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…

Dey and Xin (J.Appl.Comput.Top., 2022, arXiv:1904.03766) describe an algorithm to decompose finitely presented multiparameter persistence modules using a matrix reduction algorithm. Their algorithm only works for modules whose generators…

We investigate three combinatorial problems considered by Erd\"os, Rivat, Sark\"ozy and Sch\"on regarding divisibility properties of sum sets and sets of shifted products of integers in the context of function fields. Our results in this…