Related papers: Not Every Osborn Loop Is Universal

A question associated with the 2005 open problem of Michael Kinyon (Is every Osborn loop universal?), is answered. Two nice identities that characterize universal (left and right universal) Osborn loops are established. Numerous new…

A loop is shown to be a universal Osborn loop if and only if it has a particular simplicial complex. A loop is shown to be a universal Osborn loop and obeys two new identities if and only if it has another particular simplicial complex. A…

We study loops which are universal (that is, isotopically invariant) with respect to the property of flexibility ($xy\cdot x = x\cdot yx$). We also weaken this to semi-universality, that is, loops in which every left and right isotope is…

An open problem in theory of loops is to find the variety of non- Moufang loops satisfying the Moufang Theorem. In this note, we present a variety of local smooth diassociative loops with such property.

The paper puts into discussion the concept of universality, in particular for structures not of the power of Turing computability. The question arises if for such structures a universal structure of the same kind exists or not. For that the…

We consider the problem of building an arbitrary $N\times N$ real orthogonal operator using a finite set, $S$, of elementary quantum optics gates operating on $m\leq N$ modes - the problem of universality of $S$ on $N$ modes. In particular,…

We study some limitations and possible occurrences of uniform ultrafilters on ordinals without the axiom of choice. We prove an Easton-like theorem about the possible spectrum of successors of regular cardinals which carry uniform…

We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as…

LC-loops, RC-loops and C-loops are collectively called central loops. It is shown that an LC(RC)-loop is a left(right) universal loop. But an LC(RC)-loop is a universal loop if and only if it is a right(left) universal loop. It is observed…

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…

A new ordering, extending the notion of universal cycles of Chung {\em et al.} (1992), is proposed for the blocks of $k$-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established…

We show that the universal theory of the hyperfinite II$_1$ factor is not computable. The proof uses the recent result that MIP*=RE. Combined with an earlier observation of the authors, this yields a proof that the Connes Embedding Problem…

In various places in the literature it is stated that every separable linear order embeds into the real line. This is, however, not the case, at least not with respect to the usual definition of separability. We correct this misconception.

Using the Operator Product Expansion for Wilson loops we derive a simple formula giving the discontinuities of the two loop result in terms of the one loop answer. We also argue that the knowledge of these discontinuities should be enough…

It is a classical fact that for any $\varepsilon > 0$, a random permutation of length $n = (1 + \varepsilon) k^2 / 4$ typically contains a monotone subsequence of length $k$. As a far-reaching generalization, Alon conjectured that a random…

We study the problem of deciding universal termination of linear and affine loops over the reals in the bit-model of real computation. We show that both problems are as close to decidable as one can expect them to be: there exist sound…

We give a proof of universality in the bulk of spectrum of unitary matrix models, assuming that the potential is globally $C^{2}$ and locally $C^{3}$ function. The proof is based on the determinant formulas for correlation functions in…

In this short note, we point out a mistake in G.Cybenko's proof of his version of the universal approximation theorem which has been widely cited. This mistake might not be easily fixable along the idea of his proof and it also leads to an…

We prove that the orbit closure of the determinant is not normal. A similar result is obtained for the orbit closure of the permanent multiplied by a power of a linear form.

In this paper, the notion of simultaneous universality is introduced, concerning operators having orbits that simultaneously approximate any given vector. This notion is related to the well known concepts of universality and disjoint…