William Y. C. Chen, Larry X. W. Wang, Arthur L. B. Yang
We consider a class of strongly q-log-convex polynomials based on a triangular recurrence relation with linear coefficients, and we show that the Bell polynomials, the Bessel polynomials, the Ramanujan polynomials and the Dowling polynomials are strongly q-log-convex. We also prove that the Bessel transformation preserves log-convexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Linear recurrences for non-log-concave independence polynomials of trees
本文通过识别树独立多项式非对数凹性的结构模式，推导出其线性递推关系，并证明其零点极限点位于复平面上的圆上，还展示了多项式破坏对数凹性的不同情况。
Log-concavity and log-convexity in the theory of the Graham--Knuth--Patashnik recurrences
本文研究了由Graham-Knuth-Patashnik递推关系定义的三角数组T(n,k;μ)，证明了其在变量参数下具有强对数凹性和强对数凸性，并展示了其Hankel-完全正性。
A class of polynomial recurrences resulting in $(n/\log n, n/\log^2n)$-asymptotic normality
该研究针对离散数学中常见的满足微分-差分递推的整值随机变量生成多项式，识别出一类可导出期望、方差分别正比于$n/\log n$、$n/\log^2n$正态律的递推关系，涵盖第二类Stirling数等多个组合数学多项式实例。
We prove the log-concavity of the Fennessey-Larcombe-French sequence based on its three-term recurrence relation, which was recently conjectured by Zhao. The key ingredient of our approach is a sufficient condition for log-concavity of a sequence subject to certain three-term recurrence.
The Catalan-Larcombe-French sequence $\{P_n\}_{n\geq 0}$ arises in a series expansion of the complete elliptic integral of the first kind. It has been proved that the sequence is log-balanced. In the paper, by exploring a criterion due to Chen and Xia for testing 2-log-convexity of a sequence satisfying three-term recurrence relation, we prove that the new sequence $\{P^2_n-P_{n-1}P_{n+1}\}_{n\geq 1}$ are strictly log-convex and hence the Catalan-Larcombe-French sequence is strictly 2-log-convex.
For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a fixed number of diagonals, we give both a recurrence relation and an explicit representation in terms of partial Bell polynomials. We use basic properties of these polynomials to efficiently incorporate restrictions on the type of polygons allowed in the partitions.
We consider a self-convolutive recurrence whose solution is the sequence of coefficients in the asymptotic expansion of the logarithmic derivative of the confluent hypergeometic function $U(a,b,z)$. By application of the Hilbert transform we convert this expression into an explicit, non-recursive solution in which the $n$th coefficient is expressed as the $(n-1)$th moment of a measure, and also as the trace of the $(n-1)$th iterate of a linear operator. Applications of these sequences, and hence of the explicit solution provided, are found in quantum field theory as the number of Feynman diagr…
Log-concavity of rows of triangular arrays satisfying a certain super-recurrence
本文研究满足超递推关系的三角阵列，给出其行具有对数凹性的充分条件，统一证明多类经典组合序列的对数凹性并证实广义 Lah 数猜想，还引入双参数 Eulerian 数推广并讨论其性质。
A sequence $\{ a_n \}_{n \ge 0}$ is said to be asymptotically $r$-log-convex if it is $r$-log-convex for $n$ sufficiently large. We present a criterion on the asymptotical $r$-log-convexity based on the asymptotic behavior of $a_n a_{n+2}/a_{n+1}^2$. As an application, we show that most P-recursive sequences are asymptotic $r$-log-convexity for any integer $r$ once they are log-convex. Moreover, for a concrete integer $r$, we present a systematic method to find the explicit integer $N$ such that a P-recursive sequence $\{a_n\}_{n \ge N}$ is $r$-log-convex. This enable us to prove the $r$-log-c…
In this paper, we prove the $q$-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 $q$-log-convexity of Narayana polynomials of type $B$ and a criterion for determining $q$-log-convexity of self-reciprocal polynomials.
The q-Catalan numbers studied by Carlitz and Riordan are polynomials in q with nonnegative coefficients. They evaluate, at q=1, to the Catalan numbers: 1, 1, 2, 5, 14,..., a log-convex sequence. We use a combinatorial interpretation of these polynomials to prove a q-log-convexity result. The sequence of q-Catalan numbers is not q-log-convex in the narrow sense used by other authors, so our work suggests a more flexible definition of q-log convex be adopted.
We present an approach to proving the 2-log-convexity of sequences satisfying three-term recurrence relations. We show that the Apery numbers, the Cohen-Rhin numbers, the Motzkin numbers, the Fine numbers, the Franel numbers of order 3 and 4 and the large Schroder numbers are all 2-log-convex. Numerical evidence suggests that all these sequences are k-log-convex for any $k\geq 1$ possibly except for a constant number of terms at the beginning.
Log-concavity and strong $q$-log-convexity for some generalized triangular arrays
本文为更广义三角阵列中行的对数凹性及行生成函数的强 $q$-对数凸性提供了判定准则，并证明了 bi$^s$nomial 变换同时保持这两种性质。
In this paper we prove the strong $q$-log-convexity of the Eulerian polynomials of Coxeter groups using their exponential generating functions. Our proof is based on the theory of exponential Riordan arraya and a criterion for determining the strong $q$-log-convexity of polynomials sequences, whose generating functions can be given by the continued fraction. As consequences, we get the strong $q$-log-convexity the Eulerian polynomials of type $A_n,B_n$, their $q$-analogous and the generalized Eulerian polynomials associated to the arithmetic progression $\{a,a+d,a+2d,a+3d,\ldots\}$ in a unifie…
A sequence $\{z_n\}_{n\geq0}$ is called ratio log-convex in the sense that the ratio sequence $\{\frac{z_{n+1}}{z_n}\}_{n\geq0}$ is log-convex. Based on a three-term recurrence for sequences, we develop techniques for dealing with the ratio log-convexity of ratio sequences. As applications, we prove that the ratio sequences of numbers, including the derangement numbers, the Motzkin numbers, the Fine numbers, Franel numbers and the Domb numbers are ratio log-convex, respectively. Finally, we not only prove that the sequence of derangement numbers is asymptotically infinitely log-monotonic, but …
In his study of Ramanujan-Sato type series for $1/π$, Sun introduced a sequence of polynomials $S_n(q)$ as given by $$S_n(q)=\sum\limits_{k=0}^n{n\choose k}{2k\choose k}{2(n-k)\choose n-k}q^k,$$ and he conjectured that the polynomials $S_n(q)$ are $q$-log-convex. By imitating a result of Liu and Wang on generating new $q$-log-convex sequences of polynomials from old ones, we obtain a sufficient condition for determining the $q$-log-convexity of self-reciprocal polynomials. Based on this criterion, we then give an affirmative answer to Sun's conjecture.
Using Schur positivity and the principal specialization of Schur functions, we provide a proof of a recent conjecture of Liu and Wang on the $q$-log-convexity of the Narayana polynomials, and a proof of the second conjecture that the Narayana transformation preserves the log-convexity. Based on a formula of Bränd$\mathrm{\acute{e}}$n which expresses the $q$-Narayana numbers as the specializations of Schur functions, we derive several symmetric function identities using the Littlewood-Richardson rule for the product of Schur functions, and obtain the strong $q$-log-convexity of the Narayana pol…
$q$-log-convexity from linear transformations and polynomials with only real zeros
本文研究迭代多项式稳定性与保持多项式强$q$-对数凸性的线性变换，给出相关判别准则，统一推导多类变换的保凸性，证实猜想并推广已有结果，还通过零点交错法得到多类多项式的稳定性与$q$-对数凸性结论。
Strong $q$-log-convexity of the $d$-Hoggatt polynomials
本文研究 $d$-Hoggatt 数的对数凸性，证明 $d$-Hoggatt 变换保持对数凸性，建立 $q$-模拟的强 $q$-对数凹性，并基于 Schur 函数理论证明 $d$-Hoggatt 多项式序列强 $q$-对数凸。
We present an algorithm which computes the $D^{th}$ term of a sequence satisfying a linear recurrence relation of order $d$ over a field $K$ in $O( \mathsf{M}(\bar d)\log(D) + \mathsf{M}(d)\log(d))$ operations in $K$, where $\bar d \leq d$ is the degree of the squarefree part of the annihilating polynomial of the recurrence and $\mathsf{M}$ is the cost of polynomial multiplication in $K$. This is a refinement of the previously optimal result of $O( \mathsf{M}(d)\log(D) )$ operations, due to Fiduccia.
We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these functions satisfy a linear recurrence relation over $\mathbb Z$ or ${\mathbb Z}_m$ and allow an interpretation as counting the number of relations satisfying a property expressible in Monadic Second Order Logic (MSOL). C. Blatter and E. Specker (1981) showed that if such a function $f$ counts the number of binary relations satisfying a property expressible in MS…
Log-Concavity and Infinite Log-Concavity of Linear Recurrent Sequences with Linear Coefficients via Companion Matrix Methods
本文研究了满足线性递推关系的实序列的对数凹性，通过伴随矩阵形式分析了对数凹算子的二次形式，并推导了对数凹性的充分条件。
We study the limiting behavior of multiple ergodic averages involving sequences of integers that satisfy some regularity conditions and have polynomial growth. We show that for "typical" choices of Hardy field functions $a(t)$ with polynomial growth, the averages $\frac{1}{N}\sum_{n=1}^N f_1(T^{[a(n)]}x)\cdot...\cdot f_\ell(T^{\ell [a(n)]}x)$ converge in the mean and we determine their limit. For example, this is the case if $a(t)=t^{3/2}, t\log{t},$ or $t^2+(\log{t})^2$. Furthermore, if ${a_1(t),...,a_\ell(t)}$ is a "typical" family of logarithmico-exponential functions of polynomial growth, …
Two elements, $x$ and $y$, are separated by a set $S$ if it contains exactly one of $x$ and $y$. We prove that any set of $n$ points in general position in the plane can be separated by $O(n\log\log n/\log n)$ convex sets, and for some point sets $Ω(n/\log n)$ convex sets are necessary.
We show that Stieltjes moment sequences are infinitely log-convex, which parallels a famous result that (finite) Pólya frequency sequences are infinitely log-concave. We introduce the concept of $q$-Stieltjes moment sequences of polynomials and show that many well-known polynomials in combinatorics are such sequences. We provide a criterion for linear transformations and convolutions preserving Stieltjes moment sequences. Many well-known combinatorial sequences are shown to be Stieltjes moment sequences in a unified approach and therefore infinitely log-convex, which in particular settles a co…
We extend the exponential formula by Bender and Canfield (1996), which relates log-concavity and the cycle index polynomials. The extension clarifies the log-convexity relation. The proof is by noticing the property of a compound Poisson distribution together with its moment generating function. We also give a combinatorial proof of extended "log-convex part" referring Bender and Canfield's approach, where the formula by Bruijn and Erdös (1953) is additionally exploited. The combinatorial approach yields richer structural results more than log-convexity. Furthermore, we consider normal and bin…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。