[Paper Review] On Cobweb Posets and Discrete F-Boxes Tilings

Maciej Dziemiańczuk|ArXiv.org|Feb 24, 2008

Advanced Combinatorial Mathematics14 references11 citations

TL;DR

This paper introduces F-boxes—discrete hyper-boxes in N^∞ with edge lengths defined by a sequence F—to geometrically model cobweb poset Hasse diagrams. It proves the existence of F-tilings (partitions into sub-boxes of form σV_m) for admissible F-sequences, reformulates the tiling problem as a clique problem in a specially constructed graph, and establishes that the number of tilings equals the number of maximal cliques in this graph, with applications to binomial, fibonomial, and Gaussian coefficients.

ABSTRACT

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' valued sequence F. The problem of partitions of hyper-boxes represented by graphs into blocks of special form is considered and these are to be called F-tilings. The proof of such tilings' existence for certain sub-family of admissible sequences F is delivered. The family of F-tilings which we consider here includes among others F = Natural numbers, Fibonacci numbers, Gaussian integers with their corresponding F-nomial (Binomial, Fibonomial, Gaussian) coefficients. Extension of this tiling problem onto the general case multi F-nomial coefficients is here proposed. Reformulation of the present cobweb tiling problem into a clique problem of a graph specially invented for that purpose - is proposed here too. To this end we illustrate the area of our reconnaissance by means of the Venn type map of various cobweb sequences families.

Motivation & Objective

• To provide a geometric interpretation of cobweb poset Hasse diagrams using discrete F-boxes in N^∞.
• To solve the cobweb tiling problem by partitioning F-boxes into sub-boxes of form σV_m.
• To prove the existence of such F-tilings for a sub-family of F-admissible sequences.
• To reformulate the tiling problem as a clique problem in a graph constructed from maximal path intersections in cobweb blocks.
• To extend the tiling framework to multi-F-nomial coefficients and generalize combinatorial interpretations.

Proposed method

• Define m-dimensional F-box V_{m,n} as a product of intervals [k_F] × [(k+1)_F] × ... × [n_F], where k = n−m+1.
• Introduce F-admissible sequences as those for which F-nomial coefficients are natural numbers, ensuring valid tiling partitions.
• Use F-nomial coefficients {{n}   {m}}_F to count the number of σV_m sub-boxes in a κ-partition of V_{m,n}.
• Construct a graph G(⟨Φ_k→Φ_n⟩) whose vertices are blocks of form σP_m and edges connect blocks with disjoint maximal path sets.
• Prove that a cobweb tiling corresponds exactly to a clique of size d = m_F! in G(⟨Φ_k→Φ_n⟩), with d = {{n} {m}}_F.
• Use a Venn-type map to classify cobweb sequence families, including admissible, GCD-morphic, and tiling-specific sequences.

Experimental results

Research questions

• RQ1 For which F-sequences does an F-tiling of an m-dimensional F-box V_{m,n} exist?
• RQ2 How can the number of F-tilings be characterized combinatorially using F-nomial coefficients?
• RQ3 Can the cobweb tiling problem be reformulated as a clique problem in a graph derived from maximal path sets of cobweb blocks?
• RQ4 What is the relationship between the number of maximal cliques in the constructed graph and the number of F-tilings?
• RQ5 How do multi-F-nomial coefficients generalize the tiling framework beyond standard F-nomial coefficients?

Key findings

• An F-tiling of an m-dimensional F-box V_{m,n} exists if and only if the sequence F is F-admissible, i.e., all F-nomial coefficients {{n} {m}}_F are natural numbers.
• The number of F-tilings of a layer ⟨Φ_k→Φ_n⟩ is equal to the number of maximal cliques in the graph G(⟨Φ_k→Φ_n⟩), with clique size d = m_F!.
• The number of sub-boxes of form σV_m in a κ-partition of V_{m,n} is exactly {{n} {m}}_F, which is a natural number for F-admissible sequences.
• The tiling problem is equivalent to finding a clique of size d = m_F! in the graph G(⟨Φ_k→Φ_n⟩), where vertices represent blocks σP_m and edges indicate disjointness of maximal path sets.
• The family of F-tilings includes well-known cases such as binomial (natural numbers), fibonomial (Fibonacci), and Gaussian coefficients (Gaussian integers), all unified under the F-tiling framework.
• The Venn-type map in Figure 15 classifies cobweb sequences into families such as admissible, GCD-morphic, and tiling-specific sequences, with open problems remaining on the full boundary of tiling sequences.