Related papers: On Universality of the S Combinator
We distinguish a class of irreducible finite representations of conformal Lie (super)algebras. These representations (called universally defined) are the simplest ones from the computational point of view: a universally defined…
Nous generalisons la theorie de la K-moyennabilite au cas d'un unitaire multiplicatif regulier V. Nous montrons que si (H,V,U) est un systeme de Kac K-moyennable, alors pour toute S-algebre A, les algebres $ A\times_{m}\hat S$ (produit…
We give explicit positive combinatorial interpretations for the plethysm coefficients $\langle s_\mu[s_\nu], s_\lambda\rangle$, when $\lambda$ has at most two rows, as counting certain marked trees. In the special case $\mu=(n)$, this also…
A linear operator $U$ acting boundedly on an infinite-dimensional separable complex Hilbert space $H$ is universal if every linear bounded operator acting on $H$ is similar to a scalar multiple of a restriction of $U$ to one of its…
We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no…
The Laver tables are finite combinatorial objects with a simple elementary definition, which were introduced by R. Laver from considerations of logic and set theory. Although these objects exhibit some fascinating properties, they seem to…
We prove that every polytope described by algebraic coordinates is the face of a projectively unique polytope. This provides a universality property for projectively unique polytopes. Using a closely related result of Below, we construct a…
We give an exposition of the semantics of the simply-typed lambda-calculus, and its linear and ordered variants, using multi-ary structures. We define universal properties for multicategories, and use these to derive familiar rules for…
Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…
The spectral theory on the $S$-spectrum was born out of the need to give quaternionic quantum mechanics (formulated by Birkhoff and von Neumann) a precise mathematical foundation. Then it turned out that this theory has important…
We investigate the combinatorics of the general formulas for the powers of the operator $h \partial^k$, where $h$ is a central element of a ring and $\partial$ is a differential operator. This generalizes previous work on the powers of…
In this survey we discuss the notion of combinatorial interpretation in the context of Algebraic Combinatorics and related areas. We approach the subject from the Computational Complexity perspective. We review many examples, state a…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
We construct universal mixers, incompressible flows that mix arbitrarily well general solutions to the corresponding transport equation, in all dimensions. This mixing is exponential in time (i.e., essentially optimal) for any initial…
We connect the existence of a ternary classical universal quadratic form over a totally real number field $K$ with the property that all totally positive multiples of 2 are sums of squares (if $K$ does not contain $\sqrt 2$ or contains a…
Given a scheme S and a flat morphism T \to S of finite presentation we define a surjective S-morphism to an {\'e}tale and separated S-scheme, which is universal in an obvious sense. Properties of this morphism are deduced from a thorough…
We consider categorical logic on the category of Hilbert spaces. More generally, in fact, any pre-Hilbert category suffices. We characterise closed subobjects, and prove that they form orthomodular lattices. This shows that quantum logic is…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
We provide two simple universality criteria. Our first criterion states that $\mathcal{S}\subset G_d:=U(d)$ is universal if and only if $\mathcal{S}$ forms a $\delta$-approximate $t(d)$-design, where $t(2)=6$ and $t(d)=4$ for $d\geq3$. Our…