Related papers: Reduced Incidence algebras description of cobweb p…
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…
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…
The incidence algebra of a partially ordered set (poset) supports in a natural way also a coalgebra structure, so that it becomes a m-weak bialgebra even a m-weak Hopf algebra with M\"obius function as antipode. Here m-weak means that…
The explicite formulas for m\"{o}biusien function and some other important elements of the incidence algebra are delivered. For that to do one uses kwa\'sniewski's construction of his fibonacci cobweb poset in the plane grid coordinate…
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.
Several general properties, concerning reduction algebras - rings of definition and algorithmic efficiency of the set of ordering relations - are discussed. For the reduction algebras, related to the diagonal embedding of the Lie algebra…
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…
We compute the Hochschild cohomology of the reduced incidence algebras such as the algebra of formal power series, the algebra of exponential power series, the algebra of Eulerian power series, and the algebra of formal Dirichlet series. We…
The first aim of this paper is to show that any finite-dimensional reductive Lie algebra and its finite-dimensional completely reducible representation can be embedded into some PC Lie algebra. The second aim is to find the structure of a…
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.
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…
Coxeter polynomials are important homological invariants that are defined for a large class of finite-dimensional algebras. It is of particular interest to develop methods to compute these polynomials. We define the notion of insertion of a…
We establish simple combinatorial descriptions of the radical and irreducible representations specifically for the descent algebra of a Coxeter group of type $D$ over any field.
We consider the functions in two variables on an arbitrary poset, for which the convolution operation is defined. We obtain the generalization of incidence algebra and describe its properties: invertibility, the Jackobson radical,…
Acyclic categories were introduced by Kozlov and can be viewed as generalised posets. Similar to posets, one can define their incidence algebras and a related topological complex. We consider the incidence algebra of either a poset or…
The paper studies the structure of restricted hom-Lie algebras. More specifically speaking, we first give the equivalent definition of restricted hom-Lie algebras. Second, we obtain some properties of $p$-mappings and restrictable hom-Lie…
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…
In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…
This paper gives an overview of some basic properties of Leibniz algebras. Some of the results were known earlier, but in the article they are accompanied by new simple proofs. Some of the results are new. The article can be viewed as a…