English
Related papers

Related papers: Prefab posets` Whitney numbers

200 papers

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…

Combinatorics · Mathematics 2008-02-15 A. Krzysztof Kwaśniewski

The notion of the Fibonacci cobweb poset from [1] has been naturally extended to any admissible sequence $F$ in [2] where it was also recognized that the celebrated prefab notion of Bender and Goldman [3] - (see also [4,5]) - admits such an…

Combinatorics · Mathematics 2010-11-16 A. K. Kwasniewski

A class of new type graded infinite posets with minimal element are considered. These so called cobweb posets introduced recently by the present author provide a wide range of new noncommutative prefab combinatorial schema with…

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

In this paper we introduce a family of partitions of the set of natural numbers, Fibonacci-like partitions. In particular, we introduce a Fibonacci-like partition in a number of parts corresponding to the Fibonacci numbers, the standard…

In addition to the three standard operations on posets which are dual of poset or ordinal and cardinal sums of partial ordered sets one adds the natural join of posets. This is especially natural natural join operation for graded posets…

Combinatorics · Mathematics 2009-09-30 A. Krzysztof Kwaśniewski

Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…

Combinatorics · Mathematics 2024-07-08 Yahia Djemmada , Abdelghani Mehdaoui , László Németh , László Szalay

A natural partial order on the set of prime numbers was derived by the author from the internal symmetries of the primary finite fields, independently of Ford a.a., who investigated Pratt trees for primality tests. It leads to a…

Number Theory · Mathematics 2014-07-25 Lucian M. Ionescu

In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between…

Combinatorics · Mathematics 2008-02-12 Hansheng Diao

The set $\Mfib$ of fibbinary numbers is defined via a bijection between the set $\BB{N}$ of natural numbers and $\Mfib$. Since the elements of $\Mfib$ do not exhaust $\BB{N}$, the structure of the complement $\overline{\Mfib}$ of $\Mfib$ in…

Number Theory · Mathematics 2024-06-19 A. J. Macfarlane

The main purpose of this article is to pose three problems which are easy to be formulated in an elementary way. These problems which are specifically important also for the new class of partially ordered sets seem to be not yet solved.

Combinatorics · Mathematics 2009-01-19 A. K. Kwasniewski

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.

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

Combinatorics · Mathematics 2018-06-12 Mahir Bilen Can , Yonah Cherniavsky

We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…

Combinatorics · Mathematics 2010-03-05 Milan Janjic

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…

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

This paper defines the set fib of fibbinary numbers and displays its structure in the form of a table of a specialised type, and in array form. It uses the Zeckendorf representation $n \in \mathbf{N}$ to define a bijection $\mathcal{Z}$…

Combinatorics · Mathematics 2024-05-29 A. J. Macfarlane

F-boxes defined in [6] as hyper-boxes in N^{\infty} discrete space were applied here for the geometric description of the cobweb posetes Hasse diagrams tilings. The F-boxes edges sizes are taken to be values of terms of natural numbers'…

Combinatorics · Mathematics 2009-04-02 M. Dziemianczuk

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Combinatorics · Mathematics 2012-06-26 Robert S. Coulter , Todd Gutekunst

In this paper, we introduce a metric on the set of pairs of coprime natural numbers. We explicitly construct a quasi-isometric embedding from the set of natural numbers into this metric space via Fibonacci numbers.

Metric Geometry · Mathematics 2026-02-13 Mitsuaki Kimura

We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…

Number Theory · Mathematics 2023-04-18 H. E. A. Campbell , David L. Wehlau

We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…

Combinatorics · Mathematics 2007-05-23 Miklós Bóna , Rodica Simion
‹ Prev 1 2 3 10 Next ›