Related papers: Oppenheim-Schur's inequality and RKHS
This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces,…
We study the categorical framework for the computation of persistent homology, without reliance on a particular computational algorithm. The computation of persistent homology is commonly summarized as a matrix theorem, which we call the…
We develop a finite-dimensional, symmetric matrix framework associated with the Riemann zeta function for complex arguments s with Real(s) unequal 1/2.
Starting with the correspondence between positive definite kernels on the one hand and reproducing kernel Hilbert spaces (RKHSs) on the other, we turn to a detailed analysis of associated measures and Gaussian processes. Point of departure:…
Let $A, B$ and $X$ be $n\times n$ matrices such that $A, B$ are positive semidefinite. We present some refinements of the matrix Cauchy-Schwarz inequality by using some integration techniques and various refinements of the Hermite--Hadamard…
In this paper, by using hardy inequality, we establish some new integral inequalities of Hardy-Hilbert type with general kernel. As applications, equivalent forms and some particular results are built; the corresponding to the double series…
The problem of finding completely positive matrices with equal cp-rank and rank is considered. We give some easy-to-check sufficient conditions on the entries of a doubly nonnegative matrix for it to be completely positive with equal…
In previous work [Adv. Math. 298, pp. 325-368, 2016], the structure of the simultaneous kernels of Hadamard powers of any positive semidefinite matrix were described. Key ingredients in the proof included a novel stratification of the cone…
In this paper we continue to investigate a certain class of Hankel-like positive definite kernels using their associated orthogonal polynomials. The main result of this paper is about the structure of this kind of kernels.
Given the projections of two semialgebraic sets defined by polynomial matrix inequalities, it is in general difficult to determine whether one is contained in the other. To address this issue we propose a new matrix Positivstellensatz that…
Let $A,\;B$ be the positive semidefinite matrices. A matrix version of the famous Powers-St{\o}rmer's inequality $$2Tr(A^\alpha B^{1-\alpha})\geq Tr(A+B-|A-B|),\;\;\;0\leq\alpha\leq 1,$$ was proven by Audenaert et. al. We establish a…
We consider the Calder\'on-Zygmund kernels $K_ {\alpha,n}(x)=(x_i^{2n-1}/|x|^{2n-1+\alpha})_{i=1}^d$ in $\mathbb{R}^n$ for $0<\alpha\leq 1$ and $n\in\mathbb{N}$. We show that, on the plane, for $0<\alpha<1$, the capacity associated to the…
A linear-complexity algorithm for computing the Wasserstein-1 distance on non-uniform meshes is proposed. This work extends the fast Sinkhorn algorithms from [Q. Liao et al., Commun. Math. Sci., 20(2022)] and [Q. Liao et al., J. Sci.…
We call the solution of a kind of second order homogeneous partial differential equation as real kernel alpha-harmonic mappings. In this paper, the representation theorem, the Lipschitz continuity, the univalency and the related problems of…
Usually, complex-valued RKHS are presented as an straightforward application of the real-valued case. In this paper we prove that this procedure yields a limited solution for regression. We show that another kernel, here denoted as pseudo…
Much recent work has addressed the solution of a family of partial differential equations by computing the inverse operator map between the input and solution space. Toward this end, we incorporate function-valued reproducing kernel Hilbert…
Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear…
A spectrahedron is the positivity region of a linear matrix pencil and thus the feasible set of a semidefinite program. We propose and study a hierarchy of sufficient semidefinite conditions to certify the containment of a spectrahedron in…
The paper introduces a new characterisation of strictly positive definiteness for kernels on the 2-sphere without assuming the kernel to be radially (isotropic) or axially symmetric. The results use the series expansion of the kernel in…
In this article we consider mathematical fundamentals of one method for proving inequalities by computer, based on the Remez algorithm. Using the well-known results of undecidability of the existence of zeros of real elementary functions,…