Related papers: Ratio Monotonicity of Polynomials Derived from Non…

We show that the large Cartesian powers of any graph have log-concave valencies with respect to a ffxed vertex. We show that the series of valencies of distance regular graphs is log-concave, thus improving on a result of (Taylor,…

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

Certain monotonicity properties of the Poisson approximation to the binomial distribution are established. As a natural application of these results, exact (rather than approximate) tests of hypotheses on an unknown value of the parameter…

We consider real polynomials in one variable without vanishing coefficients and with all roots real and of distinct moduli. We show that the signs of the coefficients define the order of the moduli of the roots on the real positive…

We introduce the notion of infinitely log-monotonic sequences. By establishing a connection between completely monotonic functions and infinitely log-monotonic sequences, we show that the sequences of the Bernoulli numbers, the Catalan…

The chromatic polynomial is a well studied object in graph theory. There are many results and conjectures about the log-concavity of the chromatic polynomial and other polynomials related to it. The location of the roots of these…

A noncommutative polynomial is stable if it is nonsingular on all tuples of matrices whose imaginary parts are positive definite. In this paper a characterization of stable polynomials is given in terms of strongly stable linear matrix…

We show that probabilistic equivalence of a regret-based preference relationship over random variables is implied by a weak form of continuity and monotonicity.

In the paper the authors alternatively prove that the function $x^\alpha\big[\ln\frac{px}{x+p+1}-\psi_p(x)\big]$ is completely monotonic on $(0,\infty)$ if and only if $\alpha \le 1$, where $p\in\mathbb{N}$ and $\psi_p(x)$ is the…

We establish some new Tur\'an's type inequalities for orthogonal polynomials defined by a three-term recurrence with monotonic coefficients. As a corollary we deduce asymptotic bounds on the extreme zeros of orthogonal polynomials with…

The Rota--Heron--Welsh conjecture (now a theorem of Adiprasito, Huh, and the author) asserts the log-concavity of the characteristic polynomial of matroids. We give an exposition of the Lorentzian polynomial proof following the work of…

We consider the set of monic real univariate polynomials of a given degree $d$ with non-vanishing coefficients, with given signs of the coefficients and with given quantities $pos$ of their positive and $neg$ of their negative roots (all…

We prove an asymptotic formula for the recurrence coefficients of orthogonal polynomials with orthogonality measure $\log \bigl(\frac{2}{1-x}\bigr) {\rm d}x$ on $(-1,1)$. The asymptotic formula confirms a special case of a conjecture by…

For a polynomial $P$ of degree greater than one, we show the existence of patterns of the form $(x,x+t,x+P(t))$ with a gap estimate on $t$ in positive density subsets of the reals. This is an extension of an earlier result of Bourgain. Our…

We investigate the quantitative relationship between nonnegative polynomials and sums of squares of polynomials. We show that if the degree is fixed and the number of variables grows then there are significantly more nonnegative polynomials…

We prove the following monotonicity result for the holonomy group: Given a sequence of metric connections converging in $C^0$ such that all its members have holonomy contained in a closed group $H$, also their limit connection needs to have…

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

Deciding the positivity of a sequence defined by a linear recurrence and initial conditions is, in general, a hard problem. When the coefficients of the recurrences are constants, decidability has only been proven up to order 5. The…

We say that a random integer variable $X$ is monotone if the modulus of the characteristic function of $X$ is decreasing on $[0,\pi]$. This is the case for many commonly encountered variables, e.g., Bernoulli, Poisson and geometric random…

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…