Related papers: Sub-representation of posets
We discuss some aspects of the theory of subelliptic estimates.
We introduce a construction called realisation which transforms posets into posets. We show that realisations share several key features with upper semilattices. For example, we define local dimensions of points in a poset and show that…
The notion of relative cuspidality for distinguished representations attached to $p$-adic symmetric spaces is introduced. A characterization of relative cuspidality in terms of Jacquet modules is given and a generalization of Jacquet's…
In the present paper a new concept of representability is introduced, which can be applied to not total and also to intransitive relations (semiorders in particular). This idea tries to represent the orderings in the simplest manner,…
In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…
In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them…
A poset P is called reversible if every order preserving bijective self map of P is an order automorphism. P is called hereditarily reversible if every subposet of P is reversible. We give a complete characterization of hereditarily…
We introduce the concept of protometric and present some properties of protometrics.
We introduce some deformations of the biset category and prove a semisimplicity property. We also consider another group category, called the subgroup category, whose morphisms are subgroups of direct products, the composition being star…
We define and study the completely strongly porous at 0 subsets of R^{+}. Several characterizations of these subsets are obtained, among them the description via an universal property and structural one.
We consider the following problem in which a given number of items has to be chosen from a predefined set. Each item is described by a vector of attributes and for each attribute there is a desired distribution that the selected set should…
We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…
The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…
It is known that nontrivial ultraproducts of complete partially ordered sets (posets) are almost never complete. We show that complete additivity of functions is preserved in ultraproducts of posets. Since failure of this property is…
We define a family of combinatorial objects, which we call Baxter posets. We prove that Baxter posets are counted by the Baxter numbers by showing that they are the adjacency posets of diagonal rectangulations. Given a diagonal…
We introduce a generalization of representations of quivers that contains also representations of posets, vectorspace problems and other matrix problems. Many examples, some of which are given in the paper, show that the language of marked…
A poset is $(\omega,C)$-representable if it can be embedded into a field of sets in such a way that all existing joins, and all existing \emph{finite} meets are preserved. We show that the class of $(\omega,C)$-representable posets cannot…
We study holonomy representations admitting a pair of supplementary faithful sub-representations. In particular the cases where the sub-representations are isomorphic respectively dual to each other are treated. In each case we have a…
We give a broad survey of inequalities for the number of linear extensions of finite posets. We review many examples, discuss open problems, and present recent results on the subject. We emphasize the bounds, the equality conditions of the…
We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…