Related papers: Tiling the integer lattice with translated sublatt…
Let $\mathbf{F}=\left\langle F,R\right\rangle $ be a finite Kripke frame. A congruence of $\mathbf{F}$ is a bisimulation of $\mathbf{F}$ that is also an equivalence relation on F. The set of all congruences of $\mathbf{F}$ is a lattice…
Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element…
In this paper we study the lattice of restricted subalgebras of a restricted Lie algebra. In particular, we consider those algebras in which this lattice is dually atomistic, lower or upper semimodular, or in which every restricted…
For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…
We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…
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…
In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time…
We study the problem of covering R^d by overlapping translates of a convex body P, such that almost every point of R^d is covered exactly k times. Such a covering of Euclidean space by translations is called a k-tiling. The investigation of…
We consider the ring $\mathbb Z_n$ (integers modulo $n$) with the partial order `$\leq$' given by `$a \leq b$ if either $a=b$ or $a\equiv ab~(mod~n)$'. In this paper, we obtain necessary and sufficient conditions for the poset ($\mathbb…
The notion of weak tiling played a key role in the proof of Fuglede's spectral set conjecture for convex domains, due to the fact that every spectral set must weakly tile its complement. In this paper, we revisit the notion of weak tiling…
In this paper we begin to study the subalgebra lattice of a Leibniz algebra. In particular, we deal with Leibniz algebras whose subalgebra lattice is modular, upper semi-modular, lower semi-modular, distributive, or dually atomistic. The…
This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
It is shown that, given any $k$-dimensional lattice $\Lambda$, there is a lattice sequence $\Lambda_w$, $w\in \mathbb Z$, with sub-orthogonal lattice $\Lambda_o \subset \Lambda$, converging to $\Lambda$ (unless equivalence), also we discuss…
We describe how the usual supercharges of extended supersymmetry may be {\it twisted} to produce a BRST-like supercharge $Q$. The usual supersymmetry algebra is then replaced by a twisted algebra and the action of the twisted theory is…
In this paper, we study the algebra of twisted vertex operators over an even integral ${\mathbf Z}_2$-lattice, and give a kind of systematic construction of fundamental representations for affine Lie algebras of type $A$, $D$, $E$ with…
Lattice theoretical generalizations of some classical linear algebra results are formulated. A vector space is replaced by its subspace lattice and a linear map is replaced by the induced lattice map. This map is a complete join…
Lattice tilings of $\mathbb{Z}^n$ by limited-magnitude error balls correspond to linear perfect codes under such error models and play a crucial role in flash memory applications. In this work, we establish three main results. First, we…
We count tilings of a rectangle of integer sides m-1 and n-1 by a special set of tiles. The result is obtained fron the study of the kernel of the adjacency matrix of an n x n rectangular graph of Z x Z.
For an arbitrary group, the subgroups form a lattice with order determined by set inclusion. Not every lattice is isomorphic to the subgroup lattice for a group. However, Birkhoff and Frink proved that any compactly generated lattice is…