中文
相关论文

相关论文: Choosing roots of polynomials smoothly

200 篇论文

We prove that the roots of a definable $C^\infty$ curve of monic hyperbolic polynomials admit a definable $C^\infty$ parameterization, where `definable' refers to any fixed o-minimal structure on $(\mathbb R,+,\cdot)$. Moreover, we provide…

经典分析与常微分方程 · 数学 2011-08-04 Armin Rainer

The Witt group of a smooth curve over a real closed field is explicitely calculated. The method uses a comparison theorem between the graded Witt group and the etale cohomology groups. In the second part of the paper, the torsion Picard…

代数几何 · 数学 2007-05-23 J-P. Monnier

Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…

数论 · 数学 2018-11-26 Trajan Hammonds , Jeremy Johnson , Angela Patini , Robert M. Walker

We give a survey of the analytic theory of matrix orthogonal polynomials.

经典分析与常微分方程 · 数学 2014-12-30 David Damanik , Alexander Pushnitski , Barry Simon

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

数论 · 数学 2019-04-11 Gary McGuire , John Sheekey

We consider each of the three classes of representations of cyclic groups that arise in the study of rational sphere maps. We study the possible number of terms for invariant polynomials with non-negative coefficients that are constant on…

复变函数 · 数学 2025-12-08 John P. D'Angelo , Dusty E. Grundmeier , Daniel A. Lichtblau

We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root…

环与代数 · 数学 2025-09-05 Alina G. Goutor , Sergey V. Tikhonov

This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…

最优化与控制 · 数学 2024-05-21 Jiawang Nie , Linghao Zhang

The cyclic n-roots problem is an important benchmark problem for polynomial system solvers. We consider the pruning of cone intersections for a polyhedral method to compute series for the solution curves.

计算几何 · 计算机科学 2016-02-25 Jeff Sommars , Jan Verschelde

In subset selection we search for the best linear predictor that involves a small subset of variables. From a computational complexity viewpoint, subset selection is NP-hard and few classes are known to be solvable in polynomial time. Using…

最优化与控制 · 数学 2020-02-07 Alberto Del Pia , Santanu S. Dey , Robert Weismantel

By studying $\mathbb{A}^1$-curves on varieties, we propose a geometric approach to strong approximation problem over function fields of complex curves. We prove that strong approximation holds for smooth, low degree affine complete…

代数几何 · 数学 2015-10-16 Qile Chen , Yi Zhu

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

数值分析 · 数学 2013-11-26 Victor Y. Pan , Ai-Long Zheng

In this paper we first prove that a simple root of a polynomial satisfies the Sendov's conjecture. As the multiple roots trivially satisfy the Sendov's conjecture we conclude that the Sendov's conjecture holds true.

综合数学 · 数学 2019-04-02 Huan Xiao

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

最优化与控制 · 数学 2017-08-01 Jiawang Nie , Jinling Zhao

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

动力系统 · 数学 2025-03-17 Ziyad AlSharawi , Jose S. Cánovas , Sadok Kallel

Elimination theory has many applications, in particular, it describes explicitly an image of a complex line under rational transformation and determines the number of common zeroes of two polynomials in one variable. We generalize classical…

代数几何 · 数学 2007-05-23 Alexander Shapiro , Victor Vinnikov

Using log geometry, we study smoothability of genus zero twisted stable maps to stacky curves relative to a collection of marked points. One application is to smoothing semi-log canonical fibered surfaces with marked singular fibers.

代数几何 · 数学 2026-03-04 Kenneth Ascher , Dori Bejleri

Splints of root system of simple lie algebras appears naturally on studies of embedding of reductive subalgebras. A splint can be used to construct a branching rules as implementation of this idea simplifies calculation of branching…

表示论 · 数学 2017-07-21 Rudra Narayan Padhan , K. C. Pati

The aim of this paper is to investigate the sufficient condition for the invariance of a normal curve on a smooth immersed surface under isometry. We also find the the deviations of the tangential and normal components of the curve with…

综合数学 · 数学 2019-06-13 Absos Ali Shaikh , Mohamd Saleem Lone , Pinaki Ranjan Ghosh

Some properties and relations satisfied by the polynomial solutions of the bispectral problem are studied. Given a differential operator, under certain restrictions its polynomial eigenfunctions are explicitly obtained, as well as the…

谱理论 · 数学 2021-11-30 D. Barrios Rolanía
‹ 上一页 1 8 9 10 下一页 ›