Related papers: An $O(n\log^2n)$ Algorithm for Computing Hankel De…
Hankel determinants and automatic sequences are two classical subjects widely studied in Mathematics and Theoretical Computer Science. However, these two topics were considered totally independently, until in 1998, when Allouche,…
Sulanke and Xin developed a continued fraction method that applies to evaluate Hankel determinants corresponding to quadratic generating functions. We use their method to give short proofs of Cigler's Hankel determinant conjectures, which…
In this paper, our primary goal is to calculate the Hankel determinants for a class of lattice paths, which are distinguished by the step set consisting of \(\{(1,0), (2,0), (k-1,1), (-1,1)\}\), where the parameter \(k\geq 4\). These paths…
The logarithm-determinant is an widely-present operation in many areas of physics and computer science. Derivatives of the logarithm-determinant compute physically relevant quantities in statistical physics models, quantum field theories,…
We consider compact Hankel operators realized in $\ell^2(\mathbb Z_+)$ as infinite matrices $\Gamma$ with matrix elements $h(j+k)$. Roughly speaking, we show that, for all $\alpha>0$, the singular values $s_{n}$ of $\Gamma$ satisfy the…
Let $p_n(x)$, $n=0,1,\dots$, be the orthogonal polynomials with respect to a given density $d\mu(x)$. Furthermore, let $d\nu(x)$ be a density which arises from $d\mu(x)$ by multiplication by a rational function in $x$. We prove a formula…
We study the Hankel determinant and orthogonal polynomials with respect to the two-parameter weight function $$ w(x)=w(x;t_1, t_2):=\exp(-x^6-t_2 x^4-t_1 x^2),\qquad x\in\mathbb{R}, $$ with $t_1,\; t_2 \in \mathbb{R}$. This problem arises…
Hankel determinants of sequences related to Bernoulli and Euler numbers have been studied before, and numerous identities are known. However, when a sequence is shifted by one unit, the situation often changes significantly. In this paper…
In this expository paper we compute Hankel determinants of some sequences whose generating functions are given by C-fractions and derive orthogonality properties for associated polynomials.
We evaluate the Hankel determinants of the convolution powers of Motzkin numbers for $r\leq 27$ by finding shifted periodic continued fractions, which arose in application of Sulanke and Xin's continued fraction method. We also conjecture…
By prepending zeros to a given sequence Hankel determinants of backward shifts of this sequence become meaningful. We obtain some results for the sequences of Catalan numbers and of some numbers and polynomials which are related to Catalan…
We study the Hankel determinant generated by a Gaussian weight with Fisher-Hartwig singularities of root type at $t_j$, $j=1,\cdots ,N$. It characterizes a type of average characteristic polynomial of matrices from Gaussian unitary…
We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…
Hankel tensors arise from applications such as signal processing. In this paper, we make an initial study on Hankel tensors. For each Hankel tensor, we associate it with a Hankel matrix and a higher order two-dimensional symmetric tensor,…
We derive a general expression for the Hankel determinants of a Dirichlet series F(s) and derive the asymptotic behavior for the special case that F(s) is the Riemann zeta function. In this case the Hankel determinant is a discrete analogue…
We introduce a sequence of orthogonal polynomials whose associated moments are the Rayleigh-type sums, involving the zeros of the Bessel derivative $J_\nu'$ of order $\nu$. We also discuss the fundamental properties of those polynomials…
Hankel tensors are generalizations of Hankel matrices. This article studies the relations among various ranks of Hankel tensors. We give an algorithm that can compute the Vandermonde ranks and decompositions for all Hankel tensors. For a…
We consider a family of all analytic and univalent functions (i.e., one-to-one) in the unit disk $\mathbb{D}:=\{z\in \mathbb{C}:|z|<1\}$ of the form $f(z)=z+a_2z^2+a_3z^3+\cdots$. In this paper, we obtain the sharp bounds of the second…
For any sequences $\mathbf{u}=\{u(n)\}_{n\geq0}, \mathbf{v}=\{v(n)\}_{n\geq0},$ we define $\mathbf{u}\mathbf{v}:=\{u(n)v(n)\}_{n\geq0}$ and $\mathbf{u}+\mathbf{v}:=\{u(n)+v(n)\}_{n\geq0}$. Let $f_i(x)~(0\leq i< k)$ be sequence polynomials…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…