A result about the density of iterated line intersections in the plane

Let S be a finite set of points in the plane and let be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configurations of points S such that iteration of the above operation produces a dense set. We also discuss partial results on the characterization of those finite point-sets with rational coordinates that generate all of through iteration of .     

More examples on ordered set reconstruction

We show that there are nonisomorphic ordered sets P and Q that have the same maximal and minimal decks and a rank k such that there is a map B from the elements of rank k in P to the elements of rank k in Q such that P{x} is isomorphic to Q{B(x)} for all x of rank k in P. The examples are preceded by a criterion as to when two nonisomorphic ordered sets will have a rank k and a map B as above.     

A characterization of level planar graphs

We present a characterization of level planar graphs in terms of minimal forbidden subgraphs called minimal level non-planar (MLNP) subgraph patterns. We show that an MLNP subgraph pattern is completely characterized by either a tree, a level non-planar cycle or a level planar cycle with certain path augmentations.     

Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph

In 1996, J.C. Bermond, T. Kodate, S. Perennes and N. Marlin conjectured that the set F_σ of fixed points of some complete rotation σ of the toroidal mesh TM(p)^k is not separating (that is F_σ does not disconnect TM(p)^k). They also conjectured that the set F_ω of fixed points of any complete rotation ω of any Cayley digraph is not separating. In this paper, we prove the first conjecture and disprove the second one.