相关论文: Derived Semidistributive Lattices
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. The paper studies Rogers semilattices, i.e. upper semilattices induced by the reducibility between numberings, for families…
We prove that every finite distributive lattice $D$ can be represented as the congruence lattice of a rectangular lattice $K$ in which all congruences are principal. We verify this result in a stronger form as an extension theorem.
We prove in a large number of cases, that a Zariski dense discrete subgroup of a simple real algebraic group $G$ which contains a higher rank lattice is a lattice in the group $G$. For example, we show that a Zariski dense subgroup of…
In 1980, U. Faigle introduced a sort of finite geometries on posets that are in bijective correspondence with finite semimodular lattices. His result has almost been forgotten in lattice theory. Here we simplify the axiomatization of these…
A specialization semilattice is a join semilattice together with a coarser preorder $ \sqsubseteq $ satisfying an appropriate compatibility condition. If $X$ is a topological space, then $(\mathcal P(X), \cup, \sqsubseteq )$ is a…
We continue some recent investigations of W. Dziobiak, J. Jezek, and M. Maroti. Let G=(G,\cdot) be a commutative group. A semilattice over G is a semilattice enriched with G as a set of unary operations acting as semilattice automorphisms.…
For each permutation $w$, we consider the set $\mathrm{PD}(w)$ of reduced pipe dreams for $w$, partially ordered so that cover relations correspond to (generalized) chute moves. Settling a conjecture of Rubey from 2012, we prove that…
A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs).…
Given a finite group $G$, we denote by $L(G)$ the subgroup lattice of $G$ and by ${\rm Isolated}(G)$ the set of isolated subgroups of $G$. In this note, we describe finite groups $G$ such that $|{\rm Isolated}(G)|=|L(G)|-k$, where…
In this paper, the class of quasicomplemented residuated lattices is introduced and investigated, as a subclass of residuated lattices in which any prime filter not containing any dense element is a minimal prime filter. The notion of…
We consider the lattice of subsemigroups of the general linear group over an Artinian ring containing the group of diagonal matrices and show that every such semigroup is actually a group.
We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretation of the order given by this lattice, using (not…
For a finite real reflection group $W$ with Coxeter element $\gamma$ we give a uniform proof that the closed interval, $[I, \gamma]$ forms a lattice in the partial order on $W$ induced by reflection length. The proof involves the…
A subsemigroup S of a semigroup Q is a left order in Q and Q is a semigroup of left quotients of S if every element of Q can be expressed as a# b where a and b are elements of S and if, in addition, every element of S that is square…
We adopt a new perspective on the tensor product of arbitrary semi-lattices. Our basic construction exploits a description of semi-lattices in terms of bi-extensional Chu spaces associated to a target space defined to be the boolean domain.…
This paper pursues an investigation on groups equipped with an $L$-ordered relation, where $L$ is a fixed complete complete Heyting algebra. First, by the concept of join and meet on an $L$-ordered set, the notion of an $L$-lattice is…
A planar semimodular lattice $L$ is \emph{slim} if $\mathbf{M}_3$ is not a sublattice of $L$. In a recent paper, G. Cz\'edli introduced a very powerful diagram type for slim, planar, semimodular lattices. This short note proves the…
Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element…
For a distributive join-semilattice S with zero, a S-valued poset measure on a poset P is a map m:PxP->S such that m(x,z) <= m(x,y)vm(y,z), and x <= y implies that m(x,y)=0, for all x,y,z in P. In relation with congruence lattice…