Related papers: Intermediate arithmetic operations on ordinal numb…
Commutative hypercomplex algebras offer significant advantages over traditional quaternions due to their compatibility with linear algebra techniques and efficient computational implementation, which is crucial for broad applicability. This…
We give a method of solution to the problem of iterating holomorphic functions to fractional or complex heights. We construct an auxiliary function from natural iterates of a holomorphic function; the auxiliary function will be…
Following Wigert, various authors, including Ramanujan, Gronwall, Erd\H{o}s, Ivi\'{c}, Schwarz, Wirsing, and Shiu, determined the maximal order of several multiplicative functions, generalizing Wigert's result $$\max_{n\leq x} \log d(n) =…
In this brief, we discuss the implementation of a third order semi-implicit differentiator as a complement of the recent work by the author that proposes an interconnected semi-implicit Euler double differentiators algorithm through Taylor…
The normal ordering of an integral power of the number operator in terms of boson operators is expressed with the help of the Stirling numbers of the second kind. As a `degenerate version' of this, we consider the normal ordering of a…
Two quadrature-based algorithms for computing the matrix fractional power $A^\alpha$ are presented in this paper. These algorithms are based on the double exponential (DE) formula, which is well-known for its effectiveness in computing…
The classical orthogonal polynomials (Hermite, Laguerre and Jacobi) are involved in a vast number of applications in physics and engineering. When large degrees $n$ are needed, the use of recursion to compute the polynomials is not a good…
In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…
If $C:y^2=x(x-1)(x-a_1)(x-a_2)(x-a_3)$ is genus $2$ curve a natural question to ask is: Under what conditions on $a_1,a_2,a_3$ does the Jacobian $J(C)$ have real multiplication by $\mathbb{Z}[\sqrt{\Delta}]$ for some $\Delta>0$. Over a…
We introduce a kind of $(p, q, t)$-Catalan numbers of Type A by generalizing the Jacobian type continued fraction formula, we proved that the corresponding expansions could be expressed by the polynomials counting permutations on…
The main contribution of this paper is a new improved variant of the laser method for designing matrix multiplication algorithms. Building upon the recent techniques of [Duan, Wu, Zhou, FOCS 2023], the new method introduces several new…
In this paper we obtain a representation as martingale transform operators for the rearrangement and shift operators introduced by T. Figiel. The martingale transforms and the underlying sigma algebras are obtained explicitly by…
There is a commutative algebra of differential-difference operators, with two parameters, associated to any dihedral group with an even number of reflections. The intertwining operator relates this algebra to the algebra of partial…
The Jacobi-Stirling numbers of the first and second kinds were introduced in 2006 in the spectral theory and are polynomial refinements of the Legendre-Stirling numbers. Andrews and Littlejohn have recently given a combinatorial…
It is widely known that the lower bound for the algorithmic complexity of square matrix multiplication resorts to at least $n^2$ arithmetic operations. The justification builds upon the following reasoning: given that there are $2 n^2$…
After the language of module and theirs morphisms, this short course presents matricial calculus and determinants in a commutative ring as appliction of ``remarquable identities'' in the ring of polynomials with integer coefficients with…
We obtain an explicit simple formula for the coefficients of the asymptotic expansion for the factorial of a natural number,in terms of derivatives of powers of an elementary function. The unique explicit expression for the coefficients…
We will see that key concepts of number theory can be defined for arbitrary operations. We give a generalized distributivity for hyperoperations (usual arithmetic operations and operations going beyond exponentiation) and a generalization…
We study the problem of decomposition (non-commutative factorization) of linear ordinary differential operators near an irregular singular point. The solution (given in terms of the Newton diagram and the respective characteristic numbers)…
We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…