arXiv math/05032862005-03math.COcs.DM

Cobweb posets as noncommutative prefabs

A. K. Kwasniewski

备注：: 11 pages, 5 figures
发表信息：: Adv. Stud. Contemp. Math. vol. 14 (1) 2007. pp. 37-47

英文摘要：

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 characteristic graded subposets as primes. The schema are defined here via relaxing commutativity and associativity requirements imposed on the composition of prefabs by the fathers of this fertile concept. The construction and the very first basic properties of cobweb prefabs are pointed out in what follows. An another single valued commutative amd associative composision is also considered.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

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 prefabiants with such an another partial order that their Bell like numbers include Fibonacci triad sequences introduced recently by the present author in order to extend famous relation between binomial New…

2008-02-12cs.DMmath.CO

Characterization of Cobweb Posets as KoDAGs

The characterization of the large family of cobweb posets as DAGs and oDAGs is given. The dim 2 poset such that its Hasse diagram coincide with digraf of arbitrary cobweb poset is constructed.

2008-02-21cs.DMmath.CO

Characterization of the Fibonacci Cobweb Poset as oDAG

The characterization of fibonacci cobweb poset as d.a.g. and o.d.a.g. is given. The dim 2 poset such that its hasse diagram coincide with digraf of fibonacci cobweb poset is constructed.

2005-03-15cs.DMmath.CO

On incidence algebras description of cobweb posets

The explicite formulas for Mobius function and some other important elements of the incidence algebra of an arbitrary cobweb poset are delivered. For that to do one uses Kwasniewski's construction of his cobweb posets . The digraph representation of these cobweb posets constitutes a newly discovered class of orderable DAG's named here down KoDAGs with a kind of universality now being investigated. Namely cobweb posets' and thus KoDAGs's defining di-bicliques are links of any complete relations' chains.

2008-02-26cs.DMmath.CO

Reduced Incidence algebras description of cobweb posets and KoDAGs

After identifying the reduced incidence algebra of an arbitrary cobweb poset the very first properties of these algebras are being disclosed.

2008-02-29cs.DMmath.CO

On Characteristic Polynomials of the Family of Cobweb Posets

This note is a response to one of problems posed by A.K. Kwasniewski in one of his recent papers. Namely for the sequence of finite cobweb subposets, the looked for explicit formulas for corresponding sequence of characteristic polynomials are discovered and delivered here. The recurrence relation defining arbitrary family of charactristic polynomials of finite cobweb posets is also derived.

2008-02-19cs.DMmath.CO

更多相关论文收起更多论文

The First Ascent into the Incidence Algebra of the Fibonacci Cobweb Poset

The explicite formulas for möbiusien function and some other important elements of the incidence algebra are delivered. For that to do one uses kwaśniewski's construction of his fibonacci cobweb poset in the plane grid coordinate system.

2004-10-31cs.DMmath.CO

A note on mobiusien function and mobiusien inversion formula of fibonacci cobweb poset

The explicit formula for mobiusien function of fibonacci cobweb poset P is given for the first time by the use of definition of P in plane grid coordinate system.

2004-04-28cs.DMmath.CO

On Cobweb posets tiling problem

Kwasniewski's 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 and it entailes natural enquieres already formulated therein. In our note we response to one of those problems. This is a tiling problem. Our observations on tiling problem include proofs of tiling's existence for some cobweb-admissible sequences. We show also that not all cobwebs admit tiling as defined below.

2007-10-04cs.DMmath.CO

Cobweb posets - Recent Results

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 reported on here. The purpose of this presentation is to report on the progress in solving computational problems which are quite easily formulated for the new class of directed acyclic graphs interpreted as Hasse diagrams. The problems posed there and …

2011-01-08cs.DMmath.CO

Prefab posets` Whitney numbers

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 binom…

2005-10-03cs.DMmath.CO

On cobweb posets and their combinatorially admissible sequences

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.

2009-01-19cs.DMmath.CO

New type Stirling like numbers - an email style letter

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 extension so as to encompass the new type combinatorial objects from [2] as leading examples. Recently the present author had introduced also [6] two natural partial orders in there: one $\leq$ in grading-natural subsets of cobweb`s prefabs sets [2] and in the second proposal one endows the set sums of the so called "prefabiants" with such another partial o…

2008-02-11cs.DMmath.CO

On Cobweb Posets and Discrete F-Boxes Tilings

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 n…

2009-04-02cs.DMmath.CO

Some Cobweb Posets Digraphs' Elementary Properties and Questions

A digraph that represents reasonably a scheduling problem should be a directed acyclic graph. Here down we shall deal with special kind of graded $DAGs$ named $KoDAGs$. For their definition and first primary properties see $ [1]$, where natural join of directed biparted graphs and their corresponding adjacency matrices is defined and then applied to investigate cobweb posets and their $Hasse$ digraphs called $KoDAGs$. In this report we extend the notion of cobweb poset while delivering some elementary consequences of the description and observations established in $[1]$.

2008-12-23math.CO

An example of algebraization of analysis and Fibonacci cobweb poset characterization

In recent Kwasniewski's papers inspired by O. V. Viskov it was shown that the $ψ$-calculus in parts appears to be almost automatic, natural extension of classical operator calculus of Rota - Mullin or equivalently - of umbral calculus of Roman and Rota. At the same time this calculus is an example of the algebraization of the analysis - here restricted to the algebra of polynomials. The first part of the article is the review of the recent author's contribution. The main definitions and theorems of Finite Fibonomial Operator Calculus which is a special case of $ψ$-extented Rota's finite operat…

2007-11-03cs.DMmath.COmath.GM

Further developements in finite fibonomial calculus

Primary definitions, notation and general observations of finite fibonomial operator calculus (ffoc) are presented. Kwasniewski's combinatorial interpretation of fibonomial coefficients by the use of fibonacci cobweb poset is given. Some elements of incidence algebra of fibonacci cobweb poset are defined.

2004-10-27cs.DMmath.CO

Cobweb Posets and KoDAG Digraphs are Representing Natural Join of Relations, their diBigraphs and the Corresponding Adjacency Matrices

Natural join of $di-bigraphs$ that is directed biparted graphs and their corresponding adjacency matrices is defined and then applied to investigate the so called cobweb posets and their $Hasse$ digraphs called $KoDAGs$. $KoDAGs$ are special orderable directed acyclic graphs which are cover relation digraphs of cobweb posets introduced by the author few years ago. $KoDAGs$ appear to be distinguished family of $Ferrers$ digraphs which are natural join of a corresponding ordering chain of one direction directed cliques called $di-bicliques$. These digraphs serve to represent faithfully correspon…

2009-08-15math.CO

On cobweb posets most relevant codings

One considers here orderable acyclic digraphs named KoDAGs which represent the outmost general chains of dibicliques 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 well as chains of rectangular hyper-boxes in N^\infty. Neither of KoDAGs codings considered here is a poset isomorphism with Pi = <P, \leq>. Nevertheless every example of coding supplies a new view on possible investigation of KoDAGs properti…

2009-02-27cs.DMmath.CO

On natural join of posets properties and first applications

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 including very special and important the so called cobweb posets. The main aims of this article are the presentation of the authors update applications of natural join of posets in the domain of graded posets and summary of the general properties of natural join of posets with posing some questions arising on the way. Thus in this note apart from revealing some…

2009-08-22math.CO

Natural join construction of graded posets versus ordinal sum and discrete hyper boxes

One introduces here the natural join $P \os Q$ of graded posets $< P,\leq_P >$ and $< Q,\leq_Q >$ with correspondingly maximal and minimal sets being identical as expressed by ordinal sum $P\oplus Q$ apart from other definition and due to that one arrives at a simple proof of the $M{ö}bius $ function formula for cobweb posets. We also quote the other authors explicit formulas for the zeta matrix and its inverse for any graded posets with the finite set of minimal elements from earlier works of the author. These formulas are based on the formulas for cobweb posets and their $Hasse$ diagrams or …

2009-07-30math.CO