TDPAC and first-principles study of electronic and structural properties of a Pd-vacancy complex in undoped germanium

Pd is one of the metals suitable for inducing low-temperature crystallization in Ge. However, it is not clear how residual Pd atoms are integrated into the Ge lattice. Therefore, time-differential γ–γ perturbed angular correlations (TDPAC) technique using the ¹⁰⁰Pd(→¹⁰⁰Rh) nuclear probe produced by recoil implantation has been applied to study the hyperfine interactions of this probe in single-crystalline undoped Ge. A Pd-vacancy complex aligned along the <111> crystallographic direction with a unique interaction frequency of 8.4(5) Mrad/s has been identified. This complex was measured to have a maximum relative fraction of about 76(4)% following annealing at 350 ^°C. Further annealing at higher temperatures reduced this fraction, possibly via dissociation of the complex. Calculations suggest dissociation energy of 1.94(5) eV for the complex. DFT calculations performed in this work are in reasonable good agreement with the experimental values for the electric-field gradient of the defect complex in Ge and Si for comparison. The calculations predict a split-vacancy configuration with the Pd on a bond-centred interstitial site having a nearest-neighbour semi-vacancy on both sides (V-Pd_BI-V) in Ge and Si.     

Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.     

Gauge natural formulation of conformal gravity

We consider conformal gravity as a gauge natural theory. We study its conservation laws and superpotentials. We also consider the Mannheim and Kazanas spherically symmetric vacuum solution and discuss conserved quantities associated to conformal and diffeomorphism symmetries.     

Analytic hierarchy process for multi-sensor data fusion based on belief function theory

Multi-sensor data fusion is an evolving technology whereby data from multiple sensor inputs are processed and combined. The data derived from multiple sensors can, however, be uncertain, imperfect, and conflicting. The present study is undertaken to help contribute to the continuous search for viable approaches to overcome the problems associated with data conflict and imperfection. Sensor readings, represented by belief functions, have to be fused according to their corresponding weights. Previous studies have often estimated the weights of sensor readings based on a single criterion. Mono-criteria approaches for the assessment of sensor reading weights are, however, often unreliable and inadequate for the reflection of reality. Accordingly, this work opts for the use of a multi-criteria decision aid. A modified Analytical Hierarchy Process (AHP) that incorporates several criteria is proposed to determine the weights of a sensor reading set. The approach relies on the automation of pairwise comparisons to eliminate subjectivity and reduce inconsistency. It assesses the weight of each sensor reading, and fuses the weighed readings obtained using a modified average combination rule. The efficiency of this approach is evaluated in a target recognition context. Several tests, sensitivity analysis, and comparisons with other approaches available in the literature are described.     

Springer basic sets and modular Springer correspondence for classical types

We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic $p$, and with coefficients in a field of odd characteristic $?\ne p$): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols.     

Collective Tunnelling of Strongly Interacting Cold Atoms in a Double-Well Potential

It is known that under resonance conditions, a group of strongly interacting bosonic atoms, trapped in a double-well potential, mimics a single particle, performing Rabi oscillations between the wells. By implication, all atoms need to tunnel at roughly the same time, even though the Bose–Hubbard Hamiltonian accounts only for one-atom-at-a-time transfers. The mechanism of this collective behavior is analyzed, the Rabi frequencies in the process are evaluated, and the limitation of this simple picture is discussed. In particular, it is shown that the small rapid oscillations superimposed on the slow Rabi cycle result from splitting the transferred cluster at the sudden onset of tunnelling, and disappear if tunnelling is turned on gradually.     

Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.