Monotonicity conjecture for stream-structure graphs
Statement
Let be a semi-flow, and let and be stream structures with graphs and , respectively. Assume every node of is a subset of a node of . Let be nodes of and let be nodes of such that and .
Monotonicity conjecture. If in , then in ; equivalently, maps into .
This conjecture asserts that enlarging the nodes preserves the graph relation. The supplied text gives no indication that it has been proved or refuted.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.