English
Related papers

Related papers: Cevian operations on distributive lattices

200 papers

A clone on a set X is a set of finitary operations on X which contains all the projections and is closed under composition. The set of all clones forms a complete lattice Cl(X) with greatest element O, the set of all finitary operations.…

Rings and Algebras · Mathematics 2007-05-23 Martin Goldstern , Saharon Shelah

The sets of all neutral, distributive and lower-modular elements of the lattice of semigroup varieties are finite, countably infinite and uncountably infinite, respectively. In 2018, we established that there are precisely three neutral…

Group Theory · Mathematics 2022-12-12 Sergey V. Gusev

Let p be an odd prime. The lattice of all normal subgroups and the terms of the lower and upper central series are determined for all metabelian p-groups with generator rank d=2 having abelianization of type (p,p) and minimal defect of…

Group Theory · Mathematics 2014-03-18 Daniel C. Mayer

We develop the theory of algebraic groups over real closed fields and apply the results to construct a geometric object $\mathcal{B}$ and to prove that $\mathcal{B}$ is an affine $\Lambda$-building. We use a model theoretic transfer…

Group Theory · Mathematics 2024-07-31 Raphael Appenzeller

We provide a generalization of Mundici's equivalence between unital Abelian lattice-ordered groups and MV-algebras: the category of unital commutative lattice-ordered groups is equivalent to the category of MV-monoidal algebras. Roughly…

Logic · Mathematics 2022-11-09 Marco Abbadini

Let p be a fixed prime. An Abelian p-group is an Abelian group (not necessarily finitely generated) in which every element has for its order some power of p. The countable Abelian p-groups are classified by Ulm's theorem, and Khisamiev…

Logic · Mathematics 2008-05-14 W. Calvert , D. Cenzer , V. S. Harizanov , A. Morozov

There are continuum many clones on a three-element set even if they are considered up to \emph{homomorphic equivalence}. The clones we use to prove this fact are clones consisting of \emph{self-dual operations}, i.e., operations that…

Rings and Algebras · Mathematics 2023-05-01 Manuel Bodirsky , Albert Vucaj , Dmitriy Zhuk

A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…

Combinatorics · Mathematics 2021-01-19 Hery Randriamaro

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…

Rings and Algebras · Mathematics 2021-05-03 G. Grätzer , H. Lakser

This paper has two parts, on Baumslag-Solitar groups and on general G-trees. In the first part we establish bounds for stable commutator length (scl) in Baumslag-Solitar groups. For a certain class of elements, we further show that scl is…

Group Theory · Mathematics 2020-06-04 Matt Clay , Max Forester , Joel Louwsma

We consider the convex subset $[A,B]$ of all elements between two levels $A$ and $B$ of a finite distributive lattice, as a union of (or covered by) intervals $[a,b]$. A 1988 result of Voigt and Wegener shows that for such convex subsets of…

Combinatorics · Mathematics 2024-01-31 Dwight Duffus , Bill Sands

We show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thus improving the existing Cayley/Holland-style embedding theorem. We use this to show that the variety of all…

Logic · Mathematics 2023-10-23 Nikolaos Galatos , Isis A. Gallardo

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

We establish optimal $C^s$ boundary regularity for the most general class of (linear and translation invariant) nonlocal elliptic operator of order $2s$. Namely, we consider L\'evy operators that are symmetric and its Fourier symbol…

Analysis of PDEs · Mathematics 2026-05-19 Florian Grube , Xavier Ros-Oton

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

On an infinite set some closure operators are finitary (algebraic) while others are not. We can generalize this idea for a complete algebraic lattice letting the compact elements act as the finite sets. With this in mind, we will consider…

Rings and Algebras · Mathematics 2014-11-25 Martha Lee Hollist Kilpack

This is an addition to a series of papers [FL1, FL2, FL3, FL4], where we develop quaternionic analysis from the point of view of representation theory of the conformal Lie group and its Lie algebra. In this paper we develop split…

Representation Theory · Mathematics 2015-06-23 Matvei Libine

Left invariant affine structures in a Lie group $G$ are in one-to-one correspondence with left-symmetric algebras over its Lie algebra $\mathfrak g=T_eG$ (``over'' means that the commutator $[x,y]=xy-yx$ coincides with the Lie bracket;…

Differential Geometry · Mathematics 2007-05-23 V. M. Gichev

We introduce and study the set of radical stable operations of an integral domain $D$. We show that their set is a complete lattice that is the join-completion of the set of spectral semistar operations, and we characterize when every…

Commutative Algebra · Mathematics 2022-07-18 Dario Spirito

Let L be a complete lattice and let Q(L) be the unital quantale of join-continuous endo-functions of L. We prove the following result: Q(L) is an involutive (that is, non-commutative cyclic $\star$-autonomous) quantale if and only if L is a…

Logic in Computer Science · Computer Science 2020-04-20 Luigi Santocanale