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.     

Unbounded semidistributive lattices

We consider two properties which are close to being lower bounded in the class of finite join semidistributive lattices. An example is constructed in which a finite join semidistributive lattice has both these two properties, but it is not lower bounded. Translated fromAlgebra i Logika, Vol. 39, No. 1, pp. 87–92, January–February, 2000.     

Congruence join semidistributivity is equivalent to a congruence identity

We show that a locally finite variety is congruence join semidistributive if and only if it satisfies a congruence identity that is strong enough to force join semidistributivity in any lattice. Received February 9, 2000; accepted in final form November 23, 2000.     

The lattice of completely simple subsemigroups of a completely simple semigroup

In this paper, we present necessary and sufficient conditions for the lattice of completely simple subsemigroups of a completely simple semigroup to be 0-modular or 0-semidistributive or join semidistributive.     

Generalizing semidistributivity

A latticeL is called congruence normal if it can be generated by doubling of convex sets starting with the one-element lattice. In the special case of intervals, the lattice is called bounded. It has been proven thatL is bounded if and only ifL is congruence normal and semidistributive.In this paper we study the connection between certain classes of convex sets and generalized semidistributive laws. These so-called doubling classes are pseudovarieties which can be described by implications as well as by forbiden substructures. In the end, we examine the structure of the lattice of all doubling classes.     

The Lattice of Completions of an Ordered Set

For any ordered set P, the join dense completions of P form a complete lattice K(P) with least element O(P), the lattice of order ideals of P, and greatest element M(P), the Dedekind–MacNeille completion P. The lattice K(P) is isomorphic to an ideal of the lattice of all closure operators on the lattice O(P). Thus it inherits some local structural properties which hold in the lattice of closure operators on any complete lattice. In particular, if K(P) is finite, then it is an upper semimodular lattice and an upper bounded homomorphic image of a free lattice, and hence meet semidistributive.     

Noncrossing partitions and the shard intersection order

We define a new lattice structure \((W,\preceq)\) on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC?(W) as a sublattice. The new construction of NC?(W) yields a new proof that NC?(W) is a lattice. The shard intersection order is graded and its rank generating function is the W-Eulerian polynomial. Many order-theoretic properties of \((W,\preceq)\), like Möbius number, number of maximal chains, etc., are exactly analogous to the corresponding properties of NC?(W). There is a natural dimension-preserving bijection between simplices in the order complex of \((W,\preceq)\) (i.e. chains in \((W,\preceq)\)) and simplices in a certain pulling triangulation of the W-permutohedron. Restricting the bijection to the order complex of NC?(W) yields a bijection to simplices in a pulling triangulation of the W-associahedron.The lattice \((W,\preceq)\) is defined indirectly via the polyhedral geometry of the reflecting hyperplanes of W. Indeed, most of the results of the paper are proven in the more general setting of simplicial hyperplane arrangements.     

The Lattice of Full Subsemigroups of an Inverse Semigroup

In this paper, we consider the lattice Subf S of full subsemigroups of an inverse semigroup S. Our first main theorem states that for any inverse semigroup S, Subf S is a subdirect product of the lattices of full subsemigroups of its principal factors, so that Subf S is distributive [meet semidistributive, join semidistributive, modular, semimodular] if and only if the lattice of full subsemigroups of each principal factor is. To examine such inverse semigroups, therefore, we need essentially only consider those which are 0-simple. For a 0-simple inverse semigroup S (not a group with zero), we show that in fact each of modularity, meet semidistributivity and join semidistributivity of Subf S is equivalent to distributivity of S, that is, S is the combinatorial Brandt semigroup with exactly two nonzero idempotents and two nonidempotents. About semimodularity, however, we concentrate only on the completely 0-simple case, that is, Brandt semigroups. For a Brandt semigroup S (not a group with zero), semimodularity of Subf S is equivalent to distributivity of Subf S. Finally, we characterize an inverse semigroup S for which Subf S is a chain.     

布尔矩阵的指标格的性质

介绍了布尔矩阵的行零元、列零元和相容子矩阵的定义并讨论了它们的性质,给出了布尔矩阵的指标格分别为分配格、半分配格和半模格的等价条件.     

The rank of a distributive lattice

The rank of a partial ordering P is the maximum size of an irredundant family of linear extensions of P whose intersection is P. A simple relationship is established between the rank of a finite distributive lattice and its subset of join irreducible elements.     

Semidistributive and distributively decomposable rings

A module is said to be distributive if the lattice of all its submodules is distributive. A module is called semidistributive if it is a direct sum of distributive modules. Right semidistributive rings, as well as distributively decomposable rings, are investigated. Translated fromMatematicheskie Zemetki, Vol. 65, No. 2, pp. 307–313, February, 1999.     

A combinatorial analysis of topological dissections

From a topological space remove certain subspaces (cuts), leaving connected components (regions). We develop an enumerative theory for the regions in terms of the cuts, with the aid of a theorem on the Möbius algebra of a subset of a distributive lattice. Armed with this theory we study dissections into cellular faces and dissections in the d-sphere. For example, we generalize known enumerations for arrangements of hyperplanes to convex sets and topological arrangements, enumerations for simple arrangements and the Dehn-Sommerville equations for simple polytopes to dissections with general intersection, and enumerations for arrangements of lines and curves and for plane convex sets to dissections by curves of the 2-sphere and planar domains.     

Intersection of triadic Cantor sets with their translates— I. Fundamental properties

Motivated by Mandelbrot's [The Fractal Geometry of Nature, Freeman, San Francisco, 1983] idea of referring to lacunarity of Cantor sets in terms of departure from translation invariance, we study the properties of these translation sets and show how they can be used for a classification purpose. This first paper of a series of two will be devoted to set up the fundamental properties of Hausdorff measures of those intersection sets. Using the triadic expansion of the shifting number, we determine the fractal structure of intersection of triadic Cantor sets with their translates. We found that the Hausdorff measure of these sets forms a discrete spectrum whose non-zero values come only from those shifting numbers with a finite triadic expansion. We characterize this set of shifting numbers by giving a partition expression of it and the steps of its construction from a fundamental root set. Finally, we prove that intersection of Cantor sets with their translates verify a measure-conservation law with scales. The second paper will take advantage of the properties exposed here in order to utilize them in a classification context. Mainly, it will deal with the use of the discrete spectrum of measures to distinguish two Cantor-like sets of the same fractal dimension.     

Hypersimplicity and semicomputability in the weak truth table degrees

We study the classes of hypersimple and semicomputable sets as well as their intersection in the weak truth table degrees. We construct degrees that are not bounded by hypersimple degrees outside any non-trivial upper cone of Turing degrees and show that the hypersimple-free c.e. wtt degrees are downwards dense in the c.e. wtt degrees. We also show that there is no maximal (w.r.t. ≤_wtt) hypersimple wtt degree. Moreover, we consider the sets that are both hypersimple and semicomputable, characterize them as the (bi-infinite) c.e. cuts of computable orderings of ℕ of order type ω+ω* and study their wtt degrees. We show that there are hypersimple degrees that are not bounded by any hypersimple semicomputable degree, investigate relationships with the join and look for maximal and minimal elements of related classes. I wish to thank the anonymous referee for making helpful remarks that have improved the presentation of this work.     

Representations admitting two pairs of supplementary invariant spaces

We examine the lattice generated by two pairs of supplementary vector subspaces of a finite-dimensional vector-space by intersection and sum, with the aim of applying the results to the study of representations admitting two pairs of supplementary invariant spaces, or one pair and a reflexive form. We show that such a representation is a direct sum of three canonical sub-representations which we characterize. We then focus on representations of Berger algebras with the same property.