Search

There are two parts for this paper. In the first part, we extend some results in a recent paper by Du, Guth, Li and Zhang to a more general class of phase functions. The main methods are Bourgain-Demeter's $l^2$ decoupling theorem and induction on scales. In the second part, we prove some positive results for the maximal extension operator for hypersurfaces with positive principal curvatures. The main methods are sharp $L^2$ estimates by Du and Zhang, and the bilinear method by Wolff and Tao., 24 pages, revised version incorporating referees' suggestions

In this paper, we present a smoothing Newton method for solving the monotone weighted complementarity problem (WCP). In each iteration of our method, the iterative direction is achieved by solving a system of linear equations and the iterative step length is achieved by adopting a line search. A feature of the line search criteria used in this paper is that monotone and nonmonotone line search are mixed used. The proposed method is new even when the WCP reduces to the standard complementarity problem. Particularly, the proposed method is proved to possess the global convergence under a weak assumption. The preliminary experimental results show the effectiveness and robustness of the proposed method for solving the concerned WCP.

In this paper, a novel chaotic new three-dimensional system has been studied by Zhang et al. in 2012. In the system, there are three control parameters and three different nonlinear terms which governed equations. Zhang et al. studied elementary (preliminary) dynamic properties of the chaotic new three-dimensional system by means of bifurcation diagram, maximum Lyapunov exponent, phase portraits, dynamics behaviors by changing some parameters etc., using all possible theoretical analysis and numerical simulation. In this paper, we have demonstrated its complete synchronization. The proposed results are verified by numerical simulations.

This paper is intended to study the limit theorem of Markov chain function in the environment of single infinite Markovian systems. Moreover, the problem of the strong law of large numbers in the infinite environment is presented by means of constructing martingale differential sequence for the measurement under some different sufficient conditions. If the sequence of even functions gnx,n≥0 satisfies different conditions when the value ranges of x are different, we have obtained SLLN for function of Markov chain in the environment of single infinite Markovian systems. In addition, the paper studies the strong convergence of the weighted sums of function for finite state Markov Chains in single infinitely Markovian environments. Although the similar conclusions have been carried out, the difference results performed by previous scholars are that we give weaker different sufficient conditions of the strong convergence of weighted sums compared with the previous conclusions.

The main purpose of this paper is to explore the structure of local and regular Dirichlet forms associated with symmetric one-dimensional diffusions, which are also called symmetric linear diffusions. Let ( E , F ) (\mathcal {E},\mathcal {F}) be a regular and local Dirichlet form on L 2 ( I , m ) L^2(I,m) , where I I is an interval and m m is a fully supported Radon measure on I I . We shall first present a complete representation for ( E , F ) (\mathcal {E},\mathcal {F}) , which shows that ( E , F ) (\mathcal {E},\mathcal {F}) lives on at most countable disjoint “effective" intervals with an “adapted" scale function on each interval, and any point outside these intervals is a trap of the one-dimensional diffusion. Furthermore, we shall give a necessary and sufficient condition for C c ∞ ( I ) C_c^\infty (I) being a special standard core of ( E , F ) (\mathcal {E},\mathcal {F}) and shall identify the closure of C c ∞ ( I ) C_c^\infty (I) in ( E , F ) (\mathcal {E},\mathcal {F}) when C c ∞ ( I ) C_c^\infty (I) is contained but not necessarily dense in F \mathcal {F} relative to the E 1 1 / 2 \mathcal {E}_1^{1/2} -norm. This paper is partly motivated by a result of Hamza’s that was stated in a theorem of Fukushima, Oshima, and Takeda’s and that provides a different point of view to this theorem. To illustrate our results, many examples are provided.

Zhao and Ho asked in a recent paper that for each T0 space X, whether KB(X) (the set of all irreducible closed sets of X whose suprema exist) is the canonical k-bounded sobrification of X in the sense of Keimel and Lawson. In this paper, we construct a counterexample to give a negative answer. We also consider the subcategory Topκ of the category Top0 of T0 spaces, and prove that the category KBSob of k-bounded sober spaces is a full reflective subcategory of the category KBSob of k-bounded sober spaces is a full reflective subcategory of the category Topκ.

Let rk(n) denote the number of lattice points on a k-dimensional sphere of radius $$ \sqrt{n} $$ . The generating function $$ {\zeta}_k(s)=\sum \limits_{n=1}^{\infty }{r}_k(n){n}^{-s},\kern0.5em k\ge 2, $$ is Epstein’s zeta function. The paper considers the Riesz mean of the type $$ {D}_{\rho}\left(x;{\zeta}_3\right)=\frac{1}{\Gamma \left(\rho +1\right)}\sum \limits_{n\le x}{\left(x-n\right)}^{\rho }{r}_3(n), $$ where ρ > 0; the error term Δρ(x; ζ3) is defined by $$ {D}_{\rho}\left(x;{\zeta}_3\right)=\frac{\uppi^{3/2}{x}^{\rho +3/2}}{\Gamma \left(\rho +5/2\right)}+\frac{x^{\rho }}{\Gamma \left(\rho +1\right)}{\zeta}_3(0)+{\Delta}_{\rho}\left(x;{\zeta}_3\right). $$ K. Chandrasekharan and R. Narasimhan (1962, MR25#3911) proved that $$ {\Delta}_{\rho}\left(x;{\zeta}_3\right)=\Big\{{\displaystyle \begin{array}{ll}O\Big({x}^{1/2+\rho /2\Big)}& \left(\rho >1\right),\\ {}{\Omega}_{\pm}\left({x}^{1/2+\rho /2}\right)& \left(\rho \ge 0\right).\end{array}} $$ In the present paper, it is proved that $$ {\Delta}_{\rho}\left(x;{\zeta}_3\right)=\Big\{{\displaystyle \begin{array}{ll}O\left(x\log x\right)& \left(\rho =1\right),\\ {}O\left({x}^{2/3+\rho /3+\varepsilon}\right)& \left(1/2

This paper will be devoted to study a class of bilinear square-function Fourier multiplier operator associated with a symbol $m$ defined by $$\begin{eqnarray}\displaystyle & & \displaystyle \mathfrak{T}_{\unicode[STIX]{x1D706},m}(f_{1},f_{2})(x)\nonumber\\ \displaystyle & & \displaystyle \quad =\Big(\iint _{\mathbb{R}_{+}^{n+1}}\Big(\frac{t}{|x-z|+t}\Big)^{n\unicode[STIX]{x1D706}}\nonumber\\ \displaystyle & & \displaystyle \qquad \times \,\bigg|\int _{(\mathbb{R}^{n})^{2}}e^{2\unicode[STIX]{x1D70B}ix\cdot (\unicode[STIX]{x1D709}_{1}+\unicode[STIX]{x1D709}_{2})}m(t\unicode[STIX]{x1D709}_{1},t\unicode[STIX]{x1D709}_{2})\hat{f}_{1}(\unicode[STIX]{x1D709}_{1})\hat{f}_{2}(\unicode[STIX]{x1D709}_{2})\,d\unicode[STIX]{x1D709}_{1}\,d\unicode[STIX]{x1D709}_{2}\bigg|^{2}\frac{dz\,dt}{t^{n+1}}\Big)^{1/2}.\nonumber\end{eqnarray}$$ A basic fact about $\mathfrak{T}_{\unicode[STIX]{x1D706},m}$ is that it is closely associated with the multilinear Littlewood–Paley $g_{\unicode[STIX]{x1D706}}^{\ast }$ function. In this paper we first investigate the boundedness of $\mathfrak{T}_{\unicode[STIX]{x1D706},m}$ on products of weighted Lebesgue spaces. Then, the weighted endpoint $L\log L$ type estimate and strong estimate for the commutators of $\mathfrak{T}_{\unicode[STIX]{x1D706},m}$ will be demonstrated.

This paper concerns the adaptive finite element method for elliptic Dirichlet boundary control problems in the energy space. The contribution of this paper is twofold. First, we rigorously derive efficient and reliable a posteriori error estimates for finite element approximations of Dirichlet boundary control problems. As a by-product, a priori error estimates are derived in a simple way by introducing appropriate auxiliary problems and establishing certain norm equivalence. Secondly, for the coupled elliptic partial differential system that resulted from the first-order optimality system, we prove that the sequence of adaptively generated discrete solutions including the control, the state and the adjoint state, guided by our newly derived a posteriori error indicators, converges to the true solution along with the convergence of the error estimators. We give some numerical results to confirm our theoretical findings.

The purpose of this paper is to introduce the split combination of variational inclusion problem which combines the concept of the modified variational inclusion problem introduced by Khuangsatung and Kangtunyakarn and the split variational inclusion problem introduced by Moudafi. Using a modified Halpern iterative method, we prove the strong convergence theorem for finding a common solution for the hierarchical fixed point problem and the split combination of variational inclusion problem. The result presented in this paper demonstrates the corresponding result for the split zero point problem and the split combination of variation inequality problem. Moreover, we discuss a numerical example for supporting our result and the numerical example shows that our result is not true if some conditions fail.

In this paper we focus on the analysis of energy-preserving schemes for solving high-dimensional nonlinear Klein–Gordon equations. A novel energy-preserving scheme is developed based on the discrete gradient method and the Duhamel principle. The local error, global convergence and nonlinear stability of the new scheme are analysed in detail. Numerical experiments are implemented to compare with existing numerical methods in the literature, and the numerical results show the remarkable efficiency of the new energy-preserving scheme presented in this paper.

Many researchers have been interested in the concept of statistical convergence because of the fact that it is stronger than the classical convergence. Also, the concepts of statistical equal convergence and equi-statistical convergence are more general than the statistical uniform convergence. In this paper we define a new type of statistical convergence by using the notions of equi-statistical convergence and statistical equal convergence to prove a Korovkin type theorem. We show that our theorem is a non-trivial extension of some well-known Korovkin type approximation theorems which were demonstrated by earlier authors. After, we present an example in support of our definition and result presented in this paper. Finally, we also compute the rates of statistical equi-equal convergence of sequences of positive linear operators.

We study properties of sets having the minimum length (one-dimensional Hausdorff measure) in the class of closed connected sets Σ ⊂ ℝ2 satisfying the inequality max yϵM dist (y, Σ) ≤ r for a given compact set M ⊂ ℝ2 and given r > 0. Such sets play the role of the shortest possible pipelines arriving at a distance at most r to every point of M where M is the set of customers of the pipeline. In this paper, it is announced that every maximum distance minimizer is a union of finitely many curves having one-sided tangent lines at every point. This shows that a maximum distance minimizer is isotopic to a finite Steiner tree even for a “bad” compact set M, which distinguishes it from a solution of the Steiner problem (an example of a Steiner tree with infinitely many branching points can be found in a paper by Paolini, Stepanov, and Teplitskaya). Moreover, the angle between these lines at each point of a maximum distance minimizer is at least 2π/3. Also, we classify the behavior of a minimizer Σ in a neighborhood of any point of Σ. In fact, all the results are proved for a more general class of local minimizers.

In the first part of the paper we give a new integral representation for the principal branch of the Lambert W function. Then we deduce two continued fraction expansions for this branch. At the end of the paper we study the numerical behavior of the approximants of these expansions.

In this paper, we study the mean value property for both the harmonic functions and the functions in the domain of the Laplacian on the tetrahedral Sierpinski gasket. This paper is a continuation of the work of Strichartz and the first author (Qiu and Strichartz, J Fourier Anal Appl 19:943–966, 2013)where the same property on p.c.f. self-similar sets with Dihedral-3 symmetry was considered.

This is a continuation of our previous paper [14]. In [14], we introduced the first Aeppli–Chern class on compact complex manifolds, and proved that the (1, 1) curvature form of the Levi–Civita connection represents the first Aeppli–Chern class which is a natural link between Riemannian geometry and complex geometry. In this paper, we study the geometry of compact complex manifolds with Levi–Civita Ricci-flat metrics and classify minimal complex surfaces with Levi–Civita Ricci-flat metrics. More precisely, we show that minimal complex surfaces admitting Levi–Civita Ricci-flat metrics are Kahler Calabi–Yau surfaces and Hopf surfaces.

In this paper our aim is to show some new inequalities of the Redheffer type for Bessel and modified Bessel functions of the first kind. The key tools in our proofs are some classical results on the monotonicity of quotients of differentiable functions as well as on the monotonicity of quotients of two power series. We also use some known results on the quotients of Bessel and modified Bessel functions of the first kind, and by using the monotonicity of the Dirichlet eta function we prove a sharp inequality for the tangent function. At the end of the paper a conjecture is stated, which may be of interest for further research.

The aim of this paper is to extend the applicability of the Gauss-Newton’s method for solving nonlinear least squares problems using our new idea of restricted convergence domains. The new technique uses tighter Lipschitz functions than in earlier papers leading to a tighter ball convergence analysis.

This paper deals with the electrostatic MEMS-device parabolic equation $${u_t} - \Delta u = \frac{{\lambda f(x)}}{{{{(1 - u)}^p}}}$$ in a bounded domain Ω of ℝ N , with Dirichlet boundary condition, an initial condition u0(x) ∈ [0, 1) and a nonnegative profile f, where λ > 0, p > 1. The study is motivated by a simplified micro-electromechanical system (MEMS for short) device model. In this paper, the author first gives an asymptotic behavior of the quenching time T* for the solution u to the parabolic problem with zero initial data. Secondly, the author investigates when the solution u will quench, with general λ, u0(x). Finally, a global existence in the MEMS modeling is shown.

This paper is a companion paper to [G4], where sharp estimates are proven for Fourier transforms of compactly supported functions built out of two-dimensional real-analytic functions. The theorems of [G4] are stated in a rather general form. In this paper, we expand on the results of [G4] and show that there is a class of "well-behaved" functions that contains a number of relevant examples for which such estimates can be explicitly described in terms of the Newton polygon of the function. We will further see that for a subclass of these functions, one can prove noticeably more precise estimates, again in an explicitly describable way., 13 pages

A map (S,G) is a closed Riemann surface S with embedded graph G such that S \G is the disjoint union of connected components, called faces, each of which is homeomorphic to an open disk. Tutte began a systematic study of maps in the 1960s and contemporary authors are actively developing it. In the present paper, after recalling the concept of a circular map introduced by the author and Mednykh, a relationship between bipartite maps and circular maps is demonstrated via the concept of the duality of maps. In this way an enumeration formula for the number of bipartite maps with a given number of edges is obtained. A hypermap is a map whose vertices are colored black and white in such a way that every edge connects vertices of different colors. The hypermaps are also known as dessins d’enfants (or Grothendieck’s dessins). A hypermap is self-equivalent with respect to reversing the colors of vertices if it is equivalent to the hypermap obtained by reversing the colors of its vertices. The main result of the present paper is an enumeration formula for the number of unrooted hypermaps, regardless of genus, which have n edges and are self-equivalent with respect to reversing the colors of vertices. Bibliography: 13 titles.

Alzalg, Baha/0000-0002-1839-8083; Momani, Shaher M./0000-0002-6326-8456; WOS: 000413785300005 In a recent paper (Zeb et al. in Appl Math Model 37(7):5326-5334, 2013), the authors presented a new model of giving up smoking model. In the present paper, the dynamics of this new model involving the Caputo derivative was studied numerically. For this purpose, generalized Euler method and the multistep generalized differential transform method are employed to compute accurate approximate solutions to this new giving up smoking model of fractional order. The unique positive solution for the fractional order model is presented. A comparative study between these two methods and the well-known Runge-Kutta method is presented in the case of integer-order derivatives. The solutions obtained are also presented graphically.

In 1874, Franz Mertens proved the so-called Mertens’ theorem, and in 1974, Kenneth S. Williams showed Mertens’ theorem associated with a character. In a previous paper, we presented a graph-theoretic analogue to Williams’ theorem. In this paper, we generalize our previous work in the sense that a character is extended to a representation. To our knowledge, a number-theoretic analogue to our result is not yet known. So, we expect that, by using our methods, it can be proven in the future.

Motivated by the paper Gerard-Varet and Dormy (2010) [6] [JAMS, 2010] about the linear ill-posedness for the Prandtl equations around a shear flow with exponential decay in normal variable, and the recent study of well-posedness on the Prandtl equations in Sobolev spaces, this paper aims to extend the result in [6] to the case when the shear flow has general decay. The key observation is to construct an approximate solution that captures the initial layer to the linearized problem motivated by the precise formulation of solutions to the inviscid Prandtl equations.

In this paper, an iteration process is considered to solve linear ill-posed problems. Based on the randomness of the involved variables, this kind of problems is regarded as simulation problems of the posterior distribution of the unknown variable given the noise data. We construct a new ensemble Kalman filter-based method to seek the posterior target distribution. Despite the ensemble Kalman filter method having widespread applications, there has been little analysis of its theoretical properties, especially in the field of inverse problems. This paper analyzes the propagation of the error with the iteration step for the proposed algorithm. The theoretical analysis shows that the proposed algorithm is convergence. We compare the numerical effect with the Bayesian inversion approach by two numerical examples: backward heat conduction problem and the first kind of integral equation. The numerical tests show that the proposed algorithm is effective and competitive with the Bayesian method. Copyright © 2017 John Wiley & Sons, Ltd.

Reduction theory has played a major role in the study of Hamiltonian systems. Whilst the Hamilton–Jacobi theory is one of the main tools to integrate the dynamics of certain Hamiltonian problems and a topic of research on its own. Moreover, the construction of several symplectic integrators relies on approximations of a complete solution of the Hamilton–Jacobi equation. The natural question that we address in this paper is how these two topics (reduction and Hamilton–Jacobi theory) fit together. We obtain a reduction and reconstruction procedure for the Hamilton–Jacobi equation with symmetries, even in a generalized sense to be clarified below. Several applications and relations to other reduction of the Hamilton–Jacobi theory are shown in the last section of the paper. It is remarkable that as by-product we obtain a generalization of the Ge–Marsden reduction procedure [18] and the results in [17] . Quite surprisingly, the classical ansatze available in the literature to solve the Hamilton–Jacobi equation (see [2] , [19] ) are also particular instances of our framework.

In the present paper we introduce a notion of the \(\mathbb {K}\)-Riemann integral as a natural generalization of a usual Riemann integral and study its properties. The aim of this paper is to extend the classical Hermite–Hadamard inequalities to the case when the usual Riemann integral is replaced by the \(\mathbb {K}\)-Riemann integral and the convexity notion is replaced by \(\mathbb {K}\)-convexity.

We consider the problem of approximating a smooth function from finitely many pointwise samples using $$\ell ^1$$ minimization techniques. In the first part of this paper, we introduce an infinite-dimensional approach to this problem. Three advantages of this approach are as follows. First, it provides interpolatory approximations in the absence of noise. Second, it does not require a priori bounds on the expansion tail in order to be implemented. In particular, the truncation strategy we introduce as part of this framework is independent of the function being approximated, provided the function has sufficient regularity. Third, it allows one to explain the key role weights play in the minimization, namely, that of regularizing the problem and removing aliasing phenomena. In the second part of this paper, we present a worst-case error analysis for this approach. We provide a general recipe for analyzing this technique for arbitrary deterministic sets of points. Finally, we use this tool to show that weighted $$\ell ^1$$ minimization with Jacobi polynomials leads to an optimal method for approximating smooth, one-dimensional functions from scattered data.

The study of the global structure of ultrafilters on the natural numbers with respect to the quasi-orders of Rudin-Keisler and Rudin-Blass reducibility was initiated in the 1970s by Blass, Keisler, Kunen, and Rudin. In a 1973 paper Blass studied the special class of P-points under the quasi-ordering of Rudin-Keisler reducibility. He asked what partially ordered sets can be embedded into the P-points when the P-points are equipped with this ordering. This question is of most interest under some hypothesis that guarantees the existence of many P-points, such as Martin’s axiom for σ \sigma -centered posets. In his 1973 paper he showed under this assumption that both ω 1 {\omega }_{1} and the reals can be embedded. Analogous results were obtained later for the coarser notion of Tukey reducibility. We prove in this paper that Martin’s axiom for σ \sigma -centered posets implies that the Boolean algebra P ( ω ) / FIN \mathcal {P}(\omega ) / \operatorname {FIN} equipped with its natural partial order can be embedded into the P-points both under Rudin-Keisler and Tukey reducibility. Consequently, the continuum hypothesis implies that every partial order of size at most continuum embeds into the P-points under both notions of reducibility.

Our contribution in this paper is to propose an iterative algorithm which does not require prior knowledge of operator norm and prove strong convergence theorem for approximating a solution of split common fixed point problem of demicontractive mappings in a real Hilbert space. So many authors have used algorithms involving the operator norm for solving split common fixed point problem, but as widely known the computation of these algorithms may be difficult and for this reason, authors have recently started constructing iterative algorithms with a way of selecting the step-sizes such that the implementation of the algorithm does not require the calculation or estimation of the operator norm. We introduce a new algorithm for solving the split common fixed point problem for demicontractive mappings with a way of selecting the step-sizes such that the implementation of the algorithm does not require the calculation or estimation of the operator norm and then prove strong convergence of the sequence in real Hilbert spaces. Finally, we give some applications of our result and numerical example at the end of the paper.

The paper explores an eco-epidemiological model with weak Allee in predator, and the disease in the prey population. We consider a predator-prey model with type II functional response. The curiosity of this paper is to consider different competition coefficients within the prey population, which leads to the emergent carrying capacity. We perform the local and global stability analysis of the equilibrium points and the Hopf bifurcation analysis around the endemic equilibrium point. Further we pay attention to the chaotic dynamics which is produced by disease. Our numerical simulations reveal that the three species eco-epidemiological system without weak-Allee induced chaos from stable focus for increasing the force of infection, whereas in the presence of the weak-Allee effect, it exhibits stable solution. We conclude that chaotic dynamics can be controlled by the Allee parameter as well as the competition coefficients. We apply basic tools of non-linear dynamics such as Poincare section and maximum Lyapunov exponent to identify chaotic behavior of the system.

In the present paper, we introduce a new form of generalized Rayleigh distribution called the Alpha Power generalized Rayleigh (APGR) distribution by following the idea of extension of the distribution families with the Alpha Power transformation. The introduced distribution has the more general form than both the Rayleigh and generalized Rayleigh distributions and provides a better fit than the Rayleigh and generalized Rayleigh distributions for more various forms of the data sets. In the paper, we also obtain explicit forms of some important statistical characteristics of the APGR distribution such as hazard function, survival function, mode, moments, characteristic function, Shannon and Rényi entropies, stress-strength probability, Lorenz and Bonferroni curves and order statistics. The statistical inference problem for the APGR distribution is investigated by using the maximum likelihood and least-square methods. The estimation performances of the obtained estimators are compared based on the bias and mean square error criteria by a conducted Monte-Carlo simulation on small, moderate and large sample sizes. Finally, a real data analysis is given to show how the proposed model works in practice.

Fourier series approximations of continuous but nonperiodic functions on an interval suffer the Gibbs phenomenon, which means there is a permanent oscillatory overshoot in the neighborhoods of the endpoints. Fourier extensions circumvent this issue by approximating the function using a Fourier series that is periodic on a larger interval. Previous results on the convergence of Fourier extensions have focused on the error in the $$L^2$$ L 2 norm, but in this paper we analyze pointwise and uniform convergence of Fourier extensions (formulated as the best approximation in the $$L^2$$ L 2 norm). We show that the pointwise convergence of Fourier extensions is more similar to Legendre series than classical Fourier series. In particular, unlike classical Fourier series, Fourier extensions yield pointwise convergence at the endpoints of the interval. Similar to Legendre series, pointwise convergence at the endpoints is slower by an algebraic order of a half compared to that in the interior. The proof is conducted by an analysis of the associated Lebesgue function, and Jackson- and Bernstein-type theorems for Fourier extensions. Numerical experiments are provided. We conclude the paper with open questions regarding the regularized and oversampled least squares interpolation versions of Fourier extensions.

The fractional calculus is useful in describing the natural phenomena with memory effect. This paper addresses the fractional form of Ambartsumian equation with a delay parameter. It may be a challenge to obtain accurate approximate solution of such kinds of fractional delay equations. In the literature, several attempts have been conducted to analyze the fractional Ambartsumian equation. However, the previous approaches in the literature led to approximate power series solutions which converge in subdomains. Such difficulties are solved in this paper via the Homotopy Perturbation Method (HPM). The present approximations are expressed in terms of the Mittag-Leffler functions which converge in the whole domain of the studied model. The convergence issue is also addressed. Several comparisons with the previous published results are discussed. In particular, while the computed solution in the literature is physical in short domains, with our approach it is physical in the whole domain. The results reveal that the HPM is an effective tool to analyzing the fractional Ambartsumian equation.

We study the approximation of compact linear operators defined over certain weighted tensor product Hilbert spaces. The information complexity is defined as the minimal number of arbitrary linear functionals needed to obtain an e -approximation for the d -variate problem which is fully determined in terms of the weights and univariate singular values. Exponential tractability means that the information complexity is bounded by a certain function that depends polynomially on d and logarithmically on e − 1 . The corresponding unweighted problem was studied in Hickernell et al. (2020) with many negative results for exponential tractability. The product weights studied in the present paper change the situation. Depending on the form of polynomial dependence on d and logarithmic dependence on e − 1 , we study exponential strong polynomial, exponential polynomial, exponential quasi-polynomial, and exponential ( s , t ) -weak tractability with max ( s , t ) ≥ 1 . For all these notions of exponential tractability, we establish necessary and sufficient conditions on weights and univariate singular values for which it is indeed possible to achieve the corresponding notion of exponential tractability. The case of exponential ( s , t ) -weak tractability with max ( s , t ) 1 is left for future study. The paper uses some general results obtained in Hickernell et al. (2020) and Kritzer and Woźniakowski (2019).

This expository paper, based on a Current Events Bulletin talk at the January, 2016 Joint Meetings, introduces the concept of Lyapunov exponents and discusses the role they play in three areas: smooth ergodic theory, Teichm\"uller theory, and the spectral theory of one-frequency Schr\"odinger operators. The inspiration for this paper is the work of 2014 Fields Medalist Artur Avila, and his work in these areas is given special attention., Comment: 27 pages. To appear in the Bulletin of the AMS

Staircase tableaux are combinatorial objects that were first introduced due to a connection with the asymmetric simple exclusion process (ASEP) and Askey-Wilson polynomials. Since their introduction, staircase tableaux have been the object of study in many recent papers. Relevant to this paper, Hitczenko and Janson proved that distribution of parameters on the first diagonal is asymptotically normal. In addition, they conjectured that other diagonals would be asymptotically Poisson. Since then, only the second and the third diagonal were proven to follow the conjecture. This paper builds upon those results to prove the conjecture for the kth diagonal where k is fixed. In particular, we prove that the distribution of the number of α's (β's) on the kth diagonal, k > 1, is asymptotically Poisson with parameter 1/2. In addition, we prove that symbols on the kth diagonal are asymptotically independent and thus, collectively follow the Poisson distribution with parameter 1. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 795–818, 2016

In this paper, we propose an iterative algorithm to find the common element of set of solutions of a split equilibrium problem and set of fixed points of an asymptotically nonexpansive mapping in Hilbert spaces. The new method is used to prove the strong convergence for the result of this paper. The result extends the corresponding one in the literature.

This paper studies the approximation of the Hilbert transform f ? = H f of continuous functions f with continuous conjugate f ? based on a finite number of samples. It is known that every sequence { H N f } N ? N which approximates f ? from samples of f diverges (weakly) with respect to the uniform norm. This paper conjectures that all of these approximation sequences even contain no convergent subsequence. A property which is termed strong divergence.The conjecture is supported by two results. First it is proven that the sequence of the sampled conjugate Fejer means diverges strongly. Second, it is shown that for every sample based approximation method { H N } N ? N there are functions f such that ? H N f ? ∞ exceeds any given bound for any given number of consecutive indices N .As an application, the later result is used to investigate a problem associated with a question of Ul'yanov on Fourier series which is related to the possibility to construct adaptive approximation methods to determine the Hilbert transform from sampled data. This paper shows that no such approximation method with a finite search horizon exists.

In this paper a non-convex vector optimization problem among infinite-dimensional spaces is presented. In particular, a generalized Lagrange multiplier rule is formulated as a necessary and sufficient optimality condition for weakly minimal solutions of a constrained vector optimization problem, without requiring that the ordering cone that defines the inequality constraints has non-empty interior. This paper extends the result of Donato (J. Funct. Analysis261 (2011), 2083–2093) to the general setting of vector optimization by introducing a constraint qualification assumption that involves the Fréchet differentiability of the maps and the tangent cone to the image set. Moreover, the constraint qualification is a necessary and sufficient condition for the Lagrange multiplier rule to hold.

The object of the present paper is to introduce a new curva-ture tensor, named generalized quasi-conformal curvature tensor whichbridges conformal curvature tensor, concircular curvature tensor, pro-jective curvature tensor and conharmonic curvature tensor. Flatness andsymmetric properties of generalized quasi-conformal curvature tensor arestudied in the frame of (k,µ)-contact metric manifolds. 1. IntroductionIn 1968, Yano and Sawaki [27] introduced the notion of quasi-conformalcurvature tensor which contains both conformal curvature tensor as well asconcircular curvature tensor, in the context of Riemannian geometry. In tunewith Yano and Sawaki [27], the present paper attempts to introduce a newtensor field, named generalized quasi-conformal curvature tensor. The beautyof generalized quasi-conformal curvature tensor lies in the fact that it has theflavour of Riemann curvature tensor R, conformal curvature tensor C [8] con-harmonic curvature tensor Cˆ [9], concircular curvature tensor E [26, p. 84],projective curvature tensor P [26, p. 84] and m-projective curvature tensor H[15], as particular cases. The generalized quasi-conformal curvature tensor isdefined asW(X,Y)Z =2n−12n+1[(1−b+2na)−{1+2n(a+b)}c]C(X,Y )Z+[1−b+2na]E(X,Y)Z +2 n (b−a) P(X,Y )Z+2 n−12 n+1(1.1) (c −1){1+2 n(a +b)} Cˆ(X,Y)Zfor all X,Y,Z ∈ χ(M), the set of all vector field of the manifold M, where a,b and c are real constants. The above mentioned curvature tensors are defined

In this paper, we introduce and study an explicit hybrid re- laxed extragradient iterative method to approximate a common solution to generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup in Hilbert space. Further, we prove that the sequence generated by the proposed iterative scheme converges strongly to the common solution to generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup. This common solu- tion is the unique solution of a variational inequality problem and is the optimality condition for a minimization problem. The results presented in this paper are the supplement, improvement and generalization of the previously known results in this area.

This paper proposes two numerical algorithms for solving Euler's elastica-based inpainting model. The minimizing functional is nonsmooth and nonconvex and involves high-order derivatives, that traditional gradient descent based methods converge very slowly. Recent alternating minimization methods show fast convergence when a good choice of parameters is used. The objective of this paper is to introduce efficient algorithms which have simple structures with fewer parameters. These methods are based on operator splitting and alternating direction method of multipliers, and subproblems can be solved efficiently by Fourier transforms and shrinkage operators. For the first method, we relax the normal vector in the curvature term of the Euler's elastica model and exploit two operator splitting techniques to propose a Relaxed Normal Two Split (RN2Split) method. The second method, $\kappa$-weighted Total Variation ($\kappa$TV), solves the Euler's elastica minimization problem as a weighted total variation. We pre...

In this paper, we introduce a system of split variational inequality problems in real Hilbert spaces. Using a projection method, we propose an iterative algorithm for solving this system of split variational inequality problems. Further, we prove that the sequence generated by the iterative algorithm converges strongly to a solution of the system of split variational inequality problems. Furthermore, we discuss some consequences of the main result. The iterative algorithms and results presented in this paper generalize, unify and improve the previously known results of this area.

This paper considers the problem of approximating the spectral factor of continuous spectral densities with finite Dirichlet energy based on finitely many samples of these spectral densities. Although there exists a closed form expression for the spectral factor, this formula shows a very complicated behavior because of the non-linear dependency of the spectral factor from spectral density and because of a singular integral in this expression. Therefore approximation methods are usually applied to calculate the spectral factor. It is shown that there exists no sampling-based method which depends continuously on the samples and which is able to approximate the spectral factor for all densities in this set. Instead, to any sampling-based approximation method there exists a large set of spectral densities so that the approximation method does not converge to the spectral factor for every spectral density in this set as the number of available sampling points is increased. The paper will also show that the same results hold for sampling-based algorithms for the calculation of the outer function in the theory of Hardy spaces.

The aim of this paper is to study the Lagrange interpolation on the unit circle taking only into account the separation properties of the nodal points. The novelty of this paper is that we do not consider nodal systems connected with orthogonal or paraorthogonal polynomials, which is an interesting approach because in practical applications this connection may not exist. A detailed study of the properties satisfied by the nodal system and the corresponding nodal polynomial is presented. We obtain the relevant results of the convergence related to the process for continuous smooth functions as well as the rate of convergence. Analogous results for interpolation on the bounded interval are deduced and finally some numerical examples are presented.

We introduce a conjecture that we call the {\it Two Hyperplane Conjecture}, saying that an isoperimetric surface that divides a convex body in half by volume is trapped between parallel hyperplanes. The conjecture is motivated by an approach we propose to the {\it Hots Spots Conjecture} of J. Rauch using deformation and Lipschitz bounds for level sets of eigenfunctions. We will relate this approach to quantitative connectivity properties of level sets of solutions to elliptic variational problems, including isoperimetric inequalities, Poincar\'e inequalities, Harnack inequalities, and NTA (non-tangentially accessibility). This paper mostly asks questions rather than answering them, while recasting known results in a new light. Its main theme is that the level sets of least energy solutions to scalar variational problems should be as simple as possible., Comment: 22 pages, this new version corrects one word in the introduction, Aguilera is the name of the first author of a paper cited (not Athanosopoulos). Thanks to Joel Spruck for pointing out this error

The Gibbs phenomenon is widely known for Fourier expansions of periodic functions and refers to the phenomenon that the $n$th Fourier partial sums overshoot a target function at jump discontinuities in such a way that such overshoots do not die out as $n$ goes to infinity. The Gibbs phenomenon for wavelet expansions using (bi)orthogonal wavelets has been studied in the literature. Framelets (also called wavelet frames) generalize (bi)orthogonal wavelets. Approximation by quasi-projection operators are intrinsically linked to approximation by truncated wavelet and framelet expansions. In this paper we shall establish a key identity for quasi-projection operators and then we use it to study the Gibbs phenomenon of framelet expansions and approximation by general quasi-projection operators. We shall also study and characterize the Gibbs phenomenon at an arbitrary point for approximation by quasi-projection operators. As a consequence, we show that the Gibbs phenomenon appears at all points for every tight or dual framelet having at least two vanishing moments and for quasi-projection operators having at least three accuracy orders. Our results not only improve current results in the literature on the Gibbs phenomenon for (bi)orthogonal wavelet expansions but also are new for framelet expansions and approximation by quasi-projection operators., revised paper

In the paper, we construct conservative Markov processes corresponding to the martingale solutions to the stochastic heat equation on R + \mathbb {R}^+ or R \mathbb {R} with values in a general Riemannian manifold, which is only assumed to be complete and stochastic complete. This work is an extension of the previous paper of Röckner and the second, third, and fourth authors [SIAM J. Math. Anal. 52 (2020), pp. 2237–2274] on finite volume case. Moveover, we also obtain some functional inequalities associated to these Markov processes. This implies that on infinite volume case, the exponential ergodicity of the solution of the Ricci curvature is strictly positive and the non-ergodicity of the process if the sectional curvature is negative.

In this paper, we study the $H^s$-stability of the log-log blowup regime (which has been completely described in a series of recent works by Merle and Raphael) for the focusing mass-critical nonlinear Schr\"odinger equations $i\partial_tu+\Delta u+|u|^\frac4du=0$ in $\mathbb{R}^d$ with $d\geq3$. We aim to extend the result in [Colliander and Raphael, Rough blowup solutions to the $L^2$ critical NLS, Math. Anna., 345(2009), 307-366.] for dimension two to the higher dimensions cases $d\geq3$, where we use the bootstrap argument in the above paper and the commutator estimates in [M. Visan and X. Zhang, On the blowup for the $L^2$-critical focusing nonlinear Schr\"odinger equation in higher dimensions below the energy class. SIAM J. Math. Anal., 39(2007), 34-56.]., Comment: Comments are welcome. arXiv admin note: text overlap with arXiv:0907.5047 by other authors