Related papers: The Complexity of Connectedness Relations on Polis…
We analyze the degree-structure induced by large reducibilities under the Axiom of Determinacy. This generalizes the analysis of Borel reducibilities given in references [1], [6] and [5] e.g. to the projective levels.
This paper verifies a conjecture of Edelman and Reiner regarding the homology of the $h$-complex of a Boolean algebra. A discrete Morse function with no low-dimensional critical cells is constructed, implying a lower bound on connectivity.…
The conformal compactification is considered in a hierarchy of hypercomplex projective spaces with relevance in physics including Minkowski and Anti-de Sitter space. The geometries are expressed in terms of bicomplex Vahlen matrices and…
Given two discrete Morse functions on a simplicial complex, we introduce the {\em connectedness homomorphism} between the corresponding discrete Morse complexes. This concept leads to a novel framework for studying the connectedness in…
We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…
The development of science has been transforming man's view towards nature for centuries. Observing structures and patterns in an effective approach to discover regularities from data is a key step toward theory-building. With increasingly…
This paper deals with computation trees over an arbitrary structure consisting of a set along with collections of functions and predicates that are defined on it. It is devoted to the comparative analysis of three parameters of problems…
Let $(X_n,d_n),\,n\in\Bbb N$ be a sequence of pseudo-metric spaces, $p\ge 1$. For $x,y\in\prod_{n\in\Bbb N}X_n$, let $(x,y)\in E((X_n)_{n\in\Bbb N};p)\Leftrightarrow\sum_{n\in\Bbb N}d_n(x(n),y(n))^p<+\infty$. For Borel reducibility between…
We consider the conjugacy problem for the automorphism groups of a number of countable homogeneous structures. In each case we find the precise complexity of the conjugacy relation in the sense of Borel reducibility.
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…
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…
In 3-dimensional Lorentz-Minkowski space we determine the number of catenoids connecting two coaxial circles in parallel planes. This study is separated according to the types of circles and the causal character (spacelike and timelike) of…
High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the…
Trivial links are unique up to number of link components, but they can be hard to recognize from arbitrary diagrams. We define a new measure of the complexity of a link embedding, the crumple, and show how this may be used to measure…
We develop a unified framework for locating natural properties of algebraic and analytic structures within the Borel hierarchy. Objects are presented as quotients of a universal generator and definability is read directly from the quotient…
We prove that the existence of a Borel lower density operator (a Borel lifting) with respect to the $\sigma$-ideal of countable sets, for an uncountable Polish space, is equivalent to the Continuum Hypothesis.
For a hypersurface defined by a complex analytic function, we obtain a chain complex of free abelian groups, with ranks given in terms of relative polar multiplicities, which has cohomology isomorphic to the reduced cohomology of the real…
Given a poset-graded chain complex of vector spaces, a Conley complex is the minimal chain-homotopic reduction of the initial complex that respects the poset grading. A connection matrix is a matrix representing the differential of the…
A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…
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…