paper

Abstract The subword complexity of a finite \(\omega\) of length \(N\) is a function which associates to each \(n\leq N\)…

Abstract AuthorsMira-Cristiana Anisiu Tiberiu Popoviciu Institute of Numerical Analysis Cluj-Napoca, Romanian Academy Keywords? Paper coordinatesM.-C. Anisiu, Finite words with special…

Abstract Given a continuous function \(u:[0,\infty)\rightarrow \mathbb{R}\), a family of functionals \(\varphi_{\U{3b1} }:C(I)\rightarrow \mathbb{R},\U{3b1} >0,\) is defined by \(\varphi_{\U{3b1} }(f)=\frac{1}{\U{3b1}…

Abstract The photogravitational model of Constantin Popovici combines the Newtonian attraction force with a radiative repelling one. We consider a…

Abstract For a given a monoparametric family of curves \(f(x,y)=c\), we present the partial differential equations satisfied by the potentials…

Abstract The subword complexity function \(p_{w}\) of a finite word \(w\) over a finite alphabet A with card \(A=q\geq1\) is…

Abstract The rest in some approximation formulae can be expressed in terms of a generalized divided di§erence on three knots.…

Abstract Strong forces in celestial mechanics have the property that the particle moving under their action can describe periodic orbits,…