Following Lucas and then other Fibonacci people Kwasniewski had introduced and had started ten years ago the open investigation of the overall F-nomial coefficients which encompass among others Binomial, Gaussian and Fibonomial coefficients with a new unified combinatorial interpretation expressed in terms of cobweb posets' partitions and tilings of discrete hyperboxes. In this paper, we deal with special subfamily of T-nomial coefficients.
The main aim of this note is to develop the theory of T-nomial coefficients with the help of generating functions. The binomial-like theorem for T-nomials is delivered here and some consequences of it are drawn. A new combinatorial interpretation of T-nomial coefficients is provided and compared with the Konvalina way of objects' selections from weighted boxes. A brief summary of already known properties of T-nomial coefficients is served.
Fibonomial coefficients count the number of specific finite birth self-similar subposets of an infinite non-tree poset naturally related to the Fibonacci tree of rabbits growth process.
Combinatorial interpretation of the fibonomial coefficients recently proposed by the present author results here in combinatorial interpretation of the recurrence relation for fibonomial coefficients . The presentation is provided with quite an exhaustive context where apart from plane grid coordinate system used several figures illustrate the exposition of statements and the derivation of the recurrence itself.
In 2009, Sagan and Savage introduced a combinatorial model for the Fibonomial numbers, integer numbers that are obtained from the binomial coefficients by replacing each term by its corresponding Fibonacci number. In this paper, we present a combinatorial description for the $q$-analog and elliptic analog of the Fibonomial numbers. This is achieved by introducing some $q$-weights and elliptic weights to a slight modification of the combinatorial model of Sagan and Savage.
Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via characteristic matrix of the corresponding partial order relation . Relevance of the proposal to more general unification treatment is indicated.
Up to our knowledge -since about 126 years we were lacking of classical type combinatorial interpretation of Fibonomial coefficients as it was Lukas \cite{1} - to our knowledge -who was the first who had defined Finonomial coefficients and derived a recurrence for them (see Historical Note in \cite{2,3}). Here we inform that a join combinatorial interpretation was found \cite{4} for all binomial-type coefficient - Fibonomial coefficients included.
The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined by {n choose k} = {n}!/({k}!{n-k}!) where {n}! = {1}{2}...{n}. These quotients are also polynomials in s and t, and specializations give the ordinary binomial coefficients, the Fibonomial coefficients, and the q-binomial coefficients. We present some of their fundamental properties, including a more general recursion for {n}, an analogue of the binomial the…
It is well known that Pascal's triangle exhibits fractal behavior when reduced modulo a prime. We show that the triangle of Fibonomial coefficients has a similar nature modulo two. Specifically, for any $m \ge 0$, the subtriangle consisting of the first $3 \cdot 2^m$ rows is duplicated on the left and right sides of the next $3 \cdot 2^m$ rows, with an inverted triangle of zeros in between. We give three proofs of this fact. The first uses a combinatorial interpretation of the Fibonomials due to Sagan and Savage. The second employs an analogue of Lucas' congruence for the parity of binomial co…
A research problem for undergraduates and graduates is being posed as a cap for the prior antecedent regular discrete mathematics exercises. [Here cap is not necessarily CAP=Competitive Access Provider, though nevertheless ...] The object of the cap problem of final interest i.e. array of fibonomial coefficients and the issue of its combinatorial meaning is to be found in A.K.Kwaśniewski's source papers. The cap problem number seven - still opened for students has been placed on Mathemagics page of the first author [http://ii.uwb.edu.pl/akk/dydaktyka/dyskr/dyskretna.htm]. The indicatory refere…
In this article we study a generalization of Fibonomials, replacing the Fibonacci sequences by bivariate s-Fibonacci polynomial sequences. We call the obtained objects "Bivariate s-Fibopolynomials".
Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial coefficients by C{n,k}={n}!/({k}!{n-k}!) where {n}!={1}{2}...{n}. It is easy to see that C{n,k} is a polynomial in s and t. The purpose of this note is to give two combinatorial interpretations for this polynomial in terms of statistics on integer partitions inside a k by n-k rectangle. When s=t=1 we obtain combinatorial interpretations of the fibonomial coeffic…
In response to [6], we discover the looked for inversion formula for F-nomial coefficients. Before supplying its proof, we generalize F-nomial coefficients to multi F-nomial coefficients and we give their combinatorial interpretation in cobweb posets language, as the number of maximal-disjoint blocks of the form sP_{k_1,k_2,...,k_s} of layer <Phi_1-->Phi_n>. Then we present inversion formula for F-nomial coefficients using multi F-nomial coefficients for all cobweb-admissible sequences. To this end we infer also some identities as conclusions of that inversion formula for the case of binomial,…
We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici à déterminer est la meilleure généralisation possible des factorielles et des coefficients du binôome. On s'interesse à plusieurs exemples, à leurs propriétés combinatoires, et aux differentes relations qu'ils mettent en jeu.
This article is devoted to the computation of Jack connection coefficients, a generalization of the connection coefficients of two classical commutative subalgebras of the group algebra of the symmetric group: the class algebra and the double coset algebra. The connection coefficients of these two algebraic structures are of significant interest in the study of Schur and zonal polynomials as well as the irreducible characters of the symmetric group and the zonal spherical functions. Furthermore they play an important role in combinatorics as they give the number of factorizations of a permutat…
Jack characters are a generalization of the characters of the symmetric groups; a generalization that is related to Jack symmetric functions. We investigate the structure coefficients for Jack characters; they are a generalization of the connection coefficients for the symmetric groups. More specifically, we study the cumulants which measure the discrepancy between these structure coefficients and the simplistic structure coefficients related to the disjoint product. We show that Jack characters satisfy approximate factorization property: their cumulants are of very small degree and the charac…
We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial coefficients is also presented.
Let $t$ be a fixed parameter and $x$ some indeterminate. We give some properties of the generalized binomial coefficients $\genfrac{<}{>}{0pt}{}{x}{k}$ inductively defined by $k/x \genfrac{<}{>}{0pt}{}{x}{k}= t\genfrac{<}{>}{0pt}{}{x-1}{k-1} +(1-t)\genfrac{<}{>}{0pt}{}{x-2}{k-2}$.
The q-binomial coefficients are the polynomial cousins of the traditional binomial coefficients, and a number of identities for binomial coefficients can be translated into this polynomial setting. For instance, the familiar vanishing of the alternating sum across row n of Pascal's triangle is captured by the so-called Gaussian Formula. In this paper, we find a q-binomial congruence which synthesizes this result and Fleck's congruence for binomial coefficients.
We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are divisible by arbitrarily large powers of prime $p$.
Abstract. We generalize the $b$-ary binomial coefficients with negative entries, which is based on the generating function obtained in early work. Besides an explicit expression involving the restricted partition, several properties such as symmetry, congruence and Pascal-like recurrence are studies. Finally, we also provide two different generalizations, partially satisfying Pascal-like recurrences.
We look at the asymptotic behavior of the coefficients of the $q$-binomial coefficients (or Gaussian polynomials) $\binom{a+k}{k}_q$, when $k$ is fixed. We give a number of results in this direction, some of which involve Eulerian polynomials and their generalizations.
We construct multiple $qt$-binomial coefficients and related multiple analogues of several celebrated families of special numbers in this paper. These multidimensional generalizations include the first and the second kind of $qt$-Stirling numbers, $qt$-Bell numbers, $qt$-Bernoulli numbers, $qt$-Catalan numbers and the $qt$--Fibonacci numbers. In the course of developing main properties of these extensions, we prove results that are significant in their own rights such as certain probability measures on the set of integer partitions.
The starting point for this work is an identity that relates the number of minimal matrices with prescribed 1-marginals and coefficient sequence to a linear combination of Kronecker coefficients. In this paper we provide a bijection that realizes combinatorially this identity. As a consequence we obtain an algorithm that to each minimal matrix associates a minimal component, with respect to the dominance order, in a Kronecker product, and a combinatorial description of the corresponding Kronecker coefficient in terms of minimal matrices and tableau insertion. Our bijection follows from a gener…
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpiński gasket that can be built as the limit set, for the Hausdorff distance, of a convergent sequence of normalized compact blocks extracted from Pascal triangle modulo $2$, we describe and study the first properties of the subset of $[0, 1] \times [0, 1]$ associated with this extended Pascal triangle modulo a prime $p$.
In a previous paper, we studied an overpartition analogue of Gaussian polynomials as the generating function for overpartitions fitting inside an $m \times n$ rectangle. Here, we add one more parameter counting the number of overlined parts, obtaining a two-parameter generalization $\overline{m+n \brack n}_{q,t}$ of Gaussian polynomials, which is also a $(q,t)$-analogue of Delannoy numbers. First we obtain finite versions of classical $q$-series identities such as the $q$-binomial theorem and the Lebesgue identity, as well as two-variable generalizations of classical identities involving Gauss…
We derive asymptotic formulas for central extended binomial coefficients, which are generalizations of binomial coefficients. To do so, we relate the exact distribution of the sum of independent discrete uniform random variables to the asymptotic distribution, obtained from the Central Limit Theorem and a local limit variant.
A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable polynomial $p$ with nonnegative coefficients. This fundamental inequality has been used to attack several counting and optimization problems. Here, we study a more general question: Given a stable multilinear polynomial $p$ with nonnegative coefficients and a set of monomials $S$, we show that if the polynomial obtained by summing up all monomials in $S$ is real st…
As is well-known, a generalization of the classical concept of the factorial $n!$ for a real number $x\in {\mathbb R}$ is the value of Euler's gamma function $Γ(1+x)$. In this connection, the notion of a binomial coefficient naturally arose for admissible values of the real arguments. By elementary means, it is proved a number of properties of binomial coefficients $\binom{r}α$ of real arguments $r,\,α\in {\mathbb R}$ such as analogs of unimodality, symmetry, Pascal's triangle, etc. for classical binomial coefficients. The asymptotic behavior of such generalized binomial coefficients of a spec…
