Determination of diffusion parameters and activation energy of diffusion in V3Si phase with A15 crystal structure

Diffusion such is the integrated diffusion coefficient of the phase, the tracer diffusion coefficient of species at different temperatures and the activation energy for diffusion, are determined in V3Si phase with A15 crystal structure. The tracer diffusion coefficient of Si Was found to be negligible compared to the tracer diffusion coefficient of V. The calculated diffusion parameters will help to validate the theoretical analysis of defect structure of the phase, which plays an important role in the superconductivity.

Phase Equilibria in the System $Al_{2}O_{3}-CaO-CoO$ and Gibbs Energy of Formation of $Ca_{3}CoAl_{4}O_{10}$

The floating-zone method with different growth ambiences has been used to selectively obtain hexagonal or orthorhombic DyMnO3 single crystals. The crystals were characterized by x-ray powder diffraction of ground specimens and a structure refinement as well as electron diffraction. We report magnetic susceptibility, magnetization and specific heat studies of this multiferroic compound in both the hexagonal and the orthorhombic structure. The hexagonal DyMnO3 shows magnetic ordering of Mn3+ (S = 2) spins on a triangular Mn lattice at T-N(Mn) = 57 K characterized by a cusp in the specific heat. This transition is not apparent in the magnetic susceptibility due to the frustration on the Mn triangular lattice and the dominating paramagnetic susceptibility of the Dy3+ (S = 9/2) spins. At T-N(Dy) = 3 K, a partial antiferromagnetic order of Dy moments has been observed. In comparison, the magnetic data for orthorhombic DyMnO3 display three transitions. The data broadly agree with results from earlier neutron diffraction experiments, which allows for the following assignment: a transition from an incommensurate antiferromagnetic ordering of Mn3+ spins at T-N(Mn) = 39 K, a lock-in transition at Tlock-in = 16 K and a second antiferromagnetic transition at T-N(Dy) = 5 K due to the ordering of Dy moments. Both the hexagonal and the orthorhombic crystals show magnetic anisotropy and complex magnetic properties due to 4f-4f and 4f-3d couplings.

Effect of spatial dispersion of the dielectric on the binding energy of D- ion in Si and Ge

Using a multivalley effective mass theory, we obtain the binding energy of a D- ion in Si and Ge taking into account the spatial variation of the host dielectric function. We find that on comparison with experimental results the effect of spatial dispersion is important in the estimation of binding energy for the D- formed by As in Si and Ge. The effect is less significant for the case of D- formed by P and Sb donors.

Controversy on the Free Energy of Formation of CaO Additional Evidence in Support of Thermochemical Data

The standard free energies of formation of CaO derived from a variety of high-temperature equilibrium measurements made by seven groups of experimentalists are significantly different from those given in the standard compilations of thermodynamic data. Indirect support for the validity of the compiled data comes from new solid-state electrochemical measurements using single-crystal CaF2 and SrF2 as electrolytes. The change in free energy for the following reactions are obtained: CaO + MgF2 --> MgO + CaF2 Delta G degrees = -68,050 -2.47 T(+/-100) J mol(-1) SrO + CaF2 --> SrF2 + CaO Delta G degrees = -35,010 + 6.39 T (+/-80) J mol(-1) The standard free energy changes associated with cell reactions agree with data in standard compilations within +/- 4 kJ mol(-1). The results of this study do not support recent suggestions for a major revision in thermodynamic data for CaO.

Gibbs Energy of Formation of Cobalt Divanadium Tetroxide

The Gibbs energy of formation of V2O3-saturated spinel CoV2O4 has been measured in the temperature range 900–1700 K using a solid state galvanic cell, which can be represented as Pt, Co + CoV2O4 + V2O3/(CaO) ZrO2/Co + CoO, Pt. The standard free energy of formation of cobalt vanadite from component oxides can be represented as CoO (rs) + V2O3 (cor) → CoV2O4 (sp), ΔG° = −30,125 − 5.06T (± 150) J mole−1. Cation mixing on crystallographically nonequivalent sites of the spinel is responsible for the decrease in free energy with increasing temperature. A correlation between “second law” entropies of formation of cubic 2–3 spinels from component oxides with rock salt and corundum structures and cation distribution is presented. Based on the information obtained in this study and trends in the stability of aluminate and chromite spinels, it can be deduced that copper vanadite is unstable.

New temperature fluctuation method for direct determination of thermal activation energy of deep levels in semiconductors

A new method is suggested where the thermal activation energy is measured directly and not as a slope of an Arrhenius plot. The sample temperature T is allowed to fluctuate about a temperature T0. The reverse-biased sample diode is repeatedly pulsed towards zero bias and the transient capacitance C1 at time t1 is measured The activation energy is obtained by monitoring the fluctuations in C1 and T. The method has been used to measure the activation energy of the gold acceptor level in silicon.

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.

Improvement On Brooks Chromatic Bound For A Class Of Graphs

Brooks' Theorem says that if for a graph G,Δ(G)=n, then G is n-colourable, unless (1) n=2 and G has an odd cycle as a component, or (2) n>2 and Kn+1 is a component of G. In this paper we prove that if a graph G has none of some three graphs (K1,3;K5−e and H) as an induced subgraph and if Δ(G)greater-or-equal, slanted6 and d(G)<Δ(G), then χ(G)<Δ(G). Also we give examples to show that the hypothesis Δ(G)greater-or-equal, slanted6 can not be non-trivially relaxed and the graph K5−e can not be removed from the hypothesis. Moreover, for a graph G with none of K1,3;K5−e and H as an induced subgraph, we verify Borodin and Kostochka's conjecture that if for a graph G,Δ(G)greater-or-equal, slanted9 and d(G)<Δ(G), then χ(G)<Δ(G).

Discussion of enthalpy, entropy and free energy of formation of GaN

Presented in this letter is a critical discussion of a recent paper on experimental investigation of the enthalpy, entropy and free energy of formation of gallium nitride (GaN) published in this journal [T.J. Peshek, J.C. Angus, K. Kash, J. Cryst. Growth 311 (2008) 185-189]. It is shown that the experimental technique employed detects neither the equilibrium partial pressure of N-2 corresponding to the equilibrium between Ga and GaN at fixed temperatures nor the equilibrium temperature at constant pressure of N-2. The results of Peshek et al. are discussed in the light of other information on the Gibbs energy of formation available in the literature. Entropy of GaN is derived from heat-capacity measurements. Based on a critical analysis of all thermodynamic information now available, a set of optimized parameters is identified and a table of thermodynamic data for GaN developed from 298.15 to 1400 K.

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.

A universal relation for the cohesive energy of nanoparticles

A universal relation between the cohesive energy and the particle size has been predicted based on the liquid-drop model. The universal relation is well supported by other theoretical models and the available experimental data. The universal relations for intermediate size range as well as for particles with very few atoms are discussed. A comparison of onset temperature of evaporation also establishes a universal relation.

Gibbs Energy of Formation of MnO: Measurement and Assessment

Based on the measurements of Alcock and Zador, Grundy et al. estimated an uncertainty of the order of +/- 5 kJ mol(-1) for the standard Gibbs energy of formation of MnO in a recent assessment. Since the evaluation of thermodynamic data for the higher oxides Mn3O4, Mn2O3, and MnO2 depends on values for MnO, a redetermination of its Gibbs energy of formation was undertaken in the temperature range from 875 to 1300 K using a solid-state electrochemical cell incorporating yttria-doped thoria (YDT) as the solid electrolyte and Fe + Fe1-delta O as the reference electrode. The cell can be presented as Pt, Mn + MnO/YDT/Fe + Fe1+delta O, Pt Since the metals Fe and Mn undergo phase transitions in the temperature range of measurement, the reversible emf of the cell is represented by the three linear segments. Combining the emf with the oxygen potential for the reference electrode, the standard Gibbs energy of formation of MnO from alpha-Mn and gaseous diatomic oxygen in the temperature range from 875 to 980 K is obtained as: Delta G(f)(o)/Jmol(-1)(+/- 250) = -385624 + 73.071T From 980 to 1300 K the Gibbs energy of formation of MnO from beta-Mn and oxygen gas is given by: Delta G(f)(o)/Jmol(-1)(+/- 250) = -387850 + 75.36T The new data are in excellent agreement with the earlier measurements of Alcock and Zador. Grundy et al. incorrectly analyzed the data of Alcock and Zador showing relatively large difference (+/- 5 kJ mol(-1)) in Gibbs energies of MnO from their two cells with Fe + Fe1-delta O and Ni + NiO as reference electrodes. Thermodynamic data for MnO is reassessed in the light of the new measurements. A table of refined thermodynamic data for MnO from 298.15 to 2000 K is presented.

Hadwiger Number and the Cartesian Product of Graphs

The Hadwiger number eta(G) of a graph G is the largest integer n for which the complete graph K-n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, eta(G) >= chi(G), where chi(G) is the chromatic number of G. In this paper, we study the Hadwiger number of the Cartesian product G square H of graphs. As the main result of this paper, we prove that eta(G(1) square G(2)) >= h root 1 (1 - o(1)) for any two graphs G(1) and G(2) with eta(G(1)) = h and eta(G(2)) = l. We show that the above lower bound is asymptotically best possible when h >= l. This asymptotically settles a question of Z. Miller (1978). As consequences of our main result, we show the following: 1. Let G be a connected graph. Let G = G(1) square G(2) square ... square G(k) be the ( unique) prime factorization of G. Then G satisfies Hadwiger's conjecture if k >= 2 log log chi(G) + c', where c' is a constant. This improves the 2 log chi(G) + 3 bound in [2] 2. Let G(1) and G(2) be two graphs such that chi(G1) >= chi(G2) >= clog(1.5)(chi(G(1))), where c is a constant. Then G1 square G2 satisfies Hadwiger's conjecture. 3. Hadwiger's conjecture is true for G(d) (Cartesian product of G taken d times) for every graph G and every d >= 2. This settles a question by Chandran and Sivadasan [2]. ( They had shown that the Hadiwger's conjecture is true for G(d) if d >= 3).

On a Special Co-cycle Basis of Graphs

In this paper we consider the problems of computing a minimum co-cycle basis and a minimum weakly fundamental co-cycle basis of a directed graph G. A co-cycle in G corresponds to a vertex partition (S,V ∖ S) and a { − 1,0,1} edge incidence vector is associated with each co-cycle. The vector space over ℚ generated by these vectors is the co-cycle space of G. Alternately, the co-cycle space is the orthogonal complement of the cycle space of G. The minimum co-cycle basis problem asks for a set of co-cycles that span the co-cycle space of G and whose sum of weights is minimum. Weakly fundamental co-cycle bases are a special class of co-cycle bases, these form a natural superclass of strictly fundamental co-cycle bases and it is known that computing a minimum weight strictly fundamental co-cycle basis is NP-hard. We show that the co-cycle basis corresponding to the cuts of a Gomory-Hu tree of the underlying undirected graph of G is a minimum co-cycle basis of G and it is also weakly fundamental.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.