Related papers: Relativizing Small Complexity Classes and their Th…
We present a formalization, in the theorem prover Lean, of the classification of solvable Lie algebras of dimension at most three over arbitrary fields. Lie algebras are algebraic objects which encode infinitesimal symmetries, and as such…
Self-supervised contrastive learning (CL) has achieved remarkable empirical success, often producing representations that rival supervised pre-training on downstream tasks. Recent theory explains this by showing that the CL loss closely…
We show that SCL(FOL) can simulate the derivation of non-redundant clauses by superposition for first-order logic without equality. Superposition-based reasoning is performed with respect to a fixed reduction ordering. The completeness…
We interpret the Central Limit Theorem as a fixed point theorem for a certain operator, and consider the problem of linearizing this operator. In classical as well as in free probability theory, we consider two methods giving such a…
We present an algebraic approach to string theory, using a Hamiltonian reduction of N=2 WZW models. An embedding of sl(1|2) in a Lie superalgebra determines a niltopent subalgebra. Chirally gauging this subalgebra in the corresponding WZW…
Lambek's non-associative syntactic calculus (NL) excels in its resource consciousness: the usual structural rules for weakening, contraction, exchange and even associativity are all dropped. Recently, there have been proposals for…
Complex systems are high-dimensional nonlinear dynamical systems with intricate interactions among their constituents. To make interpretable predictions about their large-scale behavior, it is typically assumed, without a clear statement,…
Partial combinatory algebras are algebraic structures that serve as generalized models of computation. In this paper, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene's models, of…
Classical algebraic structures require exact satisfaction of their defining axioms. We propose similarity algebra, a framework extending algebraic and Lie structures to settings where operations satisfy quantitative bounds up to a tolerance…
Decomposition classes provide a way of partitioning the Lie algebras of an algebraic group into equivalence classes based on the Jordan decomposition. In this paper, we investigate the decomposition classes of the Lie algebras of connected…
Locally checkable labeling problems (LCLs) form the foundation of the modern theory of distributed graph algorithms. First introduced in the seminal paper by Naor and Stockmeyer [STOC 1993], these are graph problems that can be described by…
The complexity class $\exists\mathbb R$, standing for the complexity of deciding the existential first order theory of the reals as real closed field in the Turing model, has raised considerable interest in recent years. It is well known…
We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…
A long-investigated problem in circuit complexity theory is to decompose an $n$-input or $n$-variable Majority Boolean function (call it $M_n$) using $k$-input ones ($M_k$), $k < n$, where the objective is to achieve the decomposition using…
We introduce two-sorted theories in the style of [CN10] for the complexity classes \oplusL and DET, whose complete problems include determinants over Z2 and Z, respectively. We then describe interpretations of Soltys' linear algebra theory…
This talk explores the spin--1 correlators up to O(alpha_s) through a large NC resonance theory. The phenomenological analyses of this kind must take these corrections into account since they produce a larger impact than the first OPE…
A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…
Do complexity classes have many-one complete sets if and only if they have Turing-complete sets? We prove that there is a relativized world in which a relatively natural complexity class-namely a downward closure of NP, \rsnnp - has…
Let L denote the class Logpsace and NL the class NLogspace. We use logCFL to denote the closure under logspace reductions of the set of context-free languages. We prove that NL is different from logCFL. This result implies L different from…
In this paper, we present a generalisation of a theorem of David and Rob Pollack. In 'A construction of rigid analytic cohomology classes for congruence subgroups of SL(3,Z)', they give a very general argument for lifting ordinary…