اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLocally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness
87
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We define the notion of asymptotically free for locally restricted compositions, which means roughly that large parts can often be replaced by any larger parts. Two well-known examples are Carlitz and alternating compositions. We show that large parts have asymptotically geometric distributions. This leads to asymptotically independent Poisson variables for numbers of various large parts. Based on this we obtain asymptotic formulas for the probability of being gap free and for the expected values of the largest part, number of distinct parts and number of parts of multiplicity k, all accurate to o(1).
قيم البحث
اقرأ أيضاً
We prove three main conjectures of Berkovich and Uncu (Ann. Comb. 23 (2019) 263--284) on the inequalities between the numbers of partitions of $n$ with bounded gap between largest and smallest parts for sufficiently large $n$. Actually our theorems a
re stronger than their original conjectures. The analytic version of our results shows that the coefficients of some partition $q$-series are eventually positive.
We show that for $n geq 3, n e 5$, in any partition of $mathcal{P}(n)$, the set of all subsets of $[n]={1,2,dots,n}$, into $2^{n-2}-1$ parts, some part must contain a triangle --- three different subsets $A,B,Csubseteq [n]$ such that $Acap B$, $Acap
C$, and $Bcap C$ have distinct representatives. This is sharp, since by placing two complementary pairs of sets into each partition class, we have a partition into $2^{n-2}$ triangle-free parts. We also address a more general Ramsey-type problem: for a given graph $G$, find (estimate) $f(n,G)$, the smallest number of colors needed for a coloring of $mathcal{P}(n)$, such that no color class contains a Berge-$G$ subhypergraph. We give an upper bound for $f(n,G)$ for any connected graph $G$ which is asymptotically sharp (for fixed $k$) when $G=C_k, P_k, S_k$, a cycle, path, or star with $k$ edges. Additional bounds are given for $G=C_4$ and $G=S_3$.
Jelinek, Mansour, and Shattuck studied Wilf-equivalence among pairs of patterns of the form ${sigma,tau}$ where $sigma$ is a set partition of size $3$ with at least two blocks. They obtained an upper bound for the number of Wilf-equivalence classes f
or such pairs. We show that their upper bound is the exact number of equivalence classes, thus solving a problem posed by them.
A superdiagonal composition is one in which the $i$-th part or summand is of size greater than or equal to $i$. In this paper, we study the number of palindromic superdiagonal compositions and colored superdiagonal compositions. In particular, we giv
e generating functions and explicit combinatorial formulas involving binomial coefficients and Stirling numbers of the first kind.
The Ish arrangement was introduced by Armstrong to give a new interpretation of the $q,t$-Catalan numbers of Garsia and Haiman. Armstrong and Rhoades showed that there are some striking similarities between the Shi arrangement and the Ish arrangement
and posed some problems. One of them is whether the Ish arrangement is a free arrangement or not. In this paper, we verify that the Ish arrangement is supersolvable and hence free. Moreover, we give a necessary and sufficient condition for the deleted Ish arrangement to be free.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
