相关论文: On implications in sectionally pseudocomplemented …
We show that the product of any number of sequentially pseudocompact topological spaces is still sequentially pseudocompact. The definition of sequential pseudocompactness can be given in (at least) two ways: we show their equivalence. Some…
We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…
A partial matrix over a field $\mathbb{F}$ is a matrix whose entries are either an element of $\mathbb{F}$ or an indeterminate and with each indeterminate only appearing once. A completion is an assignment of values in $\mathbb{F}$ to all…
A new model, in terms of finite bipartite graphs, of the free pseudosemilattice is presented. This will then be used to obtain several results about the variety SPS of all strict pseudosemilattices: (i) an identity basis for SPS is found,…
The aim of this short note is to develop a (co)homology theory for topological spaces together with the specialisation preorder. A known way to construct such a (co)homology is to define a partial order on the topological space starting…
In this paper, we show that given a weakly dicomplemented lattice (WDL) $\mathcal{L}=(L; \vee, \wedge, ^{\Delta}, ^{\nabla}, 0, 1)$, $^{\Delta}$ induces a structure of a dual weakly complemented lattice in the lattice $(F(L), \subseteq)$ of…
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 introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…
We introduce and characterize various gluing constructions for residuated lattices that intersect on a common subreduct, and which are subalgebras, or appropriate subreducts, of the resulting structure. Starting from the 1-sum construction…
The semi-tensor product (STP) of matrices is extended to the STP of hypermatrices. Some basic properties of the STP of matrices are extended to the STP of hypermatrices. The hyperdeterminant of hypersquares is introduced. Some algebraic and…
Generally, in any human field, a Smarandache Structure on a set A means a weak structure W on A such that there exists a proper subset B which is embedded with a stronger structure S. By proper subset one understands a set included in A,…
The collection CL(T) of nonempty convex sublattices of a lattice T ordered by bi-domination is a lattice. We say that T has the fixed point property for convex sublattices (CLFPP for short) if every order preserving map f from T to CL(T)…
We discuss some notions of compactness and convergence relative to a specified family F of subsets of some topological space X. The two most interesting particular cases of our construction appear to be the following ones. (1) The case in…
In this paper we show that the set of closure relations on a finite poset P forms a supersolvable lattice, as suggested by Rota. Furthermore this lattice is dually isomorphic to the lattice of closed sets in a convex geometry (in the sense…
We consider extension of a closure system on a finite set S as a closure system on the same set S containing the given one as a sublattice. A closure system can be represented in different ways, e.g. by an implicational base or by the set…
Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…
We introduce a general notion of covering property, of which many classical definitions are particular instances. Notions of closure under various sorts of convergence, or, more generally, under taking kinds of accumulation points, are…
For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…
Special partial matchings (SPMs) are a generalisation of Brenti's special matchings. Let a \emph{pircon} be a poset in which every non-trivial principal order ideal is finite and admits an SPM. Thus pircons generalise Marietti's zircons. We…
In order theory, partially ordered sets are only equipped with one relation which decides the entire structure/Hasse diagram of the set. In this paper, we have presented how partially ordered sets can be studied under simultaneous partially…