相关论文: On blockers in bounded posets

The Choquet integral w.r.t. a capacity can be seen in the finite case as a parsimonious linear interpolator between vertices of $[0,1]^n$. We take this basic fact as a starting point to define the Choquet integral in a very general way,…

Given a countable model of set theory, we study the structure of its generic multiverse, the collection of its forcing extensions and ground models, ordered by inclusion. Mostowski showed that any finite poset embeds into the generic…

Let $H$ be a real Hilbert space. In this short note, using some of the properties of bounded linear operators with closed range defined on $H$, certain bounds for a specific convex subset of the solution set of infinite linear…

For posets $P$ and $Q$, extremal and saturation problems about weak and strong $P$-free subposets of $Q$ have been studied mostly in the case $Q$ is the Boolean poset $Q_n$, the poset of all subsets of an $n$-element set ordered by…

We consider problems concerning the partial order structure of the set of spreading models of Banach spaces. We construct examples of spaces showing that the possible structure of these sets include certain classes of finite semi-lattices…

We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees form a copy of the dense linear order…

We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the…

We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are…

In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small…

In this paper we discuss the properties of the biordered set obtained from a complemented modular lattice and defines an operation using the sandwich elements of the biordered set. Further we describe a biordered subset satisfying certain…

1. For many regular cardinals lambda (in particular, for all successors of singular strong limit cardinals, and for all successors of singular omega-limits), for all n in {2,3,4, ...} : There is a linear order L such that L^n has no…

Ultrafilters are useful mathematical objects having applications in nonstandard analysis, Ramsey theory, Boolean algebra, topology, and other areas of mathematics. In this note, we provide a categorical construction of ultrafilters in terms…

Continuing with the authors concept (and results) of defining independence for columns of a boolean and superboolean matrix, we apply this theory to finite lattices and finite posets, introducing boolean and superboolean matrix…

The hypergraph states are pure multipartite quantum states corresponding to a hypergraph. It is an equal superposition of the states belonging to the computational basis. Given any hypergraph, we can construct a hypergraph state determined…

We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…

We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…

Bolytropes are bounded subsets of an affine building that consist of all points that have distance at most $r$ from some polytrope. We prove that the points of a bolytrope describe the set of all invariant lattices of a bolytrope order,…

We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.

Given a complemented poset P, we can assign to every element x of P the set x^+ of all its complements. We study properties of the operator ^+ on P, in particular, we are interested in the case when x^+ forms an antichain or when ^+ is…

We prove that the set of permutations sorted by a stack of depth $t \geq 3$ and an infinite stack in series has infinite basis, by constructing an infinite antichain. This answers an open question on identifying the point at which, in a…