Construction of self-dual normal bases and their complexity

Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an explicit and constructive manner and apply them, through computer search, to identify the lowest complexity of self-dual normal bases for extensions of low degree. Comparisons to similar searches amongst normal bases show that the lowest complexity is often achieved from a self-dual normal basis

Defeasible Reasoning in SROEL: from Rational Entailment to Rational Closure

In this work we study a rational extension $SROEL^R T$ of the low complexity description logic SROEL, which underlies the OWL EL ontology language. The extension involves a typicality operator T, whose semantics is based on Lehmann and Magidor's ranked models and allows for the definition of defeasible inclusions. We consider both rational entailment and minimal entailment. We show that deciding instance checking under minimal entailment is in general $\Pi^P_2$-hard, while, under rational entailment, instance checking can be computed in polynomial time. We develop a Datalog calculus for instance checking under rational entailment and exploit it, with stratified negation, for computing the rational closure of simple KBs in polynomial time.Comment: Accepted for publication on Fundamenta Informatica

Canonical tensor product subfactors

Canonical tensor product subfactors (CTPS's) describe, among other things, the embedding of chiral observables in two-dimensional conformal quantum field theories. A new class of CTPS's is constructed some of which are associated with certain modular invariants, thereby establishing the expected existence of the corresponding two-dimensional theories.Comment: 14 pages; references added and minor improvement

Modelling fluctuations of financial time series: from cascade process to stochastic volatility model

In this paper, we provide a simple, ``generic'' interpretation of multifractal scaling laws and multiplicative cascade process paradigms in terms of volatility correlations. We show that in this context 1/f power spectra, as observed recently by Bonanno et al., naturally emerge. We then propose a simple solvable ``stochastic volatility'' model for return fluctuations. This model is able to reproduce most of recent empirical findings concerning financial time series: no correlation between price variations, long-range volatility correlations and multifractal statistics. Moreover, its extension to a multivariate context, in order to model portfolio behavior, is very natural. Comparisons to real data and other models proposed elsewhere are provided.Comment: 21 pages, 5 figure

The supermembrane revisited

The M2-brane is studied from the perspective of superembeddings. We review the derivation of the M2-brane dynamics and the supergravity constraints from the standard superembedding constraint and we discuss explicitly the induced d=3, N=8 superconformal geometry on the worldvolume. We show that the gauged supermembrane, for a target space with a U(1) isometry, is the standard D2-brane in a type IIA supergravity background. In particular, the D2-brane action, complete with the Dirac-Born-Infeld term, arises from the gauged Wess-Zumino worldvolume 4-form via the brane action principle. The discussion is extended to the massive D2-brane considered as a gauged supermembrane in a massive D=11 superspace background. Type IIA supergeometry is derived using Kaluza-Klein techniques in superspace.Comment: Latex, 46 pages, clarifying remarks and references adde

Generalized Satisfiability Problems via Operator Assignments

Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier transform is used to represent constraints by multilinear polynomials in a unique way. The polynomial representation of constraints gives rise to a relaxation of the notion of satisfiability in which the values to variables are linear operators on some Hilbert space. For the case of constraints given by a system of linear equations over the two-element field, this relaxation has received considerable attention in the foundations of quantum mechanics, where such constructions as the Mermin-Peres magic square show that there are systems that have no solutions in the Boolean domain, but have solutions via operator assignments on some finite-dimensional Hilbert space. We obtain a complete characterization of the classes of Boolean relations for which there is a gap between satisfiability in the Boolean domain and the relaxation of satisfiability via operator assignments. To establish our main result, we adapt the notion of primitive-positive definability (pp-definability) to our setting, a notion that has been used extensively in the study of constraint satisfaction problems. Here, we show that pp-definability gives rise to gadget reductions that preserve satisfiability gaps. We also present several additional applications of this method. In particular and perhaps surprisingly, we show that the relaxed notion of pp-definability in which the quantified variables are allowed to range over operator assignments gives no additional expressive power in defining Boolean relations