中文
相关论文

相关论文: Log-concavity of rows of triangular arrays satisfy…

200 篇论文

Using the lattice paths in $\mathbb{N}\times\mathbb{N}$, we derive a general formula for sequences $\big(T(n,k)\big)$ satisfying the recurrence relation of the form: \begin{equation*} T((n,k)=a_{n,k}T(n-1,k)+b_{n,k}T(n-1,k-1).…

组合数学 · 数学 2026-03-24 Voalaza Mahavily Romuald Aubert , Benjamin Randrianirina

In this paper, we present some criteria for the $2$-$q$-log-convexity and $3$-$q$-log-convexity of combinatorial sequences, which can be regarded as the first column of certain infinite triangular array $[A_{n,k}(q)]_{n,k\geq0}$ of…

组合数学 · 数学 2018-07-04 Bao-Xuan Zhu

Motivated by the classical Eulerian number, descent and excedance numbers in the hyperoctahedral groups, an triangular array from staircase tableaux and so on, we study a triangular array $[\mathcal {T}_{n,k}]_{n,k\ge 0}$ satisfying the…

组合数学 · 数学 2020-07-27 Bao-Xuan Zhu

We combinatorially prove that the number $R(n,k)$ of permutations of length $n$ having $k$ runs is a log-concave sequence in $k$, for all $n$. We also give a new combinatorial proof for the log-concavity of the Eulerian numbers.

组合数学 · 数学 2007-05-23 Miklós Bóna , Richard Ehrenborg

A triangle $\{a(n,k)\}_{0\le k\le n}$ of nonnegative numbers is LC-positive if for each $r$, the sequence of polynomials $\sum_{k=r}^{n}a(n,k)q^k$ is $q$-log-concave. It is double LC-positive if both triangles $\{a(n,k)\}$ and…

组合数学 · 数学 2007-05-23 Yi Wang , Yeong-Nan Yeh

We formulate conditions on a set of log-concave sequences, under which any linear combination of those sequences is log-concave, and further, of conditions under which linear combinations of log-concave sequences that have been transformed…

组合数学 · 数学 2014-07-24 Jonathan L. Gross , Toufik Mansour , Thomas W. Tucker , David G. L. Wang

Euler's gamma function is logarithmically convex on positive semi-axis. Additivity of logarithmic convexity implies that the function sum of gammas with non-negative coefficients is also log-convex. In this paper we investigate the series…

经典分析与常微分方程 · 数学 2012-06-22 S. I. Kalmykov , D. B. Karp

We introduce the three-Catalan triangle, highlighting the three-Catalan numbers along with their recurrence relation and combinatorial interpretation, which allows us to establish their log-convexity. Additionally, we prove that the rows of…

组合数学 · 数学 2025-06-17 Boualam Rezig , Moussa Ahmia

We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…

组合数学 · 数学 2019-01-16 Richard P. Stanley

Menon's proof of the preservation of log-concavity of sequences under convolution becomes simpler when adapted to 2-sided infinite sequences. Under assumption of log-concavity of two 2-sided infinite sequences, the existence of the…

组合数学 · 数学 2019-03-07 Stephan Foldes , Laszlo Major

We consider the higher order Tur\'an inequality and higher order log-concavity for sequences $\{a_n\}_{n \ge 0}$ such that \[ \frac{a_{n-1}a_{n+1}}{a_n^2} = 1 + \sum_{i=1}^m \frac{r_i(\log n)}{n^{\alpha_i}} + o\left( \frac{1}{n^{\beta}}…

组合数学 · 数学 2021-05-10 Q. H. Hou , G. J. Li

For an integer \( k \geq 2 \), the sequence of \( k \)-generalized Lucas numbers is defined by the recurrence relation \( L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \) for all \( n \geq 2 \), with initial conditions \( L_0^{(k)} = 2…

This paper presents the log-concavity of the $m$-gonal figurate number sequences. The author gives and proves the recurrence formula for $m$-gonal figurate number sequences and its corresponding quotient sequences which are found to be…

组合数学 · 数学 2020-06-11 Fekadu Tolessa Gedefa

We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in…

组合数学 · 数学 2026-04-17 Piero Giacomelli

Let $e_{n}^k$ be the entries in the classical Euler's difference table. We consider the array $d_{n}^{k}=e_n^k/k!$ for $0\leq k \leq n$, where $d_n^k$ can be interpreted as the number of k-fixed-points-permutations of [n]. We show that the…

组合数学 · 数学 2009-11-17 William Y. C. Chen , Cindy C. Y. Gu , Kevin J. Ma , Larry X. W. Wang

In this paper, we provide criteria for the log-concavity of rows and the strong $q$-log-convexity of the generating functions of rows in more generalized triangles. Additionally, we prove that the bi$^s$nomial transformation not only…

组合数学 · 数学 2024-09-30 Rezig Boualam , Moussa Ahmia

We present some necessary and/or sufficient conditions for the positivity problem of three-term recurrence sequences. As applications we show the positivity of diagonal Taylor coefficients of some rational functions in a unified approach.…

组合数学 · 数学 2023-01-06 Yanni Pei , Yaling Wang , Yi Wang

Many combinatorial and other number triangles are solutions of recurrences of the Graham-Knuth-Patashnik (GKP) type. Such triangles and their defining recurrences are investigated analytically. They are acted on by a transformation group…

组合数学 · 数学 2025-02-17 Robert S. Maier

Given a sequence (a_k) = a_0, a_1, a_2,... of real numbers, define a new sequence L(a_k) = (b_k) where b_k = a_k^2 - a_{k-1} a_{k+1}. So (a_k) is log-concave if and only if (b_k) is a nonnegative sequence. Call (a_k) "infinitely…

组合数学 · 数学 2012-02-01 Peter R. W. McNamara , Bruce E. Sagan

We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions…

组合数学 · 数学 2007-05-23 Tomislav Došlić
‹ 上一页 1 2 3 10 下一页 ›