Related papers: Linearization and categorification
We introduce the structural resource lambda-calculus, a new formalism in which strongly normalizing terms of the lambda-calculus can naturally be represented, and at the same time any type derivation can be internally rewritten to its…
The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity. First we define formally different…
Categorization axioms have been proposed to axiomatizing clustering results, which offers a hint of bridging the difference between human recognition system and machine learning through an intuitive observation: an object should be assigned…
We define a notion which contains numerous basic notions of Analysis as special cases, for example limit, continuity, differential, Riemann and Lebesgue integral, root and exponential functions. Properties like additivity or linearity of…
We introduce a hierarchical classification of theories that describe systems with fundamentally limited information content. This property is introduced in an operational way and gives rise to the existence of mutually complementary…
In this paper, we introduce novel characterizations of the classical concept of majorization in terms of upper triangular (resp., lower triangular) row-stochastic matrices, and in terms of sequences of linear transforms on vectors. We used…
Informally, the 'linear representation hypothesis' is the idea that high-level concepts are represented linearly as directions in some representation space. In this paper, we address two closely related questions: What does "linear…
The wide application of estimation techniques in system analysis enable us to best determine and understand the history of system states. This paper attempts to delineate the theory behind linear and non-linear estimation with a suitable…
The theory of majorization has seen substantial application in quantum information. Its framework predicates on the comparability between real vectors. We explore the antithesis of this premise, namely, incomparability. Specifically, we…
The aim of this paper is twofold. First, we introduce a new class of linearizations, based on the generalization of a construction used in polynomial algebra to find the zeros of a system of (scalar) polynomial equations. We show that one…
The linear representation hypothesis is the informal idea that semantic concepts are encoded as linear directions in the representation spaces of large language models (LLMs). Previous work has shown how to make this notion precise for…
The principal innovative idea in this paper is to transform the original complex nonlinear modeling problem into a combination of linear problem and very simple nonlinear problems. The key step is the generalized linearization of nonlinear…
We consider multicolor urn models with multiple drawings. An urn model is called linear if the conditional expected value of the urn composition at time $n$ is a linear function of the composition at time $n-1$. For four different sampling…
In this article, we describe various aspects of categorification of the structures appearing in information theory. These aspects include probabilistic models both of classical and quantum physics, emergence of F-manifolds, and motivic…
This is the first in a series of papers in which we study representations of the Brauer category and its allies. We define a general notion of triangular category that abstracts key properties of the triangular decomposition of a semisimple…
In this paper we generalise the notion of linearity (in the sense of Lawvere) to a category C equipped with a compatible sum structure and product structure. In this context, any morphism f from an n-fold sum to an n-fold product has a…
Starting categorically, we give simple and precise models of equivariant classifying spaces. We need these models for work in progress in equivariant infinite loop space theory and equivariant algebraic K-theory, but the models are of…
Diagram chasing is not an easy task. The coherence holds in a generalized sense if we have a mechanical method to judge whether given two morphisms are equal to each other. A simple way to this end is to reform a concerned category into a…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We describe a seriation algorithm for ranking a set of items given pairwise comparisons between these items. Intuitively, the algorithm assigns similar rankings to items that compare similarly with all others. It does so by constructing a…