Related papers: Computably Enumerable Sets that are Automorphic to…

The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…

One says that a property $P$ of sets of natural numbers can be made into itself iff there is a numbering $\alpha_0,\alpha_1,\ldots$ of all left-r.e. sets such that the index set $\{e: \alpha_e$ satisfies $P\}$ has the property $P$ as well.…

For a H\'enon map of the form $H(x, y) = (y, p(y) - ax)$, where $p$ is a polynomial of degree at least two and $a \not= 0$, it is known that the sub-level sets of the Green's function $G^+_H$ associated with $H$ are Short $\mathbb C^2$'s.…

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

Let $E$ be a closed polar subset of $\mathbb{C}$. In this short note, we use elementary potential theoretic tools to show that any conformal map on $\mathbb{C}\setminus{E}$ is necessarily a M\"{o}bius map. As a consequence we obtain that…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

All exactly integrable systems connected with the semisimple algebras of the second rank with an arbitrary choice of the grading in them are presented in explicit form. General solution of such systems are expressed in terms of the matrix…

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…

We show that if a set $A$ is computable from every superlow 1-random set, then $A$ is strongly jump-traceable. This theorem shows that the computably enumerable (c.e.) strongly jump-traceable sets are exactly the c.e.\ sets computable from…

We say that a set $S$ is $\Delta^0_{(n)}(X)$ if membership of $n$ in $S$ is a $\Delta^0_{n}(X)$ question, uniformly in $n$. A set $X$ is low for $\Delta$-Feiner if every set $S$ that is $\Delta^0_{(n)}(X)$ is also…

We characterize the vertices belonging to all minimum dominating sets, to some minimum dominating sets but not all, and to no minimum dominating set. We refine this characterization for some well studied sub-classes of graphs: chordal,…

Can a large system be fully characterized using its subsystems via inductive reasoning? Is it possible to completely reduce the behavior of a complex system to the behavior of its simplest "atoms"? In the following paper we answer these…

We hope to see how much for a model M of some completion T of PA (Peano Arithmetic) does M restriction {<} determine M, say up to isomorphism. We advance in characterizing for non-standard models M of PA the "minimal" set {(a,b):n < a < b…

We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…

We prove that every automorphism of the restricted root system of a real semisimple Lie algebra -- when defined properly -- can be lifted to an automorphism of that Lie algebra. In particular, this can be applied to automorphisms of the…

Our focus will be on the computably enumerable (c.e.) sets and trivial, non-trivial, Friedberg, and non-Friedberg splits of the c.e. sets. Every non-computable set has a non-trivial Friedberg split. Moreover, this theorem is uniform. V. Yu.…

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…

For any code loop $L$, we prove that the half-automorphism group of $L$ is the product of the automorphism group of $L$ by an elementary abelian $2-$group consisting of all half-automorphisms that acts as the identity on a fixed basis.…

We give an example of a computably enumerable closed subset of [0,1] that is not homeomorphic to any computably compact space. This answers a question of Koh, Melnikov and Ng.