skip to main content


Title: Stabilization of three-dimensional charge order through interplanar orbital hybridization in PrxY1−xBa2Cu3O6+δ
Abstract

The shape of 3d-orbitals often governs the electronic and magnetic properties of correlated transition metal oxides. In the superconducting cuprates, the planar confinement of the$${d}_{{x}^{2}-{y}^{2}}$$dx2y2orbital dictates the two-dimensional nature of the unconventional superconductivity and a competing charge order. Achieving orbital-specific 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 CuL3and PrM5resonant x-ray scattering and first-principles calculations, we report a highly correlated three-dimensional charge order in Pr-substituted YBa2Cu3O7, where the Prf-electrons create a direct orbital bridge between CuO2planes. With this we demonstrate that interplanar orbital engineering can be used to surgically control electronic phases in correlated oxides and other layered materials.

 
more » « less
Award ID(s):
2145080
NSF-PAR ID:
10376187
Author(s) / Creator(s):
; ; ; ; ; ; ; ; ; ; ; ; ; ; ;
Publisher / Repository:
Nature Publishing Group
Date Published:
Journal Name:
Nature Communications
Volume:
13
Issue:
1
ISSN:
2041-1723
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    Let$$(h_I)$$(hI)denote the standard Haar system on [0, 1], indexed by$$I\in \mathcal {D}$$ID, the set of dyadic intervals and$$h_I\otimes h_J$$hIhJdenote the tensor product$$(s,t)\mapsto h_I(s) h_J(t)$$(s,t)hI(s)hJ(t),$$I,J\in \mathcal {D}$$I,JD. We consider a class of two-parameter function spaces which are completions of the linear span$$\mathcal {V}(\delta ^2)$$V(δ2)of$$h_I\otimes h_J$$hIhJ,$$I,J\in \mathcal {D}$$I,JD. This class contains all the spaces of the formX(Y), whereXandYare either the Lebesgue spaces$$L^p[0,1]$$Lp[0,1]or the Hardy spaces$$H^p[0,1]$$Hp[0,1],$$1\le p < \infty $$1p<. We say that$$D:X(Y)\rightarrow X(Y)$$D:X(Y)X(Y)is a Haar multiplier if$$D(h_I\otimes h_J) = d_{I,J} h_I\otimes h_J$$D(hIhJ)=dI,JhIhJ, where$$d_{I,J}\in \mathbb {R}$$dI,JR, and ask which more elementary operators factor throughD. A decisive role is played by theCapon projection$$\mathcal {C}:\mathcal {V}(\delta ^2)\rightarrow \mathcal {V}(\delta ^2)$$C:V(δ2)V(δ2)given by$$\mathcal {C} h_I\otimes h_J = h_I\otimes h_J$$ChIhJ=hIhJif$$|I|\le |J|$$|I||J|, and$$\mathcal {C} h_I\otimes h_J = 0$$ChIhJ=0if$$|I| > |J|$$|I|>|J|, as our main result highlights: Given any bounded Haar multiplier$$D:X(Y)\rightarrow X(Y)$$D:X(Y)X(Y), there exist$$\lambda ,\mu \in \mathbb {R}$$λ,μRsuch that$$\begin{aligned} \lambda \mathcal {C} + \mu ({{\,\textrm{Id}\,}}-\mathcal {C})\text { approximately 1-projectionally factors through }D, \end{aligned}$$λC+μ(Id-C)approximately 1-projectionally factors throughD,i.e., for all$$\eta > 0$$η>0, there exist bounded operatorsABso thatABis the identity operator$${{\,\textrm{Id}\,}}$$Id,$$\Vert A\Vert \cdot \Vert B\Vert = 1$$A·B=1and$$\Vert \lambda \mathcal {C} + \mu ({{\,\textrm{Id}\,}}-\mathcal {C}) - ADB\Vert < \eta $$λC+μ(Id-C)-ADB<η. Additionally, if$$\mathcal {C}$$Cis unbounded onX(Y), then$$\lambda = \mu $$λ=μand then$${{\,\textrm{Id}\,}}$$Ideither factors throughDor$${{\,\textrm{Id}\,}}-D$$Id-D.

     
    more » « less
  2. Abstract

    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 Li-decoration of graphene with broken lattice symmetry, and includessanddsymmetry Bloch character that influences the gap symmetries that can arise. The resulting seven hybridized Li-C orbitals that support nine possible bond pairing amplitudes. The gap equation is solved for all possible gap symmetries. One band is weakly dispersive near the Fermi energy along Γ → Mwhere its Bloch wave function has linear combination of$${d}_{{x}^{2}-{y}^{2}}$$dx2y2anddxycharacter, and is responsible for$${d}_{{x}^{2}-{y}^{2}}$$dx2y2anddxypairing with lowest pairing energy in our model. These symmetries almost preserve properties from a two band model of pristine graphene. Another part of this band, alongK → Γ, is nearly degenerate with uppersband that favors extendedswave pairing which is not found in two band model. Upon electron doping to a critical chemical potentialμ1 = 0.22 eVthe pairing potential decreases, then increases until a second critical valueμ2 = 1.3 eV at which a phase transition to a distorteds-wave occurs. The distortion ofd- or s-wave phases are a consequence of decoration which is not appear in two band pristine model. In the pristine graphene these phases convert to usuald-wave or extendeds-wave pairing.

     
    more » « less
  3. 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$$L_{\beta ,\gamma } =- {\text {div}}D^{d+1+\gamma -n} \nabla $$Lβ,γ=-divDd+1+γ-nassociated to a domain$$\Omega \subset {\mathbb {R}}^n$$ΩRnwith a uniformly rectifiable boundary$$\Gamma $$Γof dimension$$d < n-1$$d<n-1, the now usual distance to the boundary$$D = D_\beta $$D=Dβgiven by$$D_\beta (X)^{-\beta } = \int _{\Gamma } |X-y|^{-d-\beta } d\sigma (y)$$Dβ(X)-β=Γ|X-y|-d-βdσ(y)for$$X \in \Omega $$XΩ, where$$\beta >0$$β>0and$$\gamma \in (-1,1)$$γ(-1,1). In this paper we show that the Green functionGfor$$L_{\beta ,\gamma }$$Lβ,γ, with pole at infinity, is well approximated by multiples of$$D^{1-\gamma }$$D1-γ, in the sense that the function$$\big | D\nabla \big (\ln \big ( \frac{G}{D^{1-\gamma }} \big )\big )\big |^2$$|D(ln(GD1-γ))|2satisfies a Carleson measure estimate on$$\Omega $$Ω. We underline that the strong and the weak results are different in nature and, of course, at the level of the proofs: the latter extensively used compactness arguments, while the present paper relies on some intricate integration by parts and the properties of the “magical distance function from David et al. (Duke Math J, to appear).

     
    more » « less
  4. Abstract

    Perovskite oxides (ternary chemical formula ABO3) are a diverse class of materials with applications including heterogeneous catalysis, solid-oxide fuel cells, thermochemical conversion, and oxygen transport membranes. However, their multicomponent (chemical formula$${A}_{x}{A}_{1-x}^{\text{'}}{B}_{y}{B}_{1-y}^{\text{'}}{O}_{3}$$AxA1x'ByB1y'O3) chemical space is underexplored due to the immense number of possible compositions. To expand the number of computed$${A}_{x}{A}_{1-x}^{{\prime} }{B}_{y}{B}_{1-y}^{{\prime} }{O}_{3}$$AxA1xByB1yO3compounds we report a dataset of 66,516 theoretical multinary oxides, 59,708 of which are perovskites. First, 69,407$${A}_{0.5}{A}_{0.5}^{{\prime} }{B}_{0.5}{B}_{0.5}^{{\prime} }{O}_{3}$$A0.5A0.5B0.5B0.5O3compositions were generated in theab+aGlazer tilting mode using the computationally-inexpensive Structure Prediction and Diagnostic Software (SPuDS) program. Next, we optimized these structures with density functional theory (DFT) using parameters compatible with the Materials Project (MP) database. Our dataset contains these optimized structures and their formation (ΔHf) and decomposition enthalpies (ΔHd) computed relative to MP tabulated elemental references and competing phases, respectively. This dataset can be mined, used to train machine learning models, and rapidly and systematically expanded by optimizing more SPuDS-generated$${A}_{0.5}{A}_{0.5}^{{\prime} }{B}_{0.5}{B}_{0.5}^{{\prime} }{O}_{3}$$A0.5A0.5B0.5B0.5O3perovskite structures using MP-compatible DFT calculations.

     
    more » « less
  5. Abstract

    Approximate integer programming is the following: For a given convex body$$K \subseteq {\mathbb {R}}^n$$KRn, either determine whether$$K \cap {\mathbb {Z}}^n$$KZnis empty, or find an integer point in the convex body$$2\cdot (K - c) +c$$2·(K-c)+cwhich isK, scaled by 2 from its center of gravityc. Approximate integer programming can be solved in time$$2^{O(n)}$$2O(n)while the fastest known methods for exact integer programming run in time$$2^{O(n)} \cdot n^n$$2O(n)·nn. So far, there are no efficient methods for integer programming known that are based on approximate integer programming. Our main contribution are two such methods, each yielding novel complexity results. First, we show that an integer point$$x^* \in (K \cap {\mathbb {Z}}^n)$$x(KZn)can be found in time$$2^{O(n)}$$2O(n), provided that theremaindersof each component$$x_i^* \mod \ell $$ximodfor some arbitrarily fixed$$\ell \ge 5(n+1)$$5(n+1)of$$x^*$$xare given. The algorithm is based on acutting-plane technique, iteratively halving the volume of the feasible set. The cutting planes are determined via approximate integer programming. Enumeration of the possible remainders gives a$$2^{O(n)}n^n$$2O(n)nnalgorithm for general integer programming. This matches the current best bound of an algorithm by Dadush (Integer programming, lattice algorithms, and deterministic, vol. Estimation. Georgia Institute of Technology, Atlanta, 2012) that is considerably more involved. Our algorithm also relies on a newasymmetric approximate Carathéodory theoremthat might be of interest on its own. Our second method concerns integer programming problems in equation-standard form$$Ax = b, 0 \le x \le u, \, x \in {\mathbb {Z}}^n$$Ax=b,0xu,xZn. Such a problem can be reduced to the solution of$$\prod _i O(\log u_i +1)$$iO(logui+1)approximate integer programming problems. This implies, for example thatknapsackorsubset-sumproblems withpolynomial variable range$$0 \le x_i \le p(n)$$0xip(n)can be solved in time$$(\log n)^{O(n)}$$(logn)O(n). For these problems, the best running time so far was$$n^n \cdot 2^{O(n)}$$nn·2O(n).

     
    more » « less