Related papers: Yet Another Single Law for Lattices
We describe new techniques in the construction of optical lattices to realize a coherent atom-based microscope, comprised of two atomic species used as target and probe atoms, each in an independently controlled optical lattice. Precise and…
A large class of first order partial nonlinear differential equations in two independent variables which possess an infinite set of polynomial conservation laws derived from an explicit generating function is constructed. The conserved…
We classify the unimodular Euclidean integral lattices of rank 29 by developing an elementary, yet very efficient, inductive method. As an application, we determine the isometry classes of even lattices of rank at most 28 and prime…
There is a well-known asymptotic formula, due to W. M. Schmidt (1968) for the number of full-rank integer lattices of index at most $V$ in $\mathbb{Z}^n$. This set of lattices $L$ can naturally be partitioned with respect to the factor…
We show that there are uncountably many countable lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many…
We solve the classification problem for integrable lattices of the form $u_{,t}=f(u_{-2},\dots,u_2)$ under the additional assumption of invariance with respect to the group of linear-fractional transformations. The obtained list contains 5…
Osculating paths are sets of directed lattice paths which are not allowed to cross each other or have common edges, but are allowed to have common vertices. In this work we derive a constant term formula for the number of such lattice paths…
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…
In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…
We show that a general one-dimensional (1D) lattice with nonlinear inter-particle interactions can always be thermalized for arbitrarily small nonlinearity in the thermodynamic limit, thus proving equipartition hypothesis in statistical…
It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…
The familiar adjunction between ordered sets and completely distributive lattices can be extended to generalised metric spaces, that is, categories enriched over a quantale (a lattice of "truth values"), via an appropriate distributive law…
Let $L$ be a lattice. We call a congruence relation $\gQ$ of $L$ isoform, if any two congruence classes of $\gQ$ are isomorphic (as lattices). Let us call the lattice $L$ isoform, if all congruences of $L$ are isoform. G. Gr\"atzer and…
We note that each lattice $L$ has a unique largest distributive quotient, of which every distributive quotient of $L$ is itself a quotient.
This text is devoted to the theory of varieties, which provides an important tool, based in universal algebra, for the classification of regular languages. In the introductory section, we present a number of examples that illustrate and…
Concept lattices are well-known conceptual structures that organise interesting patterns-the concepts-extracted from data. In some applications, such as software engineering or data mining, the size of the lattice can be a problem, as it is…
By median we mean a scheme that inputs three element of a lattice, and outputs an element that is an average of the three inputs in a certain sense. The medians of a given finite lattice form a new lattice that is usually larger than the…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
Given an algebraic theory $\ct$, a homotopy $\ct$-algebra is a simplicial set where all equations from $\ct$ hold up to homotopy. All homotopy $\ct$-algebras form a homotopy variety. We give a characterization of homotopy varieties…
It is an easy observation that every residuated lattice is in fact a semiring because multiplication distributes over join and the other axioms of a semiring are satisfied trivially. This semiring is commutative, idempotent and simple. The…