Related papers: Relative to any non-arithmetic set
This paper studies etale twists of derived categories of schemes and associative algebras. A general method, based on a new construction called the twisted Brauer space, is given for classifying etale twists, and a complete classification…
We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computability-theoretic reducibilities, in particular Weihrauch…
We introduce a class of non-commutative algebras that carry a non-commutative (geometric) cluster structure which are generated by identical copies of generalized Weyl algebras. Equivalent conditions for the finiteness of the set of the…
Classification, up to isomorphism, of algebras from a non-empty subset of the variety of $n$- dimensional algebras is presented. It is shown that these algebras have only trivial automorphism and if the basic field is algebraically closed…
We introduce local invariants of algebraic spaces and stacks which measure how far they are from being a scheme. Using these invariants, we develop mostly topological criteria to determine when the moduli space of a stack is a scheme. As an…
We introduce perfect resolving algebras and study their fundamental properties. These algebras are basic for our theory of differential graded schemes, as they give rise to affine differential graded schemes. We also introduce etale…
We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively…
We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of…
We first introduce the class of quasi-algebraically stable meromorphic maps of $\P^k.$ This class is strictly larger than that of algebraically stable meromorphic self-maps of $\P^k.$ Then we prove that all maps in the new class enjoy a…
We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…
A twisted commutative algebra is (for us) a commutative $\mathbf{Q}$-algebra equipped with an action of the infinite general linear group. In such algebras the "$\mathbf{GL}$-prime" ideals assume the duties fulfilled by prime ideals in…
Selman's Theorem in classical Computability Theory gives a characterization of the enumeration reducibility for arbitrary sets in terms of the enumeration reducibility on the total sets: $A \le_e B \iff \forall X [X \equiv_{e} X \oplus…
Given a hypersurface in a complex projective space, we prove that the multidegrees of its toric polar map agree, up to sign, with the coefficients of the Chern-Schwartz-MacPherson class of a distinguished open set, namely the complement of…
A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…
The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods…
We establish the Borel computability of various C$^*$-algebra invariants, including the Elliott invariant and the Cuntz semigroup. As applications we deduce that AF algebras are classifiable by countable structures, and that a conjecture of…
We give a construction that takes a simple linear algebraic group $G$ over a field and produces a commutative, unital, and simple non-associative algebra $A$ over that field. Two attractions of this construction are that (1) when $G$ has…
We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…
We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…
In categorical realizability, it is common to construct categories of assemblies and categories of modest sets from applicative structures. These categories have structures corresponding to the structures of applicative structures. In the…