An official website of the United States government
Many seemingly contradictory experimental findings concerning the superconducting state in Sr2RuO4 can be accounted for on the basis of a conjectured accidental degeneracy between two patterns of pairing that are unrelated to each other under the (D4h) symmetry of the crystal: a dx2-y2-wave (B1g) and a gxy(x2-y2)-wave (A2g) superconducting state. In this paper, we propose a generic multiband model in which the g-wave pairing involving the xz and yz orbitals arises from second-nearest-neighbor BCS channel effective interactions. Even if timereversal symmetry is broken in a d + ig state, such a superconductor remains gapless with a Bogoliubov Fermi surface that approximates a (vertical) line node. The model gives rise to a strain-dependent splitting between the critical temperature Tc and the time-reversal symmetry-breaking temperature TTRSB that is qualitatively similar to some of the experimental observations in Sr2RuO4.
more »
« less
A proposal for reconciling diverse experiments on the superconducting state in Sr2RuO4
Abstract A variety of precise experiments have been carried out to establish the character of the superconducting state in Sr 2 RuO 4 . Many of these appear to imply contradictory conclusions concerning the symmetries of this state. Here we propose that these results can be reconciled if we assume that there is a near-degeneracy between a $${d}_{{x}^{2}-{y}^{2}}$$ d x 2 − y 2 (B 1 g in group theory nomenclature) and a $${g}_{xy({x}^{2}-{y}^{2})}$$ g x y ( x 2 − y 2 ) (A 2 g ) superconducting state. From a weak-coupling perspective, such an accidental degeneracy can occur at a point at which a balance between the on-site and nearest-neighbor repulsions triggers a d -wave to g -wave transition.
more »
« less
- PAR ID:
- 10216202
- Date Published:
- Journal Name:
- npj Quantum Materials
- Volume:
- 5
- Issue:
- 1
- ISSN:
- 2397-4648
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract May the triforce be the 3-uniform hypergraph on six vertices with edges {123′, 12′3, 1′23}. We show that the minimum triforce density in a 3-uniform hypergraph of edge density δ is δ 4– o (1) but not O ( δ 4 ). Let M ( δ ) be the maximum number such that the following holds: for every ∊ > 0 and $$G = {\mathbb{F}}_2^n$$ with n sufficiently large, if A ⊆ G × G with A ≥ δ | G | 2 , then there exists a nonzero “popular difference” d ∈ G such that the number of “corners” ( x , y ), ( x + d , y ), ( x , y + d ) ∈ A is at least ( M ( δ )–∊)| G | 2 . As a corollary via a recent result of Mandache, we conclude that M ( δ ) = δ 4– o (1) and M ( δ ) = ω ( δ 4 ). On the other hand, for 0 < δ < 1/2 and sufficiently large N , there exists A ⊆ [ N ] 3 with | A | ≥ δN 3 such that for every d ≠ 0, the number of corners ( x , y , z ), ( x + d , y , z ), ( x , y + d , z ), ( x , y , z + d ) ∈ A is at most δ c log(1/ δ ) N 3 . A similar bound holds in higher dimensions, or for any configuration with at least 5 points or affine dimension at least 3.more » « less
-
Let $$x,y\in (0,1]$$, and let $A,B,C$ be disjoint nonempty stable subsets of a graph $$G$$, where every vertex in $$A$$ has at least $x|B|$ neighbours in $$B$$, and every vertex in $$B$$ has at least $y|C|$ neighbours in $$C$$, and there are no edges between $A,C$. We denote by $$\phi(x,y)$$ the maximum $$z$$ such that, in all such graphs $$G$$, there is a vertex $$v\in C$$ that is joined to at least $z|A|$ vertices in $$A$$ by two-edge paths. This function has some interesting properties: we show, for instance, that $$\phi(x,y)=\phi(y,x)$$ for all $x,y$, and there is a discontinuity in $$\phi(x,x)$$ when $1/x$ is an integer. For $z=1/2, 2/3,1/3,3/4,2/5,3/5$, we try to find the (complicated) boundary between the set of pairs $(x,y)$ with $$\phi(x,y)\ge z$$ and the pairs with $$\phi(x,y)1/3$.more » « less
-
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}}$$ orbital 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
-
We generalize Hermite interpolation with error correction, which is the methodology for multiplicity algebraic error correction codes, to Hermite interpolation of a rational function over a field K from function and function derivative values. We present an interpolation algorithm that can locate and correct <= E errors at distinct arguments y in K where at least one of the values or values of a derivative is incorrect. The upper bound E for the number of such y is input. Our algorithm sufficiently oversamples the rational function to guarantee a unique interpolant. We sample (f/g)^(j)(y[i]) for 0 <= j <= L[i], 1 <= i <= n, y[i] distinct, where (f/g)^(j) is the j-th derivative of the rational function f/g, f, g in K[x], GCD(f,g)=1, g <= 0, and where N = (L[1]+1)+...+(L[n]+1) >= C + D + 1 + 2(L[1]+1) + ... + 2(L[E]+1) where C is an upper bound for deg(f) and D an upper bound for deg(g), which are input to our algorithm. The arguments y[i] can be poles, which is truly or falsely indicated by a function value infinity with the corresponding L[i]=0. Our results remain valid for fields K of characteristic >= 1 + max L[i]. Our algorithm has the same asymptotic arithmetic complexity as that for classical Hermite interpolation, namely soft-O(N). For polynomials, that is, g=1, and a uniform derivative profile L[1] = ... = L[n], our algorithm specializes to the univariate multiplicity code decoder that is based on the 1986 Welch-Berlekamp algorithm.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1038/s41535-020-0245-1
