相关论文: The lattice of closure relations of a poset
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex…
In this paper we introduce and study the poset of equivalence classes of subgroups of a finite group $G$, induced by the isomorphism relation. This contains the well-known lattice of solitary subgroups of $G$. We prove that in several…
In this paper we discuss the notion of completeness of topologized posets and survey some recent results on closedness properties of complete topologized semilattices.
Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…
We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…
Given a poset $P$ with at least two elements and a group $G$, there exists a selfdual lattice of length 16 such that the collection of its principal congruences is order isomorphic to $P$ while its automorphism group to $G$.
A closure endomorphism of a Hilbert algebra A is a mapping that is simultaneously an endomorphism of and a closure operator on A. It is known that the set CE of all closure endomorphisms of A is a distributive lattice where the meet of two…
This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…
Primitive positive constructions have been introduced in recent work of Barto, Opr\v{s}al, and Pinsker to study the computational complexity of constraint satisfaction problems. Let $\mathfrak P_{\operatorname{fin}}$ be the poset which…
In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
Motivated by Kohno's result on the holonomy Lie algebra of a hyperplane arrangement, we define the holonomy Lie algebra of a finite geometric lattice in a combinatorial way. For a solvable pair of lattices, we show that the holonomy Lie…
Building sets were introduced in the study of wonderful compactifications of hyperplane arrangement complements and were later generalized to finite meet-semilattices. Convex geometries, the duals of antimatroids, offer a robust…
Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.
We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined…
We introduce a solvable lattice model for supersymmetric LLT polynomials, also known as super LLT polynomials, based upon particle interactions in super n-ribbon tableaux. Using operators on a Fock space, we prove a Cauchy identity for…
A classical tensor product $A \,\otimes\, B$ of complete lattices $A$ and $B$, consisting of all down-sets in $A \times B$ that are join-closed in either coordinate, is isomorphic to the complete lattice $Gal(A,B)$ of Galois maps from $A$…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
For any polynomial f with complex coefficients we find a remarkable subset of poles of the motivic zeta function. It is combinatorially determined by any log resolution and it admits an intrinsic interpretation in terms of contact loci of…
Earlier an arbitrary poset $P$ was proved to be isomorphic to the collection of subsets of a space $M$ with two closures which are closed in the first closure and open in the other. As a space $M$ for this representation an algebraic dual…