中文
相关论文

相关论文: The generating function of two-stack sortable perm…

200 篇论文

In this thesis, we apply the stack sorting operator to $r$-permutations and construct the functional equation for the generating function of two-stack-sortable $k$-tuple $r$-permutations counted by descents by using a factorization similar…

组合数学 · 数学 2007-05-23 Dapeng Xu

B\'ona conjectured that the descent polynomials on $(n-2)$-stack sortable permutations have only real zeros. Br\"and\'en proved this conjecture by establishing a more general result. In this paper, we give another proof of Br\"and\'en's…

组合数学 · 数学 2016-02-08 Philip B. Zhang

In this paper we study the generating polynomials obtained by enumerating signed simsun permutations by number of the descents. Properties of the polynomials, including the recurrence relations and generating functions are studied.

组合数学 · 数学 2016-05-18 Shi-Mei Ma , Toufik Mansour , Hai-Na Wang

We study Stirling permutations defined by Gessel and Stanley. We prove that their generating function according to the number of descents has real roots only. We use that fact to prove that the distribution of these descents, and other,…

组合数学 · 数学 2008-03-12 Miklos Bona

We study a sorting procedure (run-sorting) on permutations, where runs are rearranged in lexicographic order. We describe a rather surprising bijection on permutations on length $n$, with the property that it sends the set of peak-values to…

组合数学 · 数学 2021-06-29 Per Alexandersson , Olivia Nabawanda

This paper has been withdrawn by the authors. There was an erroneous estimate of the degree of a transformed polynomial, making the method appear more effective than it really is. We thank an anonymous referee for pointing out this error.

数值分析 · 数学 2008-03-26 Harold Foecke , Alan Weinstein

Motivated by a conjecture of Savage and Visontai about the equidistribution of the descent statistic on signed permutations of the multiset $\{1,1,2,2,\ldots,n,n\}$ and the ascent statistic on $(1,4,3,8,\ldots,2n-1,4n)$-inversion sequences,…

组合数学 · 数学 2013-10-25 Zhicong Lin

This paper has been withdrawn by the author(s), due to the existence of a much better paper in http://arxiv.org/abs/cs.CR/0207027

密码学与安全 · 计算机科学 2007-05-23 Boaz Tsaban

We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions.…

数论 · 数学 2014-09-23 Marco Abrate , Stefano Barbero , Umberto Cerruti , Nadir Murru

We study the generating function of descent numbers for the permutations with descent pairs of prescribed parities, the distribution of which turns out to be a refinement of median Genocchi numbers. We prove the $\gamma$-positivity for the…

组合数学 · 数学 2022-03-18 Sen-Peng Eu , Tung-Shan Fu , Hsin-Hao Lai , Yuan-Hsun Lo

We consider the set of permutations that are sorted after two passes through a pop stack. We characterize these permutations in terms of forbidden patterns (classical and barred) and enumerate them according to the ascent statistic. Then we…

组合数学 · 数学 2019-06-25 Lara Pudwell , Rebecca Smith

The paper has been withdrawn.

量子代数 · 数学 2007-05-23 Boris Shoikhet

Using earlier results we prove a formula for the number $W_{(n,k)}$ of 2-stack sortable permutations of length $n$ with $k$ runs, or in other words, $k-1$ descents. This formula will yield the suprising fact that there are as many 2-stack…

组合数学 · 数学 2009-09-25 Miklós Bóna

Given a permutation statistic $\operatorname{st}$, define its inverse statistic $\operatorname{ist}$ by $\operatorname{ist}(\pi):=\operatorname{st}(\pi^{-1})$. We give a general approach, based on the theory of symmetric functions, for…

组合数学 · 数学 2024-11-13 Ira M. Gessel , Yan Zhuang

We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…

组合数学 · 数学 2020-07-06 Marie-Louise Lackner , Alois Panholzer

In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…

组合数学 · 数学 2015-04-10 Shi-Mei Ma , Yeong-Nan Yeh

A ballot permutation is a permutation $\pi$ such that in any prefix of $\pi$ the descent number is not more than the ascent number. By using a reversal concatenation map, we give a formula for the joint distribution (pk, des) of the peak…

组合数学 · 数学 2020-09-16 David G. L. Wang , T. Zhao

Although the results are correct, it was pointed out that the results follow from some previously known results. Accordingly, this version of the paper is withdrawn by the authors.

计算复杂性 · 计算机科学 2012-12-03 Bhaskar DasGupta , Lakshmi Kaligounder

The paper was withdrawn because of its significant overlap with a paper appeared recently.

组合数学 · 数学 2008-06-30 Marilena Barnabei , Flavio Bonetti , Matteo Silimbani

In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and…

组合数学 · 数学 2016-07-21 David Callan , Shi-Mei Ma , Toufik Mansour
‹ 上一页 1 2 3 10 下一页 ›