Related papers: On minimal non-potentially closed subsets of the p…
The shift graph is defined on the space of infinite subsets of natural numbers by letting two sets be adjacent if one can be obtained from the other by removing its least element. We show that this graph is not a minimum among the graphs of…
We construct a connected, compact set $K \subset \mathbb{C}^2$ with the following property: there exist points $p \in \hat{K} \setminus K$ such that there does not exist a sequence $\{A_\nu\}$ of analytic sets $A_\nu \subset\subset…
A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such…
We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…
A long-standing conjecture of Podewski states that every minimal field is algebraically closed. It was proved by Wagner for fields of positive characteristic, but it remains wide open in the zero-characteristic case. We reduce Podewski's…
We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…
The motivation of this article is to introduce a kind of orbit equivalence relations which can well describe structures and properties of Polish groups from the perspective of Borel reducibility. Given a Polish group $G$, let $E(G)$ be the…
We study algorithmically random closed subsets of $2^\omega$, algorithmically random continuous functions from $2^\omega$ to $2^\omega$, and algorithmically random Borel probability measures on $2^\omega$, especially the interplay between…
We give an alternative proof of the existence of the anticanonical minimal model program for potentially klt pairs, assuming the anticanonical divisor admits a birational Zariski decomposition. Moreover, we establish a structure theorem…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
We prove in ZF a recursive-theoretic characterization of the Topological Vaught Conjecture by revisiting the fact that orbits in Polish $G$-spaces are Borel sets.
We prove that there exists a countable family of continuous real functions whose graphs together with their inverses cover an uncountable square, i.e. a set of the form $X\times X$, where $X$ is an uncountable subset of the real line. This…
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully…
We show that there is a system of 14 non-trivial finitary functions on the random graph with the following properties: Any non-trivial function on the random graph generates one of the functions of this system by means of composition with…
The aim of this paper is that of discussing Closed Graph Theorems for bornological vector spaces in a way which is accessible to non-experts. We will see how to easily adapt classical arguments of functional analysis over $\mathbb{R}$ and…
We characterize the smallest finite spaces with the same homotopy groups of the spheres. Similarly, we describe the minimal finite models of any finite graph. We also develop new combinatorial techniques based on finite spaces to study…
The main result of this paper characterizes the continuity from below of monotone functionals on the space $C_b$ of bounded continuous functions on an arbitrary Polish space as lower semicontinuity in the mixed topology. In this particular…
Understanding the topology of sublevel sets yields crucial insights into the optimization landscape of non-convex functions. If sublevel sets are connected, local search algorithms are less likely to be trapped in isolated valleys,…
The immersion relation is a partial ordering relation on graphs that is weaker than the topological minor relation in the sense that if a graph $G$ contains a graph $H$ as a topological minor, then it also contains it as an immersion but…
We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…