html

Abstract We prove that \(lim_{p\rightarrow \infty}k\) \(\left \Vert f\right \Vert _{+p}^{+p}\diagup \left \Vert f\right \Vert _{p}^{p}=\left \Vert f\right \Vert _{\infty}\)…

Abstract We initiate a comparative study of the properties of total palindrome complexity for binary words and arrays. From this…

Abstract We consider the problem : Given a planar region \(T_{orb}\) described by one inequality \(g(x,y)\leq c_{0}\), find the potentials…

Abstract We consider the problem of finding the optimal values\U{3b1}, \(\U{3b2} \in R\) for which the inequality \(\U{3b1} G(a,b)+(1-\U{3b1} )C(a,b)<L(a,b)<\U{3b2}…