中文
相关论文

相关论文: The Expected Number of Real Roots of a Multihomoge…

200 篇论文

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

数论 · 数学 2007-05-23 J. Maurice Rojas

We consider positive solutions to parametrized systems of generalized polynomial equations (with real exponents and positive parameters). By a fundamental result obtained in parallel work, polynomial systems are determined by geometric…

代数几何 · 数学 2024-10-07 Stefan Müller , Georg Regensburger

In this survey we determine an explicit set of generators of the maximal ideals in the ring $\mathbb R[x_1,\dots,x_n]$ of polynomials in $n$ variables with real coefficients and give an easy analytic proof of the Bass-Vasershtein theorem on…

环与代数 · 数学 2014-10-24 Raymond Mortini , Rudolf Rupp

In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In…

数论 · 数学 2015-01-13 Artūras Dubickas , Min Sha

We identify the scaling region of a width O(n^{-1}) in the vicinity of the accumulation points $t=\pm 1$ of the real roots of a random Kac-like polynomial of large degree n. We argue that the density of the real roots in this region tends…

数学物理 · 物理学 2009-11-10 A. P. Aldous , Y. V. Fyodorov

Koiran's real $\tau$-conjecture claims that the number of real zeros of a structured polynomial given as a sum of $m$ products of $k$ real sparse polynomials, each with at most $t$ monomials, is bounded by a polynomial in $m,k,t$. This…

计算复杂性 · 计算机科学 2021-07-30 Irénée Briquel , Peter Bürgisser

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

组合数学 · 数学 2026-05-26 Guy Moshkovitz , Dora Woodruff

Let $S$ be a polynomial ring in $n$ variables over a field. Let $I$ be a homogeneous ideal in $S$ generated by forms of degree at most $d$ with $\text{dim}(S/I)=r$. In the first part of this paper, we show how to derive from a result of Hoa…

交换代数 · 数学 2022-04-20 Yihui Liang

This paper is concerned with the distribution in the complex plane of the roots of a polynomial sequence $\{W_n(x)\}_{n\ge0}$ given by a recursion $W_n(x)=aW_{n-1}(x)+(bx+c)W_{n-2}(x)$, with $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a>0$,…

组合数学 · 数学 2015-01-27 J. L. Gross , T. Mansour , T. W. Tucker , D. G. L. Wang

We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…

环与代数 · 数学 2022-09-30 Maximilian Illmer , Tim Netzer

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

符号计算 · 计算机科学 2018-06-22 Cordian Riener , Mohab Safey El Din

Let R be a ring and let B be a commutative ring. Let p be a homogeneous multiplicative polynomial law of degree n from R to B. We show that p is essentially a determinant, in the sense that p is obtained from a determinant by left and right…

环与代数 · 数学 2007-05-23 Francesco Vaccarino

This survey revolves around the question how the roots of a monic polynomial (resp. the spectral decomposition of a linear operator), whose coefficients depend in a smooth way on parameters, depend on those parameters. The parameter…

泛函分析 · 数学 2024-10-23 Adam Parusiński , Armin Rainer

Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…

符号计算 · 计算机科学 2017-12-12 Mohab Safey El Din , Eric Schost

We consider random polynomials whose coefficients are independent and identically distributed on the integers. We prove that if the coefficient distribution has bounded support and its probability to take any particular value is at most…

概率论 · 数学 2017-02-07 Ohad N. Feldheim , Arnab Sen

Let a sequence $(P_n)$ of polynomials in one complex variable satisfy a recurre ce relation with length growing slowlier than linearly. It is shown that $(P_n) $ is an orthonormal basis in $L^2_{\mu}$ for some measure $\mu$ on $\C$, if and…

泛函分析 · 数学 2007-05-23 D. P. L. Castrigiano , W. Klopfer

This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…

综合数学 · 数学 2020-10-02 Christopher Thron , Jordan T. Barry

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

概率论 · 数学 2014-07-28 Igor E. Pritsker , Aaron M. Yeager

We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…

交换代数 · 数学 2018-12-12 Carlos D'Andrea , Teresa Krick , Agnes Szanto , Marcelo Valdettaro

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