Let ${\mathcal{SR}}^*$ be the class of starlike functions with real coefficients, i.e., the class of analytic functions $f$ which satisfy the condition $f(0)=0=f'(0)-1$, Re{z f'(z) / f (z)} > 0, for $z\in\mathbb{D}:=\{z\in\mathbb{C}:|z|<1 \}$ and $a_n:=f^{(n)}(0)/n!$ is real for all $n\in\mathbb{N}$. In the present paper, the sharp estimates of the third Hankel determinant $H_{3,1}$ over the class ${\mathcal{SR}}^*$ are computed.

Let BT4l denotes a subclass of bounded turning functions connected with a four-leaf-type domain. The goal of the study is to probe into coefficients of |b6|, |b7|, |b8|, the bounds of the logarithmic coefficients and the third-order determinants of H3,1, H3,2, H3,3 for functions in this class.

Sumudu transform of the Dixon elliptic function with non zero modulus a ≠ 0 for arbitrary powers sm^N(x,a) ; N ≥ 1 ; sm^N(x,a)cm(x,a) ; N ≥ 0 and sm^N(x,a)cm²(x,a) ; N ≥ 0 is given by product of Quasi C fractions. Next by assuming denominators of Quasi C fraction to 1 and hence applying Heliermann correspondance relating formal power series (Maclaurin series of Dixon elliptic functions) and regular C fraction, Hankel determinants are calculated and showed by taking a = 0 gives the Hankel determinants of regular C fraction. The derived results were back tracked to the Laplace transform of sm(x,a) ; cm(x,a) and sm(x,a)cm(x,a).

The theory of the continuous two-dimensional (2D) Fourier Transform in polar coordinates has been recently developed but no discrete counterpart exists to date. In the first part of this two-paper series, we proposed and evaluated the theory of the 2D discrete Fourier Transform (DFT) in polar coordinates. The theory of the actual manipulated quantities was shown, including the standard set of shift, modulation, multiplication, and convolution rules. In this second part of the series, we address the computational aspects of the 2D DFT in polar coordinates. Specifically, we demonstrate how the decomposition of the 2D DFT as a DFT, Discrete Hankel Transform (DHT) and inverse DFT sequence can be exploited for efficient code. We also demonstrate how the proposed 2D DFT can be used to approximate the continuous forward and inverse Fourier transform in polar coordinates in the same manner that the 1D DFT can be used to approximate its continuous counterpart.

The theory of the continuous two-dimensional (2D) Fourier Transform in polar coordinates has been recently developed but no discrete counterpart exists to date. In this paper, we propose and evaluate the theory of the 2D discrete Fourier Transform (DFT) in polar coordinates. This discrete theory is shown to arise from discretization schemes that have been previously employed with the 1D DFT and the discrete Hankel Transform (DHT). The proposed transform possesses orthogonality properties, which leads to invertibility of the transform. In the first part of this two-part paper, the theory of the actual manipulated quantities is shown, including the standard set of shift, modulation, multiplication, and convolution rules. Parseval and modified Parseval relationships are shown, depending on which choice of kernel is used. Similar to its continuous counterpart, the 2D DFT in polar coordinates is shown to consist of a 1D DFT, DHT and 1D inverse DFT.