42,671 research outputs found
A complexity dichotomy for poset constraint satisfaction
In this paper we determine the complexity of a broad class of problems that
extends the temporal constraint satisfaction problems. To be more precise we
study the problems Poset-SAT(), where is a given set of
quantifier-free -formulas. An instance of Poset-SAT() consists of
finitely many variables and formulas
with ; the question is
whether this input is satisfied by any partial order on or
not. We show that every such problem is NP-complete or can be solved in
polynomial time, depending on . All Poset-SAT problems can be formalized
as constraint satisfaction problems on reducts of the random partial order. We
use model-theoretic concepts and techniques from universal algebra to study
these reducts. In the course of this analysis we establish a dichotomy that we
believe is of independent interest in universal algebra and model theory.Comment: 29 page
When is the Haar measure a Pietsch measure for nonlinear mappings?
We show that, as in the linear case, the normalized Haar measure on a compact
topological group is a Pietsch measure for nonlinear summing mappings on
closed translation invariant subspaces of . This answers a question posed
to the authors by J. Diestel. We also show that our result applies to several
well-studied classes of nonlinear summing mappings. In the final section some
problems are proposed
- …