3,227 research outputs found
Spectral rigidity of automorphic orbits in free groups
It is well-known that a point in the (unprojectivized)
Culler-Vogtmann Outer space is uniquely determined by its
\emph{translation length function} . A subset of a
free group is called \emph{spectrally rigid} if, whenever
are such that for every then in . By
contrast to the similar questions for the Teichm\"uller space, it is known that
for there does not exist a finite spectrally rigid subset of .
In this paper we prove that for if is a subgroup
that projects to an infinite normal subgroup in then the -orbit
of an arbitrary nontrivial element is spectrally rigid. We also
establish a similar statement for , provided that is not
conjugate to a power of .
We also include an appended corrigendum which gives a corrected proof of
Lemma 5.1 about the existence of a fully irreducible element in an infinite
normal subgroup of of . Our original proof of Lemma 5.1 relied on a
subgroup classification result of Handel-Mosher, originally stated by
Handel-Mosher for arbitrary subgroups . After our paper was
published, it turned out that the proof of the Handel-Mosher subgroup
classification theorem needs the assumption that be finitely generated. The
corrigendum provides an alternative proof of Lemma~5.1 which uses the
corrected, finitely generated, version of the Handel-Mosher theorem and relies
on the 0-acylindricity of the action of on the free factor complex
(due to Bestvina-Mann-Reynolds). A proof of 0-acylindricity is included in the
corrigendum.Comment: Included a corrigendum which gives a corrected proof of Lemma 5.1
about the existence of a fully irreducible element in an infinite normal
subgroup of of Out(F_N). Note that, because of the arXiv rules, the
corrigendum and the original article are amalgamated into a single pdf file,
with the corrigendum appearing first, followed by the main body of the
original articl
Semi-Preemptive Routing on Trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given integer d. This problem is known to be polynomially solvable on paths or cycles and NP-complete on trees. We present a (4/3+epsilon)-approximation algorithm if the underlying graph is a tree. By using a result of Charikar et al. (1998), this can be extended to a O(log n log log n)-approximation for general graphs
Semi-Preemptive Routing on Trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given integer d. This problem is known to be polynomially solvable on paths or cycles and NP-complete on trees. We present a (4/3+epsilon)-approximation algorithm if the underlying graph is a tree. By using a result of Charikar et al. (1998), this can be extended to a O(log n log log n)-approximation for general graphs
Rectilinear Steiner Trees in Narrow Strips
A rectilinear Steiner tree for a set of points in is a
tree that connects the points in using horizontal and vertical line
segments. The goal of Minimal Rectilinear Steiner Tree is to find a rectilinear
Steiner tree with minimal total length. We investigate how the complexity of
Minimal Rectilinear Steiner Tree for point sets inside the strip
depends on the strip width . We
obtain two main results. 1) We present an algorithm with running time
for sparse point sets, that is, point sets where each
rectangle inside the strip contains points. 2) For
random point sets, where the points are chosen randomly inside a rectangle of
height and expected width , we present an algorithm that is
fixed-parameter tractable with respect to and linear in . It has an
expected running time of .Comment: 21 pages, 13 figure
- …