Related papers: An extension theorem for planar semimodular lattic…

We show that the subgroup lattice of any finite group satisfies Frankl's Union-Closed Conjecture. We show the same for all lattices with a modular coatom, a family which includes all supersolvable and dually semimodular lattices. A common…

The conjecture that every modular lattice is integral is disproved.

In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).…

Constructive meaning is given to the assertion that every finite Boolean algebra is an injective object in the category of distributive lattices. To this end, we employ Scott's notion of entailment relation, in which context we describe…

We study the finite basis problem for additively idempotent semirings satisfying the identity $xy \approx xz$. Let $\mathbf{R}$ denote the variety of all such semirings. Yue et al. (2025, Algebra Universalis, DOI:10.1007/s00012-025-00908-5)…

For a finite lattice L, let EL denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form EL, as follows:…

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…

We give an extension of Margulis' Super-Rigidity for higher rank lattices. In our approach the target group could be defined over any complete valued field. Our proof is based on the notion of Algebraic Representation of Ergodic Actions.

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…

In a recent paper, G. Cz\'edli and E.\,T. Schmidt present a structure theorem for planar semimodular lattices. In this note, we present an alternative proof.

We prove that every distributive algebraic lattice with at most $\aleph\_1$ compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The $\aleph\_1$ bound is optimal, as…

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…

We prove several basic extension theorems for reductive group schemes. We also prove that each Lie algebra with a perfect Killing form over a commutative $\dbZ$-algebra, is the Lie algebra of an adjoint group scheme.

For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…

We prove a complex polynomial plank covering theorem for not necessarily homogeneous polynomials. As the consequence of this result, we extend the complex plank theorem of Ball to the case of planks that are not necessarily centrally…

Let $L$ be a distributive lattice and $R[L]$ the associated Hibi ring. We show that if $L$ is planar, then any bounded Hibi subring of $R[L]$ has a quadratic Gr\"obner basis. We characterize all planar distributive lattices $L$ for which…

We provide a complete classification of matrix semirings $\mathbf{M}_n(S)$ over two-element additively idempotent semirings $S$ with respect to the finite basis property.Our main theorem shows that for every integer $n \geq 2$,the semiring…

We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…

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…

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…