Related papers: A Topological Variation of the Reconstruction Conj…
The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever…
The deck, $\mathcal{D}(X)$, of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}]\colon x \in X\}$, where $[Y]$ denotes the homeomorphism class of $Y$. A space $X$ is (topologically) reconstructible if whenever…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
A topological space ${\mathcal X}$ is reversible iff each continuous bijection (condensation) $f: {\mathcal X} \rightarrow {\mathcal X}$ is a homeomorphism; weakly reversible iff whenever ${\mathcal Y}$ is a space and there are…
This paper proves the reconstruction conjecture for graphs which are isomorphic to the cube of a tree. The proof uses the reconstructibility of trees from their peripheral vertex deleted subgraphs. The main result follows from (i)…
A topological space $G$ is said to be a {\it rectifiable space} provided that there are a surjective homeomorphism $\phi :G\times G\rightarrow G\times G$ and an element $e\in G$ such that $\pi_{1}\circ \phi =\pi_{1}$ and for every $x\in G$…
The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…
We prove a reconstruction theorem for homeomorphism groups of open sets in metrizable locally convex topological vector spaces. We show that certain small subgroups of the full homeomorphism group obey the conditions of the above theorem.
In these notes we give a brief introduction to decomposition theory and we summarize some classical and well-known results. The main question is that if a partitioning of a topological space (in other words a decomposition) is given, then…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.
A space is reversible if every continuous bijection of the space onto itself is a homeomorphism. In this paper we study the question of which countable spaces with a unique non-isolated point are reversible. By Stone duality, these spaces…
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…
We aim to reconstruct a monoid scheme $X$ from the category of quasi-coherent sheaves over it. This is much in the vein of Gabriel's original reconstruction theorem. Under some finiteness condition on a monoid schemes $X$, we show that the…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
We study the properties of a generic object $\mathbb{P}$ in the category of finite graphs. It turns out that this object, being topologically a Cantor set, has the Knaster--Reichbach type property. Namely, every homeomorphism and…
The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…
Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is…
We consider the problem of homotopy-type reconstruction of compact subsets $X\subset\R^N$ that have the Alexandrov curvature bounded above ($\leq$ $\kappa$) in the intrinsic length metric. The reconstructed spaces are in the form of…
We prove various reconstruction theorems about open subsets of normed spaces. E.g. if the uniformly continuous homeomorphism groups of two such sets are isomorphic, then this isomorphism is induced by a uniformly continuous homeomorphism…