Related papers: Lattices of coarse structures
We study a material modeled as a network of nodes connected by edges. Using a discrete approach, we build a nonlinear algebraic system that connects applied forces to internal forces and node positions. The model can describe elasticity,…
We report on recent results of a high statistics lattice calculation of the unpolarized and polarized structure functions of the nucleon.
We develop a coarse notion of bundle and use it to understand the coarse geometry of group extensions and, more generally, groups acting on proper metric spaces. The results are particularly sharp for groups acting on (locally finite) trees…
Recent decades have seen the discovery of numerous complex materials. At the root of the complexity underlying many of these materials lies a large number of possible contending atomic- and larger-scale configurations and the intricate…
We study convex subsets of buildings, discuss some structural features and derive several characterizations of buildings.
The notion of multidimensional quadrilateral lattice is introduced. It is shown that such a lattice is characterized by a system of integrable discrete nonlinear equations. Different useful formulations of the system are given. The…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
In the present paper we introduce and study a canonical ${\cal E}$-lattice structure on the set of element orders of some finite groups. We show that a finite abelian group is uniquely determined by this canonical ${\cal E}$-lattice.
We characterize the order of principal congruences of a bounded lattice as a bounded ordered set. We also state a number of open problems in this new field.
The modeling and control of networks over finite lattices are studied via the algebraic state space approach. Using the semi-tensor product of matrices, we obtain the algebraic state space representation of the dynamics of (control)…
We survey results devoted to the lattice of varieties of monoids. Along with known results, some unpublished results are given with proofs. A number of open questions and problems are also formulated.
We study modular ortholattices in the variety generated by the finite dimensional ones from an equational and geometric point of view. We relate this to coordinatization results.
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
The aim of this note is to give a geometric proof for classical local rigidity of lattices in semisimple Lie groups. We are reproving well known results in a more geometric (and hopefully clearer) way.
We give a simple analytic criterion which characterizes linearizable 1-codimensional webs. Then we give an invariant geometrical interpretation of it, in term of projective connection. We explain then how our approach allows to study…
Motivated by a fundamental geometrical object, the cut locus, we introduce and study a new combinatorial structure on graphs.
This is Part A of four Parts dedicated to modular lattices of finite length. It builds on 1992 notes of the author (available on ResearchGate), and in so doing heeds a wish of the late Gian-Carlo Rota. Part A is in fairly final form and…
We provide a complete classification of the possible cofinal structures of the families of precompact (totally bounded) sets in general metric spaces, and compact sets in general complete metric spaces. Using this classification, we…
We review important aspects of QCD in the continuum and on the lattice and take a look at the fate of its symmetries with an emphasis on chiral symmetry breaking on the lattice.
We study the model theoretic strength of various lattices that occur naturally in topology, like closed (semi-linear or semi-algebraic or convex) sets. The method is based on weak monadic second order logic and sharpens previous results by…