Maximal strategies in n-state fully controllable nondeterministic or stochastic graphs admit at least (n-1)! action-release sequences of length >= n-1 that delay full identification until the final revelation.
Poset Topology: Tools and Applications
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
These lecture notes for the IAS/Park City Graduate Summer School in Geometric Combinatorics (July 2004) provide an overview of poset topology. These notes include introductory material, as well as recent developments and open problems. Some of the topics covered are: subspace arrangements, graph complexes, group actions on poset homology, shellability, recursive techniques, and fiber theorems.
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deception, Delay, and Detection of Strategies
Maximal strategies in n-state fully controllable nondeterministic or stochastic graphs admit at least (n-1)! action-release sequences of length >= n-1 that delay full identification until the final revelation.