اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSign-alternating Gibonacci polynomials
83
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider various properties and manifestations of some sign-alternating univariate polynomials borne of right-triangular integer arrays related to certain generalizations of the Fibonacci sequence. Using a theory of the root geometry of polynomial sequences developed by J. L. Gross, T. Mansour, T. W. Tucker, and D. G. L. Wang, we show that the roots of these `sign-alternating Gibonacci polynomials are real and distinct, and we obtain explicit bounds on these roots. We also derive Binet-type closed expressions for the polynomials. Some of these results are applied to resolve finiteness questions pertaining to a one-player combinatorial game (or puzzle) modelled after a well-known puzzle we call the `Networked-numbers Game. Elsewhere, the first- and second-named authors, in collaboration with A. Nance, have found rank symmetric `diamond-colored distributive lattices naturally related to certain representations of the special linear Lie algebras. Those lattice cardinalities can be computed using sign-alternating Fibonacci polynomials, and the lattice rank generating functions correspond to the rows of some new and easily defined triangular integer arrays. Here, we present Gibonaccian, and in particular Lucasia
قيم البحث
اقرأ أيضاً
In this paper we present grammatical interpretations of the alternating Eulerian polynomials of types A and B. As applications, we derive several properties of the type B alternating Eulerian polynomials, including combinatorial expansions, recurrenc
e relations and generating functions. We establish an interesting connection between alternating Eulerian polynomials of type B and left peak polynomials of permutations in the symmetric group, which implies that the type B alternating Eulerian polynomials have gamma-vectors alternate in sign.
In this paper, we first consider a generalization of the David-Barton identity which relate the alternating run polynomials to Eulerian polynomials. By using context-free grammars, we then present a combinatorial interpretation of a family of q-alter
nating run polynomials. Furthermore, we introduce the definition of semi-gamma-positive polynomial and we show the semi-gamma-positivity of the alternating run polynomials of dual Stirling permutations. A connection between the up-down run polynomials of permutations and the alternating run polynomials of dual Stirling permutations is established.
The alternating descent statistic on permutations was introduced by Chebikin as a variant of the descent statistic. We show that the alternating descent polynomials on permutations are unimodal via a five-term recurrence relation. We also found a qua
dratic recursion for the alternating major index $q$-analog of the alternating descent polynomials. As an interesting application of this quadratic recursion, we show that $(1+q)^{lfloor n/2rfloor}$ divides $sum_{piinmathfrak{S}_n}q^{rm{altmaj}(pi)}$, where $mathfrak{S}_n$ is the set of all permutations of ${1,2,ldots,n}$ and $rm{altmaj}(pi)$ is the alternating major index of $pi$. This leads us to discover a $q$-analog of $n!=2^{ell}m$, $m$ odd, using the statistic of alternating major index. Moreover, we study the $gamma$-vectors of the alternating descent polynomials by using these two recursions and the ${textbf{cd}}$-index. Further intriguing conjectures are formulated, which indicate that the alternating descent statistic deserves more work.
The theme of this article is a reciprocity between bounded up-down paths and bounded alternating sequences. Roughly speaking, this ``reciprocity manifests itself by the fact that the extension of the sequence of numbers of paths of length $n$, consis
ting of diagonal up- and down-steps and being confined to a strip of bounded width, to negative $n$ produces numbers of alternating sequences of integers that are bounded from below and from above. We show that this reciprocity extends to families of non-intersecting bounded up-down paths and certain arrays of alternating sequences which we call alternating tableaux. We provide as well weight
Let $A(n,r;3)$ be the total weight of the alternating sign matrices of order $n$ whose sole `1 of the first row is at the $r^{th}$ column and the weight of an individual matrix is $3^k$ if it has $k$ entries equal to -1. Define the sequence of the ge
nerating functions $G_n(t)=sum_{r=1}^n A(n,r;3)t^{r-1}$. Results of two different kind are obtained. On the one hand I made the explicit expression for the even subsequence $G_{2 u}(t)$ in terms of two linear homogeneous second order recurrence in $ u$ (Theorem 1). On the other hand I brought to light the nice connection between the neighbouring functions $G_{2 u+1}(t)$ and $G_{2 u}(t)$ (Theorem 2). The 3-enumeration $A(n;3) equiv G_n(1)$ which was found by Kuperberg is reproduced as well.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
