Isomorphisms and derivations of partial flag incidence algebras

Let [Formula: see text] and [Formula: see text] be finite posets and [Formula: see text] a commutative unital ring. In the case where [Formula: see text] is indecomposable, we prove that the [Formula: see text]-linear isomorphisms between partial flag incidence algebras [Formula: see text] and [Formula: see text] are exactly those induced by poset isomorphisms between [Formula: see text] and [Formula: see text]. We also show that the [Formula: see text]-linear derivations of [Formula: see text] are trivial.

Residuation in finite posets

When an algebraic logic based on a poset instead of a lattice is investigated then there is a natural problem how to introduce implication to be everywhere defined and satisfying (left) adjointness with conjunction. We have already studied this problem for the logic of quantum mechanics which is based on an orthomodular poset or the logic of quantum effects based on a so-called effect algebra which is only partial and need not be lattice-ordered. For this, we introduced the so-called operator residuation where the values of implication and conjunction need not be elements of the underlying poset, but only certain subsets of it. However, this approach can be generalized for posets satisfying more general conditions. If these posets are even finite, we can focus on maximal or minimal elements of the corresponding subsets and the formulas for the mentioned operators can be essentially simplified. This is shown in the present paper where all theorems are explained by corresponding examples.

HEREDITARILY ANTISYMMETRIC OPERATOR ALGEBRAS

We introduce a notion of ‘hereditarily antisymmetric’ operator algebras and prove a structure theorem for them in finite dimensions. We also characterize those operator algebras in finite dimensions which can be made upper triangular and prove matrix analogs of the theorems of Dilworth and Mirsky for finite posets. Some partial results are obtained in the infinite dimensional case.

A dual Ramsey theorem for finite ordered oriented graphs

In contrast to the abundance of “direct” Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a meaningful dual Ramsey result. In this paper we prove a dual Ramsey theorem for finite ordered oriented graphs. Instead of embeddings, which are crucial for “direct” Ramsey results, we consider a special class of surjective homomorphisms between finite ordered oriented graphs. Since the setting we are interested in involves both structures and morphisms, all our results are spelled out using the reinterpretation of the (dual) Ramsey property in the language of category theory.

Cutting Convex Polytopes by Hyperplanes

Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the original polytope are hereditary to its subpolytopes obtained by a cut. In this work, we devote our attention to all the separating hyperplanes for some given polytope (integral and convex) and study the existence and classification of such hyperplanes. We prove the existence of separating hyperplanes for the order and chain polytopes for any finite posets that are not a single chain, and prove there are no such hyperplanes for any Birkhoff polytopes. Moreover, we give a complete separating hyperplane classification for the unit cube and its subpolytopes obtained by one cut, together with some partial classification results for order and chain polytopes.

Decomposition Spaces and Restriction Species

We show that Schmitt’s restriction species (such as graphs, matroids, posets, etc.) naturally induce decomposition spaces (a.k.a. unital $2$-Segal spaces), and that their associated coalgebras are an instance of the general construction of incidence coalgebras of decomposition spaces. We introduce directed restriction species that subsume Schmitt’s restriction species and also induce decomposition spaces. Whereas ordinary restriction species are presheaves on the category of finite sets and injections, directed restriction species are presheaves on the category of finite posets and convex maps. We also introduce the notion of monoidal (directed) restriction species, which induce monoidal decomposition spaces and hence bialgebras, most often Hopf algebras. Examples of this notion include rooted forests, directed graphs, posets, double posets, and many related structures. A prominent instance of a resulting incidence bialgebra is the Butcher–Connes–Kreimer Hopf algebra of rooted trees. Both ordinary and directed restriction species are shown to be examples of a construction of decomposition spaces from certain cocartesian fibrations over the category of finite ordinals that are also cartesian over convex maps. The proofs rely on some beautiful simplicial combinatorics, where the notion of convexity plays a key role. The methods developed are of independent interest as techniques for constructing decomposition spaces.