Weak Distributivity Implying Distributivity

Let $\mathbb{B}$ be a complete Boolean algebra. We show, as an application of a previous result of the author, that if $\lambda$ is an infinite cardinal and $\mathbb{B}$ is weakly $(\lambda^\omega, \omega)$-distributive, then $\mathbb{B}$ is $(\lambda, 2)$-distributive. Using a parallel result, we show that if $\kappa$ is a weakly compact cardinal such that $\mathbb{B}$ is weakly $(2^\kappa, \kappa)$-distributive and $\mathbb{B}$ is $(\alpha, 2)$-distributive for each $\alpha < \kappa$, then $\mathbb{B}$ is $(\kappa, 2)$-distributive.Comment: 12 page

On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry

An algorithm for unification modulo one-sided distributivity is an early result by Tid\'en and Arnborg. More recently this theory has been of interest in cryptographic protocol analysis due to the fact that many cryptographic operators satisfy this property. Unfortunately the algorithm presented in the paper, although correct, has recently been shown not to be polynomial time bounded as claimed. In addition, for some instances, there exist most general unifiers that are exponentially large with respect to the input size. In this paper we first present a new polynomial time algorithm that solves the decision problem for a non-trivial subcase, based on a typed theory, of unification modulo one-sided distributivity. Next we present a new polynomial algorithm that solves the decision problem for unification modulo one-sided distributivity. A construction, employing string compression, is used to achieve the polynomial bound. Lastly, we examine the one-sided distributivity problem in the new asymmetric unification paradigm. We give the first asymmetric unification algorithm for one-sided distributivity

Left-Garside categories, self-distributivity, and braids

In connection with the emerging theory of Garside categories, we develop the notions of a left-Garside category and of a locally left-Garside monoid. In this framework, the connection between the self-distributivity law LD and braids amounts to the result that a certain category associated with LD is a left-Garside category, which projects onto the standard Garside category of braids. This approach leads to a realistic program for establishing the Embedding Conjecture of [Dehornoy, Braids and Self-distributivity, Birkhauser (2000), Chap. IX]

A Note on some Characterization of Distributive Lattices of Finite Length

Using known facts we give a simple characterization of the distributivity of lattices of finite length

An Inflationary Fixed Point Operator in XQuery

We introduce a controlled form of recursion in XQuery, inflationary fixed points, familiar in the context of relational databases. This imposes restrictions on the expressible types of recursion, but we show that inflationary fixed points nevertheless are sufficiently versatile to capture a wide range of interesting use cases, including the semantics of Regular XPath and its core transitive closure construct. While the optimization of general user-defined recursive functions in XQuery appears elusive, we will describe how inflationary fixed points can be efficiently evaluated, provided that the recursive XQuery expressions exhibit a distributivity property. We show how distributivity can be assessed both, syntactically and algebraically, and provide experimental evidence that XQuery processors can substantially benefit during inflationary fixed point evaluation.Comment: 11 pages, 10 figures, 2 table