中文
相关论文

相关论文: Distance to the discriminant

200 篇论文

Finding the point in an algebraic variety that is closest to a given point is an optimization problem with many applications. We study the case when the variety is a Fermat hypersurface. Our formula for its Euclidean distance degree is a…

代数几何 · 数学 2015-10-22 Hwangrae Lee

What polynomial in the coefficients of a system of algebraic equations should be called its discriminant? We prove a package of facts that provide a possible answer. Let us call a system typical, if the homeomorphic type of its set of…

代数几何 · 数学 2013-08-22 Alexander Esterov

The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…

数值分析 · 数学 2019-11-05 Biswajit Das , Shreemayee Bora

Consider an $n \times n$ matrix polynomial $P(\lambda)$. A spectral norm distance from $P(\lambda)$ to the set of $n \times n$ matrix polynomials that have a given scalar $\mu\in\mathbb{C}$ as a multiple eigenvalue was introduced and…

数值分析 · 数学 2014-11-17 Esmaeil Kokabifar , G. B. Loghmani , A. M. Nazari , S. M. Karbassi

Consider an $n\times n$ matrix polynomial $P(\lambda)$ and a set $\Sigma$ consisting of $k \le n$ distinct complex numbers. In this paper, a (weighted) spectral norm distance from $P(\lambda)$ to the matrix polynomials whose spectra include…

数值分析 · 数学 2015-05-26 E. Kokabifar , G. B. Loghmani , P. J. Psarrakos , S. M. Karbassi

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…

组合数学 · 数学 2016-04-07 Micha Sharir , Noam Solomon

A homogeneous polynomial S(x_1, ..., x_n) of degree r in n variables posesses a discriminant D_{n|r}(S), which vanishes if and only if the system of equations dS/dx_i = 0 has non-trivial solutions. We give an explicit formula for…

代数几何 · 数学 2009-11-02 N. Perminov , Sh. Shakirov

Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…

数论 · 数学 2009-12-14 Lenny Fukshansky

We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex polynomials restricted to the unit sphere. As a corollary of…

度量几何 · 数学 2022-08-16 Alexey Glazyrin , Roman Karasev , Alexandr Polyanskii

Let $F(X,Y)=Y^d+a_1(X)Y^{d-1}+...+a_d(X)$ be a polynomial in $n+1$ variables $(X,Y)=(X_1,...,X_n,Y)$ with coefficients in an algebraically closed field K. Assuming that the discriminant $D(X)=\disc_Y F(X,Y)$ is nonzero we investigate the…

代数几何 · 数学 2010-04-23 Arkadiusz Pĺoski

We present a new topological method to study the discriminantal loci of an algebraic variety defined in a product of projective spaces. Our approach relies on an efficient use of groupoid to describe the monodromy. As an example, we treat…

代数几何 · 数学 2024-10-03 Susumu Tanabé

We study the statistics of the number of connected components and the volume of a random real algebraic hypersurface in RP^n defined by a Real Bombieri-Weyl distributed homogeneous polynomial of degree d. We prove that the expectation of…

代数几何 · 数学 2013-01-23 Antonio Lerario , Erik Lundberg

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…

代数几何 · 数学 2026-03-16 Sandra Di Rocco , Kemal Rose , Luca Sodomaco

In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…

符号计算 · 计算机科学 2010-07-26 Ioannis Z. Emiris , Bernard Mourrain , Elias Tsigaridas

In this paper we explore the connections between minimizers of the discrete logarithmic energy on the 2-dimensional sphere, univariate polynomials with optimal condition number in the Shub-Smale sense and a quotient involving norms of…

经典分析与常微分方程 · 数学 2019-12-12 Ujué Etayo

We prove Fourier restriction estimates by means of the polynomial partitioning method for compact subsets of any sufficiently smooth hyperbolic hypersurface in threedimensional euclidean space. Our approach exploits in a crucial way the…

经典分析与常微分方程 · 数学 2020-10-21 Stefan Buschenhenke , Detlef Müller , Ana Vargas

A novel algorithm is proposed for quantitative comparisons between compact surfaces embedded in the three-dimensional Euclidian space. The key idea is to identify those objects with the associated surface measures and compute a weak…

数值分析 · 数学 2024-01-17 Kazuki Koga

We give a formula for scalar product and distance in generalized barycentric coordinates for Euclidean and Pseudo-Euclidean spaces.

度量几何 · 数学 2023-01-02 Vladimir Zolotov

In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…

交换代数 · 数学 2012-10-18 Laurent Busé , Jean-Pierre Jouanolou

A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…

数值分析 · 数学 2016-08-09 Lloyd N. Trefethen
‹ 上一页 1 2 3 10 下一页 ›