Related papers: A note on "A minimal congruence lattice representa…

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…

The states in the irreducible modules of the minimal models can be represented by infinite lattice paths arising from consideration of the corresponding RSOS statistical models. For the M(p,2p+1) models, a completely different path…

We show that the reduction mod p of an orthogonal linear representation is orthogonal, and we generalize this fact to representations of algebras with involution.The proofs make an essential use of the notion of " middle lattices ".

In a 1998 paper with H. Lakser, the authors proved that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite \emph{semimodular lattice}. Some ten years later, the first author and E. Knapp proved a…

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

We prove that every finite distributive lattice $D$ can be represented as the congruence lattice of a rectangular lattice $K$ in which all congruences are principal. We verify this result in a stronger form as an extension theorem.

We consider the logarithmic minimal models LM(1,p) as `rational' logarithmic conformal field theories with extended W symmetry. To make contact with the extended picture starting from the lattice, we identify 4p-2 boundary conditions as…

A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…

We prove that every lattice with more than one element has a proper congruence-preserving extension.

For a lattice L with 0 and 1, let Princ L denote the ordered set of principal congruences of L. For {0,1}-sublattices A subseteq B of L, congruence generation defines a natural map from Princ A to Princ B. In this way, we obtain a small…

In view of recent progress in studying matrix model-2D gravity duality, we reexamine some features of $(2,2p+1)$ minimal string. After reviewing both sides of the proposed correspondence in this case, a previously unnoted identification…

The Congruence Lattice Problem (CLP), stated by R. P. Dilworth in the forties, asks whether every distributive {∨, 0}-semilatticeS is isomorphic to the semilattice Conc L of compact congruences of a lattice L. While this problem is…

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

We prove the density hypothesis for congruence subgroups of an irreducible uniform lattice in $\mathrm{PSL}_2(\mathbb{R})^d$, extending previous results on the spherical density hypothesis to bound multiplicities of non-tempered…

Let $\Gamma$ be a non-uniform lattice in $PU(p,1)$ without torsion and with $p\geq2 $. We introduce the notion of volume for a representation $\rho:\Gamma \rightarrow PU(m,1)$ where $m \geq p$. We use this notion to generalize the…

By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the…

For integers $0 \leq m \leq l \leq n-m$, the truncated Boolean lattice ${\cal B}_n(m,l)$ is the poset of all subsets of $[n] = \{1, 2, \ldots, n\}$ which have size at least $m$ and at most $l$. ${\cal C} \subseteq {\cal B}_n(m,l)$ is a {\em…

We prove that an infinite (bounded) involution lattice and even pseudo--Kleene algebra can have any number of congruences between $2$ and its number of elements or equalling its number of subsets, regardless of whether it has as many ideals…

We prove a codimension reduction and congruence theorem for compact $n$-dimensional submanifolds of $\mathbb{S}^{n+p}$ that admit a mean convex isometric embedding into $\mathbb{S}^{n+1}_+$ using a Reilly type formula for space forms.

The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…