中文
相关论文

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

200 篇论文

The expected number of real projective roots of orthogonally invariant random homogeneous real polynomial systems is known to be equal to the square root of the B\'ezout number. A similar result is known for random multi-homogeneous…

度量几何 · 数学 2025-06-23 Gregorio Malajovich

[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…

历史与综述 · 数学 2007-05-23 Ferdinand Minding

Roots of random polynomials have been studied exclusively in both analysis and probability for a long time. A famous result by Ibragimov and Maslova, generalizing earlier fundamental works of Kac and Erdos-Offord, showed that the…

概率论 · 数学 2015-05-05 Hoi Nguyen , Oanh Nguyen , Van Vu

We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…

概率论 · 数学 2008-12-10 J. Brian Conrey , David W. Farmer , Özlem Imamoglu

We consider random systems of equations over the reals, with $m$ equations and $m$ unknowns $P_i(t)+X_i(t)=0$, $t\in\mathbb{R}^m$, $i=1,...,m$, where the $P_i$'s are non-random polynomials having degrees $d_i$'s (the "signal") and the…

概率论 · 数学 2009-02-09 Diego Armentano , Mario Wschebor

The expected number of zeros of a random real polynomial of degree $N$ asymptotically equals $\frac{2}{\pi}\log N$. On the other hand, the average fraction of real zeros of a random trigonometric polynomial of increasing degree $N$…

代数几何 · 数学 2022-06-29 Boris Kazarnovskii

The Mahler measure of a polynomial is a measure of complexity formed by taking the modulus of the leading coefficient times the modulus of the product of its roots outside the unit circle. The roots of a real degree $N$ polynomial chosen…

数学物理 · 物理学 2015-07-01 Christopher D. Sinclair , Maxim L. Yattselev

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

符号计算 · 计算机科学 2017-04-14 Victor Y. Pan , Liang Zhao

Let $K$ be a field, complete with respect to a discrete non-archimedian valuation and let $k$ be the residue field. Consider a system $F$ of $n$ polynomial equations in $K\vars$. Our first result is a reformulation of the classical Hensel's…

代数几何 · 数学 2011-07-07 Martin Avendano , Ashraf Ibrahim

We obtain a Central Limit Theorem for the normalized number of real roots of a square Kostlan-Shub-Smale random polynomial system of any size as the degree goes to infinity. A study of the asymptotic variance of the number of roots is…

概率论 · 数学 2018-05-07 Diego Armentano , Jean-Marc Azaïs , Federico Dalmao , José León

We give formulas for the multiplicity of any affine isolated zero of a generic polynomial system of n equations in n unknowns with prescribed sets of monomials. First, we consider sets of supports such that the origin is an isolated root of…

代数几何 · 数学 2018-08-16 María Isabel Herrero , Gabriela Jeronimo , Juan Sabia

We study the roots of a random polynomial over the field of $p$-adic numbers. For a random monic polynomial with i.i.d. coefficients in $\mathbb{Z}_p$, we obtain an estimate for the expected number of roots of this polynomial. In…

数论 · 数学 2021-12-22 Roy Shmueli

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

代数几何 · 数学 2025-09-03 Boris Kazarnovskii

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

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

符号计算 · 计算机科学 2025-02-10 Nicolas Faroß , Thomas Sturm

This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…

概率论 · 数学 2016-08-04 Robert J. Vanderbei

Suppose $F:=(f_1,\ldots,f_n)$ is a system of random $n$-variate polynomials with $f_i$ having degree $\leq\!d_i$ and the coefficient of $x^{a_1}_1\cdots x^{a_n}_n$ in $f_i$ being an independent complex Gaussian of mean $0$ and variance…

代数几何 · 数学 2024-12-20 Grigoris Paouris , Kaitlyn Phillipson , J. Maurice Rojas

In this paper, we obtain finite estimates and asymptotic formulas for the expected number of real roots of two classes of random polynomials arising from evolutionary game theory. As a consequence of our analysis, we achieve an asymptotic…

概率论 · 数学 2020-10-28 V. H. Can , M. H. Duong , V. H. Pham

For each $\alpha \in (0, 1)$, we construct a bounded monotone deterministic sequence $(c_k)_{k \geq 0}$ of real numbers so that the number of real roots of the random polynomial $f_n(z) = \sum_{k=0}^n c_k \varepsilon_k z^k$ is $n^{\alpha +…

概率论 · 数学 2024-04-08 Marcus Michelen , Sean O'Rourke

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

交换代数 · 数学 2026-05-19 Olav Geil
‹ 上一页 1 2 3 10 下一页 ›