1,686 research outputs found
Ramsey-type theorems for lines in 3-space
We prove geometric Ramsey-type statements on collections of lines in 3-space.
These statements give guarantees on the size of a clique or an independent set
in (hyper)graphs induced by incidence relations between lines, points, and
reguli in 3-space. Among other things, we prove that: (1) The intersection
graph of n lines in R^3 has a clique or independent set of size Omega(n^{1/3}).
(2) Every set of n lines in R^3 has a subset of n^{1/2} lines that are all
stabbed by one line, or a subset of Omega((n/log n)^{1/5}) such that no
6-subset is stabbed by one line. (3) Every set of n lines in general position
in R^3 has a subset of Omega(n^{2/3}) lines that all lie on a regulus, or a
subset of Omega(n^{1/3}) lines such that no 4-subset is contained in a regulus.
The proofs of these statements all follow from geometric incidence bounds --
such as the Guth-Katz bound on point-line incidences in R^3 -- combined with
Tur\'an-type results on independent sets in sparse graphs and hypergraphs.
Although similar Ramsey-type statements can be proved using existing generic
algebraic frameworks, the lower bounds we get are much larger than what can be
obtained with these methods. The proofs directly yield polynomial-time
algorithms for finding subsets of the claimed size.Comment: 18 pages including appendi
Moving Walkways, Escalators, and Elevators
We study a simple geometric model of transportation facility that consists of
two points between which the travel speed is high. This elementary definition
can model shuttle services, tunnels, bridges, teleportation devices, escalators
or moving walkways. The travel time between a pair of points is defined as a
time distance, in such a way that a customer uses the transportation facility
only if it is helpful.
We give algorithms for finding the optimal location of such a transportation
facility, where optimality is defined with respect to the maximum travel time
between two points in a given set.Comment: 16 pages. Presented at XII Encuentros de Geometria Computacional,
Valladolid, Spai
Finding Multiple New Optimal Locations in a Road Network
We study the problem of optimal location querying for location based services
in road networks, which aims to find locations for new servers or facilities.
The existing optimal solutions on this problem consider only the cases with one
new server. When two or more new servers are to be set up, the problem with
minmax cost criteria, MinMax, becomes NP-hard. In this work we identify some
useful properties about the potential locations for the new servers, from which
we derive a novel algorithm for MinMax, and show that it is efficient when the
number of new servers is small. When the number of new servers is large, we
propose an efficient 3-approximate algorithm. We verify with experiments on
real road networks that our solutions are effective and attains significantly
better result quality compared to the existing greedy algorithms
Colorful Strips
Given a planar point set and an integer , we wish to color the points with
colors so that any axis-aligned strip containing enough points contains all
colors. The goal is to bound the necessary size of such a strip, as a function
of . We show that if the strip size is at least , such a coloring
can always be found. We prove that the size of the strip is also bounded in any
fixed number of dimensions. In contrast to the planar case, we show that
deciding whether a 3D point set can be 2-colored so that any strip containing
at least three points contains both colors is NP-complete.
We also consider the problem of coloring a given set of axis-aligned strips,
so that any sufficiently covered point in the plane is covered by colors.
We show that in dimensions the required coverage is at most .
Lower bounds are given for the two problems. This complements recent
impossibility results on decomposition of strip coverings with arbitrary
orientations. Finally, we study a variant where strips are replaced by wedges
Large Coercivity in Nanostructured Rare-earth-free MnxGa Films
The magnetic hysteresis of MnxGa films exhibit remarkably large coercive
fields as high as 2.5 T when fabricated with nanoscale particles of a suitable
size and orientation. This coercivity is an order of magnitude larger than in
well-ordered epitaxial film counterparts and bulk materials. The enhanced
coercivity is attributed to the combination of large magnetocrystalline
anisotropy and ~ 50 nm size nanoparticles. The large coercivity is also
replicated in the electrical properties through the anomalous Hall effect. The
magnitude of the coercivity approaches that found in rare-earth magnets, making
them attractive for rare-earth-free magnet applications
Constructing topological models by symmetrization: A PEPS study
Symmetrization of topologically ordered wavefunctions is a powerful method
for constructing new topological models. Here, we study wavefunctions obtained
by symmetrizing quantum double models of a group in the Projected Entangled
Pair States (PEPS) formalism. We show that symmetrization naturally gives rise
to a larger symmetry group which is always non-abelian. We prove
that by symmetrizing on sufficiently large blocks, one can always construct
wavefunctions in the same phase as the double model of . In order to
understand the effect of symmetrization on smaller patches, we carry out
numerical studies for the toric code model, where we find strong evidence that
symmetrizing on individual spins gives rise to a critical model which is at the
phase transitions of two inequivalent toric codes, obtained by anyon
condensation from the double model of .Comment: 10 pages. v2: accepted versio
Practical learning method for multi-scale entangled states
We describe a method for reconstructing multi-scale entangled states from a
small number of efficiently-implementable measurements and fast
post-processing. The method only requires single particle measurements and the
total number of measurements is polynomial in the number of particles. Data
post-processing for state reconstruction uses standard tools, namely matrix
diagonalisation and conjugate gradient method, and scales polynomially with the
number of particles. Our method prevents the build-up of errors from both
numerical and experimental imperfections
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may assign prices to the pricable edges. Based on the predefined fixed costs and our prices, a customer purchases a cheapest s-t-path in G and we receive payment equal to the sum of prices of pricable edges belonging to the path. Our goal is to find prices maximizing the payment received from the customer. While Stackelberg shortest-path pricing was known to be APX-hard before, we provide the first explicit approximation threshold and prove hardness of approximation within 2−o(1). We also argue that the nicely structured type of instance resulting from our reduction captures most of the challenges we face in dealing with the problem in general and, in particular, we show that the gap between the revenue of an optimal pricing and the only known general upper bound can still be logarithmically large
Coherent acoustic vibration of metal nanoshells
Using time-resolved pump-probe spectroscopy we have performed the first
investigation of the vibrational modes of gold nanoshells. The fundamental
isotropic mode launched by a femtosecond pump pulse manifests itself in a
pronounced time-domain modulation of the differential transmission probed at
the frequency of nanoshell surface plasmon resonance. The modulation amplitude
is significantly stronger and the period is longer than in a gold nanoparticle
of the same overall size, in agreement with theoretical calculations. This
distinct acoustical signature of nanoshells provides a new and efficient method
for identifying these versatile nanostructures and for studying their
mechanical and structural properties.Comment: 5 pages, 3 figure
- …