Finite isomorphically complete systems

AbstractIn the theory of finite automata it is an important problem to characterize such systems of automata from which any automaton can be built under a given composition and representation. Such systems are called complete with respect to the fixed composition and representation. From practical point of view, it is useful to determine those compositions and representations for which there are finite complete systems. In this paper we show that the existence of finite complete systems implies the unboundedness of the feedback dependency of the composition

On cascade products of answer set programs

Describing complex objects by elementary ones is a common strategy in mathematics and science in general. In their seminal 1965 paper, Kenneth Krohn and John Rhodes showed that every finite deterministic automaton can be represented (or "emulated") by a cascade product of very simple automata. This led to an elegant algebraic theory of automata based on finite semigroups (Krohn-Rhodes Theory). Surprisingly, by relating logic programs and automata, we can show in this paper that the Krohn-Rhodes Theory is applicable in Answer Set Programming (ASP). More precisely, we recast the concept of a cascade product to ASP, and prove that every program can be represented by a product of very simple programs, the reset and standard programs. Roughly, this implies that the reset and standard programs are the basic building blocks of ASP with respect to the cascade product. In a broader sense, this paper is a first step towards an algebraic theory of products and networks of nonmonotonic reasoning systems based on Krohn-Rhodes Theory, aiming at important open issues in ASP and AI in general.Comment: Appears in Theory and Practice of Logic Programmin

Examples of k-iterated spreading models

It is shown that for every $k\in\mathbb{N}$ and every spreading sequence $\{e_n\}_{n\in\mathbb{N}}$ that generates a uniformly convex Banach space $E$, there exists a uniformly convex Banach space $X_{k+1}$ admitting $\{e_n\}_{n\in\mathbb{N}}$ as a $k+1$-iterated spreading model, but not as a $k$-iterated one.Comment: 16 pages, no figure

An approximation theorem for nuclear operator systems

We prove that an operator system $\mathcal S$ is nuclear in the category of operator systems if and only if there exist nets of unital completely positive maps \phi_\lambda : \cl S \to M_{n_\lambda} and \psi_\lambda : M_{n_\lambda} \to \cl S such that $\psi_\lambda \circ \phi_\lambda$ converges to {\rm id}_{\cl S} in the point-norm topology. Our proof is independent of the Choi-Effros-Kirchberg characterization of nuclear $C^*$-algebras and yields this characterization as a corollary. We give an example of a nuclear operator system that is not completely order isomorphic to a unital $C^*$-algebra.Comment: 10 pages; to appear in JF

Minimal sections of conic bundles

Let the threefold X be a general smooth conic bundle over the projective plane P(2), and let (J(X), Theta) be the intermediate jacobian of X. In this paper we prove the existence of two natural families C(+) and C(-) of curves on X, such that the Abel-Jacobi map F sends one of these families onto a copy of the theta divisor (Theta), and the other -- onto the jacobian J(X). The general curve C of any of these two families is a section of the conic bundle projection, and our approach relates such C to a maximal subbundle of a rank 2 vector bundle E(C) on C, or -- to a minimal section of the ruled surface P(E(C)). The families C(+) and C(-) correspond to the two possible types of versal deformations of ruled surfaces over curves of fixed genus g(C). As an application, we find parameterizations of J(X) and (Theta) for certain classes of Fano threefolds, and study the sets Sing(Theta) of the singularities of (Theta).Comment: Duke preprint, 29 pages. LaTex 2.0