中文
相关论文

相关论文: Distance to the discriminant

200 篇论文

For a semialgebraic set K in R^n, let P_d(K) be the cone of polynomials in R^n of degrees at most d that are nonnegative on K. This paper studies the geometry of its boundary. When K=R^n and d is even, we show that its boundary lies on the…

最优化与控制 · 数学 2010-04-26 Jiawang Nie

Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…

代数几何 · 数学 2013-04-23 Alicia Dickenstein , Ioannis Emiris , Anna Karasoulou

This paper investigates the stratification of the discriminant hypersurface associated with a univariate polynomial via the number of its distinct complex roots. We introduce two novel approaches different from the one based on…

代数几何 · 数学 2025-10-01 Rizeng Chen , Hoon Hong , Jing Yang

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

经典分析与常微分方程 · 数学 2007-05-23 Alex Iosevich , Misha Rudnev

Let V be a finite dimensional complex vector space and V^* its dual and let X in P(V) be a smooth projective variety of dimension n and degree d at least two. For a generic n-tuple of hyperplanes H_1,...,H_n in P(V^*)^n, the intersection of…

微分几何 · 数学 2013-12-31 H Manilal Kapadia

We will extend the Fourier restriction inequality for quadratic hypersurfaces obtained by Strichartz. We will consider the case where the hypersurface is a graph of a certain real polynomial which is a sum of one-dimensional monomials. It…

偏微分方程分析 · 数学 2007-05-23 Kei Morii

We initiate a study of the Euclidean Distance Degree in the context of sparse polynomials. Specifically, we consider a hypersurface f=0 defined by a polynomial f that is general given its support, such that the support contains the origin.…

代数几何 · 数学 2021-06-01 Paul Breiding , Frank Sottile , James Woodcock

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…

计算复杂性 · 计算机科学 2013-02-15 Mrinal Kumar , Gaurav Maheshwari , Jayalal Sarma M. N

The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from…

代数拓扑 · 数学 2015-07-09 Barbara Di Fabio , Massimo Ferri

Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…

计算几何 · 计算机科学 2020-08-27 Huu Phuoc Le , Mohab Safey El Din , Timo de Wolff

For any (real) algebraic variety $X$ in a Euclidean space $V$ endowed with a nondegenerate quadratic form $q$, we introduce a polynomial $\mathrm{EDpoly}_{X,u}(t^2)$ which, for any $u\in V$, has among its roots the distance from $u$ to $X$.…

代数几何 · 数学 2025-12-02 Giorgio Ottaviani , Luca Sodomaco

In recent work, Etayo introduces a new Bombieri-type inequality for monic polynomials. Here we reinterpret this new inequality as a more general integral inequality involving the Green function for the sphere. This rather geometric…

经典分析与常微分方程 · 数学 2025-07-29 Ujué Etayo , Haakan Hedenmalm , Joaquim Ortega-Cerdà

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

数值分析 · 数学 2013-06-24 Michael Karow , Emre Mengi

Graham and Winkler derived a formula for the determinant of the distance matrix of a full-dimensional set of $n + 1$ points $\{ x_{0}, x_{1}, \ldots , x_{n} \}$ in the Hamming cube $H_{n} = ( \{ 0,1 \}^{n}, \ell_{1} )$. In this article we…

泛函分析 · 数学 2020-08-03 Ian Doust , Gavin Robertson , Alan Stoneham , Anthony Weston

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

代数几何 · 数学 2015-09-22 Saugata Basu , Martin Sombra

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…

复变函数 · 数学 2008-01-16 John P. D'Angelo , Jiri Lebl , Han Peters

Explicit formulas determining the dimension and the degree of the singular subscheme of hypersurfaces in ${\mathbb P}^n$ are given in terms of the graded Betti numbers of the minimal free resolution of the corresponding Jacobian algebra.…

代数几何 · 数学 2026-05-05 Alexandru Dimca , Gabriel Sticlaru

Let f1, ..., fs be a polynomial family in Q[X1,..., Xn] (with s less than n) of degree bounded by D. Suppose that f1, ..., fs generates a radical ideal, and defines a smooth algebraic variety V. Consider a projection P. We prove that the…

符号计算 · 计算机科学 2007-05-23 Mohab Safey El Din , Philippe Trebuchet

Consider an $n \times n$ matrix polynomial $P(\lambda)$. An upper bound for 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…

数值分析 · 数学 2014-10-14 E. Kokabifar , G. B. Loghmani , P. J. Psarrakos

Let $P$ be a fixed homogeneous polynomial. We present a sharp condition on $P$ guaranteeing the existence of asymptotically larger bounds in Bombieri's inequality, so for every homogeneous polynomial $q_m$ of degree $m$ we have…

偏微分方程分析 · 数学 2024-03-01 J. M. Aldaz , H. Render