English
Related papers

Related papers: Generalizing Galvin and J\'onsson's Classification…

200 papers

In this paper subvarieties of pseudocomplemented distributive lattices are classified by their unification type. We determine the unification type of every particular unification problem in each subvariety of pseudocomplemented distributive…

Rings and Algebras · Mathematics 2017-02-22 Leonardo Manuel Cabrer

Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…

Rings and Algebras · Mathematics 2014-07-10 Joao Pita Costa

In 2008, L\'aszl\'o Z\'adori proved that the lattice Sub$(V)$ of all subspaces of a vector space $V$ of finite dimension at least 3 over a finite field $F$ has a 5-element generating set; in other words, Sub$(V)$ is 5-generated. We prove…

Rings and Algebras · Mathematics 2024-01-18 Gábor Czédli

In 1960, G. Gr\"atzer and E.\,T. Schmidt proved that every finite distributive lattice can be represented as the congruence lattice of a sectionally complemented finite lattice $L$. For $u \leq v$ in $L$, they constructed a sectional…

Rings and Algebras · Mathematics 2022-08-09 G. Grätzer , G. Klus , A. Nguyen

Cyclic lattices are sublattices of $\mathbb Z^N$ that are preserved under the rotational shift operator. Cyclic lattices were introduced by D.~Micciancio and their properties were studied in the recent years by several authors due to their…

Number Theory · Mathematics 2014-11-19 Lenny Fukshansky , Xun Sun

A new model, in terms of finite bipartite graphs, of the free pseudosemilattice is presented. This will then be used to obtain several results about the variety SPS of all strict pseudosemilattices: (i) an identity basis for SPS is found,…

Rings and Algebras · Mathematics 2019-07-01 K. Auinger , L. Oliveira

Each finite algebra $\mathbf A$ induces a lattice~$\mathbf L_{\mathbf A}$ via the quasi-order~$\to$ on the finite members of the variety generated by~$\mathbf A$, where $\mathbf B \to \mathbf C$ if there exists a homomorphism from $\mathbf…

Rings and Algebras · Mathematics 2016-12-20 Brian A. Davey , Charles T. Gray , Jane G. Pitkethly

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

Recent efforts in lattice evaluation of the topological susceptibility had shown that at high temperatures it is given by well-separated instantons (even in QCD with light fermions, where those are highly suppressed). Recent development of…

High Energy Physics - Lattice · Physics 2017-01-30 Edward Shuryak

The concept of a tolerance relation, shortly called tolerance, was studied on various algebras since the seventieth of the twentieth century by B. Zelinka and the first author. Since tolerances need not be transitive, their blocks may…

Combinatorics · Mathematics 2021-12-13 Ivan Chajda , Helmut Länger

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung , Marina V. Semenova

Hemi-implicative semilattices (lattices), originally defined under the name of weak implicative semilattices (lattices), were introduced by the second author of the present paper. A hemi-implicative semilattice is an algebra…

Logic · Mathematics 2017-09-01 Ramon Jansana , Hernán Javier San Martín

We introduce an alternative stratification of knots: by the size of lattice on which a knot can be first met. Using this classification, we find ratio of unknots and knots with more than 10 minimal crossings inside different lattices and…

Geometric Topology · Mathematics 2023-09-07 E. Lanina , A. Popolitov , N. Tselousov

We study the smallest, as well as the largest numbers of congruences of lattices of an arbitrary finite cardinality $n$. Continuing the work of Freese and Cz\' edli, we prove that the third, fourth and fifth largest numbers of congruences…

Rings and Algebras · Mathematics 2018-01-22 J\' ulia Kulin , Claudia Mureşan

A series of integral lattices parametrised by integers $k,m,n$ are introduced and investigated, where $n$ is the rank of the lattice, including the root lattices described in a uniform way and unimodular lattices such as the Niemeier…

Combinatorics · Mathematics 2024-04-08 Atsushi Matsuo , Hiroki Shimakura

Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…

Image and Video Processing · Electrical Eng. & Systems 2024-12-20 Yuchen He , Sung Ha Kang

We prove that the lattice of normal subgroups of ultraproducts of compact simple non-abelian groups is distributive. In the case of ultraproducts of finite simple groups or compact connected simple Lie groups of bounded rank the set of…

Group Theory · Mathematics 2014-02-26 Abel Stolz , Andreas Thom

In 2020 Bhavale and Waphare introduced the concept of a nullity of a poset as nullity of its cover graph. According to Bhavale and Waphare, if a dismantlable lattice of nullity k contains r reducible elements then 2 $\leq$ r $\leq$ 2k. In…

Combinatorics · Mathematics 2025-03-18 B. P. Aware , A. N. Bhavale

Implicational bases are a well-known representation of closure spaces and their closure lattices. This representation is not unique, though, and a closure space usually admits multiple bases. Among these, the canonical base, the canonical…

Combinatorics · Mathematics 2025-09-03 Kira Adaricheva , Simon Vilmin

We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices when all agents have path-independent choice functions. This result answers an open question of Blair~\cite{blair1988lattice}. In the…

Discrete Mathematics · Computer Science 2026-04-09 Christopher En , Yuri Faenza