Related papers: Answering Hilbert's 1st Problem
We investigate the structure of the Schrodinger algebra and its representations in a Fock space realized in terms of canonical Appell systems. Generalized coherent states are used in the construction of a Hilbert space of functions on which…
We prove that Hilbert's Tenth Problem for a ring of integers in a number field K has a negative answer if K satisfies two arithmetical conditions (existence of a so-called division-ample set of integers and of an elliptic curve of rank one…
Our main theorem is in the generality of the axioms of Hilbert space, and the theory of unbounded operators. Consider two Hilbert spaces such that their intersection contains a fixed vector space D. It is of interest to make a precise…
The informal question of when two theorem proofs are "essentially the same" goes back to David Hilbert, who considered adding it (or something largely equivalent) to his famous list of open problems, but eventually decided to leave it out.…
Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…
We tackle the issue of representing infinite sets of real- valued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose three well-known logics extending Presburger with reals. Our…
The study of computability has its origin in Hilbert's conference of 1900, where an adjacent question, to the ones he asked, is to give a precise description of the notion of algorithm. In the search for a good definition arose three…
We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…
We use Bub's (2016) correlation arrays and Pitowksy's (1989b) correlation polytopes to analyze an experimental setup due to Mermin (1981) for measurements on the singlet state of a pair of spin-$\frac12$ particles. The class of correlations…
A succinct chronology is given around Nov 1915, when the explicit field equations of General Relativity have been found. Evidence, unearthed by D.Wuensch, that a decisive document of Hilbert has been mutilated in recent years with the…
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…
We consider the following open questions. Fix a Hilbert function, $h$, that occurs for a reduced zero-dimensional subscheme of $\mathbb P^2$. Among all subschemes, $X$, with Hilbert function $h$, what are the possible Hilbert functions and…
Standard quantum mechanics employs complex Hilbert spaces, but whether complex numbers are fundamental or merely convenient has long been debated. For decades, real-valued equivalents were considered mathematically possible but cumbersome.…
Given a set of integers W, the Partition problem determines whether W can be divided into two disjoint subsets with equal sums. We model the Partition problem as a system of polynomial equations, and then investigate the complexity of a…
We consider the problem of counting the number of answers to a first-order formula on a finite structure. We present and study an extension of first-order logic in which algorithms for this counting problem can be naturally and conveniently…
A physical system is determined by a finite set of initial conditions and "laws" represented by equations. The system is computable if we can solve the equations in all instances using a "finite body of mathematical knowledge". In this…
It is widely accepted that the states of any quantum system are vectors in a Hilbert space. Not everyone agrees, however. The recent paper ``The unphysicality of Hilbert spaces'' by Carcassi, Calder\'on and Aidala is a thoughtful dissection…
G\"odel's argument for the First Incompleteness Theorem is, structurally, a proof by contradiction. This article intends to reframe the argument by, first, isolating an additional assumption the argument relies on, and then, second, arguing…
This article is firstly a historic review of the theory of Riemann-Hilbert problems with particular emphasis placed on their original appearance in the context of Hilbert's 21st problem and Plemelj's work associated with it. The secondary…
We show that the Schubert calculus of enumerative geometry is real, for special Schubert conditions. That is, for any such enumerative problem, there exist real conditions for which all the a priori complex solutions are real.