اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAsymptotics of the Extremal Excedance Set Statistic
485
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Answering a question of Clark and Ehrenborg (2010), we determine asymptotics for the number of permutations of size n that admit the most common excedance set. In fact, we provide a more general bivariate asymptotic using the multivariate asymptotic methods of R. Pemantle and M. C. Wilson. We also consider two applications of our main result. First, we determine asymptotics on the number of permutations of size n which simultaneously avoid the generalized patterns 21-34 and 34-21. Second, we determine asymptotics on the number of n-cycles that admit no stretching pairs.
قيم البحث
اقرأ أيضاً
We consider properties of the box polynomials, a one variable polynomial defined over all integer partitions $lambda$ whose Young diagrams fit in an $m$ by $n$ box. We show that these polynomials can be expressed by the finite difference operator app
lied to the power $x^{m+n}$. Evaluating box polynomials yields a variety of identities involving set partition enumeration. We extend the latter identities using restricted growth words and a new operator called the fast Fourier operator, and consider connections between set partition enumeration and the chromatic polynomial on graphs. We also give connections between the box polynomials and the excedance matrix, which encodes combinatorial data from a noncommutative quotient algebra motivated by the recurrence for the excedance set statistic on permutations.
A formula of Stembridge states that the permutation peak polynomials and descent polynomials are connected via a quadratique transformation. The aim of this paper is to establish the cycle analogue of Stembridges formula by using cycle peaks and exce
dances of permutations. We prove a series of new general formulae expressing polynomials counting permutations by various excedance statistics in terms of refined Eulerian polynomials. Our formulae are comparable with Zhuangs generalizations [Adv. in Appl. Math. 90 (2017) 86-144] using descent statistics of permutations. Our methods include permutation enumeration techniques involving variations of classical bijections from permutations to Laguerre histories, explicit continued fraction expansions of combinatorial generating functions in Shin and Zeng [European J. Combin. 33 (2012), no. 2, 111--127] and cycle version of modified Foata-Strehl action. We also prove similar formulae for restricted permutations such as derangements and permutations avoiding certain patterns. Moreover, we provide new combinatorial interpretations for the $gamma$-coefficients of the inversion polynomials restricted on $321$-avoiding permutations.
The object of this paper is to give a systematic treatment of excedance-type polynomials. We first give a sufficient condition for a sequence of polynomials to have alternatingly increasing property, and then we present a systematic study of the join
t distribution of excedances, fixed points and cycles of permutations and derangements, signed or not, colored or not. Let $pin [0,1]$ and $qin [0,1]$ be two given real numbers. We prove that the cyc q-Eulerian polynomials of permutations are bi-gamma-positive, and the fix and cyc (p,q)-Eulerian polynomials of permutations are alternatingly increasing, and so they are unimodal with modes in the middle, where fix and cyc are the fixed point and cycle statistics. When p=1 and q=1/2, we find a combinatorial interpretation of the bi-gamma-coefficients of the (p,q)-Eulerian polynomials. We then study excedance and flag excedance statistics of signed permutations and colored permutations. In particular, we establish the relationships between the (p,q)-Eulerian polynomials and some multivariate Eulerian polynomials. Our results unify and generalize a variety of recent results.
Recently, Bagno, Garber and Mansour studied a kind of excedance number on the complex reflection groups and computed its multidistribution with the number of fixed points on the set of involutions in these groups. In this note, we consider the simila
r problems in more general cases and make a correction of one result obtained by them.
In 1973, Brown, ErdH{o}s and Sos proved that if $mathcal{H}$ is a 3-uniform hypergraph on $n$ vertices which contains no triangulation of the sphere, then $mathcal{H}$ has at most $O(n^{5/2})$ edges, and this bound is the best possible up to a consta
nt factor. Resolving a conjecture of Linial, also reiterated by Keevash, Long, Narayanan, and Scott, we show that the same result holds for triangulations of the torus. Furthermore, we extend our result to every closed orientable surface $mathcal{S}$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
