Related papers: Almost Product Evaluation of Hankel Determinants
The Euler numbers occur in the Taylor expansion of $\tan(x)+\sec(x)$. Since Stieltjes, continued fractions and Hankel determinants of the even Euler numbers, on the one hand, of the odd Euler numbers, on the other hand, have been widely…
Products of shifted characteristic polynomials, and ratios of such products, averaged over the classical compact groups are of great interest to number theorists as they model similar averages of L-functions in families with the same…
This (partly expository) paper originated from the study of Hankel determinants of convolution powers of Catalan numbers and of Narayana polynomials. This led to some Hankel determinants of signed Catalan numbers whose values are multiples…
This paper is devoted to octonions that are the eight-dimensional hypercomplex numbers characterized by multiplicative non-associativity. The decomposition of the product of three octonions with the conjugated central factor into the sum of…
In 1998, Allouche, Peyri\`ere, Wen and Wen considered the Thue--Morse sequence, and proved that all the Hankel determinants of the period-doubling sequence are odd integral numbers. We speak of $t$-extension when the entries along the…
An appropriate rational approximation to the eigenfunction of the Schr\"{o}dinger equation for anharmonic oscillators enables one to obtain the eigenvalue accurately as the limit of a sequence of roots of Hankel determinants. The…
We study the sum-product problem for the planar hypercomplex numbers: the dual numbers and double numbers. These number systems are similar to the complex numbers, but it turns out that they have a very different combinatorial behavior. We…
The $k$-Hankel transform $F_{k,1}$ (or the $(k,1)$-generalized Fourier transform) is the Dunkl analogue of the unitary inversion operator in the minimal representation of a conformal group initiated by T. Kobayashi and G. Mano. It is one of…
The symmetrized Slater determinants of orthogonal polynomials with respect to a non-negative Borel measure are shown to be represented by constant multiple of Hankel determinants of two other families of polynomials, and they can also be…
The completion of matrices with missing values under the rank constraint is a non-convex optimization problem. A popular convex relaxation is based on minimization of the nuclear norm (sum of singular values) of the matrix. For this…
The six-vertex model with Domain Wall Boundary Conditions, or square ice, is considered for particular values of its parameters, corresponding to 1-, 2-, and 3-enumerations of Alternating Sign Matrices (ASMs). Using Hankel determinant…
Computer experiments suggest some conjectures about Hankel determinants of convolution powers of Catalan numbers. Unfortunately, for most of them I have no proofs. I would like to present them anyway hoping that someone finds them…
The product formula for evaluating products of skew polynomials is used to construct a class of rings. As an application, we present a method of evaluating quotients of skew polynomials.
In 1866, Charles Ludwidge Dodgson published a paper concerning a method for evaluating determinants called the condensation method. His paper documented a new method to calculate determinants that was based on Jacobi's Theorem. The…
This study presents the derivation of a recursive formula for integrals of products of $N$ Hermite polynomials, establishing a numerically stable scheme for their accurate evaluation in computer codes. The derivation is notably simple and…
All possible products of all elements of an odd order finite group are considered. A set of all such products is called as a K-set. A hypothesis of K-set coincidence of any group of an odd order with its commutant is proposed and the…
In this paper, via the beta function we evaluate some series of the type $\sum_{k=0}^\infty(ak+b)x^k/\binom{mk}{nk}$. For example, we prove that $$\sum_{k=0}^\infty\frac{(49k+1)8^k}{3^k\binom{3k}k}=81+16\sqrt3\,\pi \ \ \text{and}\ \…
We present a simple and accessible method which uses contour integration methods to derive formulae for functional determinants. To make the presentation as clear as possible, the general idea is first illustrated on the simplest case: a…
The 3x+1 problem is one of the most classical problems in computer science, related to many fields. As it is thought by scientists a highly hard problem, resolving it successfully not only can improve the research in many relating fields,…
The Hadamard maximal determinant problem asks for the largest n-by-n determinant with entries in {+1,-1}. When n is congruent to 1 (mod 4), the maximal excess construction of Farmakis & Kounias has been the most successful general method…