Related papers: A $\Pi^0_2$ Singleton of Minimal Arithmetic Degree
The Rogers semilattice of effective programming systems (epses) is the collection of all effective numberings of the partial computable functions ordered such that \theta\ is less than or equal to \psi\ whenever \theta-programs can be…
In our previous work we studied minimal fractional decompositions of a rational matrix pseudodifferential operator: H=A/B, where A and B are matrix differential operators, and B is non-degenerate of minimal possible degree deg(B). In the…
We show that degrees containing a complete extensions of arithmetic have the random join property: they are the supremum of any random real they compute, with another random real. The same is true for the truth-table and weak truth-table…
We describe a minimal set of generators of the defining ideal of the Rees Algebra associated to a proper parametrization of any monoid hypersurface. In the case of plane curves, we recover a known description for rational parametrizations…
The Riemann hypothesis (RH) is a long-standing open problem in mathematics. It conjectures that non-trivial zeros of the zeta function all have real part equal to 1/2. The extent of the consequences of RH is far-reaching and touches a wide…
Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…
We describe the equations of the Rees algebra R(I) of an equimultiple ideal I of deviation one, provided that I has a reduction J generated by a regular sequence and such that the initial forms of the elements of this sequence, except…
We continue the study of computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a…
This monograph elucidates and extends many theorems and conjectures in analytic number theory and algebraic asymptotic analysis via the natural notion of "degree" and a more general notion that we call "logexponential degree." Specifically,…
The aim of this paper is to start a systematic investigation of the arithmetic degree of projective schemes as introduced by D. Bayer and D. Mumford. One main theme concerns itself with the behaviour of this arithmetic degree under…
Elementary Algebraic Geometry can be described as study of zeros of polynomials with integer degrees, this idea can be naturally carried over to `polynomials' with rational degree. This paper explores affine varieties, tangent space and…
Background: As traditional coding tasks in education become increasingly vulnerable to the use of Generative AI, there is a critical need for authentic, project-based assessments that evaluate students' scientific inquiry. To address this…
The goal of this paper is to study when uniform Roe algebras have certain $C^*$-algebraic properties in terms of the underlying space: in particular, we study properties like having stable rank one or real rank zero that are thought of as…
Two nonzero recursively enumerable (r.e.) degrees $\mathbf{a}$ and $\mathbf{b}$ form a strong minimal pair if $\mathbf{a} \wedge \mathbf{b}=\mathbf{0}$ and $\mathbf{b}\vee \mathbf{x}\geq \mathbf{a}$ for any nonzero r.e. degree…
We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…
Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…
We explore the low levels of the structure of the continuous Weihrauch degrees of first-order problems. In particular, we show that there exists a minimal discontinuous first-order degree, namely that of $\accn$, without any determinacy…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…
A great deal of recent activity has centered on the question of whether, for a given Hilbert function, there can fail to be a unique minimum set of graded Betti numbers, and this is closely related to the question of whether the associated…