학술
기타
On the Number of Real Zeros of Random Sparse Polynomial Systems
arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.Abstract
Consider a random system $\mathfrak{f}_1(x)=0,\ldots,\mathfrak{f}_n(x)=0$ of $n$ random real polynomials in $n$ variables, where each $\mathfrak{f}_k$ has a prescribed set of exponent vectors in a set $A_k\subseteq \mathbb{Z}^n$ of size $t_k$.
Assuming that the coefficients of the $\mathfrak{f}_k$ are independent Gaussian of any variance, we prove that the expected number of zeros of the random system in the positive orthant is bounded from above by $4^{-n} \prod_{k=1}^n t_k(t_k-1)$.
This result is a probabilisitc version of Kushnirenko's conjecture; it provides a bound that only depends on the number of terms and is independent of their degree.
이 뉴스, 어떠셨어요?
탭 한 번으로 반응 · 로그인 불필요
관련 뉴스
관련 뉴스 제보는 로그인 후 가능합니다.
'research' 카테고리 뉴스
Optimal Adaptive Market Making: A Theoretical Framework for High-Yield Liquidity Provision in Perpetual Futures Markets
arXiv CS.AI
In-Context Reinforcement Learning under Non-Stationarity: A Survey
arXiv CS.AI
Ontology-Amplified Distillation and Contextuality Auditing for Sovereign Enterprise Language Models: A Combined Proof-of-Mechanism and Negative-Results Method Study
arXiv CS.AI