Osculating geometry and higher‐order distance Loci
Abstract We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first‐order tangency. We focus on the data locus of points possessing at least one critical point of the distance function ...
Sandra Di Rocco +2 more
wiley +1 more source
Conjectures of Sun About Sums of Polygonal Numbers. [PDF]
Bringmann K, Kane B.
europepmc +1 more source
Nutrigonometry III: curvature, area and differences between performance landscapes. [PDF]
Morimoto J, Conceição P, Smoczyk K.
europepmc +1 more source
An Explicit Upper Bound of Generalized Quadratic Gauss Sums and Its Applications for Asymptotically Optimal Aperiodic Polyphase Sequence Design [PDF]
Huaning Liu, Zilong Liu
openalex +2 more sources
Correcting systematic errors by hybrid 2D correlation loss functions in nonlinear inverse modelling. [PDF]
Mayerhöfer TG +4 more
europepmc +1 more source
Information Rates for Channels with Fading, Side Information and Adaptive Codewords. [PDF]
Kramer G.
europepmc +1 more source
Analytic solution to swing equations in power grids with ZIP load models. [PDF]
Oh H, Oh H.
europepmc +1 more source
Assessment of the Second-Order Statically Screened Exchange Correction to the Random Phase Approximation for Correlation Energies. [PDF]
Förster A.
europepmc +1 more source
Analytic modeling of neural tissue: II. Nonlinear membrane dynamics. [PDF]
Schwartz BL +3 more
europepmc +1 more source

