We present a proof of concept for a spectrally selective thermal midIR source based on nanopatterned graphene (NPG) with a typical mobility of CVDgrown graphene (up to 3000
A study of possible superconducting phases of graphene has been constructed in detail. A realistic tight binding model, fit to ab initio calculations, accounts for the Lidecoration of graphene with broken lattice symmetry, and includes
 Publication Date:
 NSFPAR ID:
 10153719
 Journal Name:
 Scientific Reports
 Volume:
 8
 Issue:
 1
 ISSN:
 20452322
 Publisher:
 Nature Publishing Group
 Sponsoring Org:
 National Science Foundation
More Like this

Abstract ), ensuring scalability to large areas. For that, we solve the electrostatic problem of a conducting hyperboloid with an elliptical wormhole in the presence of an$$\hbox {cm}^2\,\hbox {V}^{1}\,\hbox {s}^{1}$$ ${\text{cm}}^{2}\phantom{\rule{0ex}{0ex}}{\text{V}}^{1}\phantom{\rule{0ex}{0ex}}{\text{s}}^{1}$inplane electric field. The localized surface plasmons (LSPs) on the NPG sheet, partially hybridized with graphene phonons and surface phonons of the neighboring materials, allow for the control and tuning of the thermal emission spectrum in the wavelength regime from to 12$$\lambda =3$$ $\lambda =3$ m by adjusting the size of and distance between the circular holes in a hexagonal or square lattice structure. Most importantly, the LSPs along with an optical cavity increase the emittance of graphene from about 2.3% for pristine graphene to 80% for NPG, thereby outperforming stateoftheart pristine graphene light sources operating in the nearinfrared by at least a factor of 100. According to our COMSOL calculations, a maximum emission power per area of$$\upmu$$ $\mu $ W/$$11\times 10^3$$ $11\times {10}^{3}$ at$$\hbox {m}^2$$ ${\text{m}}^{2}$ K for a bias voltage of$$T=2000$$ $T=2000$ V is achieved by controlling the temperature of the hot electrons through the Joule heating. By generalizing Planck’s theory to any grey body and derivingmore »$$V=23$$ $V=23$ 
Abstract It has been recently established in David and Mayboroda (Approximation of green functions and domains with uniformly rectifiable boundaries of all dimensions.
arXiv:2010.09793 ) that on uniformly rectifiable sets the Green function is almost affine in the weak sense, and moreover, in some scenarios such Green function estimates are equivalent to the uniform rectifiability of a set. The present paper tackles a strong analogue of these results, starting with the “flagship degenerate operators on sets with lower dimensional boundaries. We consider the elliptic operators associated to a domain$$L_{\beta ,\gamma } = {\text {div}}D^{d+1+\gamma n} \nabla $$ ${L}_{\beta ,\gamma}=\text{div}{D}^{d+1+\gamma n}\nabla $ with a uniformly rectifiable boundary$$\Omega \subset {\mathbb {R}}^n$$ $\Omega \subset {R}^{n}$ of dimension$$\Gamma $$ $\Gamma $ , the now usual distance to the boundary$$d < n1$$ $d<n1$ given by$$D = D_\beta $$ $D={D}_{\beta}$ for$$D_\beta (X)^{\beta } = \int _{\Gamma } Xy^{d\beta } d\sigma (y)$$ ${D}_{\beta}{\left(X\right)}^{\beta}={\int}_{\Gamma}{Xy}^{d\beta}d\sigma \left(y\right)$ , where$$X \in \Omega $$ $X\in \Omega $ and$$\beta >0$$ $\beta >0$ . In this paper we show that the Green function$$\gamma \in (1,1)$$ $\gamma \in (1,1)$G for , with pole at infinity, is well approximated by multiples of$$L_{\beta ,\gamma }$$ ${L}_{\beta ,\gamma}$ , in the sense that the function$$D^{1\gamma }$$ ${D}^{1\gamma}$ satisfies a Carleson measure estimate on$$\big  D\nabla \big (\ln \big ( \frac{G}{D^{1\gamma }} \big )\big )\big ^2$$ $D\nabla (ln(\frac{G}{{D}^{1\gamma}})){}^{2}$ . We underline that the strong and the weak results are different in nature and, of course, at the levelmore »$$\Omega $$ $\Omega $ 
Abstract The shape of 3
d orbitals often governs the electronic and magnetic properties of correlated transition metal oxides. In the superconducting cuprates, the planar confinement of the orbital dictates the twodimensional nature of the unconventional superconductivity and a competing charge order. Achieving orbitalspecific control of the electronic structure to allow coupling pathways across adjacent planes would enable direct assessment of the role of dimensionality in the intertwined orders. Using Cu$${d}_{{x}^{2}{y}^{2}}$$ ${d}_{{x}^{2}{y}^{2}}$L _{3}and PrM _{5}resonant xray scattering and firstprinciples calculations, we report a highly correlated threedimensional charge order in Prsubstituted YBa_{2}Cu_{3}O_{7}, where the Prf electrons create a direct orbital bridge between CuO_{2}planes. With this we demonstrate that interplanar orbital engineering can be used to surgically control electronic phases in correlated oxides and other layered materials. 
Abstract Hemiwicking is the phenomena where a liquid wets a textured surface beyond its intrinsic wetting length due to capillary action and imbibition. In this work, we derive a simple analytical model for hemiwicking in micropillar arrays. The model is based on the combined effects of capillary action dictated by interfacial and intermolecular pressures gradients within the curved liquid meniscus and fluid drag from the pillars at ultralow Reynolds numbers
. Fluid drag is conceptualized via a critical Reynolds number:$${\boldsymbol{(}}{{\bf{10}}}^{{\boldsymbol{}}{\bf{7}}}{\boldsymbol{\lesssim }}{\bf{Re}}{\boldsymbol{\lesssim }}{{\bf{10}}}^{{\boldsymbol{}}{\bf{3}}}{\boldsymbol{)}}$$ $\left({10}^{7}\lesssim \mathrm{Re}\lesssim {10}^{3}\right)$ , where$${\bf{Re}}{\boldsymbol{=}}\frac{{{\bf{v}}}_{{\bf{0}}}{{\bf{x}}}_{{\bf{0}}}}{{\boldsymbol{\nu }}}$$ $\mathrm{Re}=\frac{{v}_{0}{x}_{0}}{\nu}$v _{0}corresponds to the maximum wetting speed on a flat, dry surface andx _{0}is the extension length of the liquid meniscus that drives the bulk fluid toward the adsorbed thinfilm region. The model is validated with wicking experiments on different hemiwicking surfaces in conjunction withv _{0}andx _{0}measurements using Water , viscous FC70$${\boldsymbol{(}}{{\bf{v}}}_{{\bf{0}}}{\boldsymbol{\approx }}{\bf{2}}\,{\bf{m}}{\boldsymbol{/}}{\bf{s}}{\boldsymbol{,}}\,{\bf{25}}\,{\boldsymbol{\mu }}{\bf{m}}{\boldsymbol{\lesssim }}{{\bf{x}}}_{{\bf{0}}}{\boldsymbol{\lesssim }}{\bf{28}}\,{\boldsymbol{\mu }}{\bf{m}}{\boldsymbol{)}}$$ $\left({v}_{0}\approx 2\phantom{\rule{0ex}{0ex}}m/s,\phantom{\rule{0ex}{0ex}}25\phantom{\rule{0ex}{0ex}}\mu m\lesssim {x}_{0}\lesssim 28\phantom{\rule{0ex}{0ex}}\mu m\right)$ and lower viscosity Ethanol$${\boldsymbol{(}}{{\boldsymbol{v}}}_{{\bf{0}}}{\boldsymbol{\approx }}{\bf{0.3}}\,{\bf{m}}{\boldsymbol{/}}{\bf{s}}{\boldsymbol{,}}\,{\bf{18.6}}\,{\boldsymbol{\mu }}{\bf{m}}{\boldsymbol{\lesssim }}{{\boldsymbol{x}}}_{{\bf{0}}}{\boldsymbol{\lesssim }}{\bf{38.6}}\,{\boldsymbol{\mu }}{\bf{m}}{\boldsymbol{)}}$$ $\left({v}_{0}\approx 0.3\phantom{\rule{0ex}{0ex}}m/s,\phantom{\rule{0ex}{0ex}}18.6\phantom{\rule{0ex}{0ex}}\mu m\lesssim {x}_{0}\lesssim 38.6\phantom{\rule{0ex}{0ex}}\mu m\right)$ .$${\boldsymbol{(}}{{\boldsymbol{v}}}_{{\bf{0}}}{\boldsymbol{\approx }}{\bf{1.2}}\,{\bf{m}}{\boldsymbol{/}}{\bf{s}}{\boldsymbol{,}}\,{\bf{11.8}}\,{\boldsymbol{\mu }}{\bf{m}}{\boldsymbol{\lesssim }}{{\bf{x}}}_{{\bf{0}}}{\boldsymbol{\lesssim }}{\bf{33.3}}\,{\boldsymbol{\mu }}{\bf{m}}{\boldsymbol{)}}$$ $\left({v}_{0}\approx 1.2\phantom{\rule{0ex}{0ex}}m/s,\phantom{\rule{0ex}{0ex}}11.8\phantom{\rule{0ex}{0ex}}\mu m\lesssim {x}_{0}\lesssim 33.3\phantom{\rule{0ex}{0ex}}\mu m\right)$ 
Abstract We continue the program of proving circuit lower bounds via circuit satisfiability algorithms. So far, this program has yielded several concrete results, proving that functions in
and other complexity classes do not have small circuits (in the worst case and/or on average) from various circuit classes$\mathsf {Quasi}\text {}\mathsf {NP} = \mathsf {NTIME}[n^{(\log n)^{O(1)}}]$ $\mathrm{Quasi}\mathrm{NP}=\mathrm{NTIME}\left[{n}^{{\left(\mathrm{log}n\right)}^{O\left(1\right)}}\right]$ , by showing that$\mathcal { C}$ $C$ admits nontrivial satisfiability and/or$\mathcal { C}$ $C$# SAT algorithms which beat exhaustive search by a minor amount. In this paper, we present a new strong lower bound consequence of having a nontrivial# SAT algorithm for a circuit class . Say that a symmetric Boolean function${\mathcal C}$ $C$f (x _{1},…,x _{n}) issparse if it outputs 1 onO (1) values of . We show that for every sparse${\sum }_{i} x_{i}$ ${\sum}_{i}{x}_{i}$f , and for all “typical” , faster$\mathcal { C}$ $C$# SAT algorithms for circuits imply lower bounds against the circuit class$\mathcal { C}$ $C$ , which may be$f \circ \mathcal { C}$ $f\circ C$stronger than itself. In particular:$\mathcal { C}$ $C$# SAT algorithms forn ^{k}size circuits running in 2^{n}/$\mathcal { C}$ $C$n ^{k}time (for allk ) implyN E X P does not have circuits of polynomial size.$(f \circ \mathcal { C})$ $(f\circ C)$# SAT algorithms for size$2^{n^{{\varepsilon }}}$ ${2}^{{n}^{\epsilon}}$ circuits running in$\mathcal { C}$ $C$ time (for some$2^{nn^{{\varepsilon }}}$ ${2}^{n{n}^{\epsilon}}$ε > 0) implyQ u a s i N P does not have circuits of polynomial size.$(f \circ \mathcal { C})$ $(f\circ C)$Applying
# SAT algorithms from the literature, one immediate corollary of our results is thatQ u a s i N P does not haveE M A J ∘A C C ^{0}∘T H R circuits of polynomialmore »