Related papers: Osculating Geometry and Higher-Order Distance Loci
Let $P$ be a set of points and $L$ a set of lines in the (extended) Euclidean plane, and $I \subseteq P\times L$, where $i =(p,l) \in I$ means that point $p$ and line $l$ are incident. The incidences can be interpreted as quadratic…
An important application of distance geometry to biochemistry studies the embeddings of the vertices of a weighted graph in the three-dimensional Euclidean space such that the edge weights are equal to the Euclidean distances between…
The basic tool for solving problems in metric geometry and isotonic regression is the metric projection onto closed convex cones. Isotonicity of these projections with respect to a given order relation can facilitate finding the solutions…
We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…
A convex lattice polygon Delta determines a pair (S,L) of a toric surface together with an ample toric line bundle on S. The Severi degree N^{Delta,delta} is the number of delta-nodal curves in the complete linear system |L| passing through…
We describe algorithms for computing the intersection numbers of divisors and of Chern classes of the Hodge bundle on the moduli spaces of stable pointed curves. We also discuss the implementations and the results obtained. There are…
We consider the numerical solution of partial differential equations with coefficients that are strongly heterogeneous in space. We provide an overview of higher-order localized orthogonal decomposition (LOD) methods for the elliptic…
Metric data structures (distance oracles, distance labeling schemes, routing schemes) and low-distortion embeddings provide a powerful algorithmic methodology, which has been successfully applied for approximation algorithms \cite{llr},…
Let $T(n)$ denote the maximum number of unit distances that a set of $n$ points in the Euclidean plane $\mathbb{R}^2$ can determine with the additional condition that the distinct unit length directions determined by the configuration must…
Let $ \mathcal{D} = \{D_{1}, \ldots, D_{\ell}\} $ be an arrangement of smooth hypersurfaces with normal crossings on the complex projective space $ \mathbb{P}^{n} $ and let $ \Omega^{1}_{\mathbb{P}^{n}}(log \mathcal{D}) $ be the logarithmic…
In the first part we present the Weyl algebra and our results concerning its finite-dimensional Lie subalgebras. The second part is devoted to a more exotic algebraic structure, the Lie algebra of order 3. We set the basis of a theory of…
Geometric optimization problems are at the core of many applications in geometry processing. The choice of a representation fitting an optimization problem can considerably simplify solving the problem. We consider the Nonlinear…
A novel high-order numerical scheme is proposed to compute the covariant derivative, particularly for divergence and curl, on any curved surface. The proposed scheme does not require the construction of a curved axis or metric tensor, which…
We consider integrable systems that are connected with orthogonal separation of variables in complex Riemannian spaces of constant curvature. An isomorphism with the hyperbolic Gaudin magnet, previously pointed out by one of us, extends to…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
We study the Hermitian distance degree, a real enumerative invariant counting critical points of the squared Hermitian distance function, for matrix varieties invariant under left and right unitary actions. For such a variety \(M \subset…
We survey recent results on the study of metric measure spaces satisfying a Poincar\'e inequality. We overview recent characterizations in terms of objects of dimension 1, such as pencil of curves, modulus estimates and obstacle-avoidance…
Linear convergence of first-order methods is typically characterized by global optimization conditions whose constants reflect worst-case geometry of the ambient space. In high-dimensional or structured problems, these global constants can…
We establish the geometric ergodicity of the preconditioned Hamiltonian Monte Carlo (HMC) algorithm defined on an infinite-dimensional Hilbert space, as developed in [Beskos et al., Stochastic Process. Appl., 2011]. This algorithm can be…
There are two restriction maps of the logarithmic modules of plane arrangements in a three dimensional vector space. One is the Euler restriction and the other is the Ziegler restriction. The dimension of the cokernel of the Ziegler…