Related papers: The Complexity of Connectedness Relations on Polis…
Hjorth has introduced a Scott analysis for general Polish group actions, and has asked whether his notion of rank satisfies a boundedness principle similar to the one of Scott rank - namely, the orbit equivalence relation is Borel if and…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are…
Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…
It is believed that almost any pair of people in the world can be connected to one another by a short chain of intermediate acquaintances, of typical length about six. This phenomenon, colloquially referred to as the ``six degrees of…
Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…
We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…
A simplicial complex is $r$-conic if every subcomplex of at most $r$ vertices is contained in the star of a vertex. A $4$-conic complex is simply connected. We prove that an $8$-conic complex is $2$-connected. In general a $(2n+1)$-conic…
We propose and study a new approach to the topologization of spaces of (possibly not all) future-directed causal curves in a stably causal spacetime. It relies on parametrizing the curves "in accordance" with a chosen time function. Thus…
The relational complexity, introduced by G. Cherlin, G. Martin, and D. Saracino, is a measure of ultrahomogeneity of a relational structure. It provides an information on minimal arity of additional invariant relations needed to turn given…
We study from the perspective of Borel complexity theory the classification problem for multiplier algebras associated with operator algebraic varieties. These algebras are precisely the multiplier algebras of irreducible complete…
A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…
In the physics literature, Bilal--Fock--Kogan \cite{BFK} introduced the idea of parabolic reduced flat connections on a surface to give a geometric origin to $W$-algebras. In this paper, we combine these ideas with higher complex…
We consider the Monge-Kantorovich transport problem in an abstract measure theoretic setting. Our main result states that duality holds if $c:X\times Y\to [0,\infty)$ is an arbitrary Borel measurable cost function on the product of Polish…
We introduce new algebraic structures associated with heptagon relations -- higher analogue of the well-known pentagon. The main points we deal with are: (i) polygon relations as algebraic imitations of Pachner moves, on the example of…
Consider the moduli space of pairs (C,w) where C is a smooth compact complex curve of a given genus and w is a holomorphic 1-form on C with a given list of multiplicities of zeroes. We describe connected components of this space. This…
We study the connectedness of the non-subklt locus over the spectrum of a formal power series ring. In dimension 3, we prove the existence and normality of the smallest lc centre, and apply it to the ACC for minimal log discrepancies…
We point out an unusual relationship among a variety of null geodesic congruences; (a) the generators of ordinary light-cones and (b) certain (related) shear-free but twisting congruences in Minkowski Space-time as well as (c)…
We study algorithmic learning of algebraic structures. In our framework, a learner receives larger and larger pieces of an arbitrary copy of a computable structure and, at each stage, is required to output a conjecture about the isomorphism…
A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…