Related papers: Prenex normalization and the hierarchical classifi…
This is the first part in a series of papers in which we introduce and develop a natural, general tensor category theory for suitable module categories for a vertex (operator) algebra. This theory generalizes the tensor category theory for…
Matter exhibits phases and their transitions. These transitions are classified as first-order phase transitions (FOPTs) and continuous ones. While the latter has a well-established theory of the renormalization group, the former is only…
Matter exhibits phases and their transitions. These transitions are classified as first-order phase transitions (FOPTs) and continuous ones. While the latter has a well-established theory of the renormalization group, the former is only…
We investigate the presence of twinlike models in theories described by several real scalar fields. We focus on the first-order formalism, and we show how to build distinct scalar field theories that support the same extended solution, with…
When data is sampled from an unknown subspace, principal component analysis (PCA) provides an effective way to estimate the subspace and hence reduce the dimension of the data. At the heart of PCA is the Eckart-Young-Mirsky theorem, which…
We introduce a class of integrable $l$-field first-order lattices together with corresponding Lax equations. These lattices may be represented as consistency condition for auxiliary linear systems defined on sequences of formal dressing…
We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define the central constructions of gradual typing (the dynamic type, type casts and type error) in a novel way, by universal properties relative to…
We review some recent developments in 1-st order GLSM construction, or so-called Gross-Neveu formalism for sigma models. We recall the general idea behind this framework and describe a 1-st order GLSM data from which the general generalized…
A decidable transfinite hierarchy is defined by assigning ordinals to the programs of an imperative language. It singles out: the classes TIMEF(n^c) and TIMEF(n_c); the finite Grzegorczyk classes at and above the elementary level, and the…
Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes…
Hierarchical classification addresses the problem of classifying items into a hierarchy of classes. An important issue in hierarchical classification is the evaluation of different classification algorithms, which is complicated by the…
We propose a categorification of the cyclotomic Hecke algebra in terms of the equivariant K-theory of the framed matrix factorizations. The construction generalizes the earlier construction of the authors for a categorification of the…
This paper introduces a general class of hierarchical nonparametric prior distributions. The random probability measures are constructed by a hierarchy of generalized species sampling processes with possibly non-diffuse base measures. The…
A number of problems in theoretical physics share a common nucleus of combinatoric nature. It is argued here that Hopf algebraic concepts and techiques can be particularly efficient in dealing with such problems. As a first example, a brief…
In classification, it is usual to observe that models trained on a given set of classes can generalize to previously unseen ones, suggesting the ability to learn beyond the initial task. This ability is often leveraged in the context of…
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems---such as for instance natural deduction---are applied. Therefore, the…
Optimization problems with rank constraints appear in many diverse fields such as control, machine learning and image analysis. Since the rank constraint is non-convex, these problems are often approximately solved via convex relaxations.…
Normalisation in probability theory turns a subdistribution into a proper distribution. It is a partial operation, since it is undefined for the zero subdistribution. This partiality makes it hard to reason equationally about normalisation.…
Applying the classical Serre-Swan theorem, as this is extended to topological (non-normed) algebras, one attains a classification of elementary particles via their spin-structure. In this context, our argument is virtually based on a…
We look at equivalence relations on the set of models of a theory -- MERs, for short -- such that the class of equivalent pairs is itself an elementary class, in a language appropriate for pairs of models. We provide many examples of…