3,793 research outputs found
Note on the number of edges in families with linear union-complexity
We give a simple argument showing that the number of edges in the
intersection graph of a family of sets in the plane with a linear
union-complexity is . In particular, we prove for intersection graph of a family of
pseudo-discs, which improves a previous bound.Comment: background and related work is now more complete; presentation
improve
Conflict-Free Coloring of Intersection Graphs of Geometric Objects
In FOCS'2002, Even et al. introduced and studied the notion of conflict-free
colorings of geometrically defined hypergraphs. They motivated it by frequency
assignment problems in cellular networks. This notion has been extensively
studied since then.
A conflict-free coloring of a graph is a coloring of its vertices such that
the neighborhood (pointed or closed) of each vertex contains a vertex whose
color differs from the colors of all other vertices in that neighborhood. In
this paper we study conflict-colorings of intersection graphs of geometric
objects. We show that any intersection graph of n pseudo-discs in the plane
admits a conflict-free coloring with O(\log n) colors, with respect to both
closed and pointed neighborhoods. We also show that the latter bound is
asymptotically sharp. Using our methods, we also obtain a strengthening of the
two main results of Even et al. which we believe is of independent interest. In
particular, in view of the original motivation to study such colorings, this
strengthening suggests further applications to frequency assignment in wireless
networks.
Finally, we present bounds on the number of colors needed for conflict-free
colorings of other classes of intersection graphs, including intersection
graphs of axis-parallel rectangles and of \rho-fat objects in the plane.Comment: 18 page
An open string analogue of Viterbo functoriality
Liouville domains are a special type of symplectic manifolds with boundary
(they have an everywhere defined Liouville flow, pointing outwards along the
boundary). Symplectic cohomology for Liouville domains was introduced by
Cieliebak-Floer-Hofer-Wysocki and Vitero. The latter constructed a restriction
(or transfer) map associated to an embedding of one Liouville domain into
another.
In this preprint, we look at exact Lagrangian submanifolds with Legendrian
boundary inside a Liouville domain. The analogue of symplectic cohomology for
such submanifolds is called "wrapped Floer cohomology". We construct an
A_\infty-structure on the underlying wrapped Floer complex, and (under suitable
assumptions) an A_\infty-homomorphism realizing the restriction to a Liouville
subdomain. The construction of the A_\infty-structure relies on an
implementation of homotopy direct limits, and involves some new moduli spaces
which are solutions of generalized continuation map equations.Comment: 71 pages, 9 figures, minor revision correcting typographical errors
and clarifying the exposition following a referee's comment
Computing trisections of 4-manifolds
Algorithms that decompose a manifold into simple pieces reveal the geometric
and topological structure of the manifold, showing how complicated structures
are constructed from simple building blocks. This note describes a way to
algorithmically construct a trisection, which describes a -dimensional
manifold as a union of three -dimensional handlebodies. The complexity of
the -manifold is captured in a collection of curves on a surface, which
guide the gluing of the handelbodies. The algorithm begins with a description
of a manifold as a union of pentachora, or -dimensional simplices. It
transforms this description into a trisection. This results in the first
explicit complexity bounds for the trisection genus of a -manifold in terms
of the number of pentachora (-simplices) in a triangulation.Comment: 15 pages, 9 figure
Infinite sequence of fixed point free pseudo-Anosov homeomorphisms
We construct infinite sequences of pseudo-Anosov homeomorphisms without fixed
points and leaving invariant a sequence of orientable measured foliations on
the same topological surface and the same stratum of the space of abelian
differentials. The existence of such sequences show that all pseudo-Anosov
homeomorphisms fixing orientable measured foliations cannot be obtained by the
Rauzy-Veech induction strategy
Conflict-Free Coloring Made Stronger
In FOCS 2002, Even et al. showed that any set of discs in the plane can
be Conflict-Free colored with a total of at most colors. That is,
it can be colored with colors such that for any (covered) point
there is some disc whose color is distinct from all other colors of discs
containing . They also showed that this bound is asymptotically tight. In
this paper we prove the following stronger results:
\begin{enumerate} \item [(i)] Any set of discs in the plane can be
colored with a total of at most colors such that (a) for any
point that is covered by at least discs, there are at least
distinct discs each of which is colored by a color distinct from all other
discs containing and (b) for any point covered by at most discs,
all discs covering are colored distinctively. We call such a coloring a
{\em -Strong Conflict-Free} coloring. We extend this result to pseudo-discs
and arbitrary regions with linear union-complexity.
\item [(ii)] More generally, for families of simple closed Jordan regions
with union-complexity bounded by , we prove that there exists
a -Strong Conflict-Free coloring with at most colors.
\item [(iii)] We prove that any set of axis-parallel rectangles can be
-Strong Conflict-Free colored with at most colors.
\item [(iv)] We provide a general framework for -Strong Conflict-Free
coloring arbitrary hypergraphs. This framework relates the notion of -Strong
Conflict-Free coloring and the recently studied notion of -colorful
coloring. \end{enumerate}
All of our proofs are constructive. That is, there exist polynomial time
algorithms for computing such colorings
- …