14,146 research outputs found
The cutting center theorem for trees
We introduce the cutting number of a point of a connected graph as a natural measure of the extent to which the removal of that point disconnects the graph. The cutting center of the graph is the set of points of maximum cutting number. All possible configurations for the cutting center of a tree are determined, and examples are constructed which realize them. Using the lemma that the cutting center of a tree always lies on a path, it is shown specifically that (1) for every positive integer n, there exists a tree whose cutting center consists of all the n points on this path, and (2) for every nonempty subset of the points on this path, there exists a tree whose cutting center is precisely that subset.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/33655/1/0000164.pd
Output-Sensitive Tools for Range Searching in Higher Dimensions
Let be a set of points in . A point is
\emph{-shallow} if it lies in a halfspace which contains at most points
of (including ). We show that if all points of are -shallow, then
can be partitioned into subsets, so that any hyperplane
crosses at most subsets. Given such
a partition, we can apply the standard construction of a spanning tree with
small crossing number within each subset, to obtain a spanning tree for the
point set , with crossing number . This allows us to extend the construction of Har-Peled
and Sharir \cite{hs11} to three and higher dimensions, to obtain, for any set
of points in (without the shallowness assumption), a
spanning tree with {\em small relative crossing number}. That is, any
hyperplane which contains points of on one side, crosses
edges of . Using a
similar mechanism, we also obtain a data structure for halfspace range
counting, which uses space (and somewhat higher
preprocessing cost), and answers a query in time , where is the output size
Cutting arcs for torus links and trees
Among all torus links, we characterise those arising as links of simple plane
curve singularities by the property that their fibre surfaces admit only a
finite number of cutting arcs that preserve fibredness. The same property
allows a characterisation of Coxeter-Dynkin trees (i.e., , , ,
and ) among all positive tree-like Hopf plumbings.Comment: 27 pages, 18 figures. Results have been extended to cover all
Coxeter-Dynkin trees in the new versio
Destruction of very simple trees
We consider the total cost of cutting down a random rooted tree chosen from a
family of so-called very simple trees (which include ordered trees, -ary
trees, and Cayley trees); these form a subfamily of simply generated trees. At
each stage of the process an edge is chose at random from the tree and cut,
separating the tree into two components. In the one-sided variant of the
process the component not containing the root is discarded, whereas in the
two-sided variant both components are kept. The process ends when no edges
remain for cutting. The cost of cutting an edge from a tree of size is
assumed to be . Using singularity analysis and the method of moments,
we derive the limiting distribution of the total cost accrued in both variants
of this process. A salient feature of the limiting distributions obtained
(after normalizing in a family-specific manner) is that they only depend on
.Comment: 20 pages; Version 2 corrects some minor error and fixes a few typo
-covering red and blue points in the plane
We say that a finite set of red and blue points in the plane in general
position can be -covered if the set can be partitioned into subsets of
size , with points of one color and point of the other color, in
such a way that, if at each subset the fourth point is connected by
straight-line segments to the same-colored points, then the resulting set of
all segments has no crossings. We consider the following problem: Given a set
of red points and a set of blue points in the plane in general
position, how many points of can be -covered? and we prove
the following results:
(1) If and , for some non-negative integers and ,
then there are point sets , like -equitable sets (i.e.,
or ) and linearly separable sets, that can be -covered.
(2) If , and the points in are in convex position,
then at least points can be -covered, and this bound is tight.
(3) There are arbitrarily large point sets in general position,
with , such that at most points can be -covered.
(4) If , then at least points of
can be -covered. For , there are too many red points and at
least of them will remain uncovered in any -covering.
Furthermore, in all the cases we provide efficient algorithms to compute the
corresponding coverings.Comment: 29 pages, 10 figures, 1 tabl
Many 2-level polytopes from matroids
The family of 2-level matroids, that is, matroids whose base polytope is
2-level, has been recently studied and characterized by means of combinatorial
properties. 2-level matroids generalize series-parallel graphs, which have been
already successfully analyzed from the enumerative perspective.
We bring to light some structural properties of 2-level matroids and exploit
them for enumerative purposes. Moreover, the counting results are used to show
that the number of combinatorially non-equivalent (n-1)-dimensional 2-level
polytopes is bounded from below by , where
and .Comment: revised version, 19 pages, 7 figure
Unfolding Convex Polyhedra via Radially Monotone Cut Trees
A notion of "radially monotone" cut paths is introduced as an effective
choice for finding a non-overlapping edge-unfolding of a convex polyhedron.
These paths have the property that the two sides of the cut avoid overlap
locally as the cut is infinitesimally opened by the curvature at the vertices
along the path. It is shown that a class of planar, triangulated convex domains
always have a radially monotone spanning forest, a forest that can be found by
an essentially greedy algorithm. This algorithm can be mimicked in 3D and
applied to polyhedra inscribed in a sphere. Although the algorithm does not
provably find a radially monotone cut tree, it in fact does find such a tree
with high frequency, and after cutting unfolds without overlap. This
performance of a greedy algorithm leads to the conjecture that spherical
polyhedra always have a radially monotone cut tree and unfold without overlap.Comment: 41 pages, 39 figures. V2 updated to cite in an addendum work on
"self-approaching curves.
- …