#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2007

2016

- This year (0)
- Last 5 years (7)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- A. Krzysztof Kwasniewski, Maciej Dziemianczuk
- ArXiv
- 2008

SUMMARY Cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in the source papers ([6,7] and references therein to the first author).[7,6,8] include natural enquires to be… (More)

- Maciej Dziemianczuk
- Discrete Mathematics
- 2014

- M. Dziemiańczuk
- 2011

The so-called ζ-analogues of the Stirling numbers of the first and second kind are considered. These numbers cover ordinary binomial and Gaussian coefficients, p, q-Stirling numbers and other combinatorial numbers studied with the help of object selection, Ferrers diagrams and rook theory. Our generalization includes these and now also the p, q-binomial… (More)

- Maciej Dziemianczuk
- Discrete Mathematics
- 2016

- Maciej Dziemianczuk
- FCS
- 2008

In this note further clue decisive observations on cobweb admissible sequences are shared with the audience. In particular an announced proof of the Theorem 1 (by Dziemia´nczuk) from [1] announced in India-Kolkata-December 2007 is delivered here. Namely here and there we claim that any cobweb admissible sequence F is at the point product of primary cobweb… (More)

- Maciej Dziemianczuk
- ArXiv
- 2008

Responding to Kwa´sniewski's cobweb posets' problems posed in [3, 4] we present here some results on one of them-namely on Cobweb Tiling Problem. Kwa´sniewski cobweb posets with tiling property are designated-coded by their correspondent tiling sequences. We show that the family of all cobweb tiling sequences includes Natural numbers, Fibonacci numbers,… (More)

- M. Dziemianczuk
- 2008

In response to [7], 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 σP k 1 ,k 2 ,...,ks of layer Φ 1 → Φ n. Then… (More)

- Maciej Dziemianczuk, Wieslaw Bajguz
- ArXiv
- 2008

This note is a response to one of the problems posed by Kwa´sniewski in [1, 2], see also [3] i.e. GCD-morphic Problem III. We show that any GCD-morphic sequence F is at the point product of primary GCD-morphic sequences and any GCD-morphic sequence is encoded by natural number valued sequence satisfying condition (C1). The problem of general importance-for… (More)

- A. K. Kwasniewski, Maciej Dziemianczuk
- ArXiv
- 2008

One considers here orderable acyclic digraphs named KoDAGs which represent the outmost general chains of di-bi-cliques denoting thus the outmost general chains of binary relations. Because of this fact KoDAGs start to become an outstanding concept of nowadays investigation. We propose here examples of codings of KoDAGs looked upon as infinite hyper-boxes as… (More)

F-nomial coefficients encompass among others well-known binomial coefficients or Gaussian coefficients that count subsets of finite set and subspaces of finite vector space respectively. Here, the so called F-cobweb tiling sequences N (α) are considered. For such specific sequences a new interpretation with respect to Kwa´sniewski general combinatorial… (More)