English
Related papers

Related papers: Sharp bounds for the valence of certain harmonic p…

200 papers

We show that deciding whether a sparse univariate polynomial has a p-adic rational root can be done in NP for most inputs. We also prove a polynomial-time upper bound for trinomials with suitably generic p-adic Newton polygon. We thus…

Number Theory · Mathematics 2010-11-09 Martin Avendano , Ashraf Ibrahim , J. Maurice Rojas , Korben Rusek

Let $H$ be an $n$-vertex 3-uniform hypergraph such that every pair of vertices is in at least $n/3+o(n)$ edges. We show that $H$ contains two vertex-disjoint tight paths whose union covers the vertex set of $H$. The quantity two here is…

Combinatorics · Mathematics 2022-05-05 Jie Han

There is a long standing conjecture that there are at least $n$ closed characteristics for any compact convex hypersurface $\Sigma$ in $\mathbb{R}^{2n}$, and the symmetric case, i.e. $\Sigma=-\Sigma$, has already been proved by C. Liu, Y.…

Dynamical Systems · Mathematics 2019-04-30 Lei Liu , Li Wu

This paper establishes a sharp Schwarz-Pick type inequality for real-valued invariant harmonic functions defined on the complex unit ball $\mathbb B^n$. The proof of this main result simultaneously provides a solution to a natural extension…

Complex Variables · Mathematics 2026-02-13 Kapil Jaglan , Aeryeong Seo

On a complex symplectic manifold we prove a finiteness result for the global sections of solutions of holonomic DQ-modules in two cases: (a) by assuming that there exists a Poisson compactification (b) in the algebraic case. This extends…

Algebraic Geometry · Mathematics 2021-05-19 Masaki Kashiwara , Pierre Schapira

We show that with high probability the number of real zeroes of a random polynomial is bounded by the number of vertices on its Newton-Hadamard polygon times the cube of the logarithm of the polynomial degree. A similar estimate holds for…

Probability · Mathematics 2016-01-20 Ken Söze

We introduce deformations of the space of (multi-diagonal) harmonic polynomials for any finite complex reflection group of the form W=G(m,p,n), and give supporting evidence that this space seems to always be isomorphic, as a graded…

Combinatorics · Mathematics 2010-11-17 François Bergeron , Nicolas Borie , Nicolas M. Thiéry

Every polynomial of the form $P=(x+1)(x^{n-1}+c_1x^{n-2}+\cdots +c_{n-1})$ is representable as Schur-Szeg\H{o} composition of $n-1$ polynomials of the form $(x+1)^{n-1}(x+a_i)$, where the numbers $a_i$ are unique up to permutation. We give…

Classical Analysis and ODEs · Mathematics 2015-04-08 Vladimir Petrov Kostov

We derive lower bounds for the $L^p(\mu)$ norms of monic extremal polynomials with respect to compactly supported probability measures $\mu$. We obtain a sharp universal lower bound for all $0<p<\infty$ and all measures in the Szeg\H{o}…

Classical Analysis and ODEs · Mathematics 2019-07-30 Gökalp Alpan , Maxim Zinchenko

We prove a theorem on distortion of cross ratio of four points under the mapping effected by a complex polynomial with restricted critical values. Its corollaries include inequalities involving the absolute value and certain coefficients of…

Complex Variables · Mathematics 2013-01-18 V. N. Dubinin

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…

Optimization and Control · Mathematics 2011-04-08 Tim Netzer , Andreas Thom

In this paper we prove that the PDE $p(D)f=q,$ where $p$ and $q$ are multivariate polynomials, has a solution in the space of polynomials of total degree not exceeding ${n+s},$ where $n$ is the degree of $q$ and $s$ is the zero order of…

Analysis of PDEs · Mathematics 2021-06-02 Anna R. Gharibyan , Hakop A. Hakopian

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

Computational Complexity · Computer Science 2018-03-19 Chi-Ning Chou , Mrinal Kumar , Noam Solomon

Let $l$ be a finite field of cardinality $q$ and let $n$ be in $\mathbb{Z}_{\geq 1}$. Let $f_1,\ldots,f_n \in l[x_1,\ldots,x_n]$ not all constant and consider the evaluation map $f=(f_1,\ldots,f_n) \colon l^n \to l^n$. Set…

Number Theory · Mathematics 2015-09-08 Michiel Kosters

Every symmetric polynomial $h(x)$ with center of symmetry $n/2$ can be expressed as a linear combination in the basis $x^i(1+x)^{n-2i}$. The $\gamma$-polynomial of $h(x)$, which we denote $\gamma_h(x)$, records the coefficients of this…

Combinatorics · Mathematics 2025-06-17 Luis Ferroni , Greta Panova , Lorenzo Venturello

We show that the set of complex points in the moduli space of polynomials of degree d corresponding to post-critically finite polynomials is a set of algebraic points of bounded height. It follows that for any B, the set of conjugacy…

Number Theory · Mathematics 2011-02-15 Patrick Ingram

Using the $q$-Wilf--Zeilberger method and a $q$-analogue of a "divergent" Ramanujan-type supercongruence, we give several $q$-supercongruences modulo the fourth power of a cyclotomic polynomial. One of them is a $q$-analogue of a…

Number Theory · Mathematics 2020-04-23 Victor J. W. Guo

We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees counted only non-degenerate roots and even then gave much larger…

Combinatorics · Mathematics 2007-05-23 Tien-Yien Li , J. Maurice Rojas , Xiaoshen Wang

We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero…

Computational Complexity · Computer Science 2020-11-06 Mrinal Kumar , Ben Lee Volk

We show that if a system of degree-$k$ polynomial constraints on~$n$ Boolean variables has a Sums-of-Squares (SOS) proof of unsatisfiability with at most~$s$ many monomials, then it also has one whose degree is of the order of the square…

Computational Complexity · Computer Science 2019-02-21 Albert Atserias , Tuomas Hakoniemi