Related papers: The Complexity of Arc-Connectedness Relation in th…
It is known that the vertex connectivity of a planar graph can be computed in linear time. We extend this result to the class of locally maximal 1-plane graphs: graphs that have an embedding with at most one crossing per edge such that the…
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 extend the Billera-Ehrenborg-Readdy map between the intersection lattice and face lattice of a central hyperplane arrangement to affine and toric hyperplane arrangements. For arrangements on the torus, we also generalize Zaslavsky's…
It was shown in Alur et al. [1] that the problem of verifying finite concurrent systems through Linearizability is in EXPSPACE. However, there was still a complexity gap between the easy to obtain PSPACE lower bound and the EXPSPACE upper…
In this paper, we study Schauder equivalence relations, which are Borel equivalence relations generated by Banach spaces with basic sequences. We prove that the set of equivalence relations generated by basic sequences has boundaries. Then…
This article is devoted to studying complex algebraic sets under (global) blow-spherical equivalence. The main results of this article are complete classifications of complex algebraic curves. Firstly, we present a complete classification…
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…
If the Lorentzian norm on a maximal surface in the 3-dimensional Lorentz-Minkowski space $R_1^3$ is positive and proper, then the surface is relative parabolic. As a consequence, entire maximal graphs with a closed set of isolated…
There are precisely four arrangements of two point-hyperplane anti-flags. We consider the corresponding relations on the set of such anti-flags and show that each of them can be recovered from any other except in one special case. If the…
This paper begins the exploration of what we call measures of association between two irreducible complex projective varieties of the same dimension. The idea is to study from various points of view the minimal complexity of correspondences…
In this paper we study the descriptive complexity of the topological orbit equvalence relation for some Borel classes of Cantor minimal systems. Specifically, we study the Borel class of all Cantor minimal systems with only finitely many…
We show that Sobolev space $W^1_1(\Omega)$ of any planar one-connected domain $\Omega$ has the Bounded Approximation property. The result holds independently from the properties of the boundary of $\Omega$. The prove is based on a new…
Given Polish space ${\bf Y}$ and continuous language $L$ we study the corresponding logic $\mathsf{Iso}({\bf Y})$-space ${\bf Y}_L$. We build a framework of generalized model theory towards analysis of Borel/algorithmic complexity of…
For a class $\mathcal K$ of countable relational structures, a countable Borel equivalence relation $E$ is said to be $\mathcal K$-structurable if there is a Borel way to put a structure in $\mathcal K$ on each $E$-equivalence class. We…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…
We show that, up to Morita equivalence, any finite-dimensional algebra with a suitable homological system, admits an exact Borel subalgebra. This generalizes a theorem by Koenig, K\"ulshammer and Ovsienko, which holds for quasi-hereditary…
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…
We improve the best known lower bound for the dimension of radial projections of sets in the plane. We show that if $X,Y$ are Borel sets in $\R^2$, $X$ is not contained in any line and $\dim_H(X)>0$, then $$\sup\limits_{x\in X} \dim_H(\pi_x…
In this paper we characterize the unique graph whose algebraic connectivity is minimum among all connected graphs with given order and fixed matching number or edge covering number, and present two lower bounds for the algebraic…
We use stratified Morse theory to construct a complex to compute the cohomology of the complement of a hyperplane arrangement with coefficients in a complex rank one local system. The linearization of this complex is shown to be the…