1,758 research outputs found
Lattice initial segments of the hyperdegrees
We affirm a conjecture of Sacks [1972] by showing that every countable
distributive lattice is isomorphic to an initial segment of the hyperdegrees,
. In fact, we prove that every sublattice of any
hyperarithmetic lattice (and so, in particular, every countable locally finite
lattice) is isomorphic to an initial segment of . Corollaries
include the decidability of the two quantifier theory of
and the undecidability of its three quantifier theory. The key tool in the
proof is a new lattice representation theorem that provides a notion of forcing
for which we can prove a version of the fusion lemma in the hyperarithmetic
setting and so the preservation of . Somewhat surprisingly,
the set theoretic analog of this forcing does not preserve . On
the other hand, we construct countable lattices that are not isomorphic to an
initial segment of
Lower Semimodular Inverse Semigroups, II
The authors’ description of the inverse semigroups S for which the lattice ℒℱ(S) of full inverse subsemigroups is lower semimodular is used to describe those for which (a) the lattice ℒ(S) of all inverse subsemigroups or (b) the lattice �o(S) of convex inverse subsemigroups has that property. In each case, we show that this occurs if and only if the entire lattice is a subdirect product of ℒℱ(S) with ℒ(E S ), or �o(E S ), respectively, where E S is the semilattice of idempotents of S; a simple necessary and sufficient condition is found for each decomposition. For a semilattice E, ℒ(E) is in fact always lower semimodular, and �o(E) is lower semimodular if and only if E is a tree. The conjunction of these results leads to quite a divergence between the ultimate descriptions in the two cases, ℒ(S) and �o(S), with the latter being substantially richer
Semidistributive Inverse Semigroups, II
The description by Johnston-Thom and the second author of the inverse semigroups S for which the lattice LJ(S) of full inverse subsemigroups of S is join semidistributive is used to describe those for which (a) the lattice L(S) of all inverse subsemigroups or (b) the lattice lo(S) of convex inverse subsemigroups have that property. In contrast with the methods used by the authors to investigate lower semimodularity, the methods are based on decompositions via GS, the union of the subgroups of the semigroup (which is necessarily cryptic)
Homology of Distributive Lattices
We outline the theory of sets with distributive operations: multishelves and
multispindles, with examples provided by semi-lattices, lattices and skew
lattices. For every such a structure we define multi-term distributive homology
and show some of its properties. The main result is a complete formula for the
homology of a finite distributive lattice. We also indicate the answer for
unital spindles and conjecture the general formula for semi-lattices and some
skew lattices. Then we propose a generalization of a lattice as a set with a
number of idempotent operations satisfying the absorption law.Comment: 30 pages, 3 tables, 3 figure
Admissibility via Natural Dualities
It is shown that admissible clauses and quasi-identities of quasivarieties
generated by a single finite algebra, or equivalently, the quasiequational and
universal theories of their free algebras on countably infinitely many
generators, may be characterized using natural dualities. In particular,
axiomatizations are obtained for the admissible clauses and quasi-identities of
bounded distributive lattices, Stone algebras, Kleene algebras and lattices,
and De Morgan algebras and lattices.Comment: 22 pages; 3 figure
Orientation-Constrained Rectangular Layouts
We construct partitions of rectangles into smaller rectangles from an input
consisting of a planar dual graph of the layout together with restrictions on
the orientations of edges and junctions of the layout. Such an
orientation-constrained layout, if it exists, may be constructed in polynomial
time, and all orientation-constrained layouts may be listed in polynomial time
per layout.Comment: To appear at Algorithms and Data Structures Symposium, Banff, Canada,
August 2009. 12 pages, 5 figure
Conjunctive Bayesian networks
Conjunctive Bayesian networks (CBNs) are graphical models that describe the
accumulation of events which are constrained in the order of their occurrence.
A CBN is given by a partial order on a (finite) set of events. CBNs generalize
the oncogenetic tree models of Desper et al. by allowing the occurrence of an
event to depend on more than one predecessor event. The present paper studies
the statistical and algebraic properties of CBNs. We determine the maximum
likelihood parameters and present a combinatorial solution to the model
selection problem. Our method performs well on two datasets where the events
are HIV mutations associated with drug resistance. Concluding with a study of
the algebraic properties of CBNs, we show that CBNs are toric varieties after a
coordinate transformation and that their ideals possess a quadratic Gr\"{o}bner
basis.Comment: Published in at http://dx.doi.org/10.3150/07-BEJ6133 the Bernoulli
(http://isi.cbs.nl/bernoulli/) by the International Statistical
Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm
- …