Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

295887116 · May 202619922001200920172026
48 results for SCFT rank 0

We propose a method to assign non-unitary TQFTs to certain SCFTs, deriving bounds and examples.

problem Assigning non-unitary TQFTs to specific SCFTs of rank 0.
method Using degenerate limits of SCFTs, extracting modular data from supersymmetric partition functions, and proposing a dictionary.
result Deriving a lower bound on the free energy of SCFTs and showing it is saturated by a specific SCFT.

We analyse the moduli spaces of superconformal field theories (SCFTs). For N=2 we find an enhanced moduli space which in geometrical terms corresponds to tori with two independent complex structures. To explain the precise relation with the moduli space of SCFTs on K3 surfaces as described by Aspinwall and Morrison, we…

2003-02-28abs ↗pdf ↗

Classifies theories with eight supercharges using pseudo-periodic maps and Riemann surfaces.

problem Classifying theories with eight supercharges using mathematical tools.
method Assumes theories are given by genus g fibrations of Riemann surfaces, uses pseudo-periodic maps of negative type in mapping class group.
result Identifies dual graphs and 3d mirror quivers, unifies various SCFTs in combinatorial framework.

Researchers study rank two theories with eight supercharges using Lefschetz pencils.

problem Understanding the global Seiberg-Witten geometries for rank two theories with eight supercharges.
method Combining combinatorial methods with geometric analysis of Lefschetz pencils.
result The conjugacy class of mapping class group determines the local singularity, and the global study reduces to questions about MCG.

One of the main challenges in 3d-3d correspondence is that no existent approach offers a complete description of 3d N=2N=2 SCFT T[M3]T[M_3] --- or, rather, a "collection of SCFTs" as we refer to it in the paper --- for all types of 3-manifolds that include, for example, a 3-torus, Brieskorn spheres, and hyperbolic surgerie…

2019-11-19abs ↗pdf ↗

We consider supersymmetric AdS3×Y7_3 \times Y_7 and AdS2×Y9_2 \times Y_9 solutions of type IIB and D=11D=11 supergravity, respectively, that are holographically dual to SCFTs with (0,2)(0,2) supersymmetry in two dimensions and N=2\mathcal{N}=2 supersymmetry in one dimension. The geometry of Y2n+1Y_{2n+1}, which can be defined for $…

2018-10-25abs ↗pdf ↗

Study of IR phases in 3D class R theories linked to non-hyperbolic 3-manifolds.

problem Understanding IR phases of 3D class R theories associated with non-hyperbolic 3-manifolds.
method Analysis of IR phenomena through `exceptional' Dehn fillings and gauging of flavor symmetries.
result 3D class R theories associated with certain atoroidal non-hyperbolic 3-manifolds exhibit supersymmetry enhancement at low energy.

New algorithm constructs characters of rational VOAs from knot complements.

problem Constructing characters of rational VOAs from knot complements.
method 3D N=2\mathcal{N}=2 gauge theories, Dimofte-Gaiotto-Gukov construction, 3D N=4\mathcal{N}=4 rank-0 SCFT, topological twist.
result New Nahm-sum-like expressions for Virasoro minimal model characters.

New cohomology ηη for deformed Sasaki-Einstein manifolds derived from Dolbeault cohomology.

problem Developing a new cohomology structure for deformed Sasaki-Einstein manifolds.
method Introducing ηη-cohomology defined by a CR structure and a holomorphic function ff with non-vanishing ηdfη\equiv \mathrm{d}f.
result Established a direct relation between the cyclic homologies of the Calabi-Yau algebra and the ηη-cohomology groups.

Generalized Calabi-Yau structures, a notion recently introduced by Hitchin, are studied in the case of K3 surfaces. We show how they are related to the classical theory of K3 surfaces and to moduli spaces of certain SCFT as studied by Aspinwall and Morrison. It turns out that K3 surfaces and symplectic structures are b…

2003-06-10abs ↗pdf ↗

Abstract M5 branes on ADE singularities yields BPS spectrum and partition functions.

problem Determine the BPS spectrum and partition functions for M5 branes on ADE singularities.
method Analyze 6d N=(1,0)\mathcal{N}=(1,0) SCFTs on geometric backgrounds, using contributions from BPS strings and particles.
result Explicit expressions for BPS string and particle contributions to partition functions.

The abstract discusses fiber sum formulas for 4-manifolds using topological modular forms.

problem Understanding fiber sum formulas for 4-manifolds.
method Using the connection between 4-manifolds and topological modular forms from 6d (1,0) SCFTs.
result Even free theories exhibit nontrivial fiber sum formulas, sensitive to individual theories and parameters.

We propose a dictionary between geometry of triangulated 3-manifolds and physics of three-dimensional N=2 gauge theories. Under this duality, standard operations on triangulated 3-manifolds and various invariants thereof (classical as well as quantum) find a natural interpretation in field theory. For example, independ…

2011-08-22abs ↗pdf ↗

Study gauged supergravity, M5-branes, and class R theories, constraining supergravity coefficients and calculating partition functions.

problem Constraints and calculations in higher-derivative supergravity and related theories.
method Holography, Chern-Simons theory, 3d-3d correspondence, wrapped M5-branes.
result Constrained coefficients in supergravity Lagrangian, calculated partition functions for class R theories.

We use the 3d-3d correspondence together with the DGG construction of theories Tn[M]T_n[M] labelled by 3-manifolds M to define a non-perturbative state-integral model for SL(n,C) Chern-Simons theory at any level k, based on ideal triangulations. The resulting partition functions generalize a widely studied k=1 state-integ…

2014-09-02abs ↗pdf ↗

We continue our study of a general class of N=2\mathcal{N}=2 supersymmetric AdS3×Y7AdS_3\times Y_7 and AdS2×Y9AdS_2\times Y_9 solutions of type IIB and D=11D=11 supergravity, respectively. The geometry of the internal spaces is part of a general family of "GK geometries", Y2n+1Y_{2n+1}, n3n\ge 3, and here we study examples in which $Y…

2019-10-17abs ↗pdf ↗

This paper studies the interplay between the N=2 gauge theories in three and four dimensions that have a geometric description in terms of twisted compactification of the six-dimensional (2,0) SCFT. Our main goal is to construct the three-dimensional domain walls associated to any three-dimensional cobordism. We find t…

2013-04-24abs ↗pdf ↗

This paper addresses the problem of rank aggregation, which aims to find a consensus ranking among multiple ranking inputs. Traditional rank aggregation methods are deterministic, and can be categorized into explicit and implicit methods depending on whether rank information is explicitly or implicitly utilized. Surpri…

2013-09-26abs ↗pdf ↗

We study the problem of rank aggregation: given a set of ranked lists, we want to form a consensus ranking. Furthermore, we consider the case of extreme lists: i.e., only the rank of the best or worst elements are known. We impute missing ranks by the average value and generalise Spearman's ρto extreme ranks. Our main …

2014-10-16abs ↗pdf ↗

We study the problem of learning to rank from multiple information sources. Though multi-view learning and learning to rank have been studied extensively leading to a wide range of applications, multi-view learning to rank as a synergy of both topics has received little attention. The aim of the paper is to propose a c…

2018-01-31abs ↗pdf ↗

Paper tackles underranking in group-fair ranking systems, proving a trade-off and presenting an algorithm.

problem Underranking in group-fair ranking systems can worsen social and economic inequalities.
method Formulated underranking as a new problem, proved a lower bound, and presented a fair ranking algorithm.
result Algorithm achieves best of underranking and group fairness, confirming theoretical trade-off.

Introduces nondecreasing rank for matrices and tensors, developing methods and applications.

problem Finding low-rank approximations for matrices and tensors with monotonic constraints.
method Developed a variant of hierarchical alternating least squares algorithm for finding low ND rank approximations.
result Low ND rank factorizations can be found and interpreted for real-world datasets.

The paper tackles learning true rankings from noisy, incomplete data.

problem Learning true rankings from incomplete and noisy data.
method Introduces a selective Mallows model for noisy rankings and derives upper and lower bounds on sample complexity.
result Strong asymptotically tight bounds on sample complexity for learning complete rankings and top-k rankings.

Paper introduces GAMs for interpretable learning-to-rank models.

problem Need for transparent ranking models in legal or policy scenarios.
method Developed generalized additive models (GAMs) for ranking tasks using neural networks.
result Neural ranking GAMs achieve better performance than traditional GAMs while maintaining interpretability.

Low-rank framework for task-specific LLM ranking from sparse comparisons.

problem Challenges in reliable task-specific ranking of LLMs under sparse, imbalanced comparisons.
method Low-rank modeling of task-by-model ability matrix, max-norm accurate estimator, task-wise top-K recovery guarantees, uncertainty quantification framework.
result Improves sample efficiency and produces tighter, better-calibrated ranking certificates.

New method solves nonsmooth low-rank matrix optimization problems efficiently.

problem Nonsmooth and low-rank matrix optimization problems in statistics and machine learning.
method Low-rank Extragradient Method with warm-start initialization.
result The extragradient method converges to an optimal solution with rate O(1/t)O(1/t) and requires only two low-rank SVDs per iteration.

FedLoRU improves FL efficiency by using low-rank updates.

problem Communication inefficiency and performance reduction in Federated Learning.
method Proposes FedLoRU, a low-rank update framework for FL, which reduces communication costs while maintaining performance.
result FedLoRU achieves convergence rates similar to FedAvg and is robust to heterogeneous and large numbers of clients.