Search arXivSearch

arXiv · 2603.11454

Accumulation points of congruence densities of finite lattices

Abstract

Let $\mathcal W$ be a nontrivial variety of lattices, and let $L$ be a finite lattice in $\mathcal W$. The congruence density of $L$ with respect to $\mathcal W$ is the number of congruences of $L$ divided by the maximum number of congruences of $|L|$-element lattices belonging to $\mathcal W$. We prove that, with respect to the order and multiplication of the real numbers, the set SCD$(\mathcal W)$ of congruence densities of finite members of $\mathcal W$ as well as its topological closure are countably infinite dually well-ordered monoids. We also prove that the set of accumulation points of SCD$(\mathcal W)$ is either a singleton or it is countably infinite; furthermore, it is a singleton if and only if $\mathcal W$ is a subvariety of the variety of modular lattices. This gives a complicated characterization of modularity: a non-singleton lattice $K$ is modular if and only if SCD$(\mathcal V(K))$, where $\mathcal V(K)$ denotes the variety generated by $K$, has only one accumulation point. The class $\mathcal S$ of semimodular lattices is not a variety, but SCD$(\mathcal S)$ is still meaningful; we prove that SCD$(\mathcal S)$ has exactly one accumulation point.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gábor Czédli. 2026-03-12. Accumulation points of congruence densities of finite lattices. https://arxiv.org/abs/2603.11454

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA