English
Related papers

Related papers: Not Every Osborn Loop Is Universal

200 papers

We introduce a class of non-Moufang loops satisfying the Moufang's theorem.

Combinatorics · Mathematics 2016-04-26 Izabella Stuhl

We propose a framework for topological quantum computation using newly discovered non-semisimple analogs of topological quantum field theories in 2+1 dimensions. These enhanced theories offer more powerful models for quantum computation.…

Quantum Physics · Physics 2025-08-07 Filippo Iulianelli , Sung Kim , Joshua Sussan , Aaron D. Lauda

We examine various generalizations, e.g. exactly solvable, quasi-exactly solvable and non-Hermitian variants, of a quantum nonlinear oscillator. For all these cases, the same mass function has been used and it has also been shown that the…

Quantum Physics · Physics 2015-05-14 Bikashkali Midya , Barnana Roy

The framework of Solomonoff prediction assigns prior probability to hypotheses inversely proportional to their Kolmogorov complexity. There are two well-known problems. First, the Solomonoff prior is relative to a choice of Universal Turing…

Artificial Intelligence · Computer Science 2022-06-15 Sven Neth

In this paper we discuss the notion of universality for classes of candidate common Lyapunov functions of linear switched systems. On the one hand, we prove that a family of absolutely homogeneous functions is universal as soon as it…

Optimization and Control · Mathematics 2024-06-19 Paolo Mason , Yacine Chitour , Mario Sigalotti

An open problem of Manuel Abellanas asks whether every set of disjoint closed unit disks in the plane can be connected by a conveyor belt, which means a tight simple closed curve that touches the boundary of each disk, possibly multiple…

In combinatory logic it is known that the set of two combinators K and S are universal; in the sense that any other combinator can be expressed in terms of these two. K combinator can not be expressed only in terms of the S combinator. This…

Computational Complexity · Computer Science 2022-10-26 Farrokh Vatan

This note proves that arbitrary local gates together with any entangling bipartite gate V are universal. Previously this was known only when access to both V and V^{-1} was given, or when approximate universality was demanded.

Quantum Physics · Physics 2009-08-07 Aram W. Harrow

The present note contains the text of lectures discussing the problem of universality in fully developed turbulence. After a brief description of Kolmogorov's 1941 scaling theory of turbulence and a comparison between the statistical…

chao-dyn · Physics 2015-06-24 Krzysztof Gawedzki , Antti Kupiainen

We classify all closed, aspherical Riemannian manifolds M whose universal cover has indiscrete isometry group. One sample application is the theorem that any such M with word-hyperbolic fundamental group must be isometric to a negatively…

Differential Geometry · Mathematics 2007-05-23 Benson Farb , Shmuel Weinberger

We consider the problem of deciding if a set of quantum one-qudit gates $\mathcal{S}=\{U_1,\ldots,U_n\}$ is universal. We provide the compact form criteria leading to a simple algorithm that allows deciding universality of any given set of…

Quantum Physics · Physics 2017-06-09 Adam Sawicki , Katarzyna Karnas

An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint. Detailed proofs are supplied for many important results from the literature, and notation is unified, making it…

Quantum Physics · Physics 2007-05-23 Chris Lomont

We show that every source connected Lie groupoid always has global bisections through any given point. This bisection can be chosen to be the multiplication of some exponentials as close as possible to a prescribed curve. The existence of…

Differential Geometry · Mathematics 2008-07-24 Z. Chen , Z. -J. Liu , D. -S. Zhong

Our aim is to solve a quite old question on the difference between expandability and compact expandability. Toward this, we further investigate the logic of countable cofinality.

Logic · Mathematics 2019-09-18 Enrique Casanovas , Saharon Shelah

We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense.

Probability · Mathematics 2017-03-24 Percy Deift , Thomas Trogdon

Assuming a lower bound on the dimension, we prove a long standing conjecture concerning the classification of global solutions of the obstacle problem with unbounded coincidence sets.

Analysis of PDEs · Mathematics 2022-08-08 Simon Eberle , Henrik Shahgholian , Georg S. Weiss

A celebrated result in bifurcation theory is that global connected sets of non-trivial solutions bifurcate from trivial solutions at non-zero eigenvalues of odd algebraic multiplicity of the linearized problem when the operators involved…

Analysis of PDEs · Mathematics 2021-04-12 J. F. Toland

Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…

Probability · Mathematics 2015-05-15 Shuyang Bai , Murad S. Taqqu

Numerical studies support the conjecture that in continuum planar QCD the eigenvalue density of a Wilson loop operator undergoes a transition as the loop is dilated while keeping the loop shape fixed. A second part of the conjecture is that…

High Energy Physics - Lattice · Physics 2008-11-26 R. Narayanan , H. Neuberger

We investigate in which cases the boundary of a multiply connected wandering domain of an entire function is uniformly perfect. We give a general criterion implying that it is not uniformly perfect. This criterion applies in particular to…

Dynamical Systems · Mathematics 2018-01-08 Walter Bergweiler , Jian-Hua Zheng