Related papers: The Carnot-Carath\'eodory distance on $2$-step gro…

All known algorithms for the Fr\'echet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values.…

We present efficient algorithms to calculate trajectories for periodic Lorentz gases consisting of square lattices of circular obstacles in two dimensions, and simple cubic lattices of spheres in three dimensions; these become increasingly…

In this paper, we improve slightly Erd\'elyi's version of the stationary phase method by replacing the employed smooth cut-off function by a characteristic function, leading to more precise remainder estimates. We exploit this refinement to…

In this work, we analyze the three-step backward differentiation formula (BDF3) method for solving the Allen-Cahn equation on variable grids. For BDF2 method, the discrete orthogonal convolution (DOC) kernels are positive, the stability and…

Via a Bismut-Elworthy-Li formula from [KPP23], we derive uniform gradient estimates for transition semigroups associated with stochastic differential equations driven by a large class of cylindrical L\'{e}vy processes which includes the…

We study the topology of admissible-loop spaces on a step-two Carnot group G. We use a Morse-Bott theory argument to study the structure and the number of geodesics on G connecting the origin with a 'vertical' point (geodesics are critical…

The Fermat-Steiner problem consists in finding all points in a metric space $Y$ such that the sum of distances from each of them to the points from some fixed finite subset of $Y$ is minimal. This problem is investigated for the metric…

We prove a Hardy-type inequality for the gradient of the Heisenberg Laplacian on open bounded convex polytopes on the first Heisenberg Group. The integral weight of the Hardy inequality is given by the distance function to the boundary…

In 1997, Erd\H{o}s asked whether for arbitrarily large $n$ there exists a set of $n$ points in $\mathbb{R}^2$ that determines $O(\frac{n}{\sqrt{\log n}})$ distinct distances while satisfying the local constraint that every 4-point subset…

In this paper, we generalize the results of ($\textit{Groups, Geom. Dyn.}$, forthcoming) to describe the split left-invariant Riemannian distances on higher-rank Sol-type groups $G=\mathbf{N}\rtimes \mathbb{R}^k$. We show that the rough…

We prove a formula for the speed of distance stationary random sequences. A particular case is the classical formula for the largest Lyapunov exponent of an i.i.d. product of two by two matrices in terms of a stationary measure on…

In this paper we devise and analyze an unconditionally stable, second-order-in-time numerical scheme for the Cahn-Hilliard equation in two and three space dimensions. We prove that our two-step scheme is unconditionally energy stable and…

We describe, in an intrinsic way and using the global chart provided by Ito's parallel transport, a generalisation of the notion of geodesic (as critical path of an energy functional) to diffusion processes on Riemannian manifolds. These…

We find a different approach to define convex functions in the sub-Riemannian setting. A function on a sub-Riemannian manifold is nonholonomically geodesic convex if its restriction to any nonholonomic (straightest) geodesic is convex. In…

The free space diagram is a popular tool to compute the well-known Fr\'echet distance. As the Fr\'echet distance is used in many different fields, many variants have been established to cover the specific needs of these applications. Often,…

The problem of how to estimate diffusion on a graph effectively is of importance both theoretically and practically. In this paper, we make use of two widely studied indices, geodesic distance and mean first-passage time ($MFPT$) for random…

For each submanifold of a stratified group, we find a number and a measure only depending on its tangent bundle, the grading and the fixed Riemannian metric. In two step stratified groups, we show that such number and measure coincide with…

We focus our attention on the notion of intrinsic Lipschitz graphs, inside a subclass of Carnot groups of step 2 which includes a corank 1 Carnot groups (and so the Heisenberg groups), Free groups of step 2 and the complexified Heisenberg…

We show that the problem of computing the distance of a given permutation from a subgroup $H$ of $S_n$ is in general NP-complete, even under the restriction that $H$ is elementary Abelian of exponent 2. The problem is shown to be…

This paper shows how to use the shooting method, a classical numerical algorithm for solving boundary value problems, to compute the Riemannian distance on the Stiefel manifold $\mathrm{St}(n,p)$, the set of $ n \times p $ matrices with…