paper

Abstract The aim of the planar inverse problem of dynamics is to find the potentials under whose action a material…

Abstract We consider weighted arithmetic means as, for example \(\alpha G+\left(1-\alpha \right) C\), with \(\alpha \in \left( 0,1\right) ,GC\) being…

Abstract We present a method which displays all palindromes of a given length from De Bruijn words of a certain…

Abstract We present natural bounds for the complexity function of two-dimensional arrays, and we study the shape of the maximal…

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 Given a planar potential \(V\), we look for families of orbits \(f(x,y)=c\) (determined by their slope function \(\U{3b3} =fy/fx\)),…

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 Within the framework of the inverse problem of Dynamics, we consider the following question with reference to the motion…

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}…