中文
相关论文

相关论文: Polynomial systems with few real zeroes

200 篇论文

This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…

代数几何 · 数学 2012-11-16 Maria Isabel Herrero , Gabriela Jeronimo , Juan Sabia

We study the convex hulls of reachable sets of nonlinear systems with bounded disturbances and uncertain initial conditions. Reachable sets play a critical role in control, but remain notoriously challenging to compute, and existing…

最优化与控制 · 数学 2026-04-16 Thomas Lew , Riccardo Bonalli , Marco Pavone

We express Wronskian Hermite polynomials in the Hermite basis and obtain an explicit formula for the coefficients. From this we deduce an upper bound for the modulus of the roots in the case of partitions of length 2. We also derive a…

经典分析与常微分方程 · 数学 2021-01-12 Codruţ Grosu , Corina Grosu

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

组合数学 · 数学 2026-04-21 Ahmad Abdi , Gérard Cornuéjols , Daniel Dadush , Mahsa Dalirrooyfard

A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…

数值分析 · 数学 2008-10-16 Marco Caminati

Lower bounds are given for the number of non-real zeros of a second order linear differential polynomial with constant coefficients in a real entire function with finitely many non-real zeros.

复变函数 · 数学 2007-07-24 J K Langley

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

数值分析 · 数学 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…

复变函数 · 数学 2024-03-22 Marko Slapar

We apply the techniques developed by Marcus, Spielman and Srivastava, working with principal submatrices in place of rank $1$ decompositions to give an alternate proof of their results on restricted invertibility. We show that one can find…

泛函分析 · 数学 2017-03-16 Mohan Ravichandran

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

This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…

计算复杂性 · 计算机科学 2015-05-19 Zhixiang Chen , Bin Fu

A $P$-polynomial corner, for $P \in \mathbb{Z}[z]$ a polynomial, is a triple of points $(x,y),\; (x+P(z),y),\; (x,y+P(z))$ for $x,y,z \in \mathbb{Z}$. In the case where $P$ has an integer root of multiplicity $1$, we show that if $A…

组合数学 · 数学 2024-09-04 Noah Kravitz , Borys Kuca , James Leng

We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…

代数几何 · 数学 2025-10-20 J. Maurice Rojas

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

数论 · 数学 2021-04-26 Peter J. Bradshaw , Brandon Hanson , Misha Rudnev

In this paper, we investigate the problem of finding tight linear lower bounding functions for multivariate polynomials over boxes. These functions are obtained by the expansion of polynomials into Bernstein form and using the linear least…

最优化与控制 · 数学 2019-12-17 Tareq Hamadneh , Hassan Al-Zoubi , Mohammad Al-Qudah , Amjed Zraiqat

We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…

泛函分析 · 数学 2020-01-28 Pintu Bhunia , Santanu Bag , Raj Kumar Nayak , Kallol Paul

With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…

最优化与控制 · 数学 2024-07-02 Alberto Del Pia , Aida Khajavirad

In this paper, we extend the slow divergence-integral from slow-fast systems, due to De Maesschalck, Dumortier and Roussarie, to smooth systems that limit onto piecewise smooth ones as $\epsilon\rightarrow 0$. In slow-fast systems, the slow…

动力系统 · 数学 2022-10-14 R. Huzak , K. Uldall Kristiansen

We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…

复变函数 · 数学 2024-09-20 Vahagn Aslanyan

We consider perturbed pendulum-like equations on the cylinder of the form $ \ddot x+\sin(x)= \varepsilon \sum_{s=0}^{m}{Q_{n,s} (x)\, \dot x^{s}}$ where $Q_{n,s}$ are trigonometric polynomials of degree $n$, and study the number of limit…

动力系统 · 数学 2016-02-02 Armengol Gasull , Anna Geyer , Francesc Mañosas