Related papers: Proof of Compositionality of CFT Correctness
We prove a sharp structural result concerning finite colorings of pairs in well-founded trees.
A proof of G\"odel's incompleteness theorem is given. With this new proof a transfinite extension of G\"odel's theorem is considered. It is shown that if one assumes the set theory ZFC on the meta level as well as on the object level, a…
Higher genus modular invariance of two-dimensional conformal field theories (CFTs) is a largely unexplored area. In this paper, we derive explicit expressions for the higher genus partition functions of a specific class of CFTs: code CFTs,…
The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].
We propose a method for analyzing two-dimensional symmetry protected topological (SPT) wavefunctions using a correspondence with conformal field theories (CFTs) and integrable lattice models. This method generalizes the CFT approach for the…
Pandora temporal fault tree, as one notable extension of the fault tree, introduces temporal gates and temporal laws. Pandora Temporal Fault Tree(TFT) enhances the capability of fault trees and enables the modeling of system failure…
This talk provides an overview of a string-based mechanism for spontaneous CPT violation. A summary is given of theoretical developments. The mechanism could generate CPT-violating contributions to a four-dimensional low-energy effective…
How does one verify that the output of a complicated program is correct? One can formally prove that the program is correct, but this may be beyond the power of existing methods. Alternatively one can check that the output produced for a…
We formulate the Hauptvermutung of Causal Set Theory in two mathematically well-defined but different ways one of which turns out to be wrong and the other one turns out to be true. A further result is that the Hauptvermutung is true if we…
We define the notion of componentwise regularity and study some of its basic properties. We prove an analogue, when working with weight orders, of Buchberger's criterion to compute Gr\"obner bases; the proof of our criterion relies on a…
We investigate analyticity properties of correlation functions in conformal field theories (CFT) in the Wightman formulation. The goal is to determine domain of holomorphy of permuted Wightman functions. We focus on crossing property of…
A cluster tree provides a highly-interpretable summary of a density function by representing the hierarchy of its high-density clusters. It is estimated using the empirical tree, which is the cluster tree constructed from a density…
In this paper, using some properties of fundamental groups and covering spaces of connected polyhedra and CW-complexes, we present topological proof for some famous theorems about finitely presented groups.
We investigate higher-order corrections to correlators in a general CFT (conformal field theory) with the double-trace $T\bar{T}$ deformation. Standard perturbation theory proves inadequate for this problem due to the intricate…
We resolve issues that have plagued reliable prediction of relative phase stability for solid-solutions and compounds. Due to its commercially important phase diagram, we showcase Al-Li system because historically density-functional theory…
Many set theorists point to the linearity phenomenon in the hierarchy of consistency strength, by which natural theories tend to be linearly ordered and indeed well ordered by consistency strength. Why should it be linear? In this paper I…
We define what we call morphisms of Cartan connections. We generalize the main theorems on Cartan connections to theorems on morphisms. Many of the known constructions involving Cartan connections turn out to be examples of morphisms. We…
Self-consistent field theory (SCFT) is one of the useful methods to simulate phase separated structures of multi-component polymer systems. In this article, we propose an SCFT for semiflexible polymer melts, where the basic equations for…
We present a detailed account of the properties of twisters and their generalizations, FC sets, which are essential ingredients of the orbifold deconstruction procedure aimed at recognizing whether a given conformal model may be obtained as…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…