中文
相关论文

相关论文: The descent statistic on involutions is not log-co…

200 篇论文

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

We give an explicit combinatorial proof of a weighted version of strong log-concavity for the generating polynomial of increasing spanning forests of a finite simple graph equipped with a total ordering of the vertices. In contrast to…

组合数学 · 数学 2021-01-13 Abdelmalek Abdesselam

We use combinatorial and generating function techniques to enumerate various sets of involutions which avoid 231 or contain 231 exactly once. Interestingly, many of these enumerations can be given in terms of $k$-generalized Fibonacci…

组合数学 · 数学 2007-05-23 Eric S. Egge , Toufik Mansour

Denote by $A(p, n, k)$ the number of commuting $p$-tuples of permutations on $[n]$ that have exactly $k$ distinct orbits. It was conjectured in~\cite{abdesselam2023log} that $A(p, n, k)$ is log-concave with respect to $k$ for every $p\geq…

组合数学 · 数学 2024-09-02 Raghavendra Tripathi

Let alpha = a_1 a_2 ... a_n be a sequence of nonnegative integers. The ascent set of alpha, Asc(alpha), consists of all indices k where a_{k+1} > a_k. An ascent sequence is alpha where the growth of the a_k is bounded by the elements of…

组合数学 · 数学 2023-11-28 Mark Dukes , Bruce Sagan

Let $A(p,n,k)$ be the number of $p$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We formulate the conjecture that, for every fixed $p$ and $n$, the…

组合数学 · 数学 2024-01-12 Abdelmalek Abdesselam

We construct a family of trees with independence numbers going to infinity for which the log-concavity relation for the independent set sequence of a tree $T$ in the family fails at around $\alpha(T)\left(1-1/(16\log \alpha(T))\right)$.…

组合数学 · 数学 2026-01-27 David Galvin

We investigate quantitative implications of the notion of log-concavity through a probabilistic interpretation. In particular, we derive concentration inequalities, moment and entropy bounds for random variables satisfying a precise degree…

概率论 · 数学 2026-02-19 Arnaud Marsiglietti , James Melbourne

Gerhold conjectured and proved conditionally that (log n: n=1,2,...) is not a holonomic sequence. Flajolet, Gerhold and Salvy gave a proof using an analytic machinery. We give a simple proof.

组合数学 · 数学 2007-05-23 Martin Klazar

A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…

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 consider the large deviations associated with the empirical mean of independent and identically distributed random variables under a subexponential moment condition. We show that non-trivial deviations are observable at a subexponential…

概率论 · 数学 2025-07-22 Grégoire Ferré

Let $A(\ell,n,k)$ denote the number of $\ell$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We provide a new proof of an explicit formula for $A(\ell,n,k)$…

组合数学 · 数学 2024-04-17 Abdelmalek Abdesselam , Pedro Brunialti , Tristan Doan , Philip Velie

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…

组合数学 · 数学 2017-07-31 Muneya Matsui

Lorentzian and completely log-concave polynomials have recently emerged as a unifying framework for negative dependence, log-concavity, and convexity in combinatorics and probability. We extend this theory to variational analysis and…

最优化与控制 · 数学 2026-03-11 Papri Dey

We provide the combinatorial proofs of the log-convexity for the derangement numbers in the symmetric group $\mathfrak{S}_n$, hyperoctahedral group $\mathfrak{B}_n$, and the demihyperoctahedral group $\mathfrak{D}_n$. We also show that the…

组合数学 · 数学 2023-08-16 Hiranya Kishore Dey , Subhajit Ghosh

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

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

This is a survey on recent developments on unimodality, log-concavity and real-rootedness in combinatorics. Stanley and Brenti have written extensive surveys of various techniques that can be used to prove real-rootedness, log-concavity or…

组合数学 · 数学 2014-10-27 Petter Brändén

It is known from the work of Baik, Deift, and Johansson [1999] that we have Tracy-Widom fluctuations for the longest increasing subsequence of uniform permutations. In this paper, we prove that this result holds also in the case of the…

概率论 · 数学 2021-01-26 Mohamed Slim Kammoun