English
Related papers

Related papers: An extension theorem for planar semimodular lattic…

200 papers

We introduce the notion of distributivity for implicative-orthomodular lattices, proving an analogue result of the Foulis-Holland theorem. Based on this result, we characterize the distributive implicative-orthomodular lattices. Moreover,…

Logic · Mathematics 2024-03-26 Lavinia Corina Ciungu

The Kr\"otz-Stanton Extension Theorem states that the orbit map of a K-finite vector in a Hilbert representation of a linear Lie group extends to a holomorphic map to a principal fibre bundle over the complex crown domain associated to the…

Representation Theory · Mathematics 2025-01-17 Tobias Simon

We study the relationships among existing results about representations of distributive semilattices by ideals in dimension groups, von Neumann regular rings, C*-algebras, and complemented modular lattices. We prove additional…

Operator Algebras · Mathematics 2007-05-23 K. R. Goodearl , F. Wehrung

We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…

Group Theory · Mathematics 2020-06-09 Wolfgang Bertram

In this short note we present an elementary matrix-constructive proof of Quillen-Suslin theorem for Ore extensions: If $K$ is a division ring and $A:=K[x;\sigma,\delta]$ is an Ore extension, with $\sigma$ bijective, then every finitely…

Rings and Algebras · Mathematics 2018-04-10 Oswaldo Lezama , William Fajardo

We restate a process presented by Stanley as a technique to prove that there exists exactly one $d$-differential distributive lattice for any positive integer $d$. This process can be trivially extended to apply to distributive finitary…

Combinatorics · Mathematics 2026-04-14 Dale R. Worley

Let $\ell$ be prime, and $K$ be a number field containing the $\ell$-th roots of unity. We use classical algebraic number theory and some analytic techniques to prove that the Steinitz classes of $\mathbb Z/\ell\mathbb Z$ extensions of $K$…

Number Theory · Mathematics 2025-11-10 Brody Lynch

We give two sufficient conditions for the lattice Co(R^n,X) of relatively convex sets of n-dimensional real space R^n to be join-semidistributive, where X is a finite union of segments. We also prove that every finite lower bounded lattice…

Rings and Algebras · Mathematics 2011-06-15 K. Adaricheva

In this paper we introduce and study a variety of algebras that properly includes integral distributive commutative residuated lattices and weak Heyting algebras. Our main goal is to give a characterization of the principal congruences in…

Logic · Mathematics 2018-04-20 Ramon Jansana , Hernan Javier San Martin

We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a…

Combinatorics · Mathematics 2026-04-23 Mattias Ehatamm , Peter Nelson , Fernanda Rivera Omana

By a rectangular distributive lattice we mean the direct product of two non-singleton finite chains. We prove that the retracts (ordered by set inclusion and together with the empty set) of a rectangular distributive lattice $G$ form a…

Rings and Algebras · Mathematics 2021-12-30 Gábor Czédli

In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…

Combinatorics · Mathematics 2007-05-23 Hugh Thomas

We consider two constructions of an envelope for a finite locally distributive strong upper semilattice. The first is based on Birkhoff's representation of finite distributive lattices and the second on valuations on lattices. We show that…

Combinatorics · Mathematics 2009-02-03 Colin Bailey , Joseph Oliveira

We prove that the acyclic reorientation poset of a directed acyclic graph $D$ is a lattice if and only if the transitive reduction of any induced subgraph of $D$ is a forest. We then show that the acyclic reorientation lattice is always…

Combinatorics · Mathematics 2025-06-30 Vincent Pilaud

We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…

Logic in Computer Science · Computer Science 2016-03-04 Zoltan Esik

We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous)…

Number Theory · Mathematics 2026-01-15 J. E. Cremona , P. Koymans

In this paper we study the poset of basic tilting $kQ$-modules when $Q$ is a Dynkin quiver, and the poset of basic support $\tau$-tilting $kQ$-modules when $Q$ is a connected acyclic quiver respectively. It is shown that the first poset is…

Representation Theory · Mathematics 2015-05-29 Yichao Yang

A D-polyhedron is a polyhedron $P$ such that if $x,y$ are in $P$ then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive lattice with the dominance order. We provide a full…

Combinatorics · Mathematics 2008-11-11 S. Felsner , K. Knauer

We show that coalgebras whose lattice of right coideals is distributive are coproducts of coalgebras whose lattice of right coideals is a chain. Those chain coalgebras are characterized as finite duals of noetherian chain rings whose…

Rings and Algebras · Mathematics 2007-05-23 Christian Lomp , Alveri Sant'Ana

If every block of a (compatible) tolerance (relation) $T$ on a modular lattice $L$ of finite length consists of at most two elements, then we call $T$ a \emph{doubling tolerance} on $L$. We prove that, in this case, $L$ and $T$ determines a…

Rings and Algebras · Mathematics 2019-12-11 Gábor Czédli