On Integral Well-rounded Lattices in the Plane

We investigate distribution of integral well-rounded lattices in the plane, parameterizing the set of their similarity classes by solutions of the family of Pell-type Diophantine equations of the form x ²+Dy ²=z ² where D>0 is squarefree. We apply this parameterization to the study of the greatest minimal norm and the highest signal-to-noise ratio on the set of such lattices with fixed determinant, also estimating cardinality of these sets (up to rotation and reflection) for each determinant value. This investigation extends previous work of the first author in the specific cases of integer and hexagonal lattices and is motivated by the importance of integral well-rounded lattices for discrete optimization problems. We briefly discuss an application of our results to planar lattice transmitter networks.     

Well-rounded algebraic lattices in odd prime dimension

Well-rounded lattices have been considered in coding theory, in approaches to MIMO, and SISO wiretap channels. Algebraic lattices have been used to obtain dense lattices and in applications to Rayleigh fading channels. Recent works study the relation between well-rounded lattices and algebraic lattices, mainly in dimension two. In this article we present a construction of well-rounded algebraic lattices in Euclidean spaces of odd prime dimension. We prove that for each Abelian number field of odd prime degree having squarefree conductor, there exists a $${\mathbb {Z}}$$ -module M such that the canonical embedding applied to M produces a well-rounded lattice. It is also shown that for each odd prime dimension there are infinitely many non-equivalent well-rounded algebraic lattices, with high indexes as sublattices of other algebraic lattices.     

Lattices of Radicals of Involution Rings

A lattice-theoretic approach to the radical theory of rings was initiated by Snider. In the current paper, we extend this approach to the radical theory of involution rings. We show that the classes of hereditary radicals, radicals satisfying ADS and invariant radicals form complete sublattices of the lattice of all radicals of involution rings. We show that certain sublattices are isomorphic to sublattices of the lattice of radicals of rings. We characterize the atoms of certain lattices of radicals of involution rings.1991 Mathematics Subject Classification: 16W10, 16N99, 06B99     

Bounds for solid angles of lattices of rank three

We find sharp absolute constants C₁ and C₂ with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval [C₁,C₂]. In fact, we show that these absolute bounds hold for a larger class of lattices than just well-rounded, and the upper bound holds for all. We state a technical condition on the lattice that may prevent it from satisfying the absolute lower bound on the solid angle, in which case we derive a lower bound in terms of the ratios of successive minima of the lattice. We use this result to show that among all spherical triangles on the unit sphere in RN with vertices on the minimal vectors of a lattice, the smallest possible area is achieved by a configuration of minimal vectors of the (normalized) face centered cubic lattice in R³. Such spherical configurations come up in connection with the kissing number problem.     

Cardy's formula for some dependent percolation models

We prove Cardy's formula for rectangular crossing probabilities in dependent site percolation models that arise from a deterministic cellular automaton with a random initial state. The cellular automaton corresponds to the zero-temperature case of Domany's stochastic Ising ferromagnet on the hexagonal lattice  (with alternating updates of two sublattices) [7]; it may also be realized on the triangular lattice 𝕋 with flips when a site disagrees with six, five and sometimes four of its six neighbors. Received: 24 December 2001     

Sublattices of associahedra and permutohedra

Grätzer asked in 1971 for a characterization of sublattices of Tamari lattices. A natural candidate was coined by McKenzie in 1972 with the notion of a bounded homomorphic image of a free lattice—in short, bounded lattice. Urquhart proved in 1978 that every Tamari lattice is bounded (thus so are its sublattices). Geyer conjectured in 1994 that every finite bounded lattice embeds into some Tamari lattice.     

On sublattices of the hexagonal lattice

How many sublattices of index N are there in the planar hexagonal lattice? Which of them are the best from the point of view of packing density, signal-to-noise ratio, or energy? We answer the first question completely and give partial answers to the other questions.     

Graphical algebras — a new approach to congruence lattices

In 1970, H. Werner considered the question of which sublattices of partition lattices are congruence lattices for an algebra on the underlying set of the partition lattices. He showed that a complete sublattice of a partition lattice is a congruence lattice if and only if it is closed under a new operation called graphical composition. We study the properties of this new operation, viewed as an operation on an abstract lattice. We obtain some necessary properties, and we also obtain some sufficient conditions for an operation on an abstract lattice L to be this operation on a congruence lattice isomorphic to L. We use this result to give a new proof of Grätzer and Schmidt’s result that any algebraic lattice occurs as a congruence lattice.     

Quasiorders and Sublattices of Distributive Lattices

We study the lattice of all (0,1)-sublattices of a distributive lattice L, using certain compatible quasiorders on the Priestley space of L as our principal tool. Special emphasis is put on the case of finite L, where epic sublattices, Frattini sublattices and covers are considered in some detail. We hope to demonstrate that quasiorders may serve as a concept suitable to unify the many different representations of sublattices of L which are found in the literature.     

Radical classes of algebras with B-action

We initiate the radical theory of algebras with B-action where B is a fixed Boolean ring. We consider lattices of classes of algebras defined in terms of ideals of B. In two special cases (universal classes of -groups with B-action and idempotent algebras with B-action), these ideal-defined classes are sublattices of the lattice of radicals, and we characterise semisimplicity in such cases. Received February 2, 1998; accepted in final form June 11, 1998.     

An aperiodic hexagonal tile

We show that a single prototile can fill space uniformly but not admit a periodic tiling. A two-dimensional, hexagonal prototile with markings that enforce local matching rules is proven to be aperiodic by two independent methods. The space-filling tiling that can be built from copies of the prototile has the structure of a union of honeycombs with lattice constants of n²a, where a sets the scale of the most dense lattice and n takes all positive integer values. There are two local isomorphism classes consistent with the matching rules and there is a nontrivial relation between these tilings and a previous construction by Penrose. Alternative forms of the prototile enforce the local matching rules by shape alone, one using a prototile that is not a connected region and the other using a three-dimensional prototile.     

Sublattices of product spaces: Hulls, representations and counting

The Cartesian product of lattices is a lattice, called a product space, with componentwise meet and join operations. A sublattice of a lattice L is a subset closed for the join and meet operations of L. The sublattice hullLQ of a subset Q of a lattice is the smallest sublattice containing Q. We consider two types of representations of sublattices and sublattice hulls in product spaces: representation by projections and representation with proper boundary epigraphs. We give sufficient conditions, on the dimension of the product space and/or on the sublattice hull of a subset Q, for LQ to be entirely defined by the sublattice hulls of the two-dimensional projections of Q. This extends results of Topkis (1978) and of Veinott [Representation of general and polyhedral subsemilattices and sublattices of product spaces, Linear Algebra Appl. 114/115 (1989) 681-704]. We give similar sufficient conditions for the sublattice hull LQ to be representable using the epigraphs of certain isotone (i.e., nondecreasing) functions defined on the one-dimensional projections of Q. This also extends results of Topkis and Veinott. Using this representation we show that LQ is convex when Q is a convex subset in a vector lattice (Riesz space), and is a polyhedron when Q is a polyhedron in Rⁿ.We consider in greater detail the case of a finite product of finite chains (i.e., totally ordered sets). We use the representation with proper boundary epigraphs and provide upper and lower bounds on the number of sublattices, giving a partial answer to a problem posed by Birkhoff in 1937. These bounds are close to each other in a logarithmic sense. We define a corner representation of isotone functions and use it in conjunction with the representation with proper boundary epigraphs to define an encoding of sublattices. We show that this encoding is optimal (up to a constant factor) in terms of memory space. We also consider the sublattice hull membership problem of deciding whether a given point is in the sublattice hull LQ of a given subset Q. We present a good characterization and a polynomial time algorithm for this sublattice hull membership problem. We construct in polynomial time a data structure for the representation with proper boundary epigraphs, such that sublattice hull membership queries may be answered in time logarithmic in the size |Q| of the given subset.     

Topological aspects of the Medvedev lattice

We study the Medvedev degrees of mass problems with distinguished topological properties, such as denseness, closedness, or discreteness. We investigate the sublattices generated by these degrees; the prime ideal generated by the dense degrees and its complement, a prime filter; the filter generated by the nonzero closed degrees and the filter generated by the nonzero discrete degrees. We give a complete picture of the relationships of inclusion holding between these sublattices, these filters, and this ideal. We show that the sublattice of the closed Medvedev degrees is not a Brouwer algebra. We investigate the dense degrees of mass problems that are closed under Turing equivalence, and we prove that the dense degrees form an automorphism base for the Medvedev lattice. The results hold for both the Medvedev lattice on the Baire space and the Medvedev lattice on the Cantor space.     

Homogenization of hexagonal lattices

We characterize the macroscopic effective behavior of a graphene sheet modeled by a hexagonal lattice of elastic bars, using Γ-convergence.     

Dynamical combinatorics and torsion classes

For finite semidistributive lattices the map κ gives a bijection between the sets of completely join-irreducible elements and completely meet-irreducible elements.Here we study the κ-map in the context of torsion classes. It is well-known that the lattice of torsion classes for an artin algebra is semidistributive, but in general it is far from finite. We show the κ-map is well-defined on the set of completely join-irreducible elements, even when the lattice of torsion classes is infinite. We then extend κ to a map on torsion classes which have canonical join representations given by the special torsion classes associated to the minimal extending modules introduced by the first and third authors and A. Carroll in 2019.For hereditary algebras, we show that the extended κ-map on torsion classes is essentially the same as Ringel's ?-map on wide subcategories. Also in the hereditary case, we relate the square of κ to the Auslander-Reiten translation.     

On Boolean ranges of Banaschewski functions

We construct a countable lattice \({\varvec{\mathcal {S}}}\) isomorphic to a bounded sublattice of the subspace lattice of a vector space with two non-iso-morphic maximal Boolean sublattices. We represent one of them as the range of a Banaschewski function and we prove that this is not the case of the other. Hereby we solve a problem of F. Wehrung. We study coordinatizability of the lattice \({\varvec{\mathcal {S}}}\). We prove that although it does not contain a 3-frame, the lattice \({\varvec{\mathcal {S}}}\) is coordinatizable. We show that the two maximal Boolean sublattices correspond to maximal Abelian regular subalgebras of the coordinatizating ring.     

Intuitionistic fuzzy sublattices and ideals

We study the concept of intuitionistic fuzzy sublattices and intuitionistic fuzzy ideals of a lattice. Some characterization and properties of these intuitionistic fuzzy sublattices and ideals are established. Also we introduce the sum and product of two intuitionistic fuzzy ideals and prove that the sum and product of two Intuitionistic fuzzy ideals of a distributive lattice is again an intuitionistic fuzzy ideal. Moreover, we study the properties of intuitionistic fuzzy ideals under lattice homomorphism.     

A Gilbert-Varshamov-type bound for lattice packings

A Gilbert-Varshamov-type bound for Euclidean packings was recently found by Nebe and Xing. In this present paper, we derive a Gilbert-Varshamov-type bound for lattice packings by generalizing Rush's approach of combining p-ary codes with the lattice pZn. Specifically, we will exploit suitable sublattices of Zn as well as lattices of number fields in our construction. Our approach allows us to compute the center densities of lattices of moderately large dimensions which compare favorably with the best known densities given in the literature as well as the densities derived directly via Rush's method.     

Equational classes of f-rings with unit: disconnected classes

This paper introduces several families of equational classes of unital f-rings that are defined by equations that impose conditions on the elements between 0 and 1. We investigate the portion of the lattice of equational classes of f-rings that involves these classes.     

Characterizations of Complete Sublattices of a Given Complete Lattice

To characterize all complete sublattices of a given complete lattice is an important problem. In this paper we will give three different characterizations of complete sublattices of a complete lattice by using closure operators, kernel operators, and by using Galoisclosed subrelations.The research was supported by a grant of the faculty of Science ChiangMai University Thailand.