English
Related papers

Related papers: Parametrized systems of generalized polynomial equ…

200 papers

We provide fundamental results on positive solutions to parametrized systems of generalized polynomial $\textit{inequalities}$ (with real exponents and positive parameters), including generalized polynomial $\textit{equations}$. In doing…

Algebraic Geometry · Mathematics 2024-10-07 Stefan Müller , Georg Regensburger

We consider parametrized systems of generalized polynomial equations (with real exponents) in $n$ positive variables, involving $m$ monomials with positive parameters; that is, $x\in\mathbb{R}^n_>$ such that ${A \, (c \circ x^B)=0}$ with…

Algebraic Geometry · Mathematics 2026-05-29 Abhishek Deshpande , Stefan Müller

We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of…

Symbolic Computation · Computer Science 2018-09-06 Hoon Hong , Thomas Sturm

Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution in the course of analyzing the problem, appear in the…

Rings and Algebras · Mathematics 2025-09-01 Robert M. Corless , Mark Giesbrecht , Leili Rafiee Sevyeri , B. David Saunders

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

Algebraic Geometry · Mathematics 2009-05-29 Frederic Bihan , Frank Sottile

We show that there are fewer than (e^2+3) 2^(k choose 2) n^k/4 non-degenerate positive solutions to a fewnomial system consisting of n polynomials in n variables having a total of n+k+1 distinct monomials. This is significantly smaller than…

Algebraic Geometry · Mathematics 2026-03-03 Frederic Bihan , Frank Sottile

We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…

Symbolic Computation · Computer Science 2025-01-27 Louis Gaillard , Mohab Safey El Din

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…

Rings and Algebras · Mathematics 2022-09-30 Maximilian Illmer , Tim Netzer

Posynomials are nonnegative combinations of monomials with possibly fractional and both positive and negative exponents. Posynomial models are widely used in various engineering design endeavors, such as circuits, aerospace and structural…

Systems and Control · Computer Science 2014-03-17 Giuseppe C. Calafiore , Laurent El Ghaoui , Carlo Novara

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

Numerical Analysis · Mathematics 2025-08-14 Elias Jarlebring , Gustaf Lorentzon

We give partial generalizations of the classical Descartes' rule of signs to multivariate polynomials (with real exponents), in the sense that we provide upper bounds on the number of connected components of the complement of a hypersurface…

Algebraic Geometry · Mathematics 2022-07-07 Elisenda Feliu , Máté L. Telek

In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…

Symbolic Computation · Computer Science 2026-02-09 Florent Corniquel

Three aspects of applying homotopy continuation, which is commonly used to solve parameterized systems of polynomial equations, are investigated. First, for parameterized systems which are homogeneous, we investigate options for performing…

Numerical Analysis · Mathematics 2017-10-18 Jonathan D. Hauenstein , Margaret H. Regan

Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In…

Computational Complexity · Computer Science 2013-07-05 Yi Ming Zou

Fewnomial theory began with explicit bounds -- solely in terms of the number of variables and monomial terms -- on the number of real roots of systems of polynomial equations. Here we take the next logical step of investigating the…

Algebraic Geometry · Mathematics 2007-05-23 Frederic Bihan , J. Maurice Rojas , Casey E. Stella

We use Grothendieck's dessins d'enfant to show that if $P$ and $Q$ are two real polynomials, any real function of the form $x^\alpha(1-x)^{\beta} P - Q$, has at most $\deg P +\deg Q + 2$ roots in the interval $]0,~1[$. As a consequence, we…

Algebraic Geometry · Mathematics 2024-09-04 Boulos El Hilany , Sébastien Tavenas

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…

Computational Complexity · Computer Science 2015-05-19 Zhixiang Chen , Bin Fu

The analysis of many physical phenomena can be reduced to the study of solutions of differential equations with polynomial coefficients. In the present work, we establish the necessary and sufficient conditions for the existence of…

Classical Analysis and ODEs · Mathematics 2020-03-19 Kyle R. Bryenton1 , Andrew R. Cameron , Keegan L. A. Kirk , Nasser Saad , Patrick Strongman , Nikita Volodin

We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of…

Formal Languages and Automata Theory · Computer Science 2011-08-19 Aleksi Saarela

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall
‹ Prev 1 2 3 10 Next ›