Related papers: Self-full ceers and the uniform join operator

Let A be an abelian hereditary category with Serre duality. We provide a classification of such categories up to derived equivalence under the additional condition that the Grothendieck group modulo the radical of the Euler form is a free…

A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…

The Baire category theorem states that every complete pseudometric space is a Baire space. There are some results in metric spaces which have their analogue in uniform spaces, however this is not one of them. Nonetheless, since the Baire…

A unitary representation of a, possibly infinite dimensional, Lie group $G$ is called semibounded if the corresponding operators $i\dd\pi(x)$ from the derived representation are uniformly bounded from above on some non-empty open subset of…

The separability tensor element of a separable extension of noncommutative rings is an idempotent when viewed in the correct endomorphism ring; so one speaks of a separability idempotent, as one usually does for separable algebras. It is…

Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…

We study computable probably approximately correct (CPAC) learning, where learners are required to be computable functions. It had been previously observed that the Fundamental Theorem of Statistical Learning, which characterizes PAC…

There exist irreducible exact covering systems (ECS). These are ECS which are not a proper split of a coarser ECS. However, an ECS admiting a maximal modulus which is divisible by at most two distinct primes, primely splits a coarser ECS.…

We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…

We investigate if a unital C(X)-algebra is properly infinite when all its fibres are properly infinite. We show that this question can be rephrased in several different ways, including the question if every unital properly infinite…

A class $\mathcal{G}$ of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by $G^{epex}$ the class of graphs that are at most one edge away from being in $\mathcal{G}$. We note that $G^{epex}$ is…

We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable…

For a separable locally compact but not compact metrizable space $X$, let $\alpha X = X \cup \{x_\infty\}$ be the one-point compactification with the point at infinity $x_\infty$. We denote by $EM(X)$ the space consisting of admissible…

A cohesive power of a structure is an effective analog of the classical ultrapower of a structure. We start with a computable structure, and consider its countable ultrapower over a cohesive set of natural numbers. A cohesive set is an…

We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set $A$ with non-trivial prefix-free initial segment…

Let $\mathscr{A}$ be a nonempty set of infinite matrices of linear operators between two topological vector spaces. We show that a sequence is uniformly $\mathscr{A}$-summable if and only if it is $B$-summable for all matrices $B$ of linear…

Let $\mathcal C$ be a class of topological semigroups. A semigroup $X$ is $injectively$ $\mathcal C$-$closed$ if $X$ is closed in each topological semigroup $Y\in\mathcal C$ containing $X$ as a subsemigroup. Let $\mathsf{T_{\!2}S}$ (resp.…

Existentially closed groups are, informally, groups that contain solutions to every consistent finite system of equations and inequations. They were introduced in 1951 in an algebraic context and subsequent research elucidated deep…

A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…