Search

Density functional theory (DFT) and thermal DFT (thDFT) calculations were used to evaluate the energy band structure, bandgap, and the total energy of various graphene quantum dots (GQDs). The DFT calculations were performed using local density approximation for the exchange-correlation functional and norm-conserving pseudopotentials. We consider the triangular and hexagonal GQDs with zigzag and armchair edges and 1-3 nm dimensions with many hundred atoms. The simulation results show that all of these GQDs are direct bandgap semiconductors with a flat band structure, and they are suitable for electronics and optoelectronics applications. Analysis of GQDs in which the A and B sublattice symmetries were broken showed degenerate zero-energy shells. Using the thDFT calculations carried out at temperatures up to 1400 K, we evaluated the temperature dependence of the GQDs bandgaps and total energies via entropy-term and electron kinetic energy. The obtained results indicate that the ground-state DFT calculations are valid for determining the electronic properties of GQDs up to room temperature. Moreover, we tune semi-empirical parameters of the tight-binding model by the DFT results in small GQDs to reduce the computational cost of electronic structure calculations for large GQDs, which contained up to thousands of atoms.

We present a rigorous and quantum-consistent description of dispersive non-Hermitian optical bilayers in the framework of the canonical quantization scheme. Then we investigate the propagation of a normally incident squeezed coherent state of light through such media, particularly at a frequency for which the bilayers become parity-time (PT) symmetric. Furthermore, to check the realization of PT-symmetry in quantum optics, we reveal how dispersion and loss/gain-induced noises and thermal effects in such bilayers can affect quantum features of the incident light, such as squeezing and sub-Poissonian statistics. The numerical results show thermally-induced noise at room temperature has an insignificant effect on the propagation properties in these non-Hermitian bilayers. Moreover, tuning the bilayers loss/gain strength, we show that the transmitted squeezed coherent states through the structure can retain to some extent their nonclassical characteristics, specifically for the frequencies far from the emission frequency of the gain layer. Furthermore, we demonstrate, only below a critical value of gain, quantum optical effective medium theory can correctly predict the propagation of quantized waves in non-Hermitian and PT-symmetric bilayers., Comment: 8 figures

Unique properties of lead chalcogenides have enabled multiple exciton generation (MEG) in their nanocrystals that can be beneficial in enhancing the efficiency of the third generation solar cells. Although the intrinsic electric field plays an imperative role in a solar cell, its effect on the multiple exciton generation (MEG) has been overlooked, so far. Using EOM-CCSD as a many-body approach, we show that any electric field can affect the absorptivity spectra of the lead chalcogenide nanocrystals (Pb4Te4, Pb4Se4, and Pb4S4). The same electric field, however, has insignificant effects on the MEG quantum probabilities and the thresholds in these nanocrystals. Furthermore, simulations show that Pb4Te4, among the aforementioned nanocrystals, has the lowest MEG threshold and the strongest absorptivity peak that is located in the multi-excitation window, irrespective of the field strength, making it the most suitable candidate for MEG applications. Simulations also demonstrate that an electric field affects the MEG characteristics in the Pb4Te4 nanocrystal, in general, less than it perturbs MEG characteristics in Pb4Se4 and Pb4S4 nanocrystals. Our results can have a great impact in designing optoelectronic devices whose performance can be significantly influenced by MEG., Comment: Twenty pages, Six figures, Forty seven References

Given a real number $t>1$, a geometric $t$-spanner is a geometric graph for a point set in $\mathbb{R}^d$ with straight lines between vertices such that the ratio of the shortest-path distance between every pair of vertices in the graph (with Euclidean edge lengths) to their actual Euclidean distance is at most $t$. An imprecise point set is modeled by a set $R$ of regions in $\mathbb{R}^d$. If one chooses a point in each region of $R$, then the resulting point set is called a precise instance of~$R$. An imprecise $t$-spanner for an imprecise point set $R$ is a graph $G=(R,E)$ such that for each precise instance $S$ of $R$, graph $G_S=(S,E_S)$, where $E_S$ is the set of edges corresponding to $E$, is a $t$-spanner. In this paper, we show that, given a real number $t>1$, there is an imprecise point set $R$ of $n$ straight-line segments in the plane such that any imprecise $t$-spanner for $R$ has $\Omega(n^2)$ edges. Then, we propose an algorithm that computes a Well-Separated Pair Decomposition (WSPD) of size ${\cal O}(n)$ for a set of $n$ pairwise disjoint $d$-dimensional balls with arbitrary sizes. Given a real number $t>1$ and given a set of $n$ pairwise disjoint $d$-balls with arbitrary sizes, we use this WSPD to compute in ${\cal O}(n\log n+n/(t-1)^d)$ time an imprecise $t$-spanner with ${\cal O}(n/(t-1)^d)$ edges for balls.

Let $G=(V, E)$ be a simple and undirected graph. For some integer $k\geq 1$, a set $D\subseteq V$ is said to be a k-dominating set in $G$ if every vertex $v$ of $G$ outside $D$ has at least $k$ neighbors in $D$. Furthermore, for some real number $\alpha$ with $0<\alpha\leq1$, a set $D\subseteq V$ is called an $\alpha$-dominating set in $G$ if every vertex $v$ of $G$ outside $D$ has at least $\alpha\times d_v$ neighbors in $D$, where $d_v$ is the degree of $v$ in $G$. The cardinality of a minimum $k$-dominating set and a minimum $\alpha$-dominating set in $G$ is said to be the $k$-domination number and the $\alpha$-domination number of $G$, respectively. In this paper, we present some approximability and inapproximability results on the problem of finding $k$-domination number and $\alpha$-domination number of some classes of graphs. Moreover, we introduce a generalization of $\alpha$-dominating set which we call an $f$-dominating set. Given a function $f:\mathbb{N}\rightarrow \mathbb{R}$, where $\mathbb{N}=\{1, 2, 3, \ldots\}$, a set $D\subseteq V$ is said to be an $f$-dominating set in $G$ if every vertex $v$ of $G$ outside $D$ has at least $f(d_v)$ neighbors in $D$. We prove NP-hardness of the problem of finding a minimum $f$-dominating set in $G$, for a large family of functions $f$.