English
Related papers

Related papers: Relative projectivity and transferability for part…

200 papers

Let $R$ be a ring and $M$ be a right $R$-module. $M$ is called neat-flat if any short exact sequence of the form $0\to K\to N\to M\to 0$ is neat-exact i.e. any homomorphism from a simple right $R$-module $S$ to $M$ can be lifted to $N$. We…

Rings and Algebras · Mathematics 2013-06-13 Engin Büyükaşık , Yılmaz Durğun

We establish several independent results concerning extremal, left modular, congruence uniform, and semidistributive lattices. An equivalent characterization of left modular lattices is obtained in terms of edge-labellings, together with…

Combinatorics · Mathematics 2025-12-01 Adrien Segovia

We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

Let $L$ be a finite lattice and let $I$ be an ideal of $L$. Then the restriction map is a bounded lattice homomorphism of the congruence lattice of~$L$ into the congruence lattice of $I$. In a 2009 paper, the authors proved the converse. In…

Rings and Algebras · Mathematics 2022-01-11 George Grätzer , Harry Lakser

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.

Rings and Algebras · Mathematics 2019-08-13 G. Grätzer , E. T. Schmidt

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

Rings and Algebras · Mathematics 2014-09-23 Brian T. Chan

Dilworth's theorem. Every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice $L$. We want: Every finite distributive lattice $D$ can be represented as the congruence lattice of a nice finite…

Rings and Algebras · Mathematics 2013-10-01 George Grätzer

The aim of this paper is to study lattice properties of the sharp partial order for complex matrices having index at most 1. We investigate the down-set of a fixed matrix $B$ under this partial order via isomorphisms with two different…

Rings and Algebras · Mathematics 2024-12-30 Cecilia R. Cimadamore , Laura A. Rueda , Néstor Thome , Melina V. Verdecchia

In this article we investigate the relations between three classes of lattices each extending the class of distributive lattices in a different way. In particular, we consider join-semidistributive, join-extremal and left-modular lattices,…

Combinatorics · Mathematics 2023-04-20 Henri Mühle

Let $V$ be a left vector space over a division ring and let ${\mathcal P}(V)$ be the associated projective space. We describe all finite subsets $X\subset V$ such that every permutation on $X$ can be extended to a linear automorphism of $V$…

Group Theory · Mathematics 2012-06-28 Mark Pankov

For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, --The class of all finite…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung , Kira Adaricheva

Let L denote the variety of lattices. In 1982, the second author proved that L is strongly tolerance factorable, that is, the members of L have quotients in L modulo tolerances, although L has proper tolerances. We did not know any other…

Rings and Algebras · Mathematics 2024-11-01 Ivan Chajda , Gábor Czédli , Radomir Halas

We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…

Logic · Mathematics 2025-12-16 J. B. Nation , Gianluca Paolini

The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…

Combinatorics · Mathematics 2018-10-18 Xu Wang , Xuxu Zhao , Haiyuan Yao

Let $p\neq 2$, and let $R$ be a smooth affine algebra of dimension $3$ over $\overline{F}_p$ and $P, Q$ be projective $R$-modules of rank $2$, each with trivial determinant. We prove: $P$ is isomorphic to $Q$ if and only if there is an…

Commutative Algebra · Mathematics 2017-10-26 Mrinal Kanti Das

Given a normal projective irreducible stack $\mathscr X$ over an algebraically closed field of characteristic zero we consider framed sheaves on $\mathscr X$, i.e., pairs $(\mathcal E,\phi_{\mathcal E})$, where $\mathcal E$ is a coherent…

Algebraic Geometry · Mathematics 2015-02-27 Ugo Bruzzo , Francesco Sala

In this note, we prove that for any finite dimensional vector space $V$ over an algebraically closed field $k$, and for any finite subgroup $G$ of $GL(V)$ which is either solvable or is generated by pseudo reflections such that the $|G|$ is…

Algebraic Geometry · Mathematics 2008-01-09 S. S. Kannan , S. K. Pattanayak , Pranab Sardar

This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…

Rings and Algebras · Mathematics 2021-06-17 Aiping Gan , Li Guo

For some important families of complete infinite lattices, we study some generalizations of two fundamental notions which are mostly treated for finite lattices. Specifically, for well-separated $\kappa$-lattices, and also for weakly atomic…

Rings and Algebras · Mathematics 2026-04-24 Sota Asai , Osamu Iyama , Kaveh Mousavand , Charles Paquette

A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…

Discrete Mathematics · Computer Science 2021-09-30 Pranab Basu