Related papers: On Pinned Falconer Distance Problem for Cartesian …
This paper is in the continuity of a work program. Its goal is to develop an approach of the paralic confinement usable from the modeling slant, before implementing it in numerical tools. More specifically, we here deal with the multiscale…
A number of machine learning algorithms are using a metric, or a distance, in order to compare individuals. The Euclidean distance is usually employed, but it may be more efficient to learn a parametric distance such as Mahalanobis metric.…
In this paper, we consider convex feasibility problems where the underlying sets are loosely coupled, and we propose several algorithms to solve such problems in a distributed manner. These algorithms are obtained by applying proximal…
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…
Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…
Several important algorithms for machine learning and data analysis use pairwise distances as input. On Riemannian manifolds these distances may be prohibitively costly to compute, in particular for large datasets. To tackle this problem,…
Motivated by information geometry, a distance function on the space of stochastic matrices is advocated. Starting with sequences of Markov chains the Bhattacharyya angle is advocated as the natural tool for comparing both short and long…
This paper is devoted to the study of a problem of Cassels in multiplicative Diophantine approximation which involves minimising values of a product of affine linear forms computed at integral points. It was previously known that values of…
We improve the Peres-Schlag result on pinned distances in sets of a given Hausdorff dimension. In particular, for Euclidean distances, with $$\Delta^y(E) = \{|x-y|:x\in E\},$$ we prove that for any $E, F\subset{\Bbb R}^d$, there exists a…
In this paper, we present a numerical scheme to solve the initial-boundary value problem for backward stochastic partial differential equations of parabolic type. Based on the Galerkin method, we approximate the original equation by a…
This paper introduces a novel approach for the construction of bulk--surface splitting schemes for semi-linear parabolic partial differential equations with dynamic boundary conditions. The proposed construction is based on a reformulation…
In this study, the orthogonalization process for different inner products is applied to pairwise comparisons. Properties of consistent approximations of a given inconsistent pairwise comparisons matrix are examined. A method of a derivation…
We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…
Presented is a new method yielding parameterized solution to an interval parametric linear system. Some properties of this method are discussed. The solution enclosure it provides is compared to the enclosures by other methods. It is shown…
The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…
In this working note we study the one-sided positive Banach-Mazur distance between some pairs of $C(K)$ Banach spaces. Building on methods developed in [4], we solve, in particular, one of the problems posed in [2].
The present work addresses the Cauchy problem for an abstract nonlinear system of coupled hyperbolic equations associated with the Timoshenko model in a real Hilbert space. Our purpose is to develop and delve into a temporal discretization…
The min-knapsack problem with compactness constraints extends the classical knapsack problem, in the case of ordered items, by introducing a restriction ensuring that they cannot be too far apart. This problem has applications in…
Barycentric coordinates provide solutions to the problem of expressing an element of a compact convex set as a convex combination of a finite number of extreme points of the set. They have been studied widely within the geometric…
Discretely self-similar solutions to Oberbeck-Boussinesq system with Newtonian gravitational field for large discretely self-similar initial data are constructed in this note, extending the construction of Brandolese and Karch…