941 resultados para EDGE FAULTS
Resumo:
Edge-sharing bioctahedral (ESBO) complexes [Ru-2(OMe)(O2CC6H4-p-X)3(1-MeIm)(4)](ClO4)2 (X = OMe (1a), Me (1b)) and [Ru-2(O2CC6H4-P-X)(4)(1-MeIm)(4)](ClO4)(2) (X = OMe (2a), Me (2b)) are prepared by reacting Ru2Cl(O(2)CR)(4) with 1-methylimidazole (1-MeIm) in methanol followed by treatment with NaClO4. Complex 2a and the PF6- salt (1a') of 1a have been structurally characterized. Crystal data for 1a.1.5MeCN. 0.5Et(2)O: triclinic, P (1) over bar, a = 13.125(2) Angstrom, b = 15.529(3) Angstrom, c 17.314(5) Angstrom, a; 67.03(2)degrees, beta 68.05(2)degrees, gamma = 81.38(1)degrees, V 3014(1) Angstrom(3), Z = 2. Crystal data for 2a: triclinic, P (1) over bar, a 8.950(1) Angstrom, b = 12.089(3) Angstrom, c = 13.735(3) Angstrom, alpha 81.09(2)degrees, beta = 72.27(1)degrees, gamma = 83.15(2)degrees, V = 1394(1) Angstrom(3), Z = 1. The complexes consist of a diruthenium(III) unit held by two monoatomic and two three-atom bridging ligands. The 1-MeIm ligands are at the terminal sites of the [Ru-2(mu-L)(eta(1):mu-O(2)CR)(eta(1):eta(1):mu-O(2)CR)(2)](2+) core having a Ru-Ru single bond (L = OMe or eta(1)-O(2)CR). The Ru-Ru distance and the Ru-O-Ru angle in the core of 1a' and 2a are 2.49 Angstrom and similar to 76 degrees. The complexes undergo one-electron oxidation and reduction processes in MeCN-0.1 M TBAP to form mixed-valence diruthenium species with Ru-Ru bonds of orders 1.5 and 0.5, respectively.
Resumo:
We present experimental x-ray-absorption spectra at the oxygen and 3d transition-metal K edges of LaFeO3 and LaCoO3. We interpret the experimental results in terms of detailed theoretical calculations based on multiple-scattering theory. Along with providing an understanding of the origin of various experimental features, we investigate the effects of structural distortions and the core-hole potential in determining the experimental spectral shape. The results indicate that the core-hole potential as well as many-body effects within the valence electrons do not have any strong effect on the spectra suggesting that the spectral features can be directly interpreted in terms of the electronic structure of such compounds.
Resumo:
The design and development of nonresonant edge slot antenna for phased array applications has been presented. The radiating element is a slot cut on the narrow wall of rectangular waveguide (edge slot). The admittance characteristics of the edge slot have been rigorously studied using a novel hybrid method. Nonresonant arrays have been fabricated using the present slot characterization data and the earlier published data. The experimentally measured electrical characteristics of the antenna are presented which clearly brings out the accuracy of the present method.
Resumo:
A proper edge-coloring with the property that every cycle contains edges of at least three distinct colors is called an acyclic edge-coloring. The acyclic chromatic index of a graph G, denoted. chi'(alpha)(G), is the minimum k such that G admits an acyclic edge-coloring with k colors. We conjecture that if G is planar and Delta(G) is large enough, then chi'(alpha) (G) = Delta (G). We settle this conjecture for planar graphs with girth at least 5. We also show that chi'(alpha) (G) <= Delta (G) + 12 for all planar G, which improves a previous result by Fiedorowicz, Haluszczak, and Narayan Inform. Process. Lett., 108 (2008), pp. 412-417].
Resumo:
The temperature and power dependence of Fermi-edge singularity (FES) in high-density two-dimensional electron gas, specific to pseudomorphic AlxGa1-xAs/InyGa1-yAs/GaAs heterostructures is studied by photoluminescence (PL). In all these structures, there are two prominent transitions E11 and E21 considered to be the result of electron-hole recombination from first and second electron sub-bands with that of first heavy-hole sub-band. FES is observed approximately 5 -10 meV below the E21 transition. At 4.2 K, FES appears as a lower energy shoulder to the E21 transition. The PL intensity of all the three transitions E11, FES and E21 grows linearly with excitation power. However, we observe anomalous behavior of FES with temperature. While PL intensity of E11 and E21 decrease with increasing temperature, FES transition becomes stronger initially and then quenches-off slowly (till 40K). Though it appears as a distinct peak at about 20 K, its maximum is around 7 - 13 K.
Resumo:
SrTiO3:Pr3+,Al3+ phosphor samples with varying ratios of Sr/Ti/Al were prepared by the gel-carbonate method and the mechanism of enhancement of the red photoluminescence intensity therein was investigated. The photoluminescence (PL) spectra of SrTiO3:Pr3+ show both D-1(2) --> H-3(4) and P-3(0) --> H-3(4) emission in the red and blue spectral regions, respectively, with comparable intensity. The emission intensity of D-1(2) --> H-3(4) is drastically enhanced by the incorporation of Al3+ and excess Ti4+ in the compositional range Sr(Ti,Al-y)(O3+3y/2):Pr3+ (0.2 less than or equal to y less than or equal to 0.4) and SrTi1+xAlyO3+z:Pr3+ (0.2 less than or equal to x less than or equal to 0.5; 0.05 less than or equal to y less than or equal to 0.1; z = 2x + 3y/2) with the complete disappearance of the blue band. This cannot be explained by the simple point defect model as the EPR studies do not show any evidence for the presence of electron or hole centers. TEM investigations show the presence of exsolved nanophases of SrAl12O19 and/or TiO2 in the grain boundary region as well as grain interiors as lamellae which, in turn, form the solid-state defects, namely, dislocation networks, stacking faults and crystallographic shear planes whereby the framework of corner shared TiO6 octehedra changes over to edge-sharing TiO5-AlO5 strands as indicated from the Al-27 MAS NMR studies. The presence of transitional nanophases and the associated defects modify the excitation-emission processes by way of formation of electronic sub-levels at 3.40 and 4.43 eV, leading to magnetic-dipole related red emission with enhanced intensity. This is evidenced by the fact that SrAl12O19:Pr3+,Ti4+ shows bright red emission whereas SrAl12O19:Pr3+ does not show red photoluminescence.
Resumo:
Given an unweighted undirected or directed graph with n vertices, m edges and edge connectivity c, we present a new deterministic algorithm for edge splitting. Our algorithm splits-off any specified subset S of vertices satisfying standard conditions (even degree for the undirected case and in-degree ≥ out-degree for the directed case) while maintaining connectivity c for vertices outside S in Õ(m+nc2) time for an undirected graph and Õ(mc) time for a directed graph. This improves the current best deterministic time bounds due to Gabow [8], who splits-off a single vertex in Õ(nc2+m) time for an undirected graph and Õ(mc) time for a directed graph. Further, for appropriate ranges of n, c, |S| it improves the current best randomized bounds due to Benczúr and Karger [2], who split-off a single vertex in an undirected graph in Õ(n2) Monte Carlo time. We give two applications of our edge splitting algorithms. Our first application is a sub-quadratic (in n) algorithm to construct Edmonds' arborescences. A classical result of Edmonds [5] shows that an unweighted directed graph with c edge-disjoint paths from any particular vertex r to every other vertex has exactly c edge-disjoint arborescences rooted at r. For a c edge connected unweighted undirected graph, the same theorem holds on the digraph obtained by replacing each undirected edge by two directed edges, one in each direction. The current fastest construction of these arborescences by Gabow [7] takes Õ(n2c2) time. Our algorithm takes Õ(nc3+m) time for the undirected case and Õ(nc4+mc) time for the directed case. The second application of our splitting algorithm is a new Steiner edge connectivity algorithm for undirected graphs which matches the best known bound of Õ(nc2 + m) time due to Bhalgat et al [3]. Finally, our algorithm can also be viewed as an alternative proof for existential edge splitting theorems due to Lovász [9] and Mader [11].
Resumo:
Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.
Resumo:
InAsxSb1−x alloys show a strong bowing in the energy gap, the energy gap of the alloy can be less than the gap of the two parent compounds. The authors demonstrate that a consequence of this alloying is a systematic degradation in the sharpness of the absorption edge. The alloy disorder induced band-tail (Urbach tail) characteristics are quantitatively studied for InAs0.05Sb0.95.
Resumo:
This paper reports on our study of the edge of the 2/5 fractional quantum Hall state, which is more complicated than the edge of the 1/3 state because of the presence of edge sectors corresponding to different partitions of composite fermions in the lowest two Lambda levels. The addition of an electron at the edge is a nonperturbative process and it is not a priori obvious in what manner the added electron distributes itself over these sectors. We show, from a microscopic calculation, that when an electron is added at the edge of the ground state in the [N(1), N(2)] sector, where N(1) and N(2) are the numbers of composite fermions in the lowest two Lambda levels, the resulting state lies in either [N(1) + 1, N(2)] or [N(1), N(2) + 1] sectors; adding an electron at the edge is thus equivalent to adding a composite fermion at the edge. The coupling to other sectors of the form [N(1) + 1 + k, N(2) - k], k integer, is negligible in the asymptotically low-energy limit. This study also allows a detailed comparison with the two-boson model of the 2/5 edge. We compute the spectral weights and find that while the individual spectral weights are complicated and nonuniversal, their sum is consistent with an effective two-boson description of the 2/5 edge.
Resumo:
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). A graph is called 2-degenerate if any of its induced subgraph has a vertex of degree at most 2. The class of 2-degenerate graphs properly contains seriesparallel graphs, outerplanar graphs, non - regular subcubic graphs, planar graphs of girth at least 6 and circle graphs of girth at least 5 as subclasses. It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a'(G)<=Delta + 2, where Delta = Delta(G) denotes the maximum degree of the graph. We prove the conjecture for 2-degenerate graphs. In fact we prove a stronger bound: we prove that if G is a 2-degenerate graph with maximum degree ?, then a'(G)<=Delta + 1. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 68:1-27, 2011