Let $ \mathcal {B} $ be the class of analytic functions $ f $ in the unit disk $ \mathbb {D}=\{z\in \mathbb {C} : |z|<1\} $ such that $ |f(z)|<1 $ for all $ z\in \mathbb {D} $. If $ f\in \mathcal {B} $ of the form $ f(z)=\sum _{n=0}^{\infty }a_nz^n $, then $ \sum _{n=0}^{\infty }|a_nz^n|\leq 1 $ for $ |z|=r\leq 1/3 $ and $ 1/3 $ cannot be improved. This inequality is called Bohr inequality and the quantity $ 1/3 $ is called Bohr radius. If $ f\in \mathcal {B} $ of the form $ f(z)=\sum _{n=0}^{\infty }a_nz^n $, then $ |\sum _{n=0}^{N}a_nz^n|<1\;\; \mbox {for}\;\; |z|<{1}/{2} $ and the radius $ 1/2 $ is the best possible for the class $ \mathcal {B} $. This inequality is called Bohr–Rogosinski inequality and the corresponding radius is called Bohr–Rogosinski radius. Let $ \mathcal {H} $ be the class of all complex-valued harmonic functions $ f=h+\bar {g} $ defined on the unit disk $ \mathbb {D} $, where $ h $ and $ g $ are analytic in $ \mathbb {D} $ with the normalization $ h(0)=h^{\prime }(0)-1=0 $ and $ g(0)=0 $. Let $ \mathcal {H}_0=\{f=h+\bar {g}\in \mathcal {H} : g^{\prime }(0)=0\}. $ For $ \alpha \geq 0 $ and $ 0\leq \beta <1 $, let

$$ \begin{align*} \mathcal{W}^{0}_{\mathcal{H}}(\alpha, \beta)=\{f=h+\overline{g}\in\mathcal{H}_{0} : \mathrm{Re}\left(h^{\prime}(z)+\alpha zh^{\prime\prime}(z)-\beta\right)>|g^{\prime}(z)+\alpha zg^{\prime\prime}(z)|,\;\; z\in\mathbb{D}\} \end{align*} $$

be a class of close-to-convex harmonic mappings in $ \mathbb {D} $. In this paper, we prove the sharp Bohr–Rogosinski radius for the class $ \mathcal {W}^{0}_{\mathcal {H}}(\alpha , \beta ) $.

Fallacies are a particular type of informal argument that are psychologicallycompelling and often used for rhetorical purposes. Fallacies are unreasonablebecause the reasons they provide for their claims are irrelevant orinsufficient. Ability to recognize the weakness of fallacies is part of what wecall argument literacy and imporatant in rational thinking. Here we examineclassic fallacies of types found in textbooks. In an experiment, participantsevaluated the quality of fallacies and reasonable arguments. We instructedparticipants to think either intuitively, using their first impressions, oranalytically, using rational deliberation. We analyzed responses, responsetimes, and cursor trajectories (captured using mouse tracking). The resultsindicate that instructions to think analytically made people spend more time onthe task but did not make them change their minds more often. When participantsmade errors, they were drawn towards the correct response, while respondingcorrectly was more straightforward. The results are compatible with“smart intuition” accounts of dual-process theories of reasoning,rather than with corrective default-interventionist accounts. The findings arediscussed in relation to whether theories developed to account for formalreasoning can help to explain the processing of everyday arguments.

Let ${\mathcal{P}}_{{\mathcal{H}}}^{0}(M)$ denote the class of normalised harmonic mappings $f=h+\overline{g}$ in the unit disk $\mathbb{D}$ satisfying $\text{Re}\,(zh^{\prime \prime }(z))>-M+|zg^{\prime \prime }(z)|$, where $h^{\prime }(0)-1=0=g^{\prime }(0)$ and $M>0$. Let ${\mathcal{B}}_{{\mathcal{H}}}^{0}(M)$ denote the class of sense-preserving harmonic mappings $f=h+\overline{g}$ in the unit disk $\mathbb{D}$ satisfying $|zh^{\prime \prime }(z)|\leq M-|zg^{\prime \prime }(z)|$, where $M>0$. We discuss the coefficient bound problem, the growth theorem for functions in the class ${\mathcal{P}}_{{\mathcal{H}}}^{0}(M)$ and a two-point distortion property for functions in the class ${\mathcal{B}}_{{\mathcal{H}}}^{0}(M)$.

Let $f$ be analytic in $\mathbb{D}=\{z\in \mathbb{C}:|z|<1\}$ and given by $f(z)=z+\sum _{n=2}^{\infty }a_{n}z^{n}$. We give sharp bounds for the initial coefficients of the Taylor expansion of such functions in the class of strongly Ozaki close-to-convex functions, and of the initial coefficients of the inverse function, together with some growth estimates.

The logarithmic coefficients $\unicode[STIX]{x1D6FE}_{n}$ of an analytic and univalent function $f$ in the unit disc $\mathbb{D}=\{z\in \mathbb{C}:|z|<1\}$ with the normalisation $f(0)=0=f^{\prime }(0)-1$ are defined by $\log (f(z)/z)=2\sum _{n=1}^{\infty }\unicode[STIX]{x1D6FE}_{n}z^{n}$. In the present paper, we consider close-to-convex functions (with argument 0) with respect to odd starlike functions and determine the sharp upper bound of $|\unicode[STIX]{x1D6FE}_{n}|$, $n=1,2,3$, for such functions $f$.

For a normalized analytic function $f(z)=z+\sum _{n=2}^{\infty }a_{n}z^{n}$ in the unit disk $\mathbb{D}:=\{z\in \mathbb{C}:|z|<1\}$, the estimate of the integral means

$$\begin{eqnarray}L_{1}(r,f):=\frac{r^{2}}{2{\it\pi}}\int _{-{\it\pi}}^{{\it\pi}}\frac{d{\it\theta}}{|f(re^{i{\it\theta}})|^{2}}\end{eqnarray}$$

$f(z)$

$\mathbb{D}\setminus \{0\}$

${\rm\Delta}(r,f)$

$\mathbb{D}_{r}:=\{z\in \mathbb{C}:|z|<r\}$

$f$

$0<r\leq 1$

$L_{1}(r,f)$

${\rm\Delta}(r,z/f)$

$r$

$f$

$m$

We consider a recent work of Pascu and Pascu [‘Neighbourhoods of univalent functions’, Bull. Aust. Math. Soc. 83(2) (2011), 210–219] and rectify an error that appears in their work. In addition, we study certain analogous results for sense-preserving harmonic mappings in the unit disc $\vert z\vert \lt 1$. As a corollary to this result, we derive a coefficient condition for a sense-preserving harmonic mapping to be univalent in $\vert z\vert \lt 1$.

This paper investigates the rate of convergence to the probability distribution of the embedded M/G/1 and GI/M/n queues. We introduce several types of ergodicity including l-ergodicity, geometric ergodicity, uniformly polynomial ergodicity and strong ergodicity. The usual method to prove ergodicity of a Markov chain is to check the existence of a Foster–Lyapunov function or a drift condition, while here we analyse the generating function of the first return probability directly and obtain practical criteria. Moreover, the method can be extended to M/G/1- and GI/M/1-type Markov chains.