Searcharxiv⌕ Search

arXiv subjects

Victor Selivanov

Publications and source records attributed to Victor Selivanov.

At least 19 recordsLinked to original sources
arXiv2024

Complexity Aspects of the Extension of Wagner's Hierarchy to $k$-Partitions

It is known that the Wadge reducibility of regular $\omega$-languages is efficiently decidable (Krishnan et al., 1995), (Wilke, Yoo, 1995). In this paper we study analogous problem for regular k-partitions of $\omega$-languages. In the series of previous papers (Selivanov, 2011), (Alaev, Selivanov, 2021), (Selivanov, 2012) there was a partial progress towards obtaining an efficient algorithm for deciding the Wadge reducibility in this setting as well. In this paper we finalize this line of research providing a quadratic algorithm (in RAM model). For this we construct a quadratic algorithm to decide a preorder relation on iterated posets. Additionally, we discuss the size of the representation of regular $\omega$-languages and suggest a more compact way to represent them. The algorithm we provide is efficient for the more compact representation as well.

cs.FL↗
arXiv2023

Ideal presentations and numberings of some classes of effective quasi-Polish spaces

The well known ideal presentations of countably based domains were recently extended to (effective) quasi-Polish spaces. Continuing these investigations, we explore some classes of effective quasi-Polish spaces. In particular, we prove an effective version of the domain-characterization of quasi-Polish spaces, describe effective extensions of quasi-Polish topologies, discover natural numberings of classes of effective quasi-Polish spaces, estimate the complexity of the (effective) homeomorphism relation and of some classes of spaces w.r.t. these numberings, and investigate degree spectra of continuous domains.

math.LO↗
arXiv2021

Primitive Recursive Ordered Fields and Some Applications

We establish primitive recursive versions of some known facts about computable ordered fields of reals and computable reals, and then apply them to proving primitive recursiveness of some natural problems in linear algebra and analysis. In particular, we find a partial primitive recursive analogue of Ershov-Madison's theorem about real closures of computable ordered fields, relate the corresponding fields to the primitive recursive reals, give sufficient conditions for primitive recursive root-finding, computing normal forms of matrices, and computing solution operators of some linear systems of PDE.

cs.CC↗
arXiv2021

Non-Collapse of the Effective Wadge Hierarchy

We study the recently suggested effective Wadge hierarchy in effective spaces, concentrating on the non-collapse property. Along with hierarchies of sets, we study hierarchies of $k$-partitions which are interesting on their own. In particular, we establish sufficient conditions for the non-collapse of the effective Wadge hierarchy and apply them to some concrete spaces.

math.LO↗
arXiv2021

Wadge Degrees of Classes of omega-Regular k-Partitions

We develop a theory of k-partitions of the set of infinite words recognizable by classes of finite automata. The theory enables to complete proofs of existing results about topological classifications of the (aperiodic) omega-regular k-partitions and provides tools for dealing with other similar questions. In particular, we characterize the structure of Wadge degrees of (aperiodic) omega-regular $k$-partitions, prove the decidability of many related problems, and discuss their complexity.

math.CO↗
arXiv2021

Effective Wadge Hierarchy in Computable Quasi-Polish Spaces

We define and study an effective version of the Wadge hierarchy in computable quasi-Polish spaces which include most spaces of interest for computable analysis. Along with hierarchies of sets we study hierarchies of k-partitions which are interesting on their own. We show that levels of such hierarchies are preserved by the computable effectively open surjections, that if the effective Hausdorff-Kuratowski theorem holds in the Baire space then it holds in every computable quasi-Polish space, and we extend the effective Hausdorff theorem to k-partitions.

cs.LO↗
arXiv2020

Degree spectra of homeomorphism types of compact Polish spaces

A Polish space is not always homeomorphic to a computably presented Polish space. In this article, we examine degrees of non-computability of presenting homeomorphic copies of compact Polish spaces. We show that there exists a $0'$-computable low$_3$ compact Polish space which is not homeomorphic to a computable one, and that, for any natural number $n\geq 2$, there exists a Polish space $X_n$ such that exactly the high$_{n}$-degrees are required to present the homeomorphism type of $X_n$. We also show that no compact Polish space has a least presentation with respect to Turing reducibility. The first version of this article appeared in April 2020. A major update was made in September 2023, with improved proofs and results. This is the final version from January 2024, with more results on \v{C}ech homology groups.

math.LO↗
arXiv2019

A Q-Wadge Hierarchy in Quasi-Polish Spaces

The Wadge hierarchy was originally defined and studied only in the Baire space (and some other zero-dimensional spaces). We extend it here to arbitrary topological spaces by providing a set-theoretic definition of all its levels. We show that our extension behaves well in second countable spaces and especially in quasi-Polish spaces. In particular, all levels are preserved by continuous open surjections between second countable spaces which implies e.g. several Hausdorff-Kuratowski-type theorems in quasi-Polish spaces. In fact, many results hold not only for the Wadge hierarchy of sets but also for its extension to Borel functions from a space to a countable better quasiorder Q.

math.LO↗
arXiv2019

Wadge-like degrees of Borel bqo-valued functions

We unite two well known generalisations of the Wadge theory. The first one considers more general reducing functions than the continuous functions in the classical case, and the second one extends Wadge reducibility from sets (i.e., $\{0,1\}$-valued functions) to $Q$-valued functions, for a better quasiorder $Q$. In this article, we consider more general reducibilities on the $Q$-valued functions and generalise some results of L. Motto Ros in the first direction and of T. Kihara and A. Montalbán in the second direction: Our main result states that the structure of the $\mathbfΔ^0_α$-degrees of $\mathbfΔ^0_{α+γ}$-measurable $Q$-valued functions is isomorphic to the $\mathbfΔ^0_β$-degrees of $\mathbfΔ^0_{β+γ}$-measurable $Q$-valued functions, and these are isomorphic to the generalized homomorphism order on the $γ$-th iterated $Q$-labeled forests.

math.LO↗
arXiv2019

Computability on quasi-Polish spaces

We investigate the effectivizations of several equivalent definitions of quasi-Polish spaces and study which characterizations hold effectively. Being a computable effectively open image of the Baire space is a robust notion that admits several characterizations. We show that some natural effectivizations of quasi-metric spaces are strictly stronger.

math.LO↗
arXiv2018

Well Quasiorders and Hierarchy Theory

We discuss some applications of WQOs to several fields were hierarchies and reducibilities are the principal classification tools, notably to Descriptive Set Theory, Computability theory and Automata Theory. While the classical hierarchies of sets usually degenerate to structures very close to ordinals, the extension of them to functions requires more complicated WQOs, and the same applies to reducibilities. We survey some results obtained so far and discuss open problems and possible research directions.

cs.LO↗
arXiv2017

First Order Theories of Some Lattices of Open Sets

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first order theory of the lattice of effectively open sets is undecidable. Moreover, for several important spaces (e.g., $\mathbb{R}^n$, $n\geq1$, and the domain $Pω$) this theory is $m$-equivalent to first order arithmetic.

math.LO↗
arXiv2014

Towards a Descriptive Theory of cb_0-Spaces

The paper tries to extend results of the classical Descriptive Set Theory to as many countably based T_0-spaces (cb_0-spaces) as possible. Along with extending some central facts about Borel, Luzin and Hausdorff hierarchies of sets we consider also the more general case of k-partitions. In particular, we investigate the difference hierarchy of k-partitions and the fine hierarchy closely related to the Wadge hierarchy.

math.GN↗
arXiv2014

Hyperprojective Hierarchy of QCB_0-spaces

We extend the Luzin hierarchy of qcb$_0$-spaces introduced in [ScS13] to all countable ordinals, obtaining in this way the hyperprojective hierarchy of qcb$_0$-spaces. We generalize all main results of [ScS13] to this larger hierarchy. In particular, we extend the Kleene-Kreisel continuous functionals of finite types to the continuous functionals of countable types and relate them to the new hierarchy. We show that the category of hyperprojective qcb$_0$-spaces has much better closure properties than the category of projective qcb$_0$-space. As a result, there are natural examples of spaces that are hyperprojective but not projective.

cs.LO↗
arXiv2013

Total Representations

Almost all representations considered in computable analysis are partial. We provide arguments in favor of total representations (by elements of the Baire space). Total representations make the well known analogy between numberings and representations closer, unify some terminology, simplify some technical details, suggest interesting open questions and new invariants of topological spaces relevant to computable analysis.

cs.LO↗
arXiv2013

Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs

We discuss possibilities of application of Numerical Analysis methods to proving computability, in the sense of the TTE approach, of solution operators of boundary-value problems for systems of PDEs. We prove computability of the solution operator for a symmetric hyperbolic system with computable real coefficients and dissipative boundary conditions, and of the Cauchy problem for the same system (we also prove computable dependence on the coefficients) in a cube $Q\subseteq\mathbb R^m$. Such systems describe a wide variety of physical processes (e.g. elasticity, acoustics, Maxwell equations). Moreover, many boundary-value problems for the wave equation also can be reduced to this case, thus we partially answer a question raised in Weihrauch and Zhong (2002). Compared with most of other existing methods of proving computability for PDEs, this method does not require existence of explicit solution formulas and is thus applicable to a broader class of (systems of) equations.

math.NA↗
arXiv2013

Some Hierarchies of QCB_0-Spaces

We define and study hierarchies of topological spaces induced by the classical Borel and Luzin hierarchies of sets. Our hierarchies are divided into two classes: hierarchies of countably based spaces induced by their embeddings into the domain Pω, and hierarchies of spaces (not necessarily countably based) induced by their admissible representations. We concentrate on the non-collapse property of the hierarchies and on the relationships between hierarchies in the two classes.

cs.LO↗