English
Related papers

Related papers: Characterization of polynomials whose large powers…

200 papers

Dolgachev proved that, for any field k, the ring naturally associated to a generic Laurent polynomial in d variables, $d \geq 4$, is factorial. We prove a sufficient condition for the ring associated to a very general complex Laurent…

Algebraic Geometry · Mathematics 2012-01-17 Ugo Bruzzo , Antonella Grassi

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

Mathematical Physics · Physics 2017-06-13 Francesco Calogero , Francois Leyvraz

We characterize all the strongly monotypic polytopes. Hadwiger's conjecture for this class of polytopes is deduced from the characterization.

Combinatorics · Mathematics 2021-11-09 Vuong Bui

We study polynomial generalizations of the Kontsevich automorphisms acting on the skew-field of formal rational expressions in two non-commuting variables. Our main result is the Laurentness and pseudo-positivity of iterations of these…

Quantum Algebra · Mathematics 2019-02-26 Dylan Rupel

We give a new demonstration of Loewner's characterization of polynomials, solving in the positive a conjecture proposed by Laird and McCann in 1984.

Classical Analysis and ODEs · Mathematics 2016-05-04 J. M. Almira

A linear polyomial non-negative on the non-negativity domain of finitely many linear polynomials can be expressed as their non-negative linear combination. Recently, under several additional assumptions, Helton, Klep, and McCullough…

Operator Algebras · Mathematics 2012-11-28 Aljaž Zalar

We consider the following question: Which real sequences (a(n)) that satisfy a linear recurrence with constant coefficients are positive for sufficiently large n? We show that the answer is negative for both (a(n)) and (-a(n)), if the…

Number Theory · Mathematics 2007-05-23 Stefan Gerhold

In this paper, we study transfer functions corresponding to parametric linear systems whose coefficients are block matrices. Thus, these transfer functions constitute Laurent polynomials whose coefficients are square matrices. We assume…

Exactly Solvable and Integrable Systems · Physics 2020-03-05 Nancy Lopez Reyes , Raul Felipe-Sosa , Raul Felipe

In this paper we consider graded ideals in a polynomial ring over a field and ask when such an ideal has the property that all of its powers have a linear resolution. In particular it is shown that all powers of a monomial ideal with…

Commutative Algebra · Mathematics 2007-05-23 Juergen Herzog , Takayuki Hibi , Xinxian Zheng

A characterization of the general linear equation in standard form admitting a maximal symmetry algebra is obtained in terms of a simple set of conditions relating the coefficients of the equation. As a consequence, it is shown that in its…

Classical Analysis and ODEs · Mathematics 2023-01-03 J. C. Ndogmo

Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero. In the paper we give a criterion of nearly irreducibility for a given polynomial f in…

Algebraic Geometry · Mathematics 2019-05-08 Mateusz Masternak

The Poupard polynomials are polynomials in one variable with integer coefficients, with some close relationship to Bernoulli and tangent numbers. They also have a combinatorial interpretation. We prove that every Poupard polynomial has all…

Combinatorics · Mathematics 2020-01-07 Frédéric Chapoton , Guo-Niu Han

It is well known that a non-negative definite polynomial matrix (a polynomial Gramian) $G(t)$ can be written as a product of its polynomial spectral factors, $G(t) = X(t)^H X(t)$. In this paper, we give a new algebraic characterization of…

Signal Processing · Electrical Eng. & Systems 2019-03-12 Puoya Tabaghi , Ivan Dokmanić

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

A hyperbolic polynomial (HP) is a real univariate polynomial with all roots real. By Descartes' rule of signs a HP with all coefficients nonvanishing has exactly $c$ positive and exactly $p$ negative roots counted with multiplicity, where…

Classical Analysis and ODEs · Mathematics 2022-03-16 Vladimir Petrov Kostov

The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…

Combinatorics · Mathematics 2008-09-29 Benjamin Nill

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

Number Theory · Mathematics 2025-06-23 Luca Bastioni , Giacomo Micheli , Shujun Zhao

We will show that the roots of a polynomial equation in one variable of degree n are related to the solutions of a symmetric quadratic form in n-1 variables with constant positive integer coefficients. The classic polynomial notation will…

General Mathematics · Mathematics 2007-05-23 Gerry Martens

We generalize R. P. Stanley's celebrated theorem that the $h^\ast$-polynomial of the Ehrhart series of a rational polytope has nonnegative coefficients and is monotone under containment of polytopes. We show that these results continue to…

The famous Descartes' rule of signs from 1637 giving an upper bound on the number of positive roots of a real univariate polynomials in terms of the number of sign changes of its coefficients, has been an indispensable source of inspiration…

Classical Analysis and ODEs · Mathematics 2019-12-12 Vladimir Petrov Kostov , Boris Shapiro
‹ Prev 1 4 5 6 7 8 10 Next ›