Related papers: Optimal reparametrizations in the square root velo…
We introduce swept-area pseudometrics on ropelength-filtered spaces of knot representatives. For a knot type \(K\) and a ropelength level \(\Lambda\), admissible isotopies are required to pass through curves of thickness at least one and…
In this paper we study the notion of geodesic curvature of smooth horizontal curves parametrized by arc lenght in the Heisenberg group, that is the simplest sub-Riemannian structure. Our goal is to give a metric interpretation of this…
Smooth parametrization consists in a subdivision of the mathematical objects under consideration into simple pieces, and then parametric representation of each piece, while keeping control of high order derivatives. The main goal of the…
This work combines three paradigms of image processing: i) the total variation approach to denoising, ii) the superior structure of hexagonal lattices, and iii) fast and exact graph cut optimization techniques. Although isotropic in theory,…
We consider the problem of a particle traveling from an initial configuration to a final configuration (given by a point in the plane along with a prescribed velocity vector) in minimum time with non-homogeneous velocity and with…
This work introduces a new cubic regularization method for nonconvex unconstrained multiobjective optimization problems. At each iteration of the method, a model associated with the cubic regularization of each component of the objective…
The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, Scott, and…
The aim of the paper is to investigate the rigidity and the deformability of pseudoholomorphic curves in the nearly K{\"a}hler sphere $\mathbb{S}^6,$ among minimal surfaces in spheres. Under various assumptions we describe the moduli space…
We summarize our renormalization group approach for the vector model as well as the matrix model which are the discretized quantum gravity in one- and two-dimensional spacetime. A difference equation is obtained which relates free energies…
Metric graphs are meaningful objects for modeling complex structures that arise in many real-world applications, such as road networks, river systems, earthquake faults, blood vessels, and filamentary structures in galaxies. To study metric…
We consider regularised quadratic optimal transport with subquadratic polynomial or entropic regularisation. In both cases, we prove interior Lipschitz-estimates on a transport-like map and interior gradient Lipschitz-estimates on the…
Estimating Wasserstein distances between two high-dimensional densities suffers from the curse of dimensionality: one needs an exponential (wrt dimension) number of samples to ensure that the distance between two empirical measures is…
Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to…
Sliced optimal transport, which is basically a Radon transform followed by one-dimensional optimal transport, became popular in various applications due to its efficient computation. In this paper, we deal with sliced optimal transport on…
We consider the problem of optimal approximation of a target measure by an atomic measure with $N$ atoms, in branched optimal transport distance. This is a new branched transport version of optimal quantization problems. New difficulties…
The present paper generalizes the result from one of the papers by Galstyan. Namely, we consider two nonempty subsets $A$ and $B$ of a metric space $X$, and construct one-parametric family $F_r$ of subsets obtained by intersection between…
The sequence of one-parameter semigroups arising as the approximation of initial-boundary value problem with singularities is the object of investigation of this paper. The set of limit points of the sequence of approximating semigroups is…
We present an efficient, parallel, constrained optimization technique for approximating CAD curves with super-convergent rates. The optimization function is a disparity measure in terms of a piece-wise polynomial approximation and a curve…
It is known that PQ-symmetric maps on the boundary characterize the quasi-isometry type of visual hyperbolic spaces, in particular, of geodesically complete \br-trees. We define a map on pairs of PQ-symmetric ultrametric spaces which…
One of the reasons for the success of the finite element method is its versatility to deal with different types of geometries. This is particularly true of problems posed in curved domains of arbitrary shape. In the case of second order…