Related papers: Exact saturation in pseudo-elementary classes for …
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
Computational pseudorandomness studies the extent to which a random variable $\bf{Z}$ looks like the uniform distribution according to a class of tests $\cal{F}$. Computational entropy generalizes computational pseudorandomness by studying…
The quantum integrability of a class of massive perturbations of the parafermionic conformal field theories associated to compact Lie groups is established by showing that they have quantum conserved densities of scale dimension 2 and 3.…
We study complex CFTs describing fixed points of the two-dimensional $Q$-state Potts model with $Q>4$. Their existence is closely related to the weak first-order phase transition and walking RG behavior present in the real Potts model at…
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…
Probably Approximately Correct (i.e., PAC) learning is a core concept of sample complexity theory, and efficient PAC learnability is often seen as a natural counterpart to the class P in classical computational complexity. But while the…
We continue our study of Sierpinski-type colourings. In contrast to the prequel paper, we focus here on colourings for ideals stratified by their completeness degree. In particular, improving upon Ulam's theorem and its extension by Hajnal,…
String theory axions appear to be promising candidates for explaining cosmological constant via quintessence. In this paper, we study conditions on the string compactifications under which axion quintessence can happen. For sufficiently…
In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…
We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…
We present a formal proof in Lean of probably approximately correct (PAC) learnability of the concept class of decision stumps. This classic result in machine learning theory derives a bound on error probabilities for a simple type of…
We compare four different types of realizability for saturated fusion systems over discrete $p$-toral groups. For example, when $G$ is a locally finite group all of whose $p$-subgroups are artinian (hence discrete $p$-toral), we show that…
We study theoretically a PT-symmetric saturable balanced gain-loss system in a ring cavity configuration. The saturable gain and loss are modeled by two-level medium with or without population inversion. We show that the specifics of the…
This work incorporates topological features via persistence diagrams to classify point cloud data arising from materials science. Persistence diagrams are multisets summarizing the connectedness and holes of given data. A new distance on…
We classify many cardinal characteristics of the continuum according to the complexity, in the sense of descriptive set theory, of their definitions. The simplest characteristics (boldface Sigma^0_2 and, under suitable restrictions, Pi^0_2)…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…
We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…
In this paper, we have established boundaries of cardinal numbers of nonempty sets in finite non-$T_1$ topological spaces using interval analysis. For a finite set with known cardinality, we give interval estimations based on the closure…
Groundstates of 1+1d conformal field theories (CFTs) satisfy a local entropic condition called the vector fixed point equation. This condition is surprisingly well satisfied by groundstates of quantum critical lattice models even at small…