相关论文: Lower bounds on expressions dependent on functions…
We give lower bounds on the case of worst inhomogeneous approximation.
We study the exact extremal orders of compositions $f(g(n))$ of certain arithmetical functions, including the functions $\sigma(n)$, $\phi(n)$, $\sigma^*(n)$ and $\phi^*(n)$, representing the sum of divisors of $n$, Euler's function and…
We derive explicit lower and upper bounds for the probability generating functional of a stationary locally stable Gibbs point process, which can be applied to summary statistics like the F function. For pairwise interaction processes we…
We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…
The behavior of harmonic functions on Riemannian manifolds under lower bounds of the Ricci curvature has been studied from both analytic and geometric viewpoints. For example, some Liouville type theorems are obtained under lower bounds of…
We prove that a local $L^p(V_2)$ variation norm estimate fails for circular means in two dimensions, and quantify this failure by proving lower bounds for functions of exponential type. This is related to lower bounds for Fourier…
Given the Thomas-Fermi equation sqrt(x)phi''=phi*(3/2), this paper changes first the dependent variable by defining y(x)=sqrt(x phi(x)). The boundary conditions require that y(x) must vanish at the origin as sqrt(x), whereas it has a…
The paper provides new upper and lower bounds for the multivariate Laplace approximation under weak local assumptions. Their range of validity is also given. An application to an integral arising in the extension of the Dixon's identity is…
We show that electronic wave functions Psi of atoms and molecules have a representation Psi=F*phi, where F is an explicit universal factor, locally Lipschitz, and independent of the eigenvalue and the solution Psi itself, and phi has…
Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…
Euler's totient function, $\varphi(n)$, which counts how many of $0,1,\dots,n-1$ are coprime to $n$, has an explicit asymptotic lower bound of $n/\log \log n$, modulo some constant. In this note, we generalise $\varphi$; given an…
Upper and lower bounds are written down for the minimum information entropy in phase space of an antisymmetric wave function in any number of dimensions. Similar bounds are given when the wave function is restricted to belong to any of the…
Lower bounds involving $f$-divergences between the underlying probability measures are proved for the minimax risk in estimation problems. Our proofs just use simple convexity facts. Special cases and straightforward corollaries of our…
In this note, in particular, we establish the following result: Let $X$ be a real Banach space, $\varphi\in X^*\setminus \{0\}$ and $\psi:X\to {\bf R}$ a Lipschitzian functional with Lipschitz constant equal to $\varphi\|_X^{*}$. Then, we…
Based on the framework of the WZ theory, a new evaluation for $\varsigma (2) = \frac{\pi ^2}{6}$ and $\varsigma (4) = \frac{\pi ^4}{90}$ was given respectively, finally, a new recurrence formula for $\varsigma (2k)$ was given.
Suppose that $M$ is a compact Riemannian manifold with boundary and $u$ is an $L^2$-normalized Dirichlet eigenfunction with eigenvalue $\lambda$. Let $\psi$ be its normal derivative at the boundary. Scaling considerations lead one to expect…
We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].
We obtain a lower bound for a number of primes in tuples. As applications, we obtain a lower bound for the Romanoff type representation functions.
We define $\overline{\psi}$ to be the multiplicative arithemtic function that satisfies \[\overline{\psi}(p^{\alpha})=\begin{cases} p^{\alpha-1}(p+1), & \mbox{if } p\neq 2; \\ p^{\alpha-1}, & \mbox{if } p=2 \end{cases}\] for all primes $p$…
We prove lower bounds on the complexity of finding $\epsilon$-stationary points (points $x$ such that $\|\nabla f(x)\| \le \epsilon$) of smooth, high-dimensional, and potentially non-convex functions $f$. We consider oracle-based complexity…