Related papers: The Complexity of Connectedness Relations on Polis…

We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of…

We develop new tools to analyze the complexity of the conjugacy equivalence relation $E_\mathsf{lo}(G)$, whenever $G$ is a left-orderable group. Our methods are used to demonstrate non-smoothness of $E_\mathsf{lo}(G)$ for certain groups $G$…

We study Borel equivalence relations equipped with a uniformly Borel family of Polish topologies on each equivalence class, and more generally, standard Borel groupoids equipped with such a family of topologies on each connected component.…

The structure of the Wadge degrees on zero-dimensional spaces is very simple (almost well-ordered), but for many other natural non-zero-dimensional spaces (including the space of reals) this structure is much more complicated. We consider…

We prove that any divisible dynamical simplex is the set of invariant measures of some Toeplitz subshift. We apply our construction to prove that orbit equivalence of Toeplitz subshifts is Borel bireducible to the universal equivalence…

We show that the embeddability relations for countable quandles and for countable fields of any given characteristic other than 2 are maximally complex in a strong sense: they are invariantly universal. This notion from the theory of Borel…

Not all convex functions on $\mathbb{R}^n$ have finite minimizers; some can only be minimized by a sequence as it heads to infinity. In this work, we aim to develop a theory for understanding such minimizers at infinity. We study astral…

We say that two classes of topological spaces are equivalent if each member of one class has a homeomorphic copy in the other class and vice versa. Usually when the Borel complexity of a class of metrizable compacta is considered, the class…

We consider the notion of Borel reducibility between pseudometrics on standard Borel spaces introduced and studied recently by C\'{u}th, Doucha and Kurka, as well as the notion of an orbit pseudometric, a continuous version of the notion of…

This paper studies when an arithmetical equivalence relation $E$ can be realized as the connectedness relation of a graph $G$ which is simpler to define than $E$. Several examples of such equivalence relations are established. In…

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…

In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…

This paper introduces a model that identifies spatial relationships for a structural analysis based on the concept of simplicial complex. The spatial relationships are identified through overlapping two map layers, namely a primary layer…

We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…

We give two proofs of a conjecture of the first author (Inv. Math. 98, 1989) that a reduced algebraic plane curve is regular at infinity if and only if its link at infinity is a regular toral link. This conjecture has also been proved by Ha…

A space is `n-arc connected' (n-ac) if any family of no more than n-points are contained in an arc. For graphs the following are equivalent: (i) 7-ac, (ii) n-ac for all n, (iii) continuous injective image of a closed sub-interval of the…

In this paper, we analyze the complexity of topological conjugacy of pointed Cantor minimal systems from the point of view of descriptive set theory. We prove that the topological conjugacy relation on pointed Cantor minimal systems is…

Data describing the three-dimensional structure of physical networks is increasingly available, leading to a surge of interest in network science to explore the relationship between the shape and connectivity of physical networks. We…

Among the several topological properties of complex networks, the shortest path represents a particularly important characteristic because of its potential impact not only on other topological properties, but mainly for its influence on…

We study the usual notion of Scott rank but in the setting of Polish metric spaces. The signature consists of distance relations: for each rational $q > 0$, there is a relation $R_{<q}(x,y)$ stating that the distance of $x$ and $y $ is less…