Related papers: Multiplier sequences and logarithmic mesh

We study least deviation of logarithmic derivatives of real-valued polynomials with a fixed root from zero on the segment $[-1;1]$ in the uniform norm with the weight $\sqrt{1-x^2}$ and without it. Basing on results of Komarov and Novak and…

We study monomial operators on $ L^2[0,1]$, that is bounded linear operators that map each monomial $x^n$ to a multiple of $x^{p_n}$ for some $p_n$. We show that they are all unitarily equivalent to weighted composition operators on a Hardy…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line {y=ax+b}, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive an alternative algorithm to decide whether…

This write-up contains some minor results and notes related to our work [HQ15] (some of them already known in the literature). In particular, it shows the following: - We show that a graph with polynomial expansion have sublinear…

Lower bounds are given for the number of non-real zeros of a second order linear differential polynomial with constant coefficients in a real entire function with finitely many non-real zeros.

We study Laurent polynomials in any number of variables that are sums of at most $k$ monomials. We first show that the Mahler measure of such a polynomial is at least $h/2^{k-2}$, where $h$ is the height of the polynomial. Next, restricting…

In this paper, we propose a new algebraic winding number and prove that it computes the number of complex roots of a polynomial in a rectangle, including roots on edges or vertices with appropriate counting. The definition makes sense for…

Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…

Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's…

We establish a law of the iterated logarithm (LIL) for the set of real numbers whose $n$-th partial quotient is bigger than $\alpha_n$, where $(\alpha_n)$ is a sequence such that $\sum 1/\alpha_n$ is finite. This set is shown to have…

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…

Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…

We prove that bilinear fractional integral operators and similar multipliers are smoothing in the sense that they improve the regularity of functions. We also treat bilinear singular multiplier operators which preserve regularity and obtain…

We continue the study of multidimensional operator multipliers initiated in [arXiv:math/0701645]. We introduce the notion of the symbol of an operator multiplier. We characterise completely compact operator multipliers in terms of their…

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…

In this paper, we prove super-polynomial lower bounds for the model of \emph{sum of ordered set-multilinear algebraic branching programs}, each with a possibly different ordering ($\sum \mathsf{smABP}$). Specifically, we give an explicit…

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…