Related papers: Simple, subdirectly irreducible weakly dicomplemen…
We consider a generalization of Donkin-Koppinen filtrations for coordinate superalgebras of general linear supergroups. More precisely, if $G=GL(m|n)$ is a general linear supergroup of (super)degree $(m|n)$, then its coordinate superalgebra…
The cut and project method is a central construction in the theory of Aperiodic Order for generating quasicrystals with pure point diffraction. Linear repetitivity ({\bf LR}) is a form of ideal regularity of aperiodic patterns. Recently,…
The Congruence Lattice Problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of a lattice. It was hoped that a positive solution would follow from E. T. Schmidt's construction or from the approach…
We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices and (v,0,1)-embeddings, with top semilattice $2^4$, such that for any variety V of algebras, if D has a lifting, with respect to the…
A distributive lattice with zero is completely normal if its prime ideals form a root system under set inclusion.Every such lattice admits a binary operation (x,y) \mapsto x-y satisfying the rules x \leq y\vee (x-y) and (x-y) \wedge (y-x)=0…
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…
Let $G$ be a real centre-free semisimple Lie group without compact factors. I prove that irreducible lattices in $G$ are rigid under two types of sublinear distortions. The first result is that the class of lattices in groups that do not…
Semidefinite programs (SDPs) -- some of the most useful and versatile optimization problems of the last few decades -- are often pathological: the optimal values of the primal and dual problems may differ and may not be attained. Such SDPs…
We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice. The framework works by recursively searching for dense sublattices of dense sublattices (or their duals) with…
The nature of glassy states in realistic finite dimensions is still under fierce debate. Lattice models can offer valuable insights and facilitate deeper theoretical understanding. Recently, a disordered-interacting lattice model with…
Convergence is a fundamental topic in analysis that is most commonly modelled using topology. However, there are many natural convergences that are not given by any topology; e.g., convergence almost everywhere of a sequence of measurable…
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.…
The general construction of lattice (co)homology assigns to a lattice $\mathbb{Z}^r$ and a weight function $w:\mathbb{Z}^r \to \mathbb{Z}$ a bigraded $\mathbb{Z}[U]$-module $\mathbb{H}_*$. The weight function $w$ is often obtained from some…
A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
In this paper we study the class of modules with fusion and implication based over distributive lattices, or FIDL-modules, for short. We introduce the concepts of FIDL-subalgebra and FIDL-congruence as well as the notions of simple and…
This paper continues the study of the Ramsey-like large cardinals. Ramsey-like cardinals are defined by generalizing the characterization of Ramsey cardinals via the existence of elementary embeddings. Ultrafilters derived from such…
In this paper, we study the congruences, prime filters and prime ideals of horizontal sums of bounded lattices, then, through a construction based on horizontal sums and without enforcing the Continuum Hypothesis, we are modifying an…
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:…
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…
Our aim in this paper is to explore semisubtractive ideals of semirings. We prove that they form a complete modular lattice. We introduce Golan closures and prove some of their basic properties. We explore the relations between $Q$-ideals…