中文
相关论文

相关论文: Combinatorial proof of the log-convexity for the d…

200 篇论文

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…

组合数学 · 数学 2013-10-01 Bao-Xuan Zhu

Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and…

组合数学 · 数学 2007-05-23 Tomislav Došlić , Darko Veljan

We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…

组合数学 · 数学 2024-04-17 Alan Yan

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

This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…

组合数学 · 数学 2010-08-17 Li Liu , Yi Wang

We reinterpret an inequality, due originally to Sidorenko, for linear extensions of posets in terms of convex subsets of the symmetric group $\mathfrak{S}_n$. We conjecture that the analogous inequalities hold in arbitrary…

组合数学 · 数学 2022-11-02 Christian Gaetz , Yibo Gao

The derangement polynomial $d_n (x)$ for the symmetric group enumerates derangements by the number of excedances. The derangement polynomial $d^B_n(x)$ for the hyperoctahedral group is a natural type $B$ analogue. A new combinatorial…

组合数学 · 数学 2013-03-18 Christos A. Athanasiadis , Christina Savvidou

We introduce a new statistic on the hyperoctahedral groups (Coxeter groups of type B), and give a conjectural formula for its signed distributions over arbitrary descent classes. The statistic is analogous to the classical Coxeter length…

组合数学 · 数学 2013-03-06 Alexander Stasinski , Christopher Voll

This paper contains a thorough investigation of invariant distributions supported on limit sets of discrete groups acting convex cocompactly on symmetric spaces of negative curvature. It can be considered as a continuation of…

微分几何 · 数学 2007-05-23 Martin Olbrich

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…

组合数学 · 数学 2010-09-14 William Y. C. Chen , Ernest X. W. Xia

The classical Eulerian Numbers $A_{n,k}$ are known to be log-concave. Let $P_{n,k}$ and $Q_{n,k}$ be the number of even and odd permutations with $k$ excedances. In this paper, we show that $P_{n,k}$ and $Q_{n,k}$ are log-concave. For this,…

组合数学 · 数学 2020-10-21 Hiranya Kishore Dey

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 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…

组合数学 · 数学 2013-09-30 William Y. C. Chen , Jeremy J. F. Guo , Larry X. W. Wang

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ć

We study the cohomology rings of snc log symplectic pairs $(X,Y)$ which have log symplectic forms of pure weight. We show that under a certain natural condition, the cohomology ring of $X \setminus Y$ exhibits the curious hard Lefschetz…

代数几何 · 数学 2020-05-26 Andrew Harder

A Coxeter group of classical type $A_n$, $B_n$ or $D_n$ contains a chain of subgroups of the same type. We show that intersections of conjugates of these subgroups are again of the same type, and make precise in which sense and to what…

群论 · 数学 2021-09-06 Linus Hellebrandt , Götz Pfeiffer

Denote by $N_{\ell}(n)$ the number of $\ell$-tuples of elements in the symmetric group $S_n$ with commuting components, normalized by the order of $S_n$. In this paper, we prove asymptotic formulas for $N_\ell(n)$. In addition, general…

数论 · 数学 2024-01-12 Kathrin Bringmann , Johann Franke , Bernhard Heim

This paper proves explicit formulas for the number of dissections of a convex regular polygon modulo the action of the cyclic and dihedral groups. The formulas are obtained by making use of the Cauchy-Frobenius Lemma as well as bijections…

组合数学 · 数学 2012-09-28 Douglas Bowman , Alon Regev

In this article, we first show that in case $n$ is even which Coxeter element in $\mathfrak{S}_{n}$ affords the longest by taking its power to $n/2$. We also show that in case $n$ is odd which Coxeter element affords the longest in…

群论 · 数学 2014-11-24 Masashi Kosuda

We prove a conjecture by Shannon Starr regarding the asymptotics for the number of tuples of commuting permutations with given number of joint orbits. These numbers generalize unsigned Stirling numbers of the first kind which count how many…

组合数学 · 数学 2025-06-10 Abdelmalek Abdesselam
‹ 上一页 1 2 3 10 下一页 ›