English
Related papers

Related papers: Multivariate P-Eulerian polynomials

200 papers

We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…

Combinatorics · Mathematics 2025-04-15 Gary R. W. Greaves , Jeven Syatriadi

We study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear and quadratic polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is the closure of…

Classical Analysis and ODEs · Mathematics 2020-03-02 David G. L. Wang , Jerry J. R. Zhang

The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…

Computational Complexity · Computer Science 2012-10-05 Bruno Grenet , Pascal Koiran , Natacha Portier

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

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

In this paper, we present grammatical descriptions of several polynomials associated with Eulerian polynomials, including q-Eulerian polynomials, alternating run polynomials and derangement polynomials. As applications, we get several…

Combinatorics · Mathematics 2016-09-20 Shi-Mei Ma , Jun Ma , Yeong-Nan Yeh , Bao-Xuan Zhu

The topology of Liouville sets of the real forms of the complex generic Neumann system depends indirectly on the roots of the special polynomial $U_{\cal S}(\lambda)$. For certain polynomials, the existence and positions of the real roots,…

Mathematical Physics · Physics 2020-12-01 Tina Novak , Janez Žerovnik

Based on a determinantal formula for the higher derivative of a quotient of two functions, we first present the determinantal expressions of Eulerian polynomials and Andre polynomials. In particular, we discover that the Euler number…

Combinatorics · Mathematics 2024-12-20 Shi-Mei Ma , Hong Bian , Jun-Ying Liu , Jean Yeh , Yeong-Nan Yeh

We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…

Binomial Eulerian polynomials first appeared in work of Postnikov, Reiner and Williams on the face enumeration of generalized permutohedra. They are $\gamma$-positive (in particular, palindromic and unimodal) polynomials which can be…

Combinatorics · Mathematics 2020-01-24 Christos A. Athanasiadis

We address the enumeration of planar 4-valent maps equipped with an Eulerian orientation by two different methods, and compare the solutions we thus obtain. With the first method we enumerate these orientations as well as a restricted class…

Combinatorics · Mathematics 2025-04-11 Mireille Bousquet-Mélou , Andrew Elvey Price , Paul Zinn-Justin

In this work we explicitly construct polynomial vector fields $\mathcal{L}_k,\;k=0,1,2,3,4,6$ on the complex linear space $\mathbb{C}^6$ with coordinates $X=(x_2,x_3,x_4)$ and $Z=(z_4,z_5,z_6)$. The fields $\mathcal{L}_k$ are linearly…

Dynamical Systems · Mathematics 2018-03-13 Victor M. Buchstaber

The solution of equations from the title is well known since the Euler's time. However, its proof in the case of multiple roots of the characteristic polynomial is rather long and technical and even appearance of the factors $x^m$ looks…

Classical Analysis and ODEs · Mathematics 2017-10-31 Evgeniy Pustylnik

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

Algebraic Geometry · Mathematics 2020-06-15 Miguel N. Walsh

We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most $d$. For this, we interpret the basis polynomials as vector…

Combinatorics · Mathematics 2009-11-16 Julian Pfeifle

We obtain a precise relation between the Chern-Schwartz-MacPherson class of a subvariety of projective space and the Euler characteristics of its general linear sections. In the case of a hypersurface, this leads to simple proofs of…

Algebraic Geometry · Mathematics 2013-07-04 Paolo Aluffi

We present algorithms revealing new families of polynomials allowing sub-exponential detection of p-adic rational roots, relative to the sparse encoding. For instance, we show that the case of honest n-variate (n+1)-nomials is doable in NP…

Number Theory · Mathematics 2010-11-09 Martín Avendaño , Ashraf Ibrahim , J. Maurice Rojas , Korben Rusek

A partially ordered set is r-thick if every nonempty open interval contains at least r elements. This paper studies the flag vectors of graded, r-thick posets and shows the smallest convex cone containing them is isomorphic to the cone of…

Combinatorics · Mathematics 2007-05-23 Margaret M. Bayer , Gabor Hetyei

We study Dirichlet series enumerating orbits of Cartesian products of maps whose orbit distributions are modelled on the distributions of finite index subgroups of free abelian groups of finite rank. We interpret Euler factors of such orbit…

Combinatorics · Mathematics 2017-11-08 Angela Carnevale , Christopher Voll

We study continuity of the roots of nonmonic polynomials as a function of their coefficients using only the most elementary results from an introductory course in real analysis and the theory of single variable polynomials. Our approach…

Classical Analysis and ODEs · Mathematics 2021-12-30 Anthony Stefan , Aaron Welters

We address the problem of the stability of the computations of resultants and subresultants of polynomials defined over complete discrete valuation rings (e.g. Zp or k[[t]] where k is a field). We prove that Euclide-like algorithms are…

Number Theory · Mathematics 2015-07-24 Xavier Caruso