Related papers: On lattices with a smallest set of aggregation fun…
For a finite real reflection group $W$ with Coxeter element $\gamma$ we give a uniform proof that the closed interval, $[I, \gamma]$ forms a lattice in the partial order on $W$ induced by reflection length. The proof involves the…
We develop the theory of residuated lattices by introducing and studying several new types of filters and related concepts, including semi-simple filters, essential filters, the socle of a filter, and independent families of filters. Our…
We show that a minimal action of a finitely generated group of polynomial growth on a compact metrizable space has comparison. It follows that if such an action has the small boundary property then it is almost finite and its $C^*$-crossed…
We present a new type of basis set which is local, compact, and orthogonal. The basis functions, called orthlets, are centered at the sites of a lattice and are specifically adapted to represent the system being studied. The adaptability…
The collection CL(T) of nonempty convex sublattices of a lattice T ordered by bi-domination is a lattice. We say that T has the fixed point property for convex sublattices (CLFPP for short) if every order preserving map f from T to CL(T)…
Let $P$ be a partially ordered set. If the Boolean lattice $(2^{[n]},\subset)$ can be partitioned into copies of $P$ for some positive integer $n$, then $P$ must satisfy the following two trivial conditions: (1) the size of $P$ is a power…
We study the lattice of all Borel clones on $2 = \{0,1\}$: classes of Borel functions $f : 2^n \to 2$, $n \le \omega$, which are closed under composition and include all projections. This is a natural extension to countable arities of…
Let us denote by LF the class of all orthomodular lattices (OMLs) that are locally finite (i.e., L in LF provided each finite subset of L generates in L a finite subOML). We first show in this note how one can obtain new locally finite OMLs…
We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous)…
Various problems on integers lead to the class of congruence preserving functions on rings, i.e. functions verifying $a-b$ divides $f(a)-f(b)$ for all $a,b$. We characterized these classes of functions in terms of sums of rational…
We introduce and study the class of almost limited sets in Banach lattices, that is, sets on which every disjoint weak$^{*}$ null sequence of functionals converges uniformly to zero. It is established that a Banach lattice has order…
A Banaschewski function on a bounded lattice L is an antitone self-map of L that picks a complement for each element of L. We prove a set of results that include the following: (1) Every countable complemented modular lattice has a…
We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…
The first aim of this work is to characterize when the lattice of all submodules of a module is a direct product of two lattices. In particular, which decompositions of a module $M$ produce these decompositions: the \emph{lattice…
In this paper we study Zimmer's conjecture for $C^1$ actions of lattice subgroup of a higher-rank simple Lie group with finite center on compact manifolds. We show that when the rank of an uniform lattice is larger than the dimension of the…
In a seminal work, Micciancio & Voulgaris (2013) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus…
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…
A distributive lattice $L$ with minimum element $0$ is called decomposable lattice if $a$ and $b$ are not comparable elements in $L$ there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…
We review a few results concerning interpolation of monotone functions on infinite lattices, emphasizing the role of set-theoretic considerations. We also discuss a few open problems.
In this work, we exhibit several subclasses of weakly dicomplemented lattices (WDLs) based on their skeletons and dual skeletons. We investigate normal filters (resp. ideals) and show that the set of normal filters (resp. ideals) forms a…