Related papers: $\mathfrak{m}$-Endoregular lattices
In this paper we provide concrete constructions of idempotents to represent typical singular matrices over a given ring as a product of idempotents and apply these factorizations for proving our main results. We generalize works due to…
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…
For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…
A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of ${\mathbb Z}^2$, as well as their determinant and minima sets. We…
We reinterpret the Rhodes semilattices $R_n(\mathfrak{G})$ of a group $\mathfrak{G}$ in terms of gain graphs and generalize them to all gain graphs, both as sets of partition-potential pairs and as sets of subgraphs, and for the latter,…
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex…
We prove that, under mild assumptions, a lattice in a product of semi-simple Lie group and a totally disconnected locally compact group is, in a certain sense, arithmetic. We do not assume the lattice to be finitely generated or the ambient…
Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid $M$, it is natural to ask how long a sequence of elements of $M$ needs to be to ensure the…
Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold developed an algorithm to enumerate, up to isomorphism, all finite lattices up to size 18.…
Since for the classification of finite (congruence-)simple semirings it remains to classify the additively idempotent semirings, we progress on the characterization of finite simple additively idempotent semirings as semirings of…
In this paper, we introduce the notion of abelian endoregular modules as those modules whose endomorphism rings are abelian von Neumann regular. We characterize an abelian endoregular module $M$ in terms of its $M$-generated submodules. We…
Basic modules of McLain groups $M=M(\Lambda,\leq, R)$ are defined and investigated. These are (possibly infinite dimensional) analogues of Andr\'e's supercharacters of $U_n(q)$. The ring $R$ need not be finite or commutative and the field…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…
Narain lattices are unimodular lattices {\it in} $\R^{r,s}$, subject to certain natural equivalence relation and rationality condition. The problem of describing and counting these rational equivalence classes of Narain lattices in…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
We introduce the extra slow Tamari lattices, a new family of lattices defined on faithfully balanced tableaux. These tableaux arise naturally from the representation theory of type \( A \) quivers, and our construction extends the classical…
The symmetric difference in Boolean lattices can be defined in two different but equivalent forms. However, it can be introduced also in every bounded lattice with complementation where these two forms need not coincide. We study lattices…
We present a novel approach to the construction of new finite algebras and describe the congruence lattices of these algebras. Given a finite algebra $(B_0, \dots)$, let $B_1, B_2, \dots, B_K$ be sets that either intersect $B_0$ or…
Regular ring lattices (RRLs) are defined as peculiar undirected circulant graphs constructed from a cycle graph, wherein each node is connected to pairs of neighbors that are spaced progressively in terms of vertex degree. This kind of…
We prove a structure theorem for the isometry group Iso(M, g) of a compact Lorentz manifold, under the assumption that a closed subgroup has exponential growth. We don't assume anything about the identity component of Iso(M, g), so that our…