Related papers: Linear algebra in lattices, the Fitting lemma

We consider the role of the diffeomorphism constraint in the quantization of lattice formulations of diffeomorphism invariant theories of connections. It has been argued that in working with abstract lattices, one automatically takes care…

The article associates two fundamental lattice constructions with each regular unital real ordered Banach space (function system). These are used to establish certain results in the theory of operator algebras, specifically relating the…

We present a formalization, in the theorem prover Lean, of the classification of solvable Lie algebras of dimension at most three over arbitrary fields. Lie algebras are algebraic objects which encode infinitesimal symmetries, and as such…

Diversities are a generalization of metric spaces, where instead of the non-negative function being defined on pairs of points, it is defined on arbitrary finite sets of points. Diversities have a well-developed theory. This includes the…

We assign a relational structure to any finite algebra in a canonical way, using solution sets of equations, and we prove that this relational structure is polymorphism-homogeneous if and only if the algebra itself is…

We study lattice-theoretical extensions of the celebrated Sauer-Shelah-Perles Lemma. We conjecture that a general Sauer-Shelah-Perlem Lemma holds for a lattice $L$ if and only if $L$ is relatively complemented, and prove partial results…

Let $L$ be a complete orthomodular lattice. There is a one to one correspondence between complete boolean subalgebras of $L$ contained in the center of $L$ and endomorphisms $j$ of $L$ satisfying the Borceux-Van den Bossche conditions.

We prove that if A is a synaptic algebra and the orthomodular lattice P of projections in A is complete, then A is a factor iff A is an antilattice. We also generalize several other results of R. Kadison pertaining to infima and suprema in…

In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g.…

To each of the Johnson, Grassmann and Hamming graphs we associate a lattice and characterize the eigenspaces of the adjacency operator in terms of this lattice . We also show that each level of the lattice induces in a natural way a tight…

In a previous article [N. Delice, F.W. Nijhoff and S. Yoo-Kong, J. Phys. A: Math. Theor. 48(3) (2015), 035206] a novel class of elliptic Lax pairs for integrable lattice equations was introduced. The present article proposes a…

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

In two languages, Linear Algebra and Lie Algebra, we describe the results of Kostant and Wallach on the fibre of matrices with prescribed eigenvalues of all leading principal submatrices. In addition, we present a brief introduction to…

We study the theory of convergence for CAT$(0)$-lattices (that is groups $\Gamma$ acting geometrically on proper, geodesically complete CAT$(0)$-spaces) and their quotients (CAT$(0)$-orbispaces). We describe some splitting and collapsing…

Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…

J. Tuma proved an interesting "congruence amalgamation" result. We are generalizing and providing an alternate proof for it. We then provide applications of this result: --A.P. Huhn proved that every distributive algebraic lattice $D$ with…

We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states that the lattice of all boolean algebras of regular languages…

A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…

For two-dimensional lattice equations one definition of integrability is that the model can be naturally and consistently extended to three dimensions, i.e., that it is "consistent around a cube" (CAC). As a consequence of CAC one can…

Let $\Lambda$ be a lattice of rank $n$. A Lie algebra on the lattice $\Lambda$ is a Lie algebra ${\cal L}=\oplus_{\lambda\in\Lambda}\,{\cal L}_{\lambda}$ such that $\dim\,{\cal L}_\lambda=1$ for all $\lambda$. In this article, we classify…