中文
相关论文

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

200 篇论文

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

Let $N_k(m,n)$ denote the number of partitions of $n$ with Garvan $k$-rank $m$. It is well-known that Andrews-Garvan-Dyson's crank and Dyson's rank are the $k$-rank for $k=1$ and $k=2$, respectively. In this paper, we prove that the…

数论 · 数学 2022-06-02 Nian Hong Zhou

In recent years, the log-concavity of $\{\sqrt[n]{S_n}\}_{n\geq 1}$ have been received a lot of attention. Very recently, Sun posed the following conjecture in his new book: the sequences $\{\sqrt[n]{a_n}\}_{n\geq 2}$ and $\{…

组合数学 · 数学 2022-11-24 Ernest X. W. Xia , Zuo-Ru Zhang

In this paper we establish an order statistics model of Young tableaux. Multiple integration over nested simplexes is applied to the enumeration of Young tableaux. A brief proof of Frobenius-Young's and Aitken's formulas is given. Partially…

组合数学 · 数学 2013-02-05 Ping Sun

A classical result of Kahn and Saks states that given any partially ordered set with two distinguished elements, the number of linear extensions in which the ranks of the distinguished elements differ by $k$ is log-concave as a function of…

组合数学 · 数学 2024-07-02 Ramon van Handel , Alan Yan , Xinmeng Zeng

We give new examples of graphs and trees with dominating set sequences that are not log-concave. These examples were generated by PatternBoost, a transformer-based reinforcement learning software developed by…

组合数学 · 数学 2026-05-05 Alina Du , Steven Heilman , Greta Panova

Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…

组合数学 · 数学 2007-05-23 Aaron D. Jaggard

Let $P_{n,k}$ be the number of permutations $\pi$ on [n]={1, 2,..., n} such that the length of the longest increasing subsequences of $\pi$ equals k, and let $M_{2n, k}$ be the number of matchings on [2n] with crossing number k. Define…

组合数学 · 数学 2008-06-23 William Y. C. Chen

We investigate log-concavity in the context of level Hilbert functions and pure $O$-sequences, two classes of numerical sequences introduced by Stanley in the late Seventies whose structural properties have since been the object of a…

交换代数 · 数学 2024-05-20 Fabrizio Zanello

We prove log-concavity of the lengths of the top rows of Young diagrams under Poissonized Plancherel measure. This is the first known positive result towards a 2008 conjecture of Chen that the length of the top row of a Young diagram under…

概率论 · 数学 2026-01-29 Jnaneshwar Baslingker , Manjunath Krishnapur , Mokshay Madiman

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 prove that in a large collection of naturally defined sets of permutations of fixed length, the numbers of permutations at Ulam distance k from the identity form a log-concave sequence in k.

组合数学 · 数学 2015-02-20 Miklós Bóna , Marie-Louise Bruner

Descents in permutations or words are defined from the relative position of two consecutive letters. We investigate a statistic involving patterns of k consecutive letters, and show that it leads to Hopf algebras generalizing noncommutative…

组合数学 · 数学 2013-02-12 J. -C. Novelli , C. Reutenauer , J. -Y. Thibon

In recent years, Sun has proposed numerous conjectures regarding the log-concavity of root sequences $\{\sqrt[n]{a_n}}_{n\geqslant 1}$. We establish criteria for the asymptotic log-concavity of $\{\sqrt[n]{a_n}}_{n\geqslant 1}$ and the…

组合数学 · 数学 2023-10-31 Qing-hu Hou , Zhongjie Li

It has been conjectured by W. Chen that the distribution of the length of the longest increasing subsequence in a uniformly random permutation is log-concave. We propose a stronger version of this conjecture which involves the Kronecker…

组合数学 · 数学 2020-06-24 Jonathan Novak , Brendon Rhoades

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

For a graph $G$, and a nonnegative integer $g$, let $a_g(G)$ be the number of $2$-cell embeddings of $G$ in an orientable surface of genus $g$ (counted up to the combinatorial homeomorphism equivalence). In 1989, Gross, Robbins, and Tucker…

组合数学 · 数学 2025-12-30 Bojan Mohar

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

Taking transposes of Standard Young Tableaux defines a natural involution on the set $I(n)$ of involutions of length $n$ via the the Robinson-Schensted correspondence. In some cases, this involution can be defined without resorting to the…

组合数学 · 数学 2019-04-05 Miklos Bona , Rebecca Smith

Following Boros--Moll, a sequence $(a_n)$ is $m$-log-concave if $\mathcal{L}^j (a_n) \geq 0$ for all $j = 0, 1, \ldots, m$. Here, $\mathcal{L}$ is the operator defined by $\mathcal{L} (a_n) = a_n^2 - a_{n - 1} a_{n + 1}$. By a criterion of…

组合数学 · 数学 2014-05-09 Luis A. Medina , Armin Straub