ترغب بنشر مسار تعليمي؟ اضغط هنا

Anti-palindromic compositions

107   0   0.0 ( 0 )
 نشر من قبل Matthew Just
 تاريخ النشر 2021
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

A palindromic composition of $n$ is a composition of $n$ which can be read the same way forwards and backwards. In this paper we define an anti-palindromic composition of $n$ to be a composition of $n$ which has no mirror symmetry amongst its parts. We then give a surprising connection between the number of anti-palindromic compositions of $n$ and the so-called tribonacci sequence, a generalization of the Fibonacci sequence. We conclude by defining a new q-analogue of the Fibonacci sequence, which is related to certain equivalence classes of anti-palindromic compositions



قيم البحث

اقرأ أيضاً

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.
162 - Matthew Just 2021
In recent work, G. E. Andrews and G. Simay prove a surprising relation involving parity palindromic compositions, and ask whether a combinatorial proof can be found. We extend their results to a more general class of compositions that are palindromic modulo $m$, that includes the parity palindromic case when $m=2$. We then provide combinatorial proofs for the cases $m=2$ and $m=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.
128 - Xiaochuan Liu 2011
In this work, we give combinatorial proofs for generating functions of two problems, i.e., flushed partitions and concave compositions of even length. We also give combinatorial interpretation of one problem posed by Sylvester involving flushed parti tions and then prove it. For these purposes, we first describe an involution and use it to prove core identities. Using this involution with modifications, we prove several problems of different nature, including Andrews partition identities involving initial repetitions and partition theoretical interpretations of three mock theta functions of third order $f(q)$, $phi(q)$ and $psi(q)$. An identity of Ramanujan is proved combinatorially. Several new identities are also established.
116 - Michael Lugo 2009
In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating functions. A compo sition of two random involutions in S_n typically has about n^(1/2) cycles, and the cycles are characteristically of length n^(1/2). Compositions of two random fixed-point-free involutions, on the other hand, typically have about log n cycles and are closely related to permutations with all cycle lengths even. The number of factorizations of a random permutation into two involutions appears to be asymptotically lognormally distributed, which we prove for a closely related probabilistic model. This study is motivated by the observation that the number of involutions in [n] is (n!)^(1/2) times a subexponential factor; more generally the number of permutations with all cycle lengths in a finite set S is n!^(1-1/m) times a subexponential factor, and the typical number of k-cycles is nearly n^(k/m)/k. Connections to pattern avoidance in involutions are also considered.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا