Magnetic-field-induced Fabry-Perot resonances in helical edge states

We study electronic transport across a helical edge state exposed to a uniform magnetic ((B) over right arrow) field over a finite length. We show that this system exhibits Fabry-Perot-type resonances in electronic transport. The intrinsic spin anisotropy of the helical edge states allows us to tune these resonances by changing the direction of the (B) over right arrow field while keeping its magnitude constant. This is in sharp contrast to the case of nonhelical one-dimensional electron gases with a parabolic dispersion, where similar resonances do appear in individual spin channels (up arrow and down arrow) separately which, however, cannot be tuned by merely changing the direction of the (B) over right arrow field. These resonances provide a unique way to probe the helical nature of the theory. We study the robustness of these resonances against a possible static impurity in the channel.

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

The correlation clustering problem is a fundamental problem in both theory and practice, and it involves identifying clusters of objects in a data set based on their similarity. A traditional modeling of this question as a graph theoretic problem involves associating vertices with data points and indicating similarity by adjacency. Clusters then correspond to cliques in the graph. The resulting optimization problem, Cluster Editing (and several variants) are very well-studied algorithmically. In many situations, however, translating clusters to cliques can be somewhat restrictive. A more flexible notion would be that of a structure where the vertices are mutually ``not too far apart'', without necessarily being adjacent. One such generalization is realized by structures called s-clubs, which are graphs of diameter at most s. In this work, we study the question of finding a set of at most k edges whose removal leaves us with a graph whose components are s-clubs. Recently, it has been shown that unless Exponential Time Hypothesis fail (ETH) fails Cluster Editing (whose components are 1-clubs) does not admit sub-exponential time algorithm STACS, 2013]. That is, there is no algorithm solving the problem in time 2 degrees((k))n(O(1)). However, surprisingly they show that when the number of cliques in the output graph is restricted to d, then the problem can be solved in time O(2(O(root dk)) + m + n). We show that this sub-exponential time algorithm for the fixed number of cliques is rather an exception than a rule. Our first result shows that assuming the ETH, there is no algorithm solving the s-Club Cluster Edge Deletion problem in time 2 degrees((k))n(O(1)). We show, further, that even the problem of deleting edges to obtain a graph with d s-clubs cannot be solved in time 2 degrees((k))n(O)(1) for any fixed s, d >= 2. This is a radical contrast from the situation established for cliques, where sub-exponential algorithms are known.

Probing the Neutral Edge Modes in Transport across a Point Contact via Thermal Effects in the Read-Rezayi Non-Abelian Quantum Hall States

Non-Abelian quantum Hall states are characterized by the simultaneous appearance of charge and neutral gapless edge modes, with the structure of the latter being intricately related to the existence of bulk quasiparticle excitations obeying non-Abelian statistics. Here we propose a scenario for detecting the neutral modes by having two point contacts in series separated by a distance set by the thermal equilibration length of the charge mode. We show that by using the first point contact as a heating device, the excess charge noise measured at the second point contact carries a nontrivial signature of the presence of the neutral mode. We also obtain explicit expressions for the thermal conductance and corresponding Lorentz number for transport across a quantum point contact between two edges held at different temperatures and chemical potentials.

LIII absorption edge studies of mixed valent cerium intermetallics and related systems

LIII absorption edge measurements clearly delineate 3+ and 4+ states of Ce. Absorption edges of 3+ compounds show a single peak, while those of 4+ compounds show two peaks, both appearing at higher energies than the characteristic peaks of 3+ compounds. In systems where there is interconfigurational fluctuation, features due to both 3+ and 4+ states are distinctly seen.

Effect of inter-edge Coulomb interactions on transport through a point contact in nu=5/2 quantum Hall state

We study transport across a point contact separating two line junctions in a nu = 5/2 quantum Hall system. We analyze the effect of inter-edge Coulomb interactions between the chiral bosonic edge modes of the half-filled Landau level (assuming a Pfaffian wave function for the half-filled state) and of the two fully filled Landau levels. In the presence of inter-edge Coulomb interactions between all the six edges participating in the line junction, we show that the stable fixed point corresponds to a point contact that is neither fully opaque nor fully transparent. Remarkably, this fixed point represents a situation where the half-filled level is fully transmitting, while the two filled levels are completely backscattered; hence the fixed point Hall conductance is given by G(H) = 1/2e(2)/h. We predict the non-universal temperature power laws by which the system approaches the stable fixed point from the two unstable fixed points corresponding to the fully connected case (G(H) = 5/2e(2)/h) and the fully disconnected case (G(H) = 0).

The onset of warps in Spitzer observations of edge-on spiral galaxies

We analyse warps in the nearby edge-on spiral galaxies observed in the Spitzer/Infrared Array Camera (IRAC)4.5-mu m band. In our sample of 24 galaxies, we find evidence of warp in 14 galaxies. We estimate the observed onset radii for the warps in a subsample of 10 galaxies. The dark matter distribution in each of these galaxies are calculated using the mass distribution derived from the observed light distribution and the observed rotation curves. The theoretical predictions of the onset radii for the warps are then derived by applying a self-consistent linear response theory to the obtained mass models for six galaxies with rotation curves in the literature. By comparing the observed onset radii to the theoretical ones, we find that discs with constant thickness can not explain the observations; moderately flaring discs are needed. The required flaring is consistent with the observations. Our analysis shows that the onset of warp is not symmetric in our sample of galaxies. We define a new quantity called the onset-asymmetry index and study its dependence on galaxy properties. The onset asymmetries in warps tend to be larger in galaxies with smaller dis scalelengths. We also define and quantify the global asymmetry in the stellar light distribution, that we call the edge-on asymmetry in edge-on galaxies. It is shown that in most cases the onset asymmetry in warp is actually anticorrelated with the measured edge-on asymmetry in our sample of edge-on galaxies and this could plausibly indicate that the surrounding dark matter distribution is asymmetric.

A note on acyclic edge coloring of complete bipartite graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). Let Delta = Delta(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K-n,K-n. Alon, McDiarmid and Reed observed that a'(K-p-1,K-p-1) = p for every prime p. In this paper we prove that a'(K-p,K-p) <= p + 2 = Delta + 2 when p is prime. Basavaraju, Chandran and Kummini proved that a'(K-n,K-n) >= n + 2 = Delta + 2 when n is odd, which combined with our result implies that a'(K-p,K-p) = p + 2 = Delta + 2 when p is an odd prime. Moreover we show that if we remove any edge from K-p,K-p, the resulting graph is acyclically Delta + 1 = p + 1-edge-colorable. (C) 2009 Elsevier B.V. All rights reserved.

Acyclic Edge Coloring of Graphs with Maximum Degree 4

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov, and Zaks that for any simple and finite graph G, a'(G) <= Delta+2, where Delta=Delta(G) denotes the maximum degree of G. We prove the conjecture for connected graphs with Delta(G)<= 4, with the additional restriction that m <= 2n-1, where n is the number of vertices and m is the number of edges in G. Note that for any graph G, m <= 2n, when Delta(G)<= 4. It follows that for any graph G if Delta(G)<= 4, then a'(G) <= 7.

On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts

A cut (A, B) (where B = V - A) in a graph G = (V, E) is called internal if and only if there exists a vertex x in A that is not adjacent to any vertex in B and there exists a vertex y is an element of B such that it is not adjacent to any vertex in A. In this paper, we present a theorem regarding the arrangement of cliques in a chordal graph with respect to its internal cuts. Our main result is that given any internal cut (A, B) in a chordal graph G, there exists a clique with kappa(G) + vertices (where kappa(G) is the vertex connectivity of G) such that it is (approximately) bisected by the cut (A, B). In fact we give a stronger result: For any internal cut (A, B) of a chordal graph, and for each i, 0 <= i <= kappa(G) + 1 such that vertical bar K-i vertical bar = kappa(G) + 1, vertical bar A boolean AND K-i vertical bar = i and vertical bar B boolean AND K-i vertical bar = kappa(G) + 1 - i. An immediate corollary of the above result is that the number of edges in any internal cut (of a chordal graph) should be Omega(k(2)), where kappa(G) = k. Prompted by this observation, we investigate the size of internal cuts in terms of the vertex connectivity of the chordal graphs. As a corollary, we show that in chordal graphs, if the edge connectivity is strictly less than the minimum degree, then the size of the mincut is at least kappa(G)(kappa(G)+1)/2 where kappa(G) denotes the vertex connectivity. In contrast, in a general graph the size of the mincut can be equal to kappa(G). This result is tight.

Study of strontium compounds and minerals by X-ray absorption spectroscopy. I. K-edge shifts

The chemical shifts in the X-ray K-absorption edge of strontium in various compounds and in six minerals are measured using a single crystal X-ray spectrometer. Besides valence, the shifts are found to be governed by ionic charges on the absorbing ions, which are calculated employing Pauling's method. For the minerals the plot of chemical shift against the theoretically calculated ionic charges is used to determine the charges on the strontium ions.

Resistance fluctuation at the mobility edge

Following a Migdal-Kadanoff-type bond moving procedure, we derive the renormalisation-group equations for the characteristic function of the full probability distribution of resistance (conductance) of a three-dimensional disordered system. The resulting recursion relations for the first two cumulants, K, the mean resistance and K ~ t,he meansquare deviation of resistance exhibit a mobility edge dominated by large dispersion, i.e., K $ ’/ K=, 1, suggesting inadequacy of the one-parameter scaling ansatz.

Chemical ordering in As-Se glasses: X-ray absorption edge and XPES studies

X-ray absorption edge and X-ray photoelectron spectroscopic studies of As-Se glasses seem to support a chemical ordering model.

A probabilistic approach to the problem of electron localization in disordered systems and sharpness of the mobility edge

By applying the theory of the asymptotic distribution of extremes and a certain stability criterion to the question of the domain of convergence in the probability sense, of the renormalized perturbation expansion (RPE) for the site self-energy in a cellularly disordered system, an expression has been obtained in closed form for the probability of nonconvergence of the RPE on the real-energy axis. Hence, the intrinsic mobility mu (E) as a function of the carrier energy E is deduced to be given by mu (E)= mu 0exp(-exp( mod E mod -Ec) Delta ), where Ec is a nominal 'mobility edge' and Delta is the width of the random site-energy distribution. Thus mobility falls off sharply but continuously for mod E mod >Ec, in contradistinction with the notion of an abrupt 'mobility edge' proposed by Cohen et al. and Mott. Also, the calculated electrical conductivity shows a temperature dependence in qualitative agreement with experiments on disordered semiconductors.

Acyclic edge coloring of subcubic graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and it is denoted by a′(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using five colors. This result is tight since there are 3-regular graphs which require five colors. In this paper we prove that any non-regular connected graph of maximum degree 3 is acyclically edge colorable using at most four colors. This result is tight since all edge maximal non-regular connected graphs of maximum degree 3 require four colors.