Related papers: Osculating Geometry and Higher-Order Distance Loci
We focus on various dynamical invariants associated to toric correspondences, using algebraic geometry or arithmetic. We find a formula for the dynamical degrees, relate the exponential growth of the degree sequences with a strict…
The main result is a wall crossing formula for central projections defined on submanifolds of a real projective space. Our formula gives the jump of the degree of such a projection when the center of the projection varies. The fact that the…
We explore the codimension one strata in the degree-one cohomology jumping loci of a finitely generated group, through the prism of the multivariable Alexander polynomial. As an application, we give new criteria that must be satisfied by…
The goal of ordinal embedding is to represent items as points in a low-dimensional Euclidean space given a set of constraints in the form of distance comparisons like "item $i$ is closer to item $j$ than item $k$". Ordinal constraints like…
In this paper we use a homological approach to obtain upper bounds for a few homological invariants of $FI_G$-modules $V$. These upper bounds are expressed in terms of the generating degree and torsion degree, which measure the top and…
We study the projective geometry of algebraic neural layers, namely families of maps induced by a polynomial activation function, with particular emphasis on the generic Euclidean Distance degree ($\mathrm{gED}$). This invariant is…
The projectability of Poincar\'e-Cartan forms in a third-order jet bundle $J^3\pi$ onto a lower-order jet bundle is a consequence of the degenerate character of the corresponding Lagrangian. This fact is analyzed using the constraint…
This paper presents the generalization of weighted distances to modules and their computation through the chamfer algorithm on general point lattices. The first part is dedicated to formalization of definitions and properties (distance,…
In this article, a posteriori error analysis of the elliptic obstacle problem is addressed using hybrid high-order methods. The method involve cell unknowns represented by degree-$r$ polynomials and face unknowns represented by degree-$s$…
Ordinal embedding aims at finding a low dimensional representation of objects from a set of constraints of the form "item $j$ is closer to item $i$ than item $k$". Typically, each object is mapped onto a point vector in a low dimensional…
Let X be a complex smooth quasi-projective variety with a fixed epimorphism $\nu\colon\pi_1(X)\twoheadrightarrow \mathbb{Z}$. In this paper, we consider the asymptotic behaviour of invariants such as Betti numbers with all possible field…
A bottleneck of a smooth algebraic variety $X \subset \mathbb{C}^n$ is a pair of distinct points $(x,y) \in X$ such that the Euclidean normal spaces at $x$ and $y$ contain the line spanned by $x$ and $y$. The narrowness of bottlenecks is a…
Differential geometry may be generalized to allow infinitesimals to any order. The purpose of the present contribution is to show that the theory so developed expands received geometrical ideas in an interesting way, rich in potential for…
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in…
In this paper, we introduce relative LS category of a map and study some of its properties. Then we introduce `higher topological complexity' of a map, a homotopy invariant. We give a cohomological lower bound and compare it with previously…
An important problem in quaternionic hyperbolic geometry is to classify ordered $m$-tuples of pairwise distinct points in the closure of quaternionic hyperbolic n-space, $\overline{{\bf H}_\bh^n}$, up to congruence in the holomorphic…
Trajectory similarity is a cornerstone of trajectory data management and analysis. Traditional similarity functions often suffer from high computational complexity and a reliance on specific distance metrics, prompting a shift towards deep…
In this work, we develop and analyse a novel Hybrid High-Order discretisation of the Brinkman problem. The method hinges on hybrid discrete velocity unknowns at faces and elements and on discontinuous pressures. Based on the discrete…
We consider implementations of high-order finite difference Weighted Essentially Non-Oscillatory (WENO) schemes for the Euler equations in cylindrical and spherical coordinate systems with radial dependence only. The main concern of this…
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…