Suppose that for an arbitrary function $f(x,y)$ of two discrete variables, we have the formal expansions. [f(x,y)=sumlimits_{m,n=0}^{infty }a_{m,n},P_{m}(x)P_{n}(y),] $$‎ ‎x^{m}P_{j}(x)=sumlimits_{n=0}^{2m}a_{m,,n}(j)P_{j+m-n}(x)‎,$$ ‎we find the coefficients $b_{i,j}^{(p,q,ell‎ ,‎,r)}$ in the expansion‎ $$‎ ‎x^{ell }y^{r},nabla _{x}^{p}nabla _{y}^{q},f(x,y)=x^{ell‎ ‎}y^{r}f^{(p,q)}(x,y) =sumli...

In cite{p}, Park introduced the quadratic $rho$-functional inequalitiesbegin{eqnarray}label{E01}&& |f(x+y)+f(x-y)-2f(x)-2f(y)| \ && qquad le  left|rholeft(2 fleft(frac{x+y}{2}right) + 2 fleft(frac{x-y}{2}right)- f(x) -  f(y)right)right|,  nonumberend{eqnarray}where $rho$ is a fixed complex number with $|rho|

An empirical study of the bivariate probability distribution characterizing a full set of two consecutive price increments x and y for a group of stocks at time scales ranging from one minute to thirty minutes reveals asymmetric structures with respect to the axes y = 0, y = x, x = 0 and y = −x. All four asymmetry patterns remarkably resemble a four-blade mill called market mill pattern. The fo...

A permutation class which is closed under pattern involvement may be described in terms of its basis. The wreath product construction X o Y of two permutation classes X and Y is also closed, and we investigate classes Y with the property that, for any finitely based class X, the wreath product X o Y is also finitely based.

A space $Y$ is called an {em extension} of a space $X$, if $Y$ contains $X$ as a dense subspace. Two extensions of $X$ are said to be {em equivalent}, if there is a homeomorphism between them which fixes $X$ point-wise. For two (equivalence classes of) extensions $Y$ and $Y'$ of $X$ let $Yleq Y'$, if there is a continuous function of $Y'$ into $Y$ which fixes $X$ point-wise. An extension $Y$ ...

Babson and Steingrimsson (2000, Séminaire Lotharingien de Combinatoire, B44b, 18) introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Let fτ ;r (n) be the number of 1-3-2-avoiding permutations on n letters that contain exactly r occurrences of τ , where τ is a generalized pattern on k letters. Let Fτ ...