相关论文: Large scalar gaps in 2D CFTs with generalized poly…

The aim of this paper is to apply generalized operators of fractional integration and differentiation involving Appell's function $F_{3}(:)$ due to Marichev-Saigo-Maeda (MSM), to the Jacobi type orthogonal polynomials. The results are…

Recent work has shown the surprising power of low-degree sandwiching polynomial approximators in the context of challenging learning settings such as learning with distribution shift, testable learning, and learning with contamination. A…

We use the AdS/CFT correspondence to calculate three point functions of chiral primary operators at large N in d=3, N=8 and d=6, N=(2,0) superconformal field theories. These theories are related to the infrared fixed points of world-volume…

We provide a one-to-one correspondence between line operators and states in four-dimensional CFTs with continuous 1-form symmetries. In analogy with 0-form symmetries in two dimensions, such CFTs have a free photon realisation and enjoy an…

We introduce analytic functionals which act on the crossing equation for CFTs in arbitrary spacetime dimension. The functionals fully probe the constraints of crossing symmetry on the first sheet, and are in particular sensitive to the OPE,…

We propose new linear combinations of compositions of a basic second-order scheme with appropriately chosen coefficients to construct higher order numerical integrators for differential equations. They can be considered as a generalization…

A Morse 2-function is a generic smooth map from a manifold M of arbitrary finite dimension to a surface B. Its critical set maps to an immersed collection of cusped arcs in B. The aim of this paper is to explain exactly when it is possible…

We study analytically the constraints of the conformal bootstrap on the low-lying spectrum of operators in field theories with global conformal symmetry in one and two spacetime dimensions. We introduce a new class of linear functionals…

We study $S_N$-invariant four-point functions with two generic multi-cycle fields and two twist-2 fields, at the free orbifold point of the D1-D5 CFT. We derive the explicit factorization of these functions following from the action of the…

This paper introduces Generalized Fourier transform (GFT) that is an extension or the generalization of the Fourier transform (FT). The Unilateral Laplace transform (LT) is observed to be the special case of GFT. GFT, as proposed in this…

We prove the existence of common hypercyclic, entire functions for certain uncountable families of traslation type operators with relative large gaps.

We show that many important convex matrix functions can be represented as the partial infimal projection of the generalized matrix fractional (GMF) and a relatively simple convex function. This representation provides conditions under which…

Two and three-point functions of primary fields in four dimensional CFT have a simple space-time dependences factored out from the combinatoric structure which enumerates the fields and gives their couplings. This has led to the formulation…

We introduce the concept of the touching of two multifunctions on a real Hilbert space, and deduce that certain multifunctions on the space have a unique fixed point. These result are applied to the theory of genaralized cycles and…

This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…

Supporting multiple partial computations efficiently at each of the workers is a keystone in distributed coded computing in order to speed up computations and to fully exploit the resources of heterogeneous workers in terms of…

Generalized Fourier series with orthogonal polynomial bases have useful applications in several fields, including differential equations, pattern recognition, and image and signal processing. However, computing the generalized Fourier…

Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

The polynomial partitioning method of Guth and Katz [arXiv:1011.4105] has numerous applications in discrete and computational geometry. It partitions a given $n$-point set $P\subset\mathbb{R}^d$ using the zero set $Z(f)$ of a suitable…