Related papers: The Kadison-Singer Problem in Mathematics and Engi…
In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula…
We provide a representation of the $C^*$-algebra generated by multidimensional integral operators with piecewise constant kernels and discrete ergodic operators. This representation allows us to find the spectrum and to construct the…
Every $\mathrm{C}^*$-algebra, regardless of its density character, can be embedded into the Calkin algebra in a forcing extension of the universe obtained without collapsing any cardinal.
This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…
The well-behaved representations of the coordinate algebra of a 2-dimensional quantum complex plane are classified and a C*-algebra is defined which can be viewed as the algebra of continuous functions on the 2-dimensional quantum complex…
Solving avoidability problems in the area of string combinatorics often requires, in an initial step, the construction, via a computer program, of a very long word that does not contain any word that matches a given pattern. It is well…
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…
We provide some background on the category of classifiable $\mathrm{C}^*$-algebras, whose objects are infinite-dimensional, simple, separable, unital $\mathrm{C}^*$-algebras that have finite nuclear dimension and satisfy the universal…
In this work, we show that very natural, apparently simple problems in quantum measurement theory can be undecidable even if their classical analogues are decidable. Undecidability hence appears as a genuine quantum property here. Formally,…
Eugene Wigner famously argued for the "unreasonable effectiveness of mathematics" for describing physics and other natural sciences in his 1960 essay. That essay has now led to some 55 years of (sometimes anguished) soul searching ---…
We show that certain C*-algebras which have been studied among others by Arzumanian, Vershik, Deaconu, and Renault in connection to a measure preserving transformation of a measure space and/or to a covering map of a compact space are…
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…
The Atiyah-Singer index theorem is generalized to a two-dimensional SO(3) Yang-Mills-Higgs (YMH) system. The generalized theorem is proven by using the heat kernel method and a nonlinear realization of SU(2) gauge symmetry. This theorem is…
We show that a unital ring is generated by its commutators as an ideal if and only if there exists a natural number $N$ such that every element is a sum of $N$ products of pairs of commutators. We show that one can take $N \leq 2$ for…
K-theory allows us to define an analytical condition for the existence of `false' gauge field copies through the use of the Atiyah-Singer index theorem. After establishing that result we discuss a possible extension of the same result…
The problem of how mathematics and physics are related at a foundational level is of much interest. One approach is to work towards a coherent theory of physics and mathematics together. Here steps are taken in this direction by first…
We introduce a concept of the bounded rank (with respect to a positive constant) for unital C*-algebras as a modification of the usual real rank and present a series of conditions insuring that bounded and real ranks coincide. These…
In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined…
Let $R$ be a rational function. The iterations $(R^n)_n$ of $R$ gives a complex dynamical system on the Riemann sphere. We associate a $C^*$-algebra and study a relation between the $C^*$-algebra and the original complex dynamical system.…
We construct C*-dynamical systems for the dynamics of classical infinite particle systems describing harmonic oscillators interacting with arbitrarily many neighbors on lattices, as well on more general structures. Our approach allows…