English
Related papers

Related papers: Yet another look at positive linear operators, $q$…

200 papers

Khintchine's theorem on the measure dichotomy for the set of $\psi$-approximable numbers has been generalized to inhomogeneous and higher-dimensional settings. Allen and Ram\'irez conjectured that the monotonicity condition can be removed…

Number Theory · Mathematics 2026-04-27 Seongmin Kim

We design a nonadaptive algorithm that, given oracle access to a function $f: \{0,1\}^n \to \{0,1\}$ which is $\alpha$-far from monotone, makes poly$(n, 1/\alpha)$ queries and returns an estimate that, with high probability, is an…

Data Structures and Algorithms · Computer Science 2021-02-26 Ramesh Krishnan S. Pallavoor , Sofya Raskhodnikova , Erik Waingarten

In this paper, we give an interesting generalization of the Stancu type Baskakov-Kantorovich operators based on the q-integers and investigate their approximation properties. Also, we obtain the estimates for the rate of convergence for a…

Functional Analysis · Mathematics 2011-02-15 Cigdem Atakut , Ibrahim Buyukyazici

The aim of this article is to introduce a bivariate extension of Shurer-Stancu operators based on (p q)integers. We prove uniform approximation by means of Bohman Korovkin type theorem rate of convergence using total modulus of smoothness…

Classical Analysis and ODEs · Mathematics 2016-02-23 Abdul Wafi , Nadeem Rao

We simplify the proof of some widely used theoretical theorems, extending their applicability, while correcting some erroneous results. We also generalize key results and present new results that contribute to the development of the theory.…

Classical Analysis and ODEs · Mathematics 2025-10-02 V. E. Sándor Szabó

A theorem of Hoischen states that given a positive continuous function $\varepsilon:\mathbb{R}\to\mathbb{R}$, an integer $n\geq 0$, and a closed discrete set $E\subseteq\mathbb{R}$, any $C^n$ function $f:\mathbb{R}\to\mathbb{R}$ can be…

Classical Analysis and ODEs · Mathematics 2026-01-01 Maxim R. Burke

We present a unified framework to construct well-posed formulations for large classes of linear operator equations including elliptic, parabolic and hyperbolic partial differential equations. This general approach incorporates known weak…

Numerical Analysis · Mathematics 2025-08-08 Moritz Feuerle , Richard Löscher , Olaf Steinbach , Karsten Urban

The article [HPS] established a monotonicity inequality for the Helmholtz equation and presented applications to shape detection and local uniqueness in inverse boundary problems. The monotonicity inequality states that if two scattering…

Analysis of PDEs · Mathematics 2019-08-02 Bastian Harrach , Valter Pohjola , Mikko Salo

A wide class of regularization problems in machine learning and statistics employ a regularization term which is obtained by composing a simple convex function \omega with a linear transformation. This setting includes Group Lasso methods,…

Machine Learning · Computer Science 2011-04-11 Andreas Argyriou , Charles A. Micchelli , Massimiliano Pontil , Lixin Shen , Yuesheng Xu

We consider linear combinations of eigenfunctions of the Laplace-Beltrami operator on a compact Riemannian manifold $(M,g)$ and investigate a density property of their zero sets. More precisely, let $f=\sum_{k=1}^m a_k…

Analysis of PDEs · Mathematics 2021-02-17 Stefano Decio

In this paper, under the monotonicity of pairs of operators, we propose some Generalized Proximal Point Algorithms to solve non-monotone inclusions using warped resolvents and transformed resolvents. The weak, strong, and linear convergence…

Optimization and Control · Mathematics 2025-01-24 Ba Khiet Le , Minh N. Dao , Michel Théra

The $2 \rightarrow q$ norm of a matrix $X \in \mathbb{R}^{n \times d}$ is defined as $\lVert X \rVert_{2 \rightarrow q} = \sup_{\lVert v \rVert_2 = 1} \lVert Xv \rVert_q$. We give polynomial-time multiplicative approximation algorithms for…

Data Structures and Algorithms · Computer Science 2026-05-29 Samuel B. Hopkins , Stefan Tiegel

We show that every algorithm for testing $n$-variate Boolean functions for monotonicity must have query complexity $\tilde{\Omega}(n^{1/4})$. All previous lower bounds for this problem were designed for non-adaptive algorithms and, as a…

Computational Complexity · Computer Science 2015-11-17 Aleksandrs Belovs , Eric Blais

Several kinds of q-orthogonal polynomials with |q|=1 are constructed as the main parts of the eigenfunctions of new solvable discrete quantum mechanical systems. Their orthogonality weight functions consist of quantum dilogarithm functions,…

Mathematical Physics · Physics 2016-01-22 Satoru Odake , Ryu Sasaki

In this article, we construct new Pad\'{e} approximations for the \emph{product} of binomial functions and powers of logarithmic functions. While several explicit Pad\'{e} approximants are known for powers of exponential functions, binomial…

Number Theory · Mathematics 2025-11-14 Makoto Kawashima

A Boolean function on n variables is q-resilient if for any subset of at most q variables, the function is very likely to be determined by a uniformly random assignment to the remaining n-q variables; in other words, no coalition of at most…

Computational Complexity · Computer Science 2016-04-19 Raghu Meka

The main purpose of this paper is to introduce moduli of smoothness with Jacobi weights $(1-x)^\alpha(1+x)^\beta$ for functions in the Jacobi weighted $L_p[-1,1]$, $0<p\le \infty$, spaces. These moduli are used to characterize the…

Classical Analysis and ODEs · Mathematics 2018-11-12 Kirill A. Kopotun , Dany Leviatan , Igor A. Shevchuk

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…

Computational Complexity · Computer Science 2009-10-21 Ilias Diakonikolas , Rocco A. Servedio

We consider a dominance order on positive vectors induced by the elementary symmetric polynomials. Under this dominance order we provide conditions that yield simple proofs of several monotonicity questions. Notably, our approach yields a…

Classical Analysis and ODEs · Mathematics 2017-06-26 Suvrit Sra

We establish a continuous-time framework for analyzing Deep Q-Networks (DQNs) via stochastic control and Forward-Backward Stochastic Differential Equations (FBSDEs). Considering a continuous-time Markov Decision Process (MDP) driven by a…

Machine Learning · Computer Science 2025-05-06 Qian Qi