Related papers: Convergence of Harder-Narasimhan polygons
We consider the solutions $\rho_\varepsilon, \mathbf{u}_\varepsilon$ to the compressible Navier-Stokes equations (NSE) in a domain periodically perforated by holes of diameter $\varepsilon>0$. We focus on the case where the diameter of the…
The study of homogenization results has long been a central focus in the field of mathematical analysis, particularly for equations without lower-order terms. However, the importance of studying homogenization results for parabolic…
In literature the Hermite-Hadamard inequality was eligible for many reasons, one of the most surprising and interesting that the Hermite-Hadamard inequality combine the midpoint and trapezoid formulae in an inequality. In this work, a…
In order to solve Prandtl-type equations we propose a collocation-quadrature method based on VP filtered interpolation at Chebyshev nodes. Uniform convergence and stability are proved in a couple of Holder - Zygmund spaces of locally…
We introduce a probabilistic approach to the LMS filter. By means of an efficient approximation, this approach provides an adaptable step-size LMS algorithm together with a measure of uncertainty about the estimation. In addition, the…
Interpolation error estimates in terms of geometric quality measures are established for harmonic coordinates on polytopes in two and three dimensions. First we derive interpolation error estimates over convex polygons that depend on the…
We prove that a class of randomized integration methods, including averages based on $(t,d)$-sequences, Latin hypercube sampling, Frolov points as well as Cranley-Patterson rotations, consistently estimates expectations of integrable…
We prove novel convergence results for a stochastic proximal gradient algorithm suitable for solving a large class of convex optimization problems, where a convex objective function is given by the sum of a smooth and a possibly non-smooth…
Given a compact complex $n$-fold $X$ satisfying the $\partial\bar\partial$-lemma and supposed to have a trivial canonical bundle $K_X$ and to admit a balanced (=semi-K\"ahler) Hermitian metric $\omega$, we introduce the concept of…
In this thesis we study the relationship between the existence of canonical metrics on a complex manifold and stability in the sense of geometric invariant theory. We introduce a modification of K-stability of a polarised variety which we…
We prove that a conformal mapping defined on the unit disk belongs to a weighted Bergman space if and only if certain integrals involving the harmonic measure converge. With the aid of this theorem, we give a geometric characterization of…
We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…
This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…
In this paper, we prove the fractional Hardy inequality on polarisable metric measure spaces. The integral Hardy inequality for $1<p\leq q<\infty$ is playing a key role in the proof. Moreover, we also prove the fractional Hardy-Sobolev type…
Using the minors in Hessian matrices, we introduce new graded algebras associated to a homogeneous polynomial. When the associated projective hypersurface has isolated singularities, these algebras are related to some new local algebras…
We compute the pointwise asymptotics of orthogonal polynomials with respect to a general class of pure point measures supported on finite sets as both the number of nodes of the measure and also the degree of the orthogonal polynomials…
For a an arbitrary periodic Borel measure $\mu$, we prove order $O(\varepsilon)$ operator-norm resolvent estimates for the solutions to scalar elliptic problems in $L^2({\mathbb R}^d, d\mu^\varepsilon)$ with $\varepsilon$-periodic…
Geometric matching is a key step in computer vision tasks. Previous learning-based methods for geometric matching concentrate more on improving alignment quality, while we argue the importance of naturalness issue simultaneously. To deal…
We prove an arithmetic analogue of Fujita's approximation theorem in Arakelov geometry, conjectured by Moriwaki, by using slope method and measures associated to $\mathbb R$-filtrations.
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with probability density estimates. Then, a geometrical…