Related papers: A derivation of Dickson polynomials using the Cayl…
We prove the bivariate Cayley-Hamilton theorem, a powerful generalization of the classical Cayley-Hamilton theorem. The bivariate Cayley-Hamilton theorem has three direct corollaries that are usually proved independently: The classical…
The main purpose of this paper is to obtain Leibniz's rule for generalized types of derivations via Newton's binomial formula. In fact, we provide a short formula to calculate the nth power of any kind of derivations.
Newton's potential of a massive homogeneous ellipsoid is derived via Dirichlet's discontinuous factor. At first we review part of Dirichlet's work in an English translation of the original German, and then continue with an extension of his…
We derive new matrix representation for higher order Daehee numbers and polynomials, the higher order lambda-Daehee numbers and polynomials and the twisted lambda-Daehee numbers and polynomials of order k. This helps us to obtain simple and…
A theorem of Thompson provides a non-self-adjoint variant of the classical Schur-Horn theorem by characterizing the possible diagonal values of a matrix with given singular values. We prove an analogue of Thompson's theorem for II_1…
In this paper the general Krall-type Askey-Wilson polynomials are introduced. These polynomials are obtained from the Askey-Wilson polynomials via the addition of two mass points to the weight function of them at the points $\pm1$. Several…
A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…
We derive properties of powers of a function satisfying a second-order linear differential equation. In particular we prove that the n-th power of the function satisfies an (n+1)-th order differential equation and give a simple method for…
Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…
In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…
In this paper, we derive novel formulas and identities connecting Cauchy numbers and polynomials with both ordinary and generalized Stirling numbers, binomial coefficients, central factorial numbers, Euler polynomials, $r$-Whitney numbers,…
The Cayley-Dickson loop Q_n is the multiplicative closure of basic elements of the algebra constructed by n applications of the Cayley-Dickson doubling process (the first few examples of such algebras are real numbers, complex numbers,…
Schinzel's Hypothesis H is a general conjecture in number theory on prime values of polynomials that generalizes, e.g., the twin prime conjecture and Dirichlet's theorem on primes in arithmetic progression. We prove an arithmetic analog of…
Starting from a mistake done by a student, we discover an unexpected method of finding both eigenvectors for a $2\times2$ matrix with distinct eigenvalues in a single computation. We discuss a connection with the Cayley-Hamilton theorem,…
An alternative derivation is presented of the infinitely many exceptional Wilson and Askey-Wilson polynomials, which were introduced by the present authors in 2009. Darboux-Crum transformations intertwining the discrete quantum mechanical…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…
Over a composition algebra $A$, a polynomial $f(x) \in A[x]$ has a root $\alpha$ if and only $f(x)=g(x)\cdot (x-\alpha)$ for some $g(x) \in A[x]$. We examine whether this is true for general Cayley-Dickson algebras. The conclusion is that…
This paper discusses the formalization of proofs "by diagram chasing", a standard technique for proving properties in abelian categories. We discuss how the essence of diagram chases can be captured by a simple many-sorted first-order…
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…
We present a diagonalization method for generic matrix valued Hamiltonians based on a formal expansion in power of $\hbar $. Considering $\hbar $ as a running parameter, a differential equation connecting two diagonalization processes for…