Related papers: Approximation order and approximate sum rules in s…
In this paper we study the connection between the spectral condition of an Hermite subdivision operator and polynomial reproduction properties of the associated subdivision scheme. While it is known that in general the spectral condition…
Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…
The paper considers the properties of pseudo stationarity in a broad sense and pseudo strong mixing for sequences of random variables corresponding to arithmetic functions. Assertions on this topic have been proven. The implementation of…
In this paper subdivision schemes, which are used for functions approximation and curves generation, are considered. In classical case, for the functions defined on the real line, the theory of subdivision schemes is widely known due to…
The reduction of computational costs in the numerical solution of nonstationary problems is achieved through splitting schemes. In this case, solving a set of less computationally complex problems provides the transition to a new level in…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
In this paper, we study scalar multivariate non-stationary subdivision schemes with integer dilation matrix M=mI, m >=2, and present a general approach for checking their convergence and for determining their H\"older regularity. The…
We show that every real nonnegative polynomial $f$ can be approximated as closely as desired by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. Each $f_\epsilon$ has a simple et explicit form in terms of $f$ and…
We obtain a strong invariance principle for nonconventional sums and applying this result we derive for them a version of the law of iterated logarithm, as well as an almost sure central limit theorem. Among motivations for such results are…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…
Convergence and normal continuity analysis of a bivariate non-stationary (level-dependent) subdivision scheme for 2-manifold meshes with arbitrary topology is still an open issue. Exploiting ideas from the theory of asymptotically…
Stationary subdivision schemes have been extensively studied and have numerous applications in CAGD and wavelet analysis. To have high-order smoothness of the scheme, it is usually inevitable to enlarge the support of the mask that is used,…
The error term in the approximate functional equation for exponential sums involving the divisor function will be improved under certain conditions for the parameters of the approximate functional equation.
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…
This write-up contains some minor results and notes related to our work [HQ15] (some of them already known in the literature). In particular, it shows the following: - We show that a graph with polynomial expansion have sublinear…
In this paper subdivision schemes, which are used for functions approximation and curves generation, are considered. In classical case, for the functions defined on the real line, the theory of subdivision schemes is widely known due to…
This paper is devoted to studying the asymptotic behaviour of solutions to generalized non-commensurate fractional systems. To this end, we first consider fractional systems with rational orders and introduce a criterion that is necessary…
The generation of curves and surfaces from given data is a well-known problem in Computer-Aided Design that can be approached using subdivision schemes. They are powerful tools that allow obtaining new data from the initial one by means of…
Polynomial approximations of functions are widely used in scientific computing. In certain applications, it is often desired to require the polynomial approximation to be non-negative (resp. non-positive), or bounded within a given range,…