English
Related papers

Related papers: Coordinatization of join-distributive lattices

200 papers

D.Happel and L.Unger defined a partial order on the set of basic tilting modules. We study the poset of basic pre-projective tilting modules over path algebra of infinite type. We give an equivalent condition for that this poset is a…

Rings and Algebras · Mathematics 2013-08-01 Ryoichi Kase

In this paper we continue to study varieties of K-lattices, focusing on their bounded versions. These (bounded) commutative residuated lattices arise from a specific kind of construction: the {\em twist-product} of a lattice. Twist-products…

Logic · Mathematics 2020-09-01 Paolo Aglianò , Miguel Andrès Marcos

We describe the absolute retracts for the following classes of finite lattices: (1) slim semimodular lattices, (2) finite distributive lattices, and for each positive integer $n$, (3) at most $n$-dimensional finite distributive lattices.…

Rings and Algebras · Mathematics 2021-06-15 Gábor Czédli , Ali Molkhasi

Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…

Logic in Computer Science · Computer Science 2015-12-31 Mikhail A. Babin , Sergei O. Kuznetsov

K-Theory for hermitian symmetric spaces of non-compact type, as developed recently by the authors, allows to put Cartan's classification into a homological perspective. We apply this method to the case of inductive limits of finite…

K-Theory and Homology · Mathematics 2016-09-23 Dennis Bohle , Wend Werner

A join-semilattice $L$ is said to be conjunctive if it has a top element $1$ and it satisfies the following first-order condition: for any two distinct $a,b\in L$, there is $c\in L$ such that either $a\vee c\not=1=b\vee c$ or $a\vee…

Logic · Mathematics 2020-06-09 Charles N. Delzell , Oghenetega Ighedo , James J. Madden

Following G. Gr\"atzer and E. Knapp (2007), a slim semimodular lattice, SPS lattice for short, is a finite planar semimodular lattice having no $M_3$ as a sublattice. An SPS lattice is a slim rectangular lattice if it has exactly two doubly…

Rings and Algebras · Mathematics 2023-07-17 Gábor Czédli

In 1968, E. T. Schmidt introduced the M\_3[D] construction, an extension of the five-element nondistributive lattice M\_3 by a bounded distributive lattice D, defined as the lattice of all triples $(x, y, z) \in D^3$ satisfying…

General Mathematics · Mathematics 2016-08-16 George Grätzer , Friedrich Wehrung

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…

Combinatorics · Mathematics 2025-07-18 Ilani Axelrod-Freed , Colin Defant , Hanna Mularczyk , Son Nguyen , Katherine Tung

We count primitive lattices of rank $d$ inside $\mathbb{Z}^{n}$ as their covolume tends to infinity, with respect to certain parameters of such lattices. These parameters include, for example, the subsapce that a lattice spans, namely its…

Number Theory · Mathematics 2021-10-29 Tal Horesh , Yakov Karasik

For a finite distributive lattice $D$, let us call $Q \subseteq D$ \emph{principal congruence representable}, if there is a finite lattice $L$ such that the congruence lattice of $L$ is isomorphic to $D$ and the principal congruences of $L$…

Rings and Algebras · Mathematics 2021-04-30 George Grätzer

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…

Representation Theory · Mathematics 2017-01-17 Peng He , Xue-ping Wang

We introduce the Birkhoff completion as the smallest distributive lattice in which a given finite lattice can be embedded as semi-lattice. We discuss its relationship to implicational theories, in particular to R. Wille's…

Discrete Mathematics · Computer Science 2024-05-07 Mohammad Abdulla , Johannes Hirth , Gerd Stumme

We prove that for any distributive join-semilattice S, there are a meet-semilattice P with zero and a map f:PxP-->S such that f(x,z)<=f(x,y)vf(y,z) and x<=y implies that f(x,y)=0, for all x,y,z in P, together with the following conditions:…

Rings and Algebras · Mathematics 2008-06-21 Friedrich Wehrung

We completely determine upper-modular, codistributive and costandard elements in the lattice of all commutative semigroup varieties. In particular, we prove that the properties of being upper-modular and codistributive elements in the…

Group Theory · Mathematics 2015-01-20 B. M. Vernikov

This paper concerns the lattice $L_n$ of subsets of $\{1,\ldots,n\}$ that are arithmetic progressions, under the inclusion order. For $n\geq 4$, this poset is not graded and thus not semimodular. We give three independent proofs of the fact…

Combinatorics · Mathematics 2022-10-10 Marcel K. Goh , Jad Hamdan , Jonah Saks

We present a class of photonic lattices with an underlying symmetry given by a finite-dimensional representation of the 2+1D Lorentz group. In order to construct such a finite-dimensional representation of a non-compact group, we have to…

Optics · Physics 2015-12-03 B. M. Rodríguez-Lara , J. Guerrero

If $L$ is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex $\Delta(L)$ (definition recalled). Lattice-theoretically, the resulting object is a subdirect…

Rings and Algebras · Mathematics 2017-02-08 George M. Bergman

Each quiver corresponds to a path semigroup, and such a path semigroup also corresponds to an associative K-algebra over an algebraically closed field K. Let Q be a quiver and S_Q, KQ be its path semigroup, path algebra, respectively. In…

Group Theory · Mathematics 2024-05-30 Yongle Luo , Zhengpan Wang , Jiaqun Wei

The set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet $\Sigma = \{ x, y, z, ... \}$, where each letter has a…

Logic · Mathematics 2018-07-19 Maria João Gouveia , Luigi Santocanale
‹ Prev 1 4 5 6 7 8 10 Next ›