Exceptional Moufang quadrangles and structurable algebras

In 2000, J. Tits and R. Weiss classified all Moufang spherical buildings of rank two, also known as Moufang polygons. The hardest case in the classification consists of the Moufang quadrangles. They fall into different families, each of which can be described by an appropriate algebraic structure. For the exceptional quadrangles, this description is intricate and involves many different maps that are defined ad hoc and lack a proper explanation. In this paper, we relate these algebraic structures to two other classes of algebraic structures that had already been studied before, namely to Freudenthal triple systems and to structurable algebras. We show that these structures give new insight in the understanding of the corresponding Moufang quadrangles.Comment: 49 page

Non-polynomial Worst-Case Analysis of Recursive Programs

We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of nonrecursive programs. First, we apply ranking functions to recursion, resulting in measure functions. We show that measure functions provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in nonpolynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form $\mathcal{O}(n\log n)$ as well as $\mathcal{O}(n^r)$ where $r$ is not an integer. We present experimental results to demonstrate that our approach can obtain efficiently worst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the divide-and-conquer algorithm for the Closest-Pair problem, where we obtain $\mathcal{O}(n \log n)$ worst-case bound, and (ii) Karatsuba's algorithm for polynomial multiplication and Strassen's algorithm for matrix multiplication, where we obtain $\mathcal{O}(n^r)$ bound such that $r$ is not an integer and close to the best-known bounds for the respective algorithms.Comment: 54 Pages, Full Version to CAV 201

On Deformations of n-Lie algebras

The aim of this paper is to review the deformation theory of $n$-Lie algebras. We summarize the 1-parameter formal deformation theory and provide a generalized approach using any unital commutative associative algebra as a deformation base. Moreover, we discuss degenerations and quantization of $n$-Lie algebras.Comment: Proceeding of the conference Dakar's Workshop in honor of Pr Amin Kaidi. arXiv admin note: text overlap with arXiv:hep-th/9602016 by other author