Related papers: Proof of Compositionality of CFT Correctness
We review the construction of the AdS/CFT dressing factor, its analytic properties and several checks of its validity.
A general introduction to Lorentz and CPT violation is presented. The observable effects of the breakdown of such fundamental symmetries in neutrinos are outlined and different experimental searches of some of the key signals of Lorentz…
In this paper we proof that any cactus graph satisfies graph complement conjecture by finding a orthogonal representation of its complement in $\mathbb{R}^5$.
We prove that finite-index conformal nets are fully dualizable objects in the 3-category of conformal nets. Therefore, assuming the cobordism hypothesis applies, there exists a local framed topological field theory whose value on the point…
The paper presents an enriched categorical account of homological perturbation theory, including the formulation, proof and functoriality properties of the homological perturbation lemma.
Many books on polarization give tables of Mueller matrices. Here we give a table of Mueller matrices M, coherency matrices C, and coherency matrix factors F for different polarization components. F is not given for some complicated cases.…
During the recent years experiments with neutral kaons have yielded remarkably sensitive results which are pertinent to such fundamental phenomena as CPT invariance (protecting causality), time-reversal invariance violation, coherence of…
The focus of the tool FTOS is to alleviate designers' burden by offering code generation for non-functional aspects including fault-tolerance mechanisms. One crucial aspect in this context is to ensure that user-selected mechanisms for the…
We compute the fundamental correlation functions in two-dimensional rational conformal field theory, from which all other correlators can be obtained by sewing: the correlators of three bulk fields on the sphere, one bulk and one boundary…
This is a survey on rectifiability. I discuss basic properties of rectifiable sets, measures, currents and varifolds and their role in complex and harmonic analysis, potential theory, calculus of variations, PDEs and some other topics.
Compositional verification algorithms are well-studied in the context of model checking. Properly selecting components for verification is important for efficiency, yet has received comparatively less attention. In this paper, we address…
In this paper, we discuss the simple current orbifold of a rational Narain CFT (Narain RCFT). This is a method of constructing other rational CFTs from a given rational CFT, by ``orbifolding'' the global symmetry formed by a particular…
Neural Network Field Theories (NN-FTs) represent a novel construction of arbitrary field theories, including those of conformal fields, through the specification of the network architecture and prior distribution for the network parameters.…
The study of Riemann surfaces with parametrized boundary components was initiated in conformal field theory (CFT). Motivated by general principles from Teichmueller theory, and applications to the construction of CFT from vertex operator…
This talk at the CPT'25 meeting presents an overview of some recent results in Lorentz and CPT violation. Topics covered include the geometry of Finsler spaces associated with Lorentz violation, the resolution of the concordance problem in…
Conformal field theories (CFTs) feature prominently in high-energy physics, statistical mechanics, and condensed matter. For example, CFTs govern emergent universal properties of systems tuned to quantum phase transitions, including their…
Factorization theorem plays the central role at high energy colliders to study standard model and beyond standard model physics. The proof of factorization theorem is given by Collins, Soper and Sterman to all orders in perturbation theory…
We consider the constituent parsing problem which states: given a final state normalized constituent tree automaton (CTA) and a string, compute the set of all constituent trees that are inductively recognized by the CTA and yield the…
In this paper we give a method, based on the characteristic function of a set, to solve some difficult problems of set theory in undergraduate research.
Verified compilation of open modules (i.e., modules whose functionality depends on other modules) provides a foundation for end-to-end verification of modular programs ubiquitous in contemporary software. However, despite intensive…