skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 10:00 PM ET on Friday, February 6 until 10:00 AM ET on Saturday, February 7 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Bounds on the superconducting transition temperature
I summarize recent progress on obtaining rigorous upper bounds on superconducting transition temperature [Formula: see text] in two dimensions independent of pairing mechanism or interaction strength. These results are derived by finding a general upper bound for the superfluid stiffness for a multi-band system with arbitrary interactions, with the only assumption that the external vector potential couples to the kinetic energy and not to the interactions. This bound is then combined with the universal relation between the superfluid stiffness and the Berezinskii–Kosterlitz–Thouless [Formula: see text] in 2D. For parabolic dispersion, one obtains the simple result that [Formula: see text], which has been tested in recent experiments. More generally, the bounds are expressed in terms of the optical spectral weight and lead to stringent constraints for the [Formula: see text] of low-density, strongly correlated superconductors. Results for [Formula: see text] bounds for models of flat-band superconductors, where the kinetic energy vanishes and the vector potential must couple to interactions, are briefly summarized. Upper bounds on [Formula: see text] in 3D remains an open problem, and I describe how questions of universality underlie the challenges in 3D.  more » « less
Award ID(s):
2011876
PAR ID:
10582594
Author(s) / Creator(s):
Publisher / Repository:
World Scientific Connect
Date Published:
Journal Name:
Modern Physics Letters B
Volume:
38
Issue:
34
ISSN:
0217-9849
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; ; ; ; ; (, Nature Communications)
    null (Ed.)
    Abstract Superfluid 3 He, with unconventional spin-triplet p-wave pairing, provides a model system for topological superconductors, which have attracted significant interest through potential applications in topologically protected quantum computing. In topological insulators and quantum Hall systems, the surface/edge states, arising from bulk-surface correspondence and the momentum space topology of the band structure, are robust. Here we demonstrate that in topological superfluids and superconductors the surface Andreev bound states, which depend on the momentum space topology of the emergent order parameter, are fragile with respect to the details of surface scattering. We confine superfluid 3 He within a cavity of height D comparable to the Cooper pair diameter ξ 0 . We precisely determine the superfluid transition temperature T c and the suppression of the superfluid energy gap, for different scattering conditions tuned in situ, and compare to the predictions of quasiclassical theory. We discover that surface magnetic scattering leads to unexpectedly large suppression of T c , corresponding to an increased density of low energy bound states. 
    more » « less
  2. (, Journal of Knot Theory and Its Ramifications)
    The non-orientable 4-genus of a knot [Formula: see text] in [Formula: see text] is defined to be the minimum first Betti number of a non-orientable surface [Formula: see text] smoothly embedded in [Formula: see text] so that [Formula: see text] bounds [Formula: see text]. We will survey the tools used to compute the non-orientable 4-genus, and use various techniques to calculate this invariant for non-alternating 11 crossing knots. We will also view obstructions to a knot bounding a Möbius band given by the double branched cover of [Formula: see text] branched over [Formula: see text]. 
    more » « less
  3. ; ; ; ; (, Mathematics of Operations Research)
    We study the problem of fairly allocating a set of indivisible goods among n agents with additive valuations. Envy freeness up to any good (EFX) is arguably the most compelling fairness notion in this context. However, the existence of an EFX allocation has not been settled and is one of the most important problems in fair division. Toward resolving this question, many impressive results show the existence of its relaxations. In particular, it is known that 0.618-EFX allocations exist and that EFX allocation exists if we do not allocate at most (n-1) goods. Reducing the number of unallocated goods has emerged as a systematic way to tackle the main question. For example, follow-up works on three- and four-agents cases, respectively, allocated two more unallocated goods through an involved procedure. In this paper, we study the general case and achieve sublinear numbers of unallocated goods. Through a new approach, we show that for every [Formula: see text], there always exists a [Formula: see text]-EFX allocation with sublinear number of unallocated goods and high Nash welfare. For this, we reduce the EFX problem to a novel problem in extremal graph theory. We define the notion of rainbow cycle number [Formula: see text] in directed graphs. For all [Formula: see text] is the largest k such that there exists a k-partite graph [Formula: see text], in which each part has at most d vertices (i.e., [Formula: see text] for all [Formula: see text]); for any two parts Viand Vj, each vertex in Vihas an incoming edge from some vertex in Vjand vice versa; and there exists no cycle in G that contains at most one vertex from each part. We show that any upper bound on [Formula: see text] directly translates to a sublinear bound on the number of unallocated goods. We establish a polynomial upper bound on [Formula: see text], yielding our main result. Furthermore, our approach is constructive, which also gives a polynomial-time algorithm for finding such an allocation. Funding: J. Garg was supported by the Directorate for Computer and Information Science and Engineering [Grant CCF-1942321]. R. Mehta was supported by the Directorate for Computer and Information Science and Engineering [Grant CCF-1750436]. 
    more » « less
  4. ; (, International Journal of Computational Geometry & Applications)
    null (Ed.)
    We propose an Euler transformation that transforms a given [Formula: see text]-dimensional cell complex [Formula: see text] for [Formula: see text] into a new [Formula: see text]-complex [Formula: see text] in which every vertex is part of the same even number of edges. Hence every vertex in the graph [Formula: see text] that is the [Formula: see text]-skeleton of [Formula: see text] has an even degree, which makes [Formula: see text] Eulerian, i.e., it is guaranteed to contain an Eulerian tour. Meshes whose edges admit Eulerian tours are crucial in coverage problems arising in several applications including 3D printing and robotics. For [Formula: see text]-complexes in [Formula: see text] ([Formula: see text]) under mild assumptions (that no two adjacent edges of a [Formula: see text]-cell in [Formula: see text] are boundary edges), we show that the Euler transformed [Formula: see text]-complex [Formula: see text] has a geometric realization in [Formula: see text], and that each vertex in its [Formula: see text]-skeleton has degree [Formula: see text]. We bound the numbers of vertices, edges, and [Formula: see text]-cells in [Formula: see text] as small scalar multiples of the corresponding numbers in [Formula: see text]. We prove corresponding results for [Formula: see text]-complexes in [Formula: see text] under an additional assumption that the degree of a vertex in each [Formula: see text]-cell containing it is [Formula: see text]. In this setting, every vertex in [Formula: see text] is shown to have a degree of [Formula: see text]. We also present bounds on parameters measuring geometric quality (aspect ratios, minimum edge length, and maximum angle of cells) of [Formula: see text] in terms of the corresponding parameters of [Formula: see text] for [Formula: see text]. Finally, we illustrate a direct application of the proposed Euler transformation in additive manufacturing. 
    more » « less
  5. ; ; (, Mathematics of Operations Research)
    We study optimal design problems in which the goal is to choose a set of linear measurements to obtain the most accurate estimate of an unknown vector. We study the [Formula: see text]-optimal design variant where the objective is to minimize the average variance of the error in the maximum likelihood estimate of the vector being measured. We introduce the proportional volume sampling algorithm to obtain nearly optimal bounds in the asymptotic regime when the number [Formula: see text] of measurements made is significantly larger than the dimension [Formula: see text] and obtain the first approximation algorithms whose approximation factor does not degrade with the number of possible measurements when [Formula: see text] is small. The algorithm also gives approximation guarantees for other optimal design objectives such as [Formula: see text]-optimality and the generalized ratio objective, matching or improving the previously best-known results. We further show that bounds similar to ours cannot be obtained for [Formula: see text]-optimal design and that [Formula: see text]-optimal design is NP-hard to approximate within a fixed constant when [Formula: see text]. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Text Encoded Conversion
  • XML
  • Save / Share this Record
  • Send to Email