Related papers: Computability and Categoricity of Weakly Ultrahomo…
An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…
The syntactic categories of categorial grammar formalisms are structured units made of smaller, indivisible primitives, bound together by the underlying grammar's category formation rules. In the trending approach of constructive…
For any irreducible character $\chi$ of a finite group $G$, let $\theta(\chi)$ denote the proportion of elements $g\in G$ for which $\chi(g)$ is either zero or a root of unity. Then for any $L\in[1/2,1]$ and any $\epsilon>0$, there exists…
The notion of $\Delta$-weakly mixing set is introduced, which shares similar properties of weakly mixing sets. It is shown that if a dynamical system has positive topological entropy, then the collection of $\Delta$-weakly mixing sets is…
A density operator of a bipartite quantum system is called robustly separable if it has a neighborhood of separable operators. Given a bipartite density matrix, its property to be robustly separable is reduced, using the continuous ensemble…
We interpret homogenousness as a second order property and base it on the same principle as nonmonotonic logic: there might be a small set of exceptions. We use this idea to analyse fundamental questions about defeasible inheritance…
It is known that the space of boundedly finite integer-valued measures on a complete separable metric space becomes itself a complete separable metric space when endowed with the weak-hash metric. It is also known that convergence under…
Ultrafilters are useful mathematical objects having applications in nonstandard analysis, Ramsey theory, Boolean algebra, topology, and other areas of mathematics. In this note, we provide a categorical construction of ultrafilters in terms…
A matrix (and any associated linear system) will be referred to as structured if it has a small displacement rank. It is known that the inverse of a structured matrix is structured, which allows fast inversion (or solution), and reduced…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
We provide the expected constructions of weakly $\omega$-categorified models (in the sense of Bressie) of the theory of groups and quandles which arise by replacing the homotopies used to give equivalence relations in the theory of…
We consider homogeneity properties of Boolean algebras that have nonprincipal ultrafilters which are countably generated.It is shown that a Boolean algebra B is homogeneous if it is the union of countably generated nonprincipal ultrafilters…
We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every (possibly infinite) regular set F of finite…
We provide a classification of the homogeneous 3-dimensional permutation structures, i.e. homogeneous structures in a language of 3 linear orders, partially answering a question of Cameron. We also arrive at a natural description of all…
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…
Motivated by questions in biological classification, we discuss some elementary combinatorial and computational properties of certain set systems that generalize hierarchies, namely, 'patchworks', 'weak patchworks', 'ample patchworks' and…
We study the existence of uncountable first-order structures that are homogeneous with respect to their finitely generated substructures. In many classical cases this is either well-known or follows from general facts, for example, if the…
We consider the arithmetic complexity of index sets of uniformly computably enumerable families learnable under different learning criteria. We determine the exact complexity of these sets for the standard notions of finite learning,…
We describe those complete linearly ordered topological spaces $X$ which are homogeneous (=CHLOTS). That is, $X$ is order isomorphic with any nonempty open interval in $X$. Using countable tail-like ordinals as indices, we build towers of…
The Weihrauch degrees and strong Weihrauch degrees are partially ordered structures representing degrees of unsolvability of various mathematical problems. Their study has been widely applied in computable analysis, complexity theory, and…