2000 character limit reached
On Characteristic Polynomials of the Family of Cobweb Posets
Published 19 Feb 2008 in math.CO and cs.DM | (0802.2696v1)
Abstract: This note is a response to one of problems posed by A.K. Kwasniewski in one of his 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.