中文
相关论文

相关论文: Polynomial systems with few real zeroes

200 篇论文

We consider extremal polynomials with respect to a Sobolev-type $p$-norm, with $1<p<\infty$ and measures supported on compact subsets of the real line. For a wide class of such extremal polynomials with respect to mutually singular measures…

经典分析与常微分方程 · 数学 2017-10-10 A. Diaz Gonzalez , G. Lopez Lagomasino , H. Pijeira Cabrera

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

alg-geom · 数学 2008-02-03 M. Giusti , J. Heintz , K. Hägele , J. E. Morais , L. M. Pardo , J. L. Montaña

This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…

最优化与控制 · 数学 2010-07-27 João Gouveia , Rekha R. Thomas

In this paper, we give error bounds on the number of monic irreducible polynomials $a_0+a_1x+\dots+a_{n-1}x^{n-1}+x^n$ over a finite field $\mathbb{F}_q$ of degree $n$ with $(a_0, a_1, \dots, a_{n-1}, 1)$ lying in a fixed affine algebraic…

数论 · 数学 2025-12-11 Neil Kolekar

Suppose $A=\{a_1,\ldots,a_{n+2}\}\subset\mathbb{Z}^n$ has cardinality $n+2$, with all the coordinates of the $a_j$ having absolute value at most $d$, and the $a_j$ do not all lie in the same affine hyperplane. Suppose $F=(f_1,\ldots,f_n)$…

代数几何 · 数学 2021-06-14 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

This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed $k\ge2$. In the…

离散数学 · 计算机科学 2022-08-31 Marilena Jianu , Leonard Daus , Vlad-Florin Dragoi , Valeriu Beiu

We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well as higher-order maps. We show…

组合数学 · 数学 2023-04-05 Niklas Kochdumper , Matthias Althoff

We use a generalization of Vinogradov's mean value theorem of S. Parsell, S. Prendiville and T. Wooley and ideas of W. Schmidt to give nontrivial bounds for the number of solutions to polynomial congruences, for arbitrary polynomials, when…

数论 · 数学 2013-02-27 Bryce Kerr

We consider polynomials on the intersection of the closed positive orthant with the height-$1$ level hypersurface of certain polynomials with positive coefficients. We show that any polynomial strictly positive on such a semi-algebraic set…

代数几何 · 数学 2026-03-12 Colin Tan , Wing-Keung To

Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…

代数几何 · 数学 2010-03-25 Claus Scheiderer

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

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…

数论 · 数学 2025-10-09 Masahiro Mine

A {+,x}-circuit counts a given multivariate polynomial f, if its values on 0-1 inputs are the same as those of f; on other inputs the circuit may output arbitrary values. Such a circuit counts the number of monomials of f evaluated to 1 by…

计算复杂性 · 计算机科学 2018-05-30 Stasys Jukna

We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…

动力系统 · 数学 2022-02-08 Alexander Blokh , Lex Oversteegen , Vladlen Timorin

The technique of $Q$-polinomials are used to derive the $w$- constraints in the two-matrix and Kontsevich-like model at finite $N$. These constraints are closed and form Lie algebra. They are associated with the matrices, $\lambda…

高能物理 - 理论 · 物理学 2007-05-23 N. L. Khviengia

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

复变函数 · 数学 2019-09-11 Sushil Gorai

We prove the irreducibility of integer polynomials $f(X)$ whose roots lie inside an Apollonius circle associated to two points on the real axis with integer abscisae $a$ and $b$, with ratio of the distances to these points depending on the…

In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…

经典分析与常微分方程 · 数学 2012-05-07 Pedro J. Freitas , Shmuel Friedland , Gaspar Porta

We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…

数论 · 数学 2007-05-23 Greg Martin