Related papers: Isolated d.c.e. degrees and $\Sigma_1$ induction
We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…
Two well studied invariants of a complex projective variety are the unit Euclidean distance degree and the generic Euclidean distance degree. These numbers give a measure of the algebraic complexity for "nearest" point problems of the…
We study the ground-state properties of a dilute gas of strongly-interacting fermions in the framework of the coupled-cluster expansion (CCE). We demonstrate that properties such as universality, opening of a gap in the excitation spectrum…
Algebraic number theory relates SIC-POVMs in dimension $d>3$ to those in dimension $d(d-2)$. We define a SIC in dimension $d(d-2)$ to be aligned to a SIC in dimension $d$ if and only if the squares of the overlap phases in dimension $d$…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
In this article, we ask whether the Igusa zeta function of a restricted power series over $\mathbb{Q}_p$ can be determined solely from the terms of degree at most $D$. That is, we ask whether the truncated polynomial $f_D$, consisting of…
A graph is called odd if all of its vertex degrees are odd. A long-standing conjecture asked whether there exists a positive constant $c$ such that every $n$-vertex graph without isolated vertices contains an odd induced subgraph on at…
Claims about recursive self-improvement in AI often slide from repeated internal revision to the possibility of qualitatively stronger capability without clearly distinguishing the underlying computational regimes. This paper gives a formal…
The main result concerns a sigma-unital C*-algebra A, a strongly lower semicontinuous element h of A**, the enveloping von Neumann algebra, and the set of self-adjoint elements a of A such that a \le h - delta 1 for some delta > 0, where 1…
We define a class of algebras describing links of binary isolating formulas on a set of realizations for a family of 1-types of a complete theory. We prove that a set of labels for binary isolating formulas on a set of realizations for a…
The class of separable C*-algebras which can be written as inductive limits of continuous-trace C*-algebras with spectrum homeomorphic to a disjoint union of trees and trees with a point removed is classified by the Cuntz semigroup.
The dually transformed path integral of four-dimensional U(1) lattice gauge theory is used for the calculation of expectation values in the presence of external charges. Applying the dual simulation to flux tubes for charge distances up to…
This article presents a bidirectional type system for the Calculus of Inductive Constructions (CIC). It introduces a new judgement intermediate between the usual inference and checking, dubbed constrained inference, to handle the presence…
We investigate the complexity of embeddings between bi-embeddable structures. In analogy with categoricity spectra, we define the bi-embeddable categoricity spectrum of a structure $\mathcal A$ as the family of Turing degrees that compute…
We prove that the bounded and bounded below derived categories of (all) modules over the dual numbers have strongly unique (dg) enhancements. To this end we relate those categories to the category of sequences of vector spaces, which allows…
The dissociation number ${\rm diss}(G)$ of a graph $G$ is the maximum order of a set of vertices of $G$ inducing a subgraph that is of maximum degree at most $1$. Computing the dissociation number of a given graph is algorithmically hard…
Two important notions of integrability for discrete mappings are algebraic integrability and singularity confinement, have been used for discrete mappings. Algebraic integrability is related to the existence of sufficiently many conserved…
We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
The reverse degree distance is a connected graph invariant closely related to the degree distance proposed in mathematical chemistry. We determine the unicyclic graphs of given girth, number of pendant vertices and maximum degree,…