22,019 research outputs found
Positivity properties of Jacobi-Stirling numbers and generalized Ramanujan polynomials
Generalizing recent results of Egge and Mongelli, we show that each diagonal
sequence of the Jacobi-Stirling numbers \js(n,k;z) and \JS(n,k;z) is a
P\'olya frequency sequence if and only if and study the
-total positivity properties of these numbers. Moreover, the polynomial
sequences \biggl\{\sum_{k=0}^n\JS(n,k;z)y^k\biggr\}_{n\geq 0}\quad \text{and}
\quad \biggl\{\sum_{k=0}^n\js(n,k;z)y^k\biggr\}_{n\geq 0} are proved to be
strongly -log-convex. In the same vein, we extend a recent result of
Chen et al. about the Ramanujan polynomials to Chapoton's generalized Ramanujan
polynomials. Finally, bridging the Ramanujan polynomials and a sequence arising
from the Lambert function, we obtain a neat proof of the unimodality of the
latter sequence, which was proved previously by Kalugin and Jeffrey.Comment: 17 pages, 2 tables, the proof of Lemma 3.3 is corrected, final
version to appear in Advances in Applied Mathematic
The -log-convexity of Domb's polynomials
In this paper, we prove the -log-convexity of Domb's polynomials, which
was conjectured by Sun in the study of Ramanujan-Sato type series for powers of
. As a result, we obtain the log-convexity of Domb's numbers. Our proof is
based on the -log-convexity of Narayana polynomials of type and a
criterion for determining -log-convexity of self-reciprocal polynomials.Comment: arXiv admin note: substantial text overlap with arXiv:1308.273
On the -log-convexity conjecture of Sun
In his study of Ramanujan-Sato type series for , Sun introduced a
sequence of polynomials as given by
and he conjectured that the polynomials are -log-convex. By
imitating a result of Liu and Wang on generating new -log-convex sequences
of polynomials from old ones, we obtain a sufficient condition for determining
the -log-convexity of self-reciprocal polynomials. Based on this criterion,
we then give an affirmative answer to Sun's conjecture
Radon Numbers for Trees
Many interesting problems are obtained by attempting to generalize classical
results on convexity in Euclidean spaces to other convexity spaces, in
particular to convexity spaces on graphs. In this paper we consider
-convexity on graphs. A set of vertices in a graph is -convex
if every vertex not in has at most one neighbour in . More specifically,
we consider Radon numbers for -convexity in trees.
Tverberg's theorem states that every set of points in
can be partitioned into sets with intersecting convex hulls.
As a special case of Eckhoff's conjecture, we show that a similar result holds
for -convexity in trees.
A set of vertices in a graph is called free, if no vertex of has
more than one neighbour in . We prove an inequality relating the Radon
number for -convexity in trees with the size of a maximal free set.Comment: 17 pages, 13 figure
A note on Reeb dynamics on the tight 3-sphere
We show that a nondegenerate tight contact form on the 3-sphere has exactly
two simple closed Reeb orbits if and only if the differential in linearized
contact homology vanishes. Moreover, in this case the Floquet multipliers and
Conley-Zehnder indices of the two Reeb orbits agree with those of a suitable
irrational ellipsoid in 4-space.Comment: 20 pages, no figure
- …