English
Related papers

Related papers: A Distributive Lattice Cover for Semilattices

200 papers

We characterise the Priestley spaces corresponding to affine complete bounded distributive lattices. Moreover we prove that the class of affine complete bounded distributive lattices is closed under products and free products. We show that…

Logic · Mathematics 2007-05-31 Dominic van der Zypen

Let $\calM=\Gamma\bs \calH^{(n)}$, where $\calH^{(n)}$ is a product of $n+1$ hyperbolic planes and $\Gamma\subset\PSL(2,\bbR)^{n+1}$ is an irreducible cocompact lattice. We consider closed geodesics on $\calM$ that propagate locally only in…

Number Theory · Mathematics 2010-08-31 Dubi Kelmer

We describe spaces of essential finite height (measured) laminations in a surface $S$ using a parameter space we call $\mathbb S$, an ordered semi-ring. We show that for every finite height essential lamination $L$ in $S$, there is an…

Geometric Topology · Mathematics 2014-04-15 Ulrich Oertel

This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…

Rings and Algebras · Mathematics 2013-04-02 G. Grätzer , E. T. Schmidt

We introduce the notion of decomposable locally conformally product (LCP) manifolds and characterize those which are defined on quotients of Riemannian Lie groups by co-compact lattices.

Differential Geometry · Mathematics 2024-12-25 Brice Flamencourt , Andrei Moroianu

A rack is a set together with a self-distributive bijective binary operation. In this paper, we give a positive answer to a question due to Heckenberger, Shareshian and Welker. Indeed, we prove that the lattice of subracks of a rack is…

Combinatorics · Mathematics 2018-02-23 Amir Saki , Dariush Kiani

It is an easy observation that every residuated lattice is in fact a semiring because multiplication distributes over join and the other axioms of a semiring are satisfied trivially. This semiring is commutative, idempotent and simple. The…

Rings and Algebras · Mathematics 2018-09-21 Ivan Chajda , Helmut Länger

This is a survey of characterizations and relationships between some properties of lattices, particularly the modular, Arguesian, linear, and distributive properties, but also some other related properties. The survey emphasizes finite and…

History and Overview · Mathematics 2024-04-15 Dale R. Worley

Orbital semilattices are introduced as bounded semilattices that are, in addition, equipped with an outer multiplication (a semigroup action) and diagonals (a concept borrowed from cylindric algebra), where each semilattice element has a…

General Mathematics · Mathematics 2022-06-17 Jens Kötters , Stefan E. Schmidt

For two subsets S and T of a given lattice L, we define a relative distributive (modular) property over L, that underlies a large family including the usual class of distributive (modular) lattices. Our proposed class will be called…

Combinatorics · Mathematics 2023-12-07 M. R. Emamy-K. , Gustavo A. Melendez Rios

We characterize the isomorphism types of principal ideals of the Turing degrees below 0' that are lattices as the lattices with a Sigma-0-3 presentation, by showing that each Sigma-0-3 presentable bounded upper semilattice is isomorphic to…

Logic · Mathematics 2011-07-15 Bjørn Kjos-Hanssen

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…

Combinatorics · Mathematics 2014-12-25 Jeremy F. Alm , John W. Snow

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…

Rings and Algebras · Mathematics 2022-08-23 Paolo Lipparini

We announce various results concerning the structure of compactly generated simple locally compact groups. We introduce a local invariant, called the structure lattice, which consists of commensurability classes of compact subgroups with…

Group Theory · Mathematics 2014-05-15 Pierre-Emmanuel Caprace , Colin D. Reid , George A. Willis

Finite distributive lattices whose join-meet ideals are of K\"onig type will be classified. Furthermore, a class of polyominoes whose polyomino ideals are of K\"onig type will be studied.

Commutative Algebra · Mathematics 2022-02-22 Jürgen Herzog , Takayuki Hibi

Let $\Delta$ be a cocompact lattice in $\mathsf{Sp}(m,1)$, $m \geq 2$, or $F_{4}^{(-20)}$. We exhibit examples of finitely generated subgroups of $\Delta \times \Delta$ with positive first Betti number all of whose discrete faithful…

Group Theory · Mathematics 2023-03-10 Konstantinos Tsouvalas

This paper focuses on distributive uninorms, which induce structures of commutative ordered semirings. We will show that the second uninorm must be locally internal on $A(e)$, and will present a complete characterization of the structure of…

General Mathematics · Mathematics 2024-10-29 Wenwen Zong , Yong Su , Hua-Wen Liu

We propose an algebraic and a geometric classification of euclidean isodual lattices of fixed rank. First, we prove that these lattices are distribued according to a finite number of algebraic types. Second, we show that they are…

Number Theory · Mathematics 2014-11-11 Christophe Bavard

M.S. Rao recently investigated some sorts of special filters in distributive pseudocomplemented lattices. In our paper we extend this study to lattices which need neither be distributive nor pseudocomplemented. For this sake we define a…

Rings and Algebras · Mathematics 2023-06-19 Ivan Chajda , Miroslav Kolařík , Helmut Länger

The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA. It is shown that compact bisimilar PA form lattices. These…

Formal Languages and Automata Theory · Computer Science 2014-02-28 Johann Schuster , Markus Siegle