Related papers: Strong uniqueness polynomials: the complex case
The density of polynomials in a weighted space of infinitely differentiable functions in a multidimensional real space is proved under minimal conditions on weight functions and on differences between weight functions. We apply this result…
We give a short proof, using generating functions, for a polynomial congruence for Eulerian polynomials first proved, using arrangements of hyperplanes, by Yoshinaga and later proved, using roots of unity, by Iijima, Sasaki, Takahashi, and…
In this paper a general theory of semi-classical matrix orthogonal polynomials is developed. We define the semi-classical linear functionals by means of a distributional equation $D(u A) = u B,$ where $A$ and $B$ are matrix polynomials.…
We obtain multiplicity results for a class of first-order superquadratic Hamiltonian systems and a class of indefinite superquadratic elliptic systems which lead to the study of strongly indefinite functionals. There is no assumption to the…
This paper, a continuation of [3], involves a closer study of polynomials of supertropical semirings and their version of tropical geometry in which we introduce the concept of relatively prime polynomials and resultants, with the aid of…
Under certain natural sufficient conditions on the sequence of uniformly bounded closed sets $E_k\subset\mathbb{R}$ of admissible coefficients, we construct a polynomial $P_n(x)=1+\sum_{k=1}^n\varepsilon_k x^k$, $\varepsilon_k\in E_k$, with…
For an arbitrary evolution family, we consider the notion of a polynomial dichotomy with respect to a family of norms and characterize it in terms of the admissibility property, that is, the existence of a unique bounded solution for each…
We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…
A generalization of the Macdonald polynomials depending upon both commuting and anticommuting variables has been introduced recently. The construction relies on certain orthogonality and triangularity relations. Although many…
The purpose of this paper has twofold. The first is to establish a second main theorem for meromorphic functions on annuli and meromorphic function targets (may not be small functions) with truncated counting functions (truncation level 1)…
It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…
In this article we consider the class $\mathcal{A}(p)$ which consists of functions that are meromorphic in the unit disc $\ID$ having a simple pole at $z=p\in (0,1)$ with the normalization $f(0)=0=f'(0)-1 $. First we prove some sufficient…
The Weighted First-Order Model Counting Problem (WFOMC) asks to compute the weighted sum of models of a given first-order logic sentence over a given domain. It can be solved in time polynomial in the domain size for sentences from the…
The paper determines all meromorphic functions with finitely many zeros in the plane having the property that a linear differential polynomial in the function, of order at least 3 and with rational functions as coefficients, also has…
Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…
We study the quantum Hamilton-Jacobi (QHJ) equation of the recently obtained exactly solvable models, related to the newly discovered exceptional polynomials and show that the QHJ formalism reproduces the exact eigenvalues and the…
In this paper, we investigate how the initial models and the final models for the polynomial functors can be uniformly specified in matching logic.
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construc-tion uses a single linear differential form defined from the…
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…