Prefab posets' Whitney numbers

نویسنده

  • A. K. Kwasniewski
چکیده

We introduce a natural partial order ≤ in structurally natural finite subsets the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling-like numbers' triangular array-are then calculated and the explicit formula for them is provided. Next-in the second construction-we endow the set sums of prefabiants with such an another partial order that their their Bell-like numbers include Fibonacci triad sequences introduced recently by the present author in order to extend famous relation between binomial Newton coefficients and Fibonacci numbers onto the infinity of their relatives among which there are also the Fibonacci triad sequences and binomial-like coefficients (incidence coefficients included).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

First Observations on Prefab Posets Whitney Numbers

We introduce a natural partial order ≤ in structurally natural finite subsets of the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling-like numbers‘ triangular array are then calculated and the explicit formula for them is provided. Next in the second construction we endow the set sums of pr...

متن کامل

Cobweb posets as noncommutative prefabs

A class of new type graded infinite posets with minimal element is introduced. These so called cobweb posets proposed recently by the present author constitute a wide range of new noncommutative and nonassociative prefab combinatorial schemes‘ examples with characteristic graded sub-posets as primes. These schemes are defined here via relaxing commutativity and associativity requirements impose...

متن کامل

Partition Lattice q-Analogs Related to q-Stirling Numbers

Abstract We construct a family of partially ordered sets (posets) that are q-analogs of the set partition lattice. They are different from the q-analogs proposed by Dowling [5]. One of the important features of these posets is that their Whitney numbers of the first and second kind are just the q-Stirling numbers of the first and second kind, respectively. One member of this family [4] can be c...

متن کامل

Discrete Entropy Power Inequalities via Sperner Theory

A ranked poset is called strongly Sperner if the size of k-family cannot exceed the sum of k-largest Whitney numbers. In the sense of a function ordering, a function f is (weakly) majorized by g if the the sum of k-largest values in f cannot exceed the sum of k-largest values in g. Two definitions arise from different contexts, but they have strong similarities in their own meanings. Furthermor...

متن کامل

Whitney Homology of Semipure Shellable Posets

We generalize results of Calderbank, Hanlon and Robinson on the representation of the symmetric group on the homology of posets of partitions with restricted block size. Calderbank, Hanlon and Robinson consider the cases of block sizes that are congruent to 0 mod d and 1 mod d for fixed d . We derive a general formula for the representation of the symmetric group on the homology of posets of pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/math/0510027  شماره 

صفحات  -

تاریخ انتشار 2005