195 research outputs found
Update schedules of sequential dynamical systems
AbstractSequential dynamical systems have the property, that the updates of states of individual cells occur sequentially, so that the global update of the system depends on the order of the individual updates. This order is given by an order on the set of vertices of the dependency graph. It turns out that only a partial suborder is necessary to describe the global update. This paper defines and studies this partial order and its influence on the global update function
Minimizing the number of vehicles to meet a fixed periodic schedule : an application of periodic posets
Includes bibliographical references (leaf 25).Supported in part by the U.S. Army Research Office. DAAG29-80-C-0061by James B. Orlin
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
In this paper we study the problem of existence of a crossing-free acyclic
hamiltonian path completion (for short, HP-completion) set for embedded upward
planar digraphs. In the context of book embeddings, this question becomes:
given an embedded upward planar digraph , determine whether there exists an
upward 2-page book embedding of preserving the given planar embedding.
Given an embedded -digraph which has a crossing-free HP-completion
set, we show that there always exists a crossing-free HP-completion set with at
most two edges per face of . For an embedded -free upward planar digraph
, we show that there always exists a crossing-free acyclic HP-completion set
for which, moreover, can be computed in linear time. For a width-
embedded planar -digraph , we show that we can be efficiently test
whether admits a crossing-free acyclic HP-completion set.Comment: Accepted to ISAAC200
Interval Orders with Restrictions on the Interval Lengths
This thesis examines several classes of interval orders arising from restrictions on the permissible interval lengths. We first provide an accessible proof of the characterization theorem for the class of interval orders representable with lengths between 1 and k for each k in {1,2,...}. We then consider the interval orders representable with lengths exactly 1 and k for k in {0,1,...}. We characterize the class of interval orders representable with lengths 0 and 1, both structurally and algorithmically. To study the other classes in this family, we consider a related problem, in which each interval has a prescribed length. We derive a necessary and sufficient condition for an interval order to have a representation with a given set of prescribed lengths. Using this result, we provide a necessary condition for an interval order to have a representation with lengths 1 and 2
SOME ASPECTS OF TOPOLOGICAL SORTING
In this paper, we provide an outline of most of the known techniques and principal results pertaining to computing and counting topological sorts, realizers and dimension of a finite partially ordered set, and identify some new directions
An algorithmic characterization of antimatroids
In an article entitled “Optimal sequencing of a single machine subject to precedence constraints” E.L. Lawler presented a now classical minmax result for job scheduling. In essence, Lawler's proof demonstrated that the properties of partially ordered sets were sufficient to solve the posed scheduling problem. These properties are, in fact, common to a more general class of combinatorial structures known as antimatroids, which have recently received considerable attention in the literature. It is demonstrated that the properties of antimatroids are not only sufficient but necessary to solve the scheduling problem posed by Lawler, thus yielding an algorithmic characterization of antimatroids. Examples of problems solvable by the general result are provided
Categorical Combinatorics for Innocent Strategies
International audienceWe show how to construct the category of games and innocent strategies from a more primitive category of games. On that category we define a comonad and monad with the former distributing over the latter. Innocent strategies are the maps in the induced two-sided Kleisli category. Thus the problematic composition of innocent strategies reflects the use of the distributive law. The composition of simple strategies, and the combinatorics of pointers used to give the comonad and monad are themselves described in categorical terms. The notions of view and of legal play arise naturally in the explanation of the distributivity. The category-theoretic perspective provides a clear discipline for the necessary combinatorics
- …