Related papers: On Universality of the S Combinator
We introduce the \emph{universal algebra} of two Poisson algebras $P$ and $Q$ as a commutative algebra $A:={\mathcal P} (P, \, Q )$ satisfying a certain universal property. The universal algebra is shown to exist for any finite dimensional…
We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…
We define a semantics for first-order logic with generalized quantifiers based on double teams. We also define and investigate a notion of a generalized atom. Such atoms can be used in order to define extensions of first-order logic with a…
In this article we obtain a general polynomial identity in $k$ variables, where $k\geq 2$ is an arbitrary positive integer. We use this identity to give a closed-form expression for the entries of the powers of a $k \times k$ matrix.…
A generalized word in two positive definite matrices A and B is a finite product of nonzero real powers of A and B. Symmetric words in positive definite A and B are positive definite, and so for fxed B, we can view a symmetric word, S(A,B),…
We construct a two-dimensional Turing machine that is physically universal in both the moving tape and moving head model. In particular, it is mixing of all finite orders in both models. We also provide a variant that is physically…
In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of…
We introduce several classes of quantum combinatorial designs, namely quantum Latin squares, cubes, hypercubes and a notion of orthogonality between them. A further introduced notion, quantum orthogonal arrays, generalizes all previous…
Since 1950s, mathematicians have successfully interpreted the traditional Eulerian numbers and $q-$Eulerian numbers combinatorially. In this paper, the authors give a combinatorial interpretation to the general Eulerian numbers defined on…
Article presents a short investigation into some properties of the Moser polynomials which appear in various problems from algebraic combinatorics. For instance, these polynomials can be used to solve the Generalized Moser's Problem on…
Making use of the simple fact that all separable complex Hilbert spaces of given dimension are isomorphic, we show that there are just six basic ways to define generalized coordinate operators in Quantum Mechanics. In each case a…
In 1989 Manin and Schechtman defined the discriminantal arrangement $\mathcal{B}(n, k,\mathcal{A})$ associated to a generic arrangement $\mathcal{A}$ of $n$ hyperplanes in a $k$-dimensional space. An equivalent notion was already introduced…
It is known that no quantum process can produce a predetermined superposition of unknown arbitrary states. It has already been shown that with some partial information about the states, one can produce with some probability such…
We show that a question of Miller and Solomon -- that whether there exists a coloring $c:d^{<\omega}\rightarrow k$ that does not admit a $c$-computable variable word infinite solution, is equivalent to a natural, nontrivial combinatorial…
The most general R-matrix type state sum model for link invariants is constructed. It contains in itself all R-matrix invariants and is a generating function for "universal" Vassiliev link invariants. This expression is more simple than…
A universal process of a process calculus is one that, given the G\"{o}del index of a process of a certain type, produces a process equivalent to the encoded process. This paper demonstrates how universal processes can be formally defined…
Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…
Although the conjugacy classes of the general linear group are known, it is not obvious (from the canonic form of matrices) that two permutation matrices are similar if and only if they are conjugate as permutations in the symmetric group,…
For a field $k$ we compute the $K$-theory of the exact category of $k[t_1,\dots,t_n]$-modules that are finite-dimensional over $k$, generalising the work of Kelley and Spanier.
We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combinatory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven…