English
Related papers

Related papers: Sign conditions for the existence of at least one …

200 papers

We show that all sign patterns of the coefficients Hilbert polynomials of standard graded $k$-algebras are possible.

Commutative Algebra · Mathematics 2017-02-13 Akiyoshi Tsuchiya

The set of all m-tuples of compatible full conditional distributions on discrete random variables is an algebraic set whose defining ideal is a unimodular toric ideal. We identify the defining polynomials of these ideals with closed walks…

Algebraic Geometry · Mathematics 2007-06-13 Aleksandra B Slavkovic , Seth Sullivant

In this short note, a general result concerning the positivity, under some conditions, of the coefficients of a power series is proved. This allows us to answer positively a question raised by Guo (2010) about the sign of the coefficients…

Complex Variables · Mathematics 2011-04-05 Omran Kouba

Certifying function nonnegativity is a ubiquitous problem in computational mathematics, with especially notable applications in optimization. We study the question of certifying nonnegativity of signomials based on the recently proposed…

Optimization and Control · Mathematics 2021-07-06 Riley Murray , Venkat Chandrasekaran , Adam Wierman

We consider systems of ordinary differential equations with quadratic homogeneous right hand side. We give a new simple proof of a result already obtained in [8,10] which gives the necessary conditions for the existence of polynomial first…

Dynamical Systems · Mathematics 2009-10-31 Alexei Tsygvintsev

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 consider the class of all homogeneous, possibly non-reduced, polynomials $f$ whose associated reduced projective divisor $D_{\text{red}} \subset \mathbb{P}^{n-1}$ has (at worst) quasi-homogeneous isolated singularities. In an arbitrary…

Algebraic Geometry · Mathematics 2026-02-25 Daniel Bath , Willem Veys

In this work, we consider an estimation method in sparse Poisson models inspired by [1] and provide novel sign consistency results under mild conditions.

Statistics Theory · Mathematics 2023-03-27 Marina Gomtsyan , Céline Lévy-Leduc , Sarah Ouadah , Laure Sansonnet

We describe a generalization of the Sums-of-AM/GM Exponential (SAGE) relaxation methodology for obtaining bounds on constrained signomial and polynomial optimization problems. Our approach leverages the fact that relative entropy based SAGE…

Optimization and Control · Mathematics 2021-07-06 Riley Murray , Venkat Chandrasekaran , Adam Wierman

General concept of a gradation slicing is used to analyze polynomial solutions of ordinary differential equations (ODE) with polynomial coefficients, ${\cal L}\psi=0$, where ${\cal L}=\sum_l p_l(z) d_z^l$, $p_l(z)$ are polynomials, $z$ is a…

Quantum Physics · Physics 2018-06-20 Alexander Moroz

We study polynomial systems with prescribed monomial supports in the Cox rings of toric varieties built from complete polyhedral fans. We present combinatorial formulas for the dimensions of their associated subvarieties under genericity…

Symbolic Computation · Computer Science 2024-02-21 Matías Bender , Pierre-Jean Spaenlehauer

We consider linear recurrences with polynomial coefficients of Poincar\'e type and with a unique simple dominant eigenvalue. We give an algorithm that proves or disproves positivity of solutions provided the initial conditions satisfy a…

Symbolic Computation · Computer Science 2024-01-18 Alaa Ibrahim , Bruno Salvy

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

Symbolic Computation · Computer Science 2011-01-04 Mark Giesbrecht , Daniel S. Roche , Hrushikesh Tilak

Two sets of conditions are presented for the compactness of a real plane algebraic curve, one sufficient and one necessary, in terms of the Newton polygon of the defining polynomial.

Algebraic Geometry · Mathematics 2007-05-23 John Stalker

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…

Computational Complexity · Computer Science 2015-08-11 Hing Yin Tsang , Ning Xie , Shengyu Zhang

Given n polynomials in n variables of respective degrees d_1,...,d_n, and a set of monomials of cardinality d_1...d_n, we give an explicit subresultant-based polynomial expression in the coefficients of the input polynomials whose…

Algebraic Geometry · Mathematics 2007-05-23 Carlos D'Andrea , Gabriela Jeronimo

We consider the problem of computing homogeneous coordinates of points in a zero-dimensional subscheme of a compact, complex toric variety $X$. Our starting point is a homogeneous ideal $I$ in the Cox ring of $X$, which in practice might…

Algebraic Geometry · Mathematics 2022-03-14 Matías R. Bender , Simon Telen

We give necessary and sufficient conditions for majorization of realrooted polynomials sharing a common interlacer by means of residues coming from fraction decomposition. We also introduce a motivated notion called strong majorization, and…

Classical Analysis and ODEs · Mathematics 2023-07-25 Aurelien Gribinski

We give necessary and sufficient conditions for differentiating under the integral sign an integral that depends on a parameter. The conditions require the equality of two iterated integrals and depend on being able to integrate every…

Classical Analysis and ODEs · Mathematics 2007-05-23 Erik Talvila

We consider radial solutions of a general elliptic equation involving a weighted $p$-Laplace operator with a subcritical nonlinearity. By a shooting method we prove the existence of solutions with any prescribed number of nodes. The method…

Analysis of PDEs · Mathematics 2014-08-05 Carmen Cortázar , Jean Dolbeault , Marta Garcia-Huidobro , Raul Manásevich