Search
Skip to Search Results-
Spring 2024
Most quantum computers are based on elements with many addressable states, yet restrict themselves to a two-level subset, a qubit. In principle, more states could be used in each element to form a d-dimensional qudit, increasing the Hilbert space dimension and thus the computational power of the...
-
Fall 2016
Little is known about Vertex Operator Algebras (VOAs) which are neither semi-simple nor rational, and most of the work on such VOAs has been focused around specific examples such as the Singlet VOA. In this thesis, the relationship between subcategories of the module categories of the Singlet VOA...
-
2001
We give an answer to the question as to whether quantifier elimination is possible in some infinite algebraic extensions of QpQp ('infinite p-adic fields') using a natural language extension. The present paper deals with those infinite p-adic fields which admit only tamely ramified algebraic...
-
Fall 2021
Topological Recursion began its life as a series of recursive equations aimed at solving constraints which occur in matrix models of Quantum Field Theory. After its inception, Topological Recursion was given a more abstract formulation in terms of Quantum Airy Structures and has since been of...
-
2006
Zalta, Edward N. , Linsky, Bernard
Logicism is a thesis about the foundations of mathematics, roughly, that mathematics is derivable from logic alone. It is now widely accepted that the thesis is false and that the logicist program of the early 20th century was unsuccessful. Frege's [1893/1903] system was inconsistent and the...