Related papers: A non-Borel special alpha-limit set in the square

We present a new lambda-calculus with explicit substitutions and named variables. Renaming of bound variables in this calculus is explicit (there is a special rewrite rule) and can be delayed. Contexts (environments) are not sets or lists…

We prove level-by-level upper and lower bounds on the strength of determinacy for finite differences of sets in the hyperarithmetical hierarchy in terms of subsystems of finite-and transfinite-order arithmetic, extending the…

We show that the set of locally finite Borel graphs with finite Borel asymptotic dimension is $\mathbf{\Sigma}^1_2$-complete. The result is based on a combinatorial characterization of finite Borel asymptotic dimension for graphs generated…

We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…

Let $M$ be a compact hyperkaehler manifold. The hyperkaehler structure equips $M$ with a set $R$ of complex structures parametrized by $CP^1$, called "the set of induced complex structures". It was known previously that induced complex…

We investigate the structure of $\omega$-limit (resp. $\alpha$-limit) sets for a monotone map $f$ on a regular curve $X$. %Let $X$ be a regular curve and let $f: X\longrightarrowX$ be a monotone map. We show that for any $x\in X$ (resp. for…

For the ultradifferentiable weight sequence setting it is known that the Borel map which assigns to each function the infinite jet of derivatives (at 0) is surjective onto the corresponding weighted sequence class if and only if the…

This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…

We give, for some Borel sets of a product of two Polish spaces, including the Borel sets with countable sections, a Hurewicz-like characterization of those which cannot become a transfinite difference of open sets by changing the two Polish…

It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification. On the other hand, for a large class of examples the problem of drawing a picture has…

It is shown that any finite-dimensional homomorphic image of an inverse limit of nilpotent not-necessarily-associative algebras over a field is nilpotent. More generally, this is true of algebras over a general commutative ring k, with…

We study the complexity of the isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Polish spaces. For…

We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the…

We give, for each level of complexity L, a Hurewicz-like characterization of the Borel subsets with countable sections of a product of two Polish spaces that cannot become in L by changing the two Polish topologies.

We provide some new necessary and sufficient conditions which guarantee arbitrary pole placement of a particular linear system over the complex numbers. We exhibit a non-trivial real linear system which is not controllable by real static…

While the forward trajectory of a point in a discrete dynamical system is always unique, in general a point can have infinitely many backward trajectories. The union of the limit points of all backward trajectories through $x$ was called by…

We locate the complexity of the set of closed sets of uniqueness U(G), for G locally compact Lie group and of the set of closed sets of extended uniqueness U_0(G), for G connected abelian Lie group. More concretely, we prove that with…

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…

We present the effective version of the theorem about turning Borel sets in Polish spaces into clopen sets while preserving the Borel structure of the underlying space. We show that under some conditions the emerging parameters can be…

We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…