Magnetoresistance oscillations in two-dimensional electron systems under monochromatic and bichromatic radiations

The magnetoresistance oscillations in high-mobility two-dimensional electron systems induced by two radiation fields of frequencies 31 GHz and 47 GHz, are analyzed in a wide magnetic-field range down to 100 G, using the balance-equation approach to magnetotransport for high-carrier-density systems. The frequency mixing processes are shown to be important. The predicted peak positions, relative heights, radiation-intensity dependence and their relation with monochromatic resistivities are in good agreement with recent experimental finding [M. A. Zudov {\it et al.} Phys. Rev. Lett. 96, 236804 (2006)].Comment: 4 pages, 3 figure

Spanners for Geometric Intersection Graphs

Efficient algorithms are presented for constructing spanners in geometric intersection graphs. For a unit ball graph in R^k, a (1+\epsilon)-spanner is obtained using efficient partitioning of the space into hypercubes and solving bichromatic closest pair problems. The spanner construction has almost equivalent complexity to the construction of Euclidean minimum spanning trees. The results are extended to arbitrary ball graphs with a sub-quadratic running time. For unit ball graphs, the spanners have a small separator decomposition which can be used to obtain efficient algorithms for approximating proximity problems like diameter and distance queries. The results on compressed quadtrees, geometric graph separators, and diameter approximation might be of independent interest.Comment: 16 pages, 5 figures, Late

Radiation-induced magnetoresistance oscillations in two-dimensional electron systems under bichromatic irradiation

We analyze the magnetoresistance $R_{xx}$ oscillations in high-mobility two-dimensional electron systems induced by the combined driving of two radiation fields of frequency $\omega_1$ and $\omega_2$, based on the balance-equation approach to magnetotransport for high-carrier-density systems in Faraday geometry. It is shown that under bichromatic irradiation of $\omega_2\sim 1.5 \omega_1$, most of the characterstic peak-valley pairs in the curve of $R_{xx}$ versus magnetic field in the case of monochromatic irradiation of either $\omega_1$ or $\omega_2$ disappear, except the one around $\omega_1/\omega_c\sim 2$ or $\omega_2/\omega_c\sim 3$. $R_{xx}$ oscillations show up mainly as new peak-valley structures around other positions related to multiple photon processes of mixing frequencies $\omega_1+\omega_2$, $\omega_2-\omega_1$, etc. Many minima of these resistance peak-valley pairs can descend down to negative with enhancing radiation strength, indicating the possible bichromaticzero-resistance states.Comment: 5 pages, 3 figures. Accepted for publication in Phys. Rev.

Algorithms for Stable Matching and Clustering in a Grid

We study a discrete version of a geometric stable marriage problem originally proposed in a continuous setting by Hoffman, Holroyd, and Peres, in which points in the plane are stably matched to cluster centers, as prioritized by their distances, so that each cluster center is apportioned a set of points of equal area. We show that, for a discretization of the problem to an $n\times n$ grid of pixels with $k$ centers, the problem can be solved in time $O(n^2 \log^5 n)$, and we experiment with two slower but more practical algorithms and a hybrid method that switches from one of these algorithms to the other to gain greater efficiency than either algorithm alone. We also show how to combine geometric stable matchings with a $k$-means clustering algorithm, so as to provide a geometric political-districting algorithm that views distance in economic terms, and we experiment with weighted versions of stable $k$-means in order to improve the connectivity of the resulting clusters.Comment: 23 pages, 12 figures. To appear (without the appendices) at the 18th International Workshop on Combinatorial Image Analysis, June 19-21, 2017, Plovdiv, Bulgari

Reverse Nearest Neighbor Heat Maps: A Tool for Influence Exploration

We study the problem of constructing a reverse nearest neighbor (RNN) heat map by finding the RNN set of every point in a two-dimensional space. Based on the RNN set of a point, we obtain a quantitative influence (i.e., heat) for the point. The heat map provides a global view on the influence distribution in the space, and hence supports exploratory analyses in many applications such as marketing and resource management. To construct such a heat map, we first reduce it to a problem called Region Coloring (RC), which divides the space into disjoint regions within which all the points have the same RNN set. We then propose a novel algorithm named CREST that efficiently solves the RC problem by labeling each region with the heat value of its containing points. In CREST, we propose innovative techniques to avoid processing expensive RNN queries and greatly reduce the number of region labeling operations. We perform detailed analyses on the complexity of CREST and lower bounds of the RC problem, and prove that CREST is asymptotically optimal in the worst case. Extensive experiments with both real and synthetic data sets demonstrate that CREST outperforms alternative algorithms by several orders of magnitude.Comment: Accepted to appear in ICDE 201

Improved Bounds for 3SUM, kk-SUM, and Linear Degeneracy

Given a set of $n$ real numbers, the 3SUM problem is to decide whether there are three of them that sum to zero. Until a recent breakthrough by Gr{\o}nlund and Pettie [FOCS'14], a simple $\Theta(n^2)$-time deterministic algorithm for this problem was conjectured to be optimal. Over the years many algorithmic problems have been shown to be reducible from the 3SUM problem or its variants, including the more generalized forms of the problem, such as $k$-SUM and $k$-variate linear degeneracy testing ($k$-LDT). The conjectured hardness of these problems have become extremely popular for basing conditional lower bounds for numerous algorithmic problems in P. In this paper, we show that the randomized $4$-linear decision tree complexity of 3SUM is $O(n^{3/2})$, and that the randomized $(2k-2)$-linear decision tree complexity of $k$-SUM and $k$-LDT is $O(n^{k/2})$, for any odd $k\ge 3$. These bounds improve (albeit randomized) the corresponding $O(n^{3/2}\sqrt{\log n})$ and $O(n^{k/2}\sqrt{\log n})$ decision tree bounds obtained by Gr{\o}nlund and Pettie. Our technique includes a specialized randomized variant of fractional cascading data structure. Additionally, we give another deterministic algorithm for 3SUM that runs in $O(n^2 \log\log n / \log n )$ time. The latter bound matches a recent independent bound by Freund [Algorithmica 2017], but our algorithm is somewhat simpler, due to a better use of word-RAM model